__GNU_PARALLEL::SAMPLING_SORTER(3)
β¨ NAME β¨
Okay bestie, this page is from the Library Functions Manual, and the star of the show is __gnu_parallel::sampling_sorter β a Stable sorting functor. Periodt. π
πΈ SYNOPSIS πΈ
π«Ά Public Member Functions π«Ά
void operator() (RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp)
π Detailed Description π
template<bool stable, class RandomAccessIterator, class StrictWeakOrdering>
struct __gnu_parallel::sampling_sorter< stable, RandomAccessIterator,
StrictWeakOrdering >
Itβs a Stable sorting functor, no cap. π¦
And why does it exist? To reduce code instanciation in multiway_merge_sampling_splitting. Yep, thatβs the vibe. β¨
Definition at line1072of filemultiway_merge.h. π
π AUTHOR π
Generated automatically by Doxygen for libstdc++ from the source code. Iconic, honestly. π
Brought to you by libstdc++, dated 21 Apr 2009 β mwah, bestie, go forth and sort stably ππ«Ά
π¦ where this page comes from
- nixpkgs unstable: std-man-pages 4.4.0
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms