Lines Matching refs:Comp
52 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> …
53 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
56 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> …
57 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
60 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
61 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
64 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
65 …constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); …
134 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
135 …constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
138 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
139 …constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
142 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
145 …min(R&& r, Comp comp = {}, Proj proj = {}); …
148 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
149 …constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
152 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
153 …constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
156 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
159 …max(R&& r, Comp comp = {}, Proj proj = {}); …
220 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
222 …minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
225 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
227 …minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
230 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
233 …minmax(R&& r, Comp comp = {}, Proj proj = {}); …
239 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
241 …minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); …
244 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
246 …minmax_element(R&& r, Comp comp = {}, Proj proj = {}); …
345 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
347 requires sortable<I, Comp, Proj>
349 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
351 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
352 requires sortable<iterator_t<R>, Comp, Proj>
354 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
356 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
358 requires sortable<I, Comp, Proj>
360 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
362 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
363 requires sortable<iterator_t<R>, Comp, Proj>
365 …ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
367 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
369 requires sortable<I, Comp, Proj>
371 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
373 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
374 requires sortable<iterator_t<R>, Comp, Proj>
376 …ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
378 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
380 requires sortable<I, Comp, Proj>
382 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
384 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
385 requires sortable<iterator_t<R>, Comp, Proj>
387 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
390 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
391 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
394 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
395 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C…
398 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
399 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
402 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
404 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
414 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
416 requires sortable<I, Comp, Proj>
418 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
420 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
421 requires sortable<iterator_t<R>, Comp, Proj>
423 …ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
425 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
427 requires sortable<I, Comp, Proj>
429 …ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
431 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
432 requires sortable<iterator_t<R>, Comp, Proj>
434 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
436 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
438 requires sortable<I, Comp, Proj>
440 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
442 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
443 requires sortable<iterator_t<R>, Comp, Proj>
445 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
544 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
545 requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
546 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
549 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
551 template<input_range R1, random_access_range R2, class Comp = ranges::less,
554 sortable<iterator_t<R2>, Comp, Proj2> &&
555 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
558 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
562 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
563 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
566 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
567 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
570 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
571 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
574 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
576 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
578 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
580 requires sortable<I, Comp, Proj>
582 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++…
584 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
585 requires sortable<iterator_t<R>, Comp, Proj>
587 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++…
590 … indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
591 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
594 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
597 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
600 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
601 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
604 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
607 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
610 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
611 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
615 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
617 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
692 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
694 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
699 projected<I2, Proj2>> Comp = ranges::less>
702 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
707 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
709 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
770 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
772 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
775 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
777 template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
779 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
782 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
808 weakly_incrementable O, class Comp = ranges::less,
810 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
813 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
816 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
817 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
820 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
826 weakly_incrementable O, class Comp = ranges::less,
828 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
831 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
834 weakly_incrementable O, class Comp = ranges::less,
836 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
839 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
975 weakly_incrementable O, class Comp = ranges::less,
977 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
980 Comp comp = {}, Proj1 proj1 = {},
984 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
985 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
988 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
992 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
994 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
997 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
1000 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
1006 weakly_incrementable O, class Comp = ranges::less,
1008 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
1010 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
1014 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
1015 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
1017 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
1022 indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
1024 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
1030 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
1031 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
1034 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1036 requires sortable<I, Comp, Proj>
1038 …inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1040 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
1041 requires sortable<iterator_t<R>, Comp, Proj>
1043 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
1145 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1147 requires sortable<I, Comp, Proj>
1149 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1151 template<bidirectional_range R, class Comp = ranges::less,
1153 requires sortable<iterator_t<R>, Comp, Proj>
1155 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1160 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1162 requires sortable<I, Comp, Proj>
1164 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1166 template<bidirectional_range R, class Comp = ranges::less,
1168 requires sortable<iterator_t<R>, Comp, Proj>
1170 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…