Lines Matching refs:comp
50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
54 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
58 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
62 …constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); …
132 …constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
136 …constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
142 …min(R&& r, Comp comp = {}, Proj proj = {}); …
146 …constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
150 …constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
156 …max(R&& r, Comp comp = {}, Proj proj = {}); …
219 …minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
224 …minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
230 …minmax(R&& r, Comp comp = {}, Proj proj = {}); …
238 …minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); …
243 …minmax_element(R&& r, Comp comp = {}, Proj proj = {}); …
343 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
348 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
354 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
359 …ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
365 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
370 …ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
376 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
381 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
385 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
389 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C…
393 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
398 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
412 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
417 …ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
422 …I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
427 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
433 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
438 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
542 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
551 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
556 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
560 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
564 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
569 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
575 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++…
580 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++…
584 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
590 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
594 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
600 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
604 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
610 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
685 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
693 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
700 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
760 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
767 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
798 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
805 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
816 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
824 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
965 Comp comp = {}, Proj1 proj1 = {},
973 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
979 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
985 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
995 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
1002 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
1009 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
1016 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
1022 …I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj 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…
1133 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1139 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1148 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
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);