Author: dalia07

• Auto_ptr

  computing/stl

  smart pointer that deletes the instance it points to when going out of scope

• 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

• Exceptions

  computing/stl
• 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

• generate

  computing/stl/algorithms/modifying

  Replaces each element with the result of an operation

• inplace_merge

  computing/stl/algorithms/set

  Merges two consecutive sorted ranges

• Introduction

  computing/stl/containers/sequences
• Introduction

  computing/stl/containers/associative
• Introduction

  computing/stl/algorithms/binarysearch
• Introduction

  computing/stl/algorithms/set
• Introduction

  computing/stl/algorithms/heap
• Introduction

  computing/stl/algorithms/modifying
• Introduction

  computing/stl/algorithms/nonmodifying
• Introduction

  computing/stl/algorithms
• Introduction

  computing/stl
• lexicographical_compare

  computing/stl/algorithms/min_max

  Returns whether a range is lexicographically less than another range.

• make_heap

  computing/stl/algorithms/heap

  Converts a range into a heap

• reverse

  computing/stl/algorithms/modifying

  Reverses the order of the elements

• rotate

  computing/stl/algorithms/modifying

  Rotates the order of the elements

• set_intersection

  computing/stl/algorithms/set

  Processes the sorted intersection of two ranges

• set_symmetric_difference

  computing/stl/algorithms/set

  Processes a sorted range that contains all elements that are in exactly one of two ranges

• set_union

  computing/stl/algorithms/set

  Processes the sorted union of two ranges

• sort

  computing/stl/algorithms/sorting

  Sorts all elements

• stable_sort

  computing/stl/algorithms/sorting

  Sorts while preserving order of equal elements

• swap

  computing/stl/algorithms/modifying

  Exchanges the values of the elements between two types of objects

• Valarray

  computing/stl/numerics

  Is like a vector, but is optimized to get good performance for the processing of value arrays