Lines Matching refs:Comp
49 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> …
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> …
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 = {}); …
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 = {}); …
106 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
107 …constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
110 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
111 …constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
114 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
117 …min(R&& r, Comp comp = {}, Proj proj = {}); …
120 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
121 …constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
124 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
125 …constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
128 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
131 …max(R&& r, Comp comp = {}, Proj proj = {}); …
192 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
194 …minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
197 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
199 …minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
202 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
205 …minmax(R&& r, Comp comp = {}, Proj proj = {}); …
211 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
213 …minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); …
216 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
218 …minmax_element(R&& r, Comp comp = {}, Proj proj = {}); …
301 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
303 requires sortable<I, Comp, Proj>
305 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
307 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
308 requires sortable<iterator_t<R>, Comp, Proj>
310 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
312 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
314 requires sortable<I, Comp, Proj>
316 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
318 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
319 requires sortable<iterator_t<R>, Comp, Proj>
321 …ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
323 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
325 requires sortable<I, Comp, Proj>
327 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
329 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
330 requires sortable<iterator_t<R>, Comp, Proj>
332 …ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
334 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
336 requires sortable<I, Comp, Proj>
338 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
340 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
341 requires sortable<iterator_t<R>, Comp, Proj>
343 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
346 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
347 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
350 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
351 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C…
354 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
355 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
358 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
360 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
370 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
372 requires sortable<I, Comp, Proj>
374 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
376 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
377 requires sortable<iterator_t<R>, Comp, Proj>
379 …ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
381 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
383 requires sortable<I, Comp, Proj>
384 …I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
386 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
387 requires sortable<iterator_t<R>, Comp, Proj>
389 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
391 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
393 requires sortable<I, Comp, Proj>
395 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
397 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
398 requires sortable<iterator_t<R>, Comp, Proj>
400 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
499 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
500 requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
501 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
504 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
506 template<input_range R1, random_access_range R2, class Comp = ranges::less,
509 sortable<iterator_t<R2>, Comp, Proj2> &&
510 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
513 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
517 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
518 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
521 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
522 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
525 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
526 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
529 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
531 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
533 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
535 requires sortable<I, Comp, Proj>
537 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++…
539 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
540 requires sortable<iterator_t<R>, Comp, Proj>
542 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++…
545 … indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
546 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
549 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
552 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
555 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
556 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
559 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
562 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
565 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
566 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
570 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
572 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
645 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
647 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
652 projected<I2, Proj2>> Comp = ranges::less>
655 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
660 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
662 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
717 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
719 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
722 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
724 template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
726 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
729 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
755 weakly_incrementable O, class Comp = ranges::less,
757 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
760 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
763 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
764 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
767 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
773 weakly_incrementable O, class Comp = ranges::less,
775 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
778 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
781 weakly_incrementable O, class Comp = ranges::less,
783 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
786 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
922 weakly_incrementable O, class Comp = ranges::less,
924 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
927 Comp comp = {}, Proj1 proj1 = {},
931 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
932 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
935 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
939 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
941 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
944 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
947 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
953 weakly_incrementable O, class Comp = ranges::less,
955 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
957 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
961 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
962 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
964 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
969 indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
971 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
977 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
978 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
981 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
983 requires sortable<I, Comp, Proj>
984 …I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // …
986 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
987 requires sortable<iterator_t<R>, Comp, Proj>
989 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
1091 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1093 requires sortable<I, Comp, Proj>
1095 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1097 template<bidirectional_range R, class Comp = ranges::less,
1099 requires sortable<iterator_t<R>, Comp, Proj>
1101 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1106 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1108 requires sortable<I, Comp, Proj>
1110 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1112 template<bidirectional_range R, class Comp = ranges::less,
1114 requires sortable<iterator_t<R>, Comp, Proj>
1116 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…