Lines Matching refs:Compare

1465 template <class ForwardIterator, class Compare>
1467     is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1473 template <class ForwardIterator, class Compare>
1475     is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1481 template <class RandomAccessIterator, class Compare>
1483     sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1489 template <class RandomAccessIterator, class Compare>
1491     stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1497 template <class RandomAccessIterator, class Compare>
1499 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1506 template <class InputIterator, class RandomAccessIterator, class Compare>
1509 …                RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1515 template <class RandomAccessIterator, class Compare>
1517 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1523 template <class ForwardIterator, class T, class Compare>
1525     lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1531 template <class ForwardIterator, class T, class Compare>
1533     upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1539 template <class ForwardIterator, class T, class Compare>
1541     equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1547 template <class ForwardIterator, class T, class Compare>
1549     binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1556 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1559           InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1565 template <class BidirectionalIterator, class Compare>
1567 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1573 template <class InputIterator1, class InputIterator2, class Compare>
1575 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1582 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1585               InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1592 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1595 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1602 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1605 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1612 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1615 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1621 template <class RandomAccessIterator, class Compare>
1623     push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1629 template <class RandomAccessIterator, class Compare>
1631     pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1637 template <class RandomAccessIterator, class Compare>
1639     make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1645 template <class RandomAccessIterator, class Compare>
1647     sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1653 template <class RandomAccessIterator, class Compare>
1655     is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1661 template <class RandomAccessIterator, class Compare>
1663     is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1669 template <class ForwardIterator, class Compare>
1671     min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1677 template <class T, class Compare>
1679     min(const T& a, const T& b, Compare comp);
1685 template<class T, class Compare>
1687     min(initializer_list<T> t, Compare comp);
1692 template<class T, class Compare>
1693     constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1699 template <class ForwardIterator, class Compare>
1701     max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1707 template <class T, class Compare>
1709     max(const T& a, const T& b, Compare comp);
1715 template<class T, class Compare>
1717     max(initializer_list<T> t, Compare comp);
1723 template<class ForwardIterator, class Compare>
1725     minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1731 template<class T, class Compare>
1733     minmax(const T& a, const T& b, Compare comp);
1739 template<class T, class Compare>
1741     minmax(initializer_list<T> t, Compare comp);
1747 template <class InputIterator1, class InputIterator2, class Compare>
1750                             InputIterator2 first2, InputIterator2 last2, Compare comp);
1768 template <class BidirectionalIterator, class Compare>
1770     next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1776 template <class BidirectionalIterator, class Compare>
1778     prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);