freebsd/contrib/llvm-project/libcxx/include/__algorithm
..
pstl_backends
adjacent_find.h
all_of.h
any_of.h
binary_search.h
clamp.h
comp.h
comp_ref_type.h
copy.h
copy_backward.h
copy_if.h
copy_move_common.h
copy_n.h
count.h
count_if.h
equal.h
equal_range.h
fill.h
fill_n.h
find.h
find_end.h
find_first_of.h
find_if.h
find_if_not.h
find_segment_if.h
fold.h
for_each.h
for_each_n.h
for_each_segment.h
generate.h
generate_n.h
half_positive.h
in_found_result.h
in_fun_result.h
in_in_out_result.h
in_in_result.h
in_out_out_result.h
in_out_result.h
includes.h
inplace_merge.h
is_heap.h
is_heap_until.h
is_partitioned.h
is_permutation.h
is_sorted.h
is_sorted_until.h
iter_swap.h
iterator_operations.h
lexicographical_compare.h
lexicographical_compare_three_way.h
lower_bound.h
make_heap.h
make_projected.h
max.h
max_element.h
merge.h
min.h
min_element.h
min_max_result.h
minmax.h
minmax_element.h
mismatch.h
move.h
move_backward.h
next_permutation.h
none_of.h
nth_element.h
partial_sort.h
partial_sort_copy.h
partition.h
partition_copy.h
partition_point.h
pop_heap.h
prev_permutation.h
pstl_any_all_none_of.h
pstl_backend.h
pstl_copy.h
pstl_count.h
pstl_equal.h
pstl_fill.h
pstl_find.h
pstl_for_each.h
pstl_frontend_dispatch.h
pstl_generate.h
pstl_is_partitioned.h
pstl_merge.h
pstl_move.h
pstl_replace.h
pstl_rotate_copy.h
pstl_sort.h
pstl_stable_sort.h
pstl_transform.h
push_heap.h
ranges_adjacent_find.h
ranges_all_of.h
ranges_any_of.h
ranges_binary_search.h
ranges_clamp.h
ranges_contains.h
ranges_copy.h
ranges_copy_backward.h
ranges_copy_if.h
ranges_copy_n.h
ranges_count.h
ranges_count_if.h
ranges_ends_with.h
ranges_equal.h
ranges_equal_range.h
ranges_fill.h
ranges_fill_n.h
ranges_find.h
ranges_find_end.h
ranges_find_first_of.h
ranges_find_if.h
ranges_find_if_not.h
ranges_for_each.h
ranges_for_each_n.h
ranges_generate.h
ranges_generate_n.h
ranges_includes.h
ranges_inplace_merge.h
ranges_is_heap.h
ranges_is_heap_until.h
ranges_is_partitioned.h
ranges_is_permutation.h
ranges_is_sorted.h
ranges_is_sorted_until.h
ranges_iterator_concept.h
ranges_lexicographical_compare.h
ranges_lower_bound.h
ranges_make_heap.h
ranges_max.h
ranges_max_element.h
ranges_merge.h
ranges_min.h
ranges_min_element.h
ranges_minmax.h
ranges_minmax_element.h
ranges_mismatch.h
ranges_move.h
ranges_move_backward.h
ranges_next_permutation.h
ranges_none_of.h
ranges_nth_element.h
ranges_partial_sort.h
ranges_partial_sort_copy.h
ranges_partition.h
ranges_partition_copy.h
ranges_partition_point.h
ranges_pop_heap.h
ranges_prev_permutation.h
ranges_push_heap.h
ranges_remove.h
ranges_remove_copy.h
ranges_remove_copy_if.h
ranges_remove_if.h
ranges_replace.h
ranges_replace_copy.h
ranges_replace_copy_if.h
ranges_replace_if.h
ranges_reverse.h
ranges_reverse_copy.h
ranges_rotate.h
ranges_rotate_copy.h
ranges_sample.h
ranges_search.h
ranges_search_n.h
ranges_set_difference.h
ranges_set_intersection.h
ranges_set_symmetric_difference.h
ranges_set_union.h
ranges_shuffle.h
ranges_sort.h
ranges_sort_heap.h
ranges_stable_partition.h
ranges_stable_sort.h
ranges_starts_with.h
ranges_swap_ranges.h
ranges_transform.h
ranges_unique.h
ranges_unique_copy.h
ranges_upper_bound.h
remove.h
remove_copy.h
remove_copy_if.h
remove_if.h
replace.h
replace_copy.h
replace_copy_if.h
replace_if.h
reverse.h
reverse_copy.h
rotate.h
rotate_copy.h
sample.h
search.h
search_n.h
set_difference.h
set_intersection.h
set_symmetric_difference.h
set_union.h
shift_left.h
shift_right.h
shuffle.h
sift_down.h
sort.h
sort_heap.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.h
unique_copy.h
unwrap_iter.h
unwrap_range.h
upper_bound.h