.. adjacent_find.h all_of.h any_of.h binary_search.h comp_ref_type.h comp.h copy_backward.h copy_if.h copy_move_common.h copy_n.h copy.h count_if.h count.h equal_range.h equal.h fill_n.h fill.h find_end.h find_first_of.h find_if_not.h find_if.h find_segment_if.h find.h for_each_segment.h for_each.h generate_n.h generate.h half_positive.h includes.h inplace_merge.h is_heap_until.h is_heap.h is_partitioned.h is_permutation.h is_sorted_until.h is_sorted.h iter_swap.h iterator_operations.h lexicographical_compare.h lower_bound.h make_heap.h make_projected.h max_element.h max.h merge.h min_element.h min.h minmax_element.h minmax.h mismatch.h move_backward.h move.h next_permutation.h none_of.h nth_element.h partial_sort_copy.h partial_sort.h partition_copy.h partition_point.h partition.h pop_heap.h prev_permutation.h push_heap.h remove_copy_if.h remove_copy.h remove_if.h remove.h replace_copy_if.h replace_copy.h replace_if.h replace.h reverse_copy.h reverse.h rotate_copy.h rotate.h search_n.h search.h set_difference.h set_intersection.h set_symmetric_difference.h set_union.h shuffle.h sift_down.h simd_utils.h sort_heap.h sort.h stable_partition.h stable_sort.h swap_ranges.h three_way_comp_ref_type.h transform.h uniform_random_bit_generator_adaptor.h unique_copy.h unique.h unwrap_iter.h unwrap_range.h upper_bound.h