C++ 一些STL泛型算法

不变算法：

for_each                count

find                        count_if

find_if                     mismatch

adjacent_find        equal

find_first_of           search

变易算法：

copy                        remove

swap                        unique

transform                reserve

replace                    rotate

fill                            random_shuffle

generate                 partition

顺序算法：

sort                            partial_sort

binary_search            merge

includes                     set_union

set_intersection         set_difference

make_heap                push_heap

sort_heap                   pop_heap

算数算法：

accumulate                 inner_product

partial_sum                adjacent_difference

 数据的存储位置：

存在堆上：                                              存在栈上：

vector, map, string, function, any            array, bitset, glm::vec, string_view

unique_ptr, shared_ptr, weak_ptr            pair, tuple, optional, variant