Tag: Algorithms

• adjacent_find

  computing/stl/algorithms/nonmodifying

  Searches for two adjacent elements that are equal (by some criterion)

• binary_search

  computing/stl/algorithms/binarysearch

  Returns whether the range contains an element

• copy

  computing/stl/algorithms/modifying

  Copies a range starting with the first element

• copy_backward

  computing/stl/algorithms/modifying

  Copies a range starting with the last element

• copy_n

  computing/stl/algorithms/modifying

  Copies a specified number of elements

• count

  computing/stl/algorithms/nonmodifying

  Count appearances of value in range

• count_if

  computing/stl/algorithms/nonmodifying

  Returns the number of elements that match a criterion

• equal

  computing/stl/algorithms/nonmodifying

  Test whether two ranges are equal

• equal_range

  computing/stl/algorithms/binarysearch

  Returns the range of elements equal to a given value

• fill

  computing/stl/algorithms/modifying

  Replaces each element with a given value

• fill_n

  computing/stl/algorithms/modifying

  Replaces n elements with a given value

• find

  computing/stl/algorithms/nonmodifying

  Searches for the first element with the passed value

• find_end

  computing/stl/algorithms/nonmodifying

  Searches for the last occurrence of a subrang

• find_first_of

  computing/stl/algorithms/nonmodifying

  Searches the first of several possible elements

• find_if

  computing/stl/algorithms/nonmodifying

  Searches for the first element that matches a criterion

• for_each

  computing/stl/algorithms/nonmodifying

  Performs an operation for each element

• generate

  computing/stl/algorithms/modifying

  Replaces each element with the result of an operation

• generate_n

  computing/stl/algorithms/modifying

  Replaces n elements with the result of an operation

• includes

  computing/stl/algorithms/set

  Returns whether each element of a range is also an element of another range

• inplace_merge

  computing/stl/algorithms/set

  Merges two consecutive sorted ranges

• Introduction

  computing/stl/algorithms/sorting
• Introduction

  computing/stl/algorithms/min_max
• Introduction

  computing/stl/algorithms/heap
• Introduction

  computing/stl/algorithms
• Introduction

  computing/stl/algorithms/binarysearch
• Introduction

  computing/stl/algorithms/modifying
• Introduction

  computing/stl/algorithms/set
• Introduction

  computing/stl/algorithms/nonmodifying
• is_heap

  computing/stl/algorithms/heap

  Checks if a range is a heap or not

• iter_swap

  computing/stl/algorithms/modifying

  Swap values of objects pointed by two iterators