Lines Matching full:compare

1503 template <class ForwardIterator, class Compare>
1505     is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1511 template <class ForwardIterator, class Compare>
1513     is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1519 template <class RandomAccessIterator, class Compare>
1521     sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1527 template <class RandomAccessIterator, class Compare>
1529     stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1535 template <class RandomAccessIterator, class Compare>
1537 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1544 template <class InputIterator, class RandomAccessIterator, class Compare>
1547 …                RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1553 template <class RandomAccessIterator, class Compare>
1555 …ent(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1561 template <class ForwardIterator, class T, class Compare>
1563     lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1569 template <class ForwardIterator, class T, class Compare>
1571     upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1577 template <class ForwardIterator, class T, class Compare>
1579     equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1585 template <class ForwardIterator, class T, class Compare>
1587     binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1594 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1597           InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1603 template <class BidirectionalIterator, class Compare>
1605 …directionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1611 template <class InputIterator1, class InputIterator2, class Compare>
1613 …Iterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1620 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1623               InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1630 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1633 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1640 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1643 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1650 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1653 …                 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1659 template <class RandomAccessIterator, class Compare>
1661     push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1667 template <class RandomAccessIterator, class Compare>
1669     pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1675 template <class RandomAccessIterator, class Compare>
1677     make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1683 template <class RandomAccessIterator, class Compare>
1685     sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1691 template <class RandomAccessIterator, class Compare>
1693     is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1699 template <class RandomAccessIterator, class Compare>
1701     is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1707 template <class ForwardIterator, class Compare>
1709     min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1715 template <class T, class Compare>
1717     min(const T& a, const T& b, Compare comp);
1723 template<class T, class Compare>
1725     min(initializer_list<T> t, Compare comp);
1730 template<class T, class Compare>
1731     constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1737 template <class ForwardIterator, class Compare>
1739     max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1745 template <class T, class Compare>
1747     max(const T& a, const T& b, Compare comp);
1753 template<class T, class Compare>
1755     max(initializer_list<T> t, Compare comp);
1761 template<class ForwardIterator, class Compare>
1763     minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1769 template<class T, class Compare>
1771     minmax(const T& a, const T& b, Compare comp);
1777 template<class T, class Compare>
1779     minmax(initializer_list<T> t, Compare comp);
1785 template <class InputIterator1, class InputIterator2, class Compare>
1788                             InputIterator2 first2, InputIterator2 last2, Compare comp);
1806 template <class BidirectionalIterator, class Compare>
1808     next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1814 template <class BidirectionalIterator, class Compare>
1816     prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);