cppreference

............\all_cpp_functions.html

............\all_c_functions.html

............\ascii.html

............\complexity.html

............\containers.html

............\cppalgorithm

............\............\accumulate.html

............\............\adjacent_difference.html

............\............\adjacent_find.html

............\............\all.html

............\............\binary_search.html

............\............\copy.html

............\............\copy_backward.html

............\............\copy_n.html

............\............\count.html

............\............\count_if.html

............\............\equal.html

............\............\equal_range.html

............\............\fill.html

............\............\fill_n.html

............\............\find.html

............\............\find_end.html

............\............\find_first_of.html

............\............\find_if.html

............\............\for_each.html

............\............\generate.html

............\............\generate_n.html

............\............\includes.html

............\............\index.html

............\............\inner_product.html

............\............\inplace_merge.html

............\............\is_heap.html

............\............\is_sorted.html

............\............\iter_swap.html

............\............\lexicographical_compare.html

............\............\lexicographical_compare_3.html

............\............\lower_bound.html

............\............\make_heap.html

............\............\max.html

............\............\max_element.html

............\............\merge.html

............\............\min.html

............\............\min_element.html

............\............\mismatch.html

............\............\next_permutation.html

............\............\nth_element.html

............\............\partial_sort.html

............\............\partial_sort_copy.html

............\............\partial_sum.html

............\............\partition.html

............\............\pop_heap.html

............\............\power.html

............\............\prev_permutation.html

............\............\push_heap.html

............\............\random_sample.html

............\............\random_sample_n.html

............\............\random_shuffle.html

............\............\remove.html

............\............\remove_copy.html

............\............\remove_copy_if.html

............\............\remove_if.html

............\............\replace.html

............\............\replace_copy.html

............\............\replace_copy_if.html

............\............\replace_if.html

............\............\reverse.html

............\............\reverse_copy.html

............\............\rotate.html

............\............\rotate_copy.html

............\............\search.html

............\............\search_n.html

............\............\set_difference.html

............\............\set_intersection.html

............\............\set_symmetric_difference.html

............\............\set_union.html

............\............\sort.html

............\............\sort_heap.html

............\............\stable_partition.html

............\............\stable_sort.html

............\............\swap.html

............\............\swap_ranges.html

............\............\transform.html

............\............\unique.html

............\............\unique_copy.html

............\............\upper_bound.html

............\cppbitset

............\.........\all.html

............\.........\any.html

............\.........\biset_operators.html

............\.........\bitset_constructors.html

............\.........\count.html

............\.........\flip.html

............\.........\index.html

............\.........\none.html

............\.........\reset.html

............\.........\set.html

............\.........\size.html

............\.........\test.html

............\.........\to_string.html