9c24e97a97
Some new algorithms need to use _GLIBCXX_STD_A to refer to the "normal" version of the algorithm, to workaround the namespace dance done for parallel mode. PR libstdc++/94971 (partial) * include/bits/ranges_algo.h (ranges::__sample_fn): Qualify std::sample using macro to work in parallel mode. (__sort_fn): Likewise for std::sort. (ranges::__nth_element_fn): Likewise for std::nth_element. * include/bits/stl_algobase.h (lexicographical_compare_three_way): Likewise for std::__min_cmp. * include/parallel/algobase.h (lexicographical_compare_three_way): Add to namespace std::__parallel. |
||
---|---|---|
.. | ||
algo.h | ||
algobase.h | ||
algorithm | ||
algorithmfwd.h | ||
balanced_quicksort.h | ||
base.h | ||
basic_iterator.h | ||
checkers.h | ||
compatibility.h | ||
compiletime_settings.h | ||
equally_split.h | ||
features.h | ||
find_selectors.h | ||
find.h | ||
for_each_selectors.h | ||
for_each.h | ||
iterator.h | ||
list_partition.h | ||
losertree.h | ||
merge.h | ||
multiseq_selection.h | ||
multiway_merge.h | ||
multiway_mergesort.h | ||
numeric | ||
numericfwd.h | ||
omp_loop_static.h | ||
omp_loop.h | ||
par_loop.h | ||
parallel.h | ||
partial_sum.h | ||
partition.h | ||
queue.h | ||
quicksort.h | ||
random_number.h | ||
random_shuffle.h | ||
search.h | ||
set_operations.h | ||
settings.h | ||
sort.h | ||
tags.h | ||
types.h | ||
unique_copy.h | ||
workstealing.h |