Lines Matching refs:Comp
49 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20
50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
53 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
54 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
57 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
58 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
62 constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
131 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
132 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
135 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
136 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
139 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
142 min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
145 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
146 constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
149 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
150 constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
153 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
156 max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
217 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
219 minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
222 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
224 minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
227 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
230 minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
236 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
238 minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
241 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
243 minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
342 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
344 requires sortable<I, Comp, Proj>
346 ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
348 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
349 requires sortable<iterator_t<R>, Comp, Proj>
351 ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
353 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
355 requires sortable<I, Comp, Proj>
357 ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
359 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
360 requires sortable<iterator_t<R>, Comp, Proj>
362 ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
364 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
366 requires sortable<I, Comp, Proj>
368 ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
370 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
371 requires sortable<iterator_t<R>, Comp, Proj>
373 ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
375 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
377 requires sortable<I, Comp, Proj>
379 ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
381 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
382 requires sortable<iterator_t<R>, Comp, Proj>
384 ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
387 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
388 constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
391 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
392 constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
395 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
396 constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
399 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
401 is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
411 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
413 requires sortable<I, Comp, Proj>
415 ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
417 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
418 requires sortable<iterator_t<R>, Comp, Proj>
420 ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
422 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
424 requires sortable<I, Comp, Proj>
425 I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
427 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
428 requires sortable<iterator_t<R>, Comp, Proj>
430 ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
432 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
434 requires sortable<I, Comp, Proj>
436 ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
438 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
439 requires sortable<iterator_t<R>, Comp, Proj>
441 ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20
540 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
541 requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
542 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
545 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
547 template<input_range R1, random_access_range R2, class Comp = ranges::less,
550 sortable<iterator_t<R2>, Comp, Proj2> &&
551 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
554 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
558 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
559 constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
562 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
563 constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
566 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
567 constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
570 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
572 ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
574 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
576 requires sortable<I, Comp, Proj>
578 ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20
580 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
581 requires sortable<iterator_t<R>, Comp, Proj>
583 ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++20
586 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
587 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
590 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
593 upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
596 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
597 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
600 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
603 lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
606 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
607 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
611 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
613 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
686 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
688 ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // since C++20
693 projected<I2, Proj2>> Comp = ranges::less>
696 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
701 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
703 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
764 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
766 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
769 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
771 template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
773 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
776 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
802 weakly_incrementable O, class Comp = ranges::less,
804 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
807 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
810 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
811 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
814 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
820 weakly_incrementable O, class Comp = ranges::less,
822 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
825 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
828 weakly_incrementable O, class Comp = ranges::less,
830 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
833 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
969 weakly_incrementable O, class Comp = ranges::less,
971 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
974 Comp comp = {}, Proj1 proj1 = {},
978 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
979 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
982 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
986 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
988 equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
991 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
994 equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
1000 weakly_incrementable O, class Comp = ranges::less,
1002 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
1004 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
1008 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
1009 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
1011 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
1016 indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
1018 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
1024 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
1025 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
1028 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1030 requires sortable<I, Comp, Proj>
1031 I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1033 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
1034 requires sortable<iterator_t<R>, Comp, Proj>
1036 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
1138 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1140 requires sortable<I, Comp, Proj>
1142 ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1144 template<bidirectional_range R, class Comp = ranges::less,
1146 requires sortable<iterator_t<R>, Comp, Proj>
1148 ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1153 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1155 requires sortable<I, Comp, Proj>
1157 ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1159 template<bidirectional_range R, class Comp = ranges::less,
1161 requires sortable<iterator_t<R>, Comp, Proj>
1163 ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20