Lines Matching refs:comp
47 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
51 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
55 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
59 …constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); …
104 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
108 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
114 min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
118 constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
122 constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
128 max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
191 … minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
196 … minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
202 … minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
210 … minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
215 … minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
294 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
299 …ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
305 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
310 …ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
316 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
321 …ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
327 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
332 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
336 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // Since C…
340 …constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // Since C…
344 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // Since C…
349 …is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // Since C++…
363 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
368 …ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
373 …I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
378 …ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
384 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
389 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
456 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20
465 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
470 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
474 …constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C…
478 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
483 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
489 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C…
494 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C…
498 …constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since…
504 …upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C…
508 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
514 …lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C…
518 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
524 constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
599 …ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // s…
607 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
614 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
674 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
681 …Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C…
712 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
719 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
730 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
738 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
862 Comp comp = {}, Proj1 proj1 = {},
870 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
876 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
882 …equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // s…
892 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
899 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
906 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
913 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
919 …I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // …
924 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
929 …constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // …
935 …unique(R&& r, C comp = {}, Proj proj = {}); // Si…
944 …unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // Si…
953 …unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); // Si…
1030 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Si…
1036 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Si…
1045 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Si…
1051 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Si…
1402 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1410 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1418 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1426 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1434 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1444 … RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1452 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1460 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1468 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1476 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1484 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1494 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1502 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1510 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1520 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1530 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1540 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1550 … InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1558 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1566 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1574 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1582 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1590 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1598 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1606 min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1614 min(const T& a, const T& b, Compare comp);
1622 min(initializer_list<T> t, Compare comp);
1628 constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1636 max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1644 max(const T& a, const T& b, Compare comp);
1652 max(initializer_list<T> t, Compare comp);
1660 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1668 minmax(const T& a, const T& b, Compare comp);
1676 minmax(initializer_list<T> t, Compare comp);
1685 InputIterator2 first2, InputIterator2 last2, Compare comp);
1693 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1701 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1718 #include <__algorithm/comp.h>