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 = {}); …
107 …constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
111 …constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
117 …min(R&& r, Comp comp = {}, Proj proj = {}); …
121 …constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
125 …constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
131 …max(R&& r, Comp comp = {}, Proj proj = {}); …
194 …minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
199 …minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); …
205 …minmax(R&& r, Comp comp = {}, Proj proj = {}); …
213 …minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); …
218 …minmax_element(R&& r, Comp comp = {}, Proj proj = {}); …
305 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
310 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
316 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
321 …ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
327 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
332 …ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
338 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
343 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
347 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
351 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C…
355 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
360 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
374 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
379 …ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
384 …I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
389 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
395 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
400 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
504 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
513 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
518 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
522 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
526 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
531 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
537 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++…
542 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++…
546 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
552 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
556 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
562 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++…
566 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
572 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
647 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
655 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
662 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
722 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
729 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
760 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
767 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
778 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
786 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
927 Comp comp = {}, Proj1 proj1 = {},
935 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
941 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
947 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
957 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
964 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
971 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
978 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
984 …I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // …
989 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
994 …constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // …
1000 …unique(R&& r, C comp = {}, Proj proj = {}); // si…
1009 …unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // si…
1018 …unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); // si…
1095 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1101 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1110 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1116 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // si…
1467 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1475 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1483 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1491 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1499 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1509 … RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1517 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1525 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1533 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1541 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1549 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1559 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1567 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1575 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1585 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1595 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1605 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1615 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1623 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1631 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1639 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1647 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1655 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1663 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1671 min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1679 min(const T& a, const T& b, Compare comp);
1687 min(initializer_list<T> t, Compare comp);
1693 constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1701 max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1709 max(const T& a, const T& b, Compare comp);
1717 max(initializer_list<T> t, Compare comp);
1725 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1733 minmax(const T& a, const T& b, Compare comp);
1741 minmax(initializer_list<T> t, Compare comp);
1750 InputIterator2 first2, InputIterator2 last2, Compare comp);
1756 Cmp comp)
1757 … -> decltype(comp(*b1, *b2)); // since C++20
1770 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1778 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1792 #include <__algorithm/comp.h>