STL 算法概述

# STL Standard Template Library

roil expressive codes
Spectacular

img

# Heap

the parent is bigger
Make_heap
Push_heap
Pop_heap

# Sort

Partial_sort
Nth_element
Sort_heap
Inplace_merge

# Partition

boolean
Partition_point

# Permutations

Rotate

​ put the last to the first
Shuffle

​ do randomly
Next_permutation
Prev_permutation
Reverse

# Secret runes

Stable_*
Relative order
Is_*
Is_*_until
Don’t hold anymore

# Queries

# Numeric algorithms

Count
Accumulate
Partial_sum
Inner_product
Adjacent_difference
Sample
select randomly

# Querying a property

All_of
Any_of
None_of

# Querying a property on 2 ranges

Equal
Same size
Each equal
Lexicographical_compare
Mismatch
Return pair<iterator, iterator>

# Searching a value

Not sorted
Find
Adjacent_find
Sorted
Equal_range
Upper_bound
Binary_search

# Searching a range

Search
Find_end
Find_first_of

# Searching a relative value

Max_element
Min_element
Minmax_element

# Glorious county of Lagos on sets

Set_difference
Set_intersection
Set_union
Set_symmetric_difference
Includes
Merge

# Movers

Copy
Move
Swap_ranges
Copy_backward
Move_backward

##Value Modifiers

Fill
Fill the same number
Generate
Iota
Increment number
Replace

# Structure changes

Remove
Erase
Unique
Remove the adjacent same element, and move the element forward

# *_copy

Remove_copy
Unique_copy
Reverse_copy
Rotate_copy
Replace_copy
Partition_copy
Partial_sort_copy

# *_if

Find_if
Find_if_not
Count_if
Remove_if
Remove_copy_if
Replace_if
Replace_copy_if
Copy_if

# lone islnad

Transform
It can has more than one collection(parameters) to transform.

For_each

# Raw memory

Uninitialized_fill
Uninitialized_copy
Uninitialized_move
Destroy

_n
Fill_n
Search_n
…