Lines Matching refs:Compare

332 template <class ForwardIterator, class Compare>
334     is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
340 template <class ForwardIterator, class Compare>
342     is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
348 template <class RandomAccessIterator, class Compare>
350     sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
356 template <class RandomAccessIterator, class Compare>
358     stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
364 template <class RandomAccessIterator, class Compare>
366 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
373 template <class InputIterator, class RandomAccessIterator, class Compare>
376 …                RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
382 template <class RandomAccessIterator, class Compare>
384 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
390 template <class ForwardIterator, class T, class Compare>
392     lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
398 template <class ForwardIterator, class T, class Compare>
400     upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
406 template <class ForwardIterator, class T, class Compare>
408     equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
414 template <class ForwardIterator, class T, class Compare>
416     binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
423 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
426           InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
432 template <class BidirectionalIterator, class Compare>
434 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
440 template <class InputIterator1, class InputIterator2, class Compare>
442 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
449 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
452               InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
459 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
462 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
469 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
472 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
479 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
482 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
488 template <class RandomAccessIterator, class Compare>
490     push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
496 template <class RandomAccessIterator, class Compare>
498     pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
504 template <class RandomAccessIterator, class Compare>
506     make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
512 template <class RandomAccessIterator, class Compare>
514     sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
520 template <class RandomAccessIterator, class Compare>
522     is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
528 template <class RandomAccessIterator, class Compare>
530     is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
536 template <class ForwardIterator, class Compare>
538     min_element(ForwardIterator first, ForwardIterator last, Compare comp);  // constexpr in C++14
544 template <class T, class Compare>
546     min(const T& a, const T& b, Compare comp);  // constexpr in C++14
552 template<class T, class Compare>
554     min(initializer_list<T> t, Compare comp);  // constexpr in C++14
559 template<class T, class Compare>
560     constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17
566 template <class ForwardIterator, class Compare>
568     max_element(ForwardIterator first, ForwardIterator last, Compare comp);  // constexpr in C++14
574 template <class T, class Compare>
576     max(const T& a, const T& b, Compare comp);  // constexpr in C++14
582 template<class T, class Compare>
584     max(initializer_list<T> t, Compare comp);  // constexpr in C++14
590 template<class ForwardIterator, class Compare>
592 … minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);   // constexpr in C++14
598 template<class T, class Compare>
600     minmax(const T& a, const T& b, Compare comp);  // constexpr in C++14
606 template<class T, class Compare>
608     minmax(initializer_list<T> t, Compare comp);  // constexpr in C++14
614 template <class InputIterator1, class InputIterator2, class Compare>
617                             InputIterator2 first2, InputIterator2 last2, Compare comp);
623 template <class BidirectionalIterator, class Compare>
625     next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
631 template <class BidirectionalIterator, class Compare>
633     prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);