Lines Matching refs:Comp
46 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20
47 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
50 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
51 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
54 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
55 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
58 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
59 …constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); …
103 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
104 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
107 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
108 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
111 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
114 min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
117 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
118 constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
121 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
122 constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
125 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
128 max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
189 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
191 … minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
194 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
196 … minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
199 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
202 … minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
208 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
210 … minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
213 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
215 … minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
290 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
292 requires sortable<I, Comp, Proj>
294 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
296 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
297 requires sortable<iterator_t<R>, Comp, Proj>
299 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
301 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
303 requires sortable<I, Comp, Proj>
305 …ranges::pop_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::pop_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::make_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::make_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::sort_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::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
335 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
336 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // Since C…
339 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
340 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // Since C…
343 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
344 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // Since C…
347 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
349 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // Since C++…
359 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
361 requires sortable<I, Comp, Proj>
363 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
365 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
366 requires sortable<iterator_t<R>, Comp, Proj>
368 …ranges::sort(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>
373 …I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
375 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
376 requires sortable<iterator_t<R>, Comp, Proj>
378 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
380 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
382 requires sortable<I, Comp, Proj>
384 …ranges::partial_sort(I first, I middle, 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::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
451 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
452 requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
453 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
456 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20
458 template<input_range R1, random_access_range R2, class Comp = ranges::less,
461 sortable<iterator_t<R2>, Comp, Proj2> &&
462 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
465 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
469 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
470 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
473 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
474 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
477 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
478 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
481 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
483 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
485 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
487 requires sortable<I, Comp, Proj>
489 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C…
491 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
492 requires sortable<iterator_t<R>, Comp, Proj>
494 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C…
497 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
498 …constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since…
501 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
504 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C…
507 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
508 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
511 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
514 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C…
517 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
518 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
522 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
524 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
597 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
599 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
604 projected<I2, Proj2>> Comp = ranges::less>
607 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
612 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
614 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
669 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
671 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
674 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
676 template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
678 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
681 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
707 weakly_incrementable O, class Comp = ranges::less,
709 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
712 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
715 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
716 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
719 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
725 weakly_incrementable O, class Comp = ranges::less,
727 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
730 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
733 weakly_incrementable O, class Comp = ranges::less,
735 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
738 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
857 weakly_incrementable O, class Comp = ranges::less,
859 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
862 Comp comp = {}, Proj1 proj1 = {},
866 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
867 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
870 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
874 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
876 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
879 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
882 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
888 weakly_incrementable O, class Comp = ranges::less,
890 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
892 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
896 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
897 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
899 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
904 indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
906 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
912 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
913 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
916 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
918 requires sortable<I, Comp, Proj>
919 …I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // …
921 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
922 requires sortable<iterator_t<R>, Comp, Proj>
924 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
1026 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1028 requires sortable<I, Comp, Proj>
1030 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Si…
1032 template<bidirectional_range R, class Comp = ranges::less,
1034 requires sortable<iterator_t<R>, Comp, Proj>
1036 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Si…
1041 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1043 requires sortable<I, Comp, Proj>
1045 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Si…
1047 template<bidirectional_range R, class Comp = ranges::less,
1049 requires sortable<iterator_t<R>, Comp, Proj>
1051 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Si…