Doomhowl-Interactive/llvm-project
0
0
Fork 0
Code Issues Pull Requests Actions 5 Packages Projects Releases Wiki Activity
Files
main
llvm-project/libcxx/include/__algorithm
History
Connector Switch 7df5533497 [libc++] Implement ranges::fold_left_first and ranges::fold_left_first_with_iter (#180214) 
- Part of #105208.
- Closes #174059.
- Closes #121558.

---------

Co-authored-by: JCGoran <jcgoran@protonmail.com>
Co-authored-by: A. Jiang <de34@live.cn>
2026-04-23 23:34:41 +08:00
..
adjacent_find.h
…
all_of.h
[libc++] Forward std::all_of and std::none_of to std::any_of (#167670)
2025-11-24 11:09:40 +01:00
any_of.h
…
binary_search.h
…
clamp.h
…
comp_ref_type.h
…
comp.h
Reapply "[libc++] Avoid constructing additional objects when using map::at" (#160738) (#161485)
2025-10-02 11:15:33 +02:00
copy_backward.h
[libc++] Merge the segmented iterator code for {copy,move}_backward (#165160)
2025-12-11 10:32:24 +01:00
copy_if.h
…
copy_move_common.h
…
copy_n.h
[libc++] Merge the implementations of ranges::copy_n and std::copy_n and fix vector::insert to assign (#157444)
2025-11-27 15:50:50 +01:00
copy.h
[libc++][NFC] Use lambdas when calling a segmented iterator algorithm (#173345)
2026-01-06 17:15:05 +01:00
count_if.h
…
count.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
equal_range.h
…
equal.h
[libc++] Add segmented iterator optimization to std::equal (#179242)
2026-02-24 10:23:15 +01:00
fill_n.h
[libc++] Introduce __specialized_algorithms (#167295)
2025-11-25 13:46:19 +01:00
fill.h
[libc++] Simplify most of the segmented iterator optimizations (#164797)
2025-11-07 08:27:55 +01:00
find_end.h
[libc++] Add __find_end optimizations back (#171374)
2025-12-11 09:46:37 +01:00
find_first_of.h
…
find_if_not.h
[libc++] Forward find* algorithms to find_if (#179938)
2026-02-27 14:48:58 -08:00
find_if.h
[libc++] Forward find* algorithms to find_if (#179938)
2026-02-27 14:48:58 -08:00
find_segment_if.h
[libc++] Add segmented iterator optimization to std::equal (#179242)
2026-02-24 10:23:15 +01:00
find.h
[libc++] Forward find* algorithms to find_if (#179938)
2026-02-27 14:48:58 -08:00
for_each_n_segment.h
…
for_each_n.h
[libcxx] Modify std::__for_each{, _n} to accept r-values in __f (#179451)
2026-02-04 23:15:21 +08:00
for_each_segment.h
[libc++] Merge the segmented iterator code for {copy,move}_backward (#165160)
2025-12-11 10:32:24 +01:00
for_each.h
[libcxx] Modify std::__for_each{, _n} to accept r-values in __f (#179451)
2026-02-04 23:15:21 +08:00
generate_n.h
[libcxx] Modify std::__for_each{, _n} to accept r-values in __f (#179451)
2026-02-04 23:15:21 +08:00
generate.h
[libcxx] Optimize std::generate for segmented iterators (#163006)
2025-10-20 19:37:33 +08:00
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_until.h
…
is_heap.h
…
is_partitioned.h
…
is_permutation.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
is_sorted_until.h
…
is_sorted.h
…
iter_swap.h
…
iterator_operations.h
[libc++] Merge the implementations of ranges::copy_n and std::copy_n and fix vector::insert to assign (#157444)
2025-11-27 15:50:50 +01:00
lexicographical_compare_three_way.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
lexicographical_compare.h
[libc++] Refactor __libcpp_is_trivially_equality_comparable to be a variable template (#173151)
2025-12-22 10:04:47 +01:00
lower_bound.h
…
make_heap.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
make_projected.h
…
max_element.h
…
max.h
…
merge.h
…
min_element.h
…
min_max_result.h
…
min.h
…
minmax_element.h
…
minmax.h
…
mismatch.h
[libc++] Refactor __libcpp_is_trivially_equality_comparable to be a variable template (#173151)
2025-12-22 10:04:47 +01:00
move_backward.h
[libc++] Merge the segmented iterator code for {copy,move}_backward (#165160)
2025-12-11 10:32:24 +01:00
move.h
[libc++][NFC] Use lambdas when calling a segmented iterator algorithm (#173345)
2026-01-06 17:15:05 +01:00
next_permutation.h
…
none_of.h
[libc++] Forward std::all_of and std::none_of to std::any_of (#167670)
2025-11-24 11:09:40 +01:00
nth_element.h
…
out_value_result.h
…
partial_sort_copy.h
…
partial_sort.h
…
partition_copy.h
…
partition_point.h
…
partition.h
…
pop_heap.h
…
prev_permutation.h
…
pstl.h
[libc++][pstl] Generic implementation of parallel std::is_sorted (#176129)
2026-01-27 13:43:23 -05:00
push_heap.h
…
radix_sort.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
ranges_adjacent_find.h
…
ranges_all_of.h
…
ranges_any_of.h
…
ranges_binary_search.h
…
ranges_clamp.h
…
ranges_contains_subrange.h
…
ranges_contains.h
…
ranges_copy_backward.h
…
ranges_copy_if.h
…
ranges_copy_n.h
[libc++] Merge the implementations of ranges::copy_n and std::copy_n and fix vector::insert to assign (#157444)
2025-11-27 15:50:50 +01:00
ranges_copy.h
…
ranges_count_if.h
…
ranges_count.h
…
ranges_ends_with.h
…
ranges_equal_range.h
…
ranges_equal.h
[libc++] Fix use of static in constexpr (#175667)
2026-01-14 06:08:14 -08:00
ranges_fill_n.h
…
ranges_fill.h
[libc++] Optimize std::{,ranges}::{fill,fill_n} for segmented iterators (#132665)
2025-10-17 07:41:24 +08:00
ranges_find_end.h
…
ranges_find_first_of.h
…
ranges_find_if_not.h
[libc++] Forward find* algorithms to find_if (#179938)
2026-02-27 14:48:58 -08:00
ranges_find_if.h
[libc++] Forward find* algorithms to find_if (#179938)
2026-02-27 14:48:58 -08:00
ranges_find_last.h
…
ranges_find.h
…
ranges_fold.h
[libc++] Implement ranges::fold_left_first and ranges::fold_left_first_with_iter (#180214)
2026-04-23 23:34:41 +08:00
ranges_for_each_n.h
…
ranges_for_each.h
[libc++] Optimize {std,ranges}::for_each for iterating over __trees (#164405)
2025-12-12 09:05:51 +01:00
ranges_generate_n.h
[libcxx] Optimize rng::generate_n for segmented iterators (#165280)
2025-10-28 22:22:26 +08:00
ranges_generate.h
…
ranges_includes.h
…
ranges_inplace_merge.h
…
ranges_is_heap_until.h
…
ranges_is_heap.h
…
ranges_is_partitioned.h
…
ranges_is_permutation.h
…
ranges_is_sorted_until.h
…
ranges_is_sorted.h
…
ranges_iterator_concept.h
…
ranges_lexicographical_compare.h
…
ranges_lower_bound.h
…
ranges_make_heap.h
…
ranges_max_element.h
…
ranges_max.h
…
ranges_merge.h
…
ranges_min_element.h
…
ranges_min.h
…
ranges_minmax_element.h
…
ranges_minmax.h
…
ranges_mismatch.h
…
ranges_move_backward.h
…
ranges_move.h
…
ranges_next_permutation.h
…
ranges_none_of.h
…
ranges_nth_element.h
…
ranges_partial_sort_copy.h
…
ranges_partial_sort.h
…
ranges_partition_copy.h
…
ranges_partition_point.h
…
ranges_partition.h
…
ranges_pop_heap.h
…
ranges_prev_permutation.h
…
ranges_push_heap.h
…
ranges_remove_copy_if.h
…
ranges_remove_copy.h
…
ranges_remove_if.h
[libc++] Forward find* algorithms to find_if (#179938)
2026-02-27 14:48:58 -08:00
ranges_remove.h
…
ranges_replace_copy_if.h
…
ranges_replace_copy.h
…
ranges_replace_if.h
…
ranges_replace.h
…
ranges_reverse_copy.h
[libc++] Use views::reverse to implement ranges::reverse_copy (#177123)
2026-02-04 20:58:16 +01:00
ranges_reverse.h
…
ranges_rotate_copy.h
…
ranges_rotate.h
…
ranges_sample.h
…
ranges_search_n.h
[libc++] Optimize search_n (#171389)
2026-01-08 11:26:08 +01:00
ranges_search.h
…
ranges_set_difference.h
…
ranges_set_intersection.h
…
ranges_set_symmetric_difference.h
…
ranges_set_union.h
…
ranges_shift_left.h
[libc++][ranges] implement ranges::shift_left (#83231)
2026-01-25 10:35:43 +00:00
ranges_shift_right.h
[libc++] Implement ranges::shift_right (#177847)
2026-02-14 17:34:44 +00:00
ranges_shuffle.h
…
ranges_sort_heap.h
…
ranges_sort.h
…
ranges_stable_partition.h
…
ranges_stable_sort.h
…
ranges_starts_with.h
…
ranges_swap_ranges.h
[libc++] Forward calls to ranges::swap_ranges to the 3-leg implementation if possible (#176762)
2026-01-27 16:25:41 +01:00
ranges_transform.h
…
ranges_unique_copy.h
…
ranges_unique.h
…
ranges_upper_bound.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
[libc++] Optimize rotate (#120890)
2025-12-23 10:18:43 +01:00
sample.h
…
search_n.h
[libc++] Optimize search_n (#171389)
2026-01-08 11:26:08 +01:00
search.h
…
set_difference.h
…
set_intersection.h
…
set_symmetric_difference.h
…
set_union.h
…
shift_left.h
[libc++][ranges] implement ranges::shift_left (#83231)
2026-01-25 10:35:43 +00:00
shift_right.h
[libc++] Implement ranges::shift_right (#177847)
2026-02-14 17:34:44 +00:00
shuffle.h
…
sift_down.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
simd_utils.h
[libc++] Optimize num_get integral functions (#121795)
2025-11-24 16:53:58 +01:00
sort_heap.h
…
sort.h
…
specialized_algorithms.h
[libc++] Refactor swap_ranges to use __specialized_algorithm for the vector<bool>::iterator specialization (#173384)
2026-01-29 11:11:51 +01:00
stable_partition.h
…
stable_sort.h
[libc++] Make the naming of the iterator_traits aliases consistent (#161661)
2025-10-07 14:42:11 +02:00
swap_ranges.h
[libc++] Refactor swap_ranges to use __specialized_algorithm for the vector<bool>::iterator specialization (#173384)
2026-01-29 11:11:51 +01:00
three_way_comp_ref_type.h
…
transform.h
…
uniform_random_bit_generator_adaptor.h
…
unique_copy.h
…
unique.h
…
unwrap_iter.h
[libc++] Simplify __unwrap_iter a bit (#175153)
2026-01-13 17:01:02 +01:00
unwrap_range.h
[libc++] Fix module builds for <__algorithm/unwrap_range.h> (#179887)
2026-02-06 09:42:49 +08:00
upper_bound.h
…