说明：以下剖析，纯属蛋疼兴趣


#include<algorithm>

非修改性序列操作

​​all_of​​：Test condition on all elements in range

​​any_of​​ ：Test if any element in range fulfills condition

​​none_of​​ ：Test if no elements fulfill condition

​​for_each​​ ：Apply function to range

​​find​​ ：Find value in range

​​find_if​​ ：Find element in range

​​find_if_not​​ ：Find element in range (negative condition)

​​find_end​​ ：Find last subsequence in range

​​fnd_first_of​​ ：Find element from set in range

​​adjacent_find​​ ：Find equal adjacent elements in range

​​count​​ ：Count appearances of value in range

​​count_if​​ ：Return number of elements in range satisfying condition

​​mismatch​​ ：Return first position where two ranges differ

​​equal​​ ：Test whether the elements in two ranges are equal 

​​is_permutation​​ : Test whether range is permutation of another

​​search​​ ：Search range for subsequence




堆：

​​is_heap​​

​​is_heap_until​​

​​push_heap​​

​​pop_heap​​

​​make_heap​​


#include<cstdlib>

​​itoa​​


#include<cstring>

#include<list>

​​sort​​