37 concept compare = requires( const std::remove_reference_t<Compare>& comp, typename std::iterator_tr…  in requires()  argument
39     { comp(typename std::iterator_traits<Iterator>::reference(value),  in requires()
61 …return comp(array[l], array[m]) ? ( comp(array[m], array[r]) ? m : ( comp(array[l], array[r]) ? r …  in median_of_three()
62 …                         : ( comp(array[r], array[m]) ? m : ( comp(array[r], array[l]) ? r : l ) );  in median_of_three()
89             } while( comp(*first_element, array[j]) );  in split_range()
94             } while( comp(array[i], *first_element) );  in split_range()
116     const Compare& comp;  variable
121         comp(comp_), size(size_), begin(begin_) {}  in quick_sort_range()
127         : comp(range.comp)  in quick_sort_range()
138     const Compare& comp;  variable
146 …quick_sort_pretest_body( const Compare& _comp, task_group_context& _context ) : comp(_comp), conte…  in quick_sort_pretest_body()
157             if( comp(*(k), *(k - 1)) ) {  in operator()
170         std::sort(range.begin, range.begin + range.size, range.comp);  in operator()
177 …_parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp ) {  in do_parallel_quick_sort()  argument
178     parallel_for(quick_sort_range<RandomAccessIterator,Compare>(begin, end - begin, comp),  in do_parallel_quick_sort()
186 void parallel_quick_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp…  in parallel_quick_sort()  argument
193         if( comp(*(k + 1), *k) ) {  in parallel_quick_sort()
194             do_parallel_quick_sort(begin, end, comp);  in parallel_quick_sort()
201                  quick_sort_pretest_body<RandomAccessIterator, Compare>(comp, my_context),  in parallel_quick_sort()
206         do_parallel_quick_sort(begin, end, comp);  in parallel_quick_sort()
238 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end, const Compare& comp ) {  in __TBB_requires()
242             std::sort(begin, end, comp);  in __TBB_requires()
244             parallel_quick_sort(begin, end, comp);  in __TBB_requires()
265 void parallel_sort( Range&& rng, const Compare& comp ) {  in __TBB_requires()
266     parallel_sort(std::begin(rng), std::end(rng), comp);  in __TBB_requires()