Lines Matching full: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 = {}); …
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 = {}); …
135 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
136 …constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
139 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
142 …min(R&& r, Comp comp = {}, Proj proj = {}); …
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 = {}); …
149 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
150 …constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
153 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
156 …max(R&& r, Comp comp = {}, Proj proj = {}); …
217 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
219 …minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
222 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
224 …minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
227 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
230 …minmax(R&& r, Comp comp = {}, Proj proj = {}); …
236 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
238 …minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); …
241 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
243 …minmax_element(R&& r, Comp comp = {}, Proj proj = {}); …
339 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
341 requires sortable<I, Comp, Proj>
343 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
345 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
346 requires sortable<iterator_t<R>, Comp, Proj>
348 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
350 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
352 requires sortable<I, Comp, Proj>
354 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
356 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
357 requires sortable<iterator_t<R>, Comp, Proj>
359 …ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
361 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
363 requires sortable<I, Comp, Proj>
365 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
367 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
368 requires sortable<iterator_t<R>, Comp, Proj>
370 …ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
372 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
374 requires sortable<I, Comp, Proj>
376 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
378 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
379 requires sortable<iterator_t<R>, Comp, Proj>
381 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
384 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
385 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
388 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
389 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C…
392 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
393 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
396 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
398 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
408 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
410 requires sortable<I, Comp, Proj>
412 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
414 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
415 requires sortable<iterator_t<R>, Comp, Proj>
417 …ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
419 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
421 requires sortable<I, Comp, Proj>
422 …I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
424 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
425 requires sortable<iterator_t<R>, Comp, Proj>
427 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
429 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
431 requires sortable<I, Comp, Proj>
433 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
435 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
436 requires sortable<iterator_t<R>, Comp, Proj>
438 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
537 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
538 requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
539 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
542 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
544 template<input_range R1, random_access_range R2, class Comp = ranges::less,
547 sortable<iterator_t<R2>, Comp, Proj2> &&
548 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
551 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
555 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
556 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
559 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
560 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
563 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
564 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
567 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
569 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
571 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
573 requires sortable<I, Comp, Proj>
575 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++…
577 template<random_access_range R, class Comp = ranges::less, class Proj = identity>
578 requires sortable<iterator_t<R>, Comp, Proj>
580 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++…
583 … indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
584 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
587 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
590 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
593 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
594 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
597 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
600 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
603 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
604 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
608 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
610 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
683 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
685 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
690 projected<I2, Proj2>> Comp = ranges::less>
693 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
698 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
700 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
755 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
757 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
760 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
762 template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
764 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
767 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
793 weakly_incrementable O, class Comp = ranges::less,
795 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
798 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
801 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
802 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
805 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
811 weakly_incrementable O, class Comp = ranges::less,
813 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
816 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
819 weakly_incrementable O, class Comp = ranges::less,
821 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
824 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
960 weakly_incrementable O, class Comp = ranges::less,
962 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
965 Comp comp = {}, Proj1 proj1 = {},
969 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
970 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
973 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
977 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
979 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
982 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
985 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
991 weakly_incrementable O, class Comp = ranges::less,
993 requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
995 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
999 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
1000 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
1002 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
1007 indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
1009 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
1015 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
1016 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
1019 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1021 requires sortable<I, Comp, Proj>
1022 …I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // …
1024 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
1025 requires sortable<iterator_t<R>, Comp, Proj>
1027 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
1032 …constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // …
1038 …unique(R&& r, C comp = {}, Proj proj = {}); // si…
1047 …unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // si…
1056 …unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); // si…
1129 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1131 requires sortable<I, Comp, Proj>
1133 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1135 template<bidirectional_range R, class Comp = ranges::less,
1137 requires sortable<iterator_t<R>, Comp, Proj>
1139 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1144 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1146 requires sortable<I, Comp, Proj>
1148 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1150 template<bidirectional_range R, class Comp = ranges::less,
1152 requires sortable<iterator_t<R>, Comp, Proj>
1154 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1505 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1513 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1521 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1529 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1537 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1547 … RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1555 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1563 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1571 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1579 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1587 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1597 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1605 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1613 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1623 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1633 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1643 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1653 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1661 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1669 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1677 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1685 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1693 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1701 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1709 min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1717 min(const T& a, const T& b, Compare comp);
1725 min(initializer_list<T> t, Compare comp);
1731 constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1739 max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1747 max(const T& a, const T& b, Compare comp);
1755 max(initializer_list<T> t, Compare comp);
1763 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1771 minmax(const T& a, const T& b, Compare comp);
1779 minmax(initializer_list<T> t, Compare comp);
1788 InputIterator2 first2, InputIterator2 last2, Compare comp);
1794 Cmp comp)
1795 … -> decltype(comp(*b1, *b2)); // since C++20
1808 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1816 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);