Lines Matching refs:Compare

341 template <class ForwardIterator, class Compare>
343     is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
349 template <class ForwardIterator, class Compare>
351     is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
357 template <class RandomAccessIterator, class Compare>
359     sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
365 template <class RandomAccessIterator, class Compare>
367     stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
373 template <class RandomAccessIterator, class Compare>
375 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
382 template <class InputIterator, class RandomAccessIterator, class Compare>
385 …                RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
391 template <class RandomAccessIterator, class Compare>
393 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
399 template <class ForwardIterator, class T, class Compare>
401     lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
407 template <class ForwardIterator, class T, class Compare>
409     upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
415 template <class ForwardIterator, class T, class Compare>
417     equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
423 template <class ForwardIterator, class T, class Compare>
425     binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
432 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
435           InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
441 template <class BidirectionalIterator, class Compare>
443 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
449 template <class InputIterator1, class InputIterator2, class Compare>
451 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
458 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
461               InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
468 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
471 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
478 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
481 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
488 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
491 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
497 template <class RandomAccessIterator, class Compare>
499     push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
505 template <class RandomAccessIterator, class Compare>
507     pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
513 template <class RandomAccessIterator, class Compare>
515     make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
521 template <class RandomAccessIterator, class Compare>
523     sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
529 template <class RandomAccessIterator, class Compare>
531     is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
537 template <class RandomAccessIterator, class Compare>
539     is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
545 template <class ForwardIterator, class Compare>
547     min_element(ForwardIterator first, ForwardIterator last, Compare comp);
553 template <class T, class Compare>
555     min(const T& a, const T& b, Compare comp);
561 template<class T, class Compare>
563     min(initializer_list<T> t, Compare comp);
568 template<class T, class Compare>
569     constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
575 template <class ForwardIterator, class Compare>
577     max_element(ForwardIterator first, ForwardIterator last, Compare comp);
583 template <class T, class Compare>
585     max(const T& a, const T& b, Compare comp);
591 template<class T, class Compare>
593     max(initializer_list<T> t, Compare comp);
599 template<class ForwardIterator, class Compare>
601     minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
607 template<class T, class Compare>
609     minmax(const T& a, const T& b, Compare comp);
615 template<class T, class Compare>
617     minmax(initializer_list<T> t, Compare comp);
623 template <class InputIterator1, class InputIterator2, class Compare>
626                             InputIterator2 first2, InputIterator2 last2, Compare comp);
632 template <class BidirectionalIterator, class Compare>
634     next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
640 template <class BidirectionalIterator, class Compare>
642     prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);