Lines Matching refs:comp

343     is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
351     is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
359     sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
367     stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
375 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
385 …                RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
393 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
401     lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
409     upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
417     equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
425     binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
435           InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
443 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
451 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
461               InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
471 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
481 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
491 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
499     push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
507     pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
515     make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
523     sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
531     is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
539     is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
547     min_element(ForwardIterator first, ForwardIterator last, Compare comp);
555     min(const T& a, const T& b, Compare comp);
563     min(initializer_list<T> t, Compare comp);
569     constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
577     max_element(ForwardIterator first, ForwardIterator last, Compare comp);
585     max(const T& a, const T& b, Compare comp);
593     max(initializer_list<T> t, Compare comp);
601     minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
609     minmax(const T& a, const T& b, Compare comp);
617     minmax(initializer_list<T> t, Compare comp);
626                             InputIterator2 first2, InputIterator2 last2, Compare comp);
634     next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
642     prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
668 #include <__algorithm/comp.h>