std::sortable

(C++20)

indirectly_writable

(C++20)

weakly_incrementable

(C++20)

incrementable

(C++20)

is-integer-like
is-signed-integer-like

(C++20)(C++20)

(C++20)

(C++20)

(C++20)

(C++20)

input_or_output_iterator

(C++20)

forward_iterator

(C++20)

bidirectional_iterator

(C++20)

random_access_iterator

(C++20)

contiguous_iterator

(C++20)

Iterator primitives

input_iterator_tagoutput_iterator_tagforward_iterator_tagbidirectional_iterator_tagrandom_access_iterator_tagcontiguous_iterator_tag

(C++20)

iter_value_titer_difference_titer_reference_titer_const_reference_titer_rvalue_reference_titer_common_reference_t

(C++20)(C++20)(C++20)(C++23)(C++20)(C++20)

iterator

(deprecated in C++17)

iterator_traits

incrementable_traits

(C++20)

indirectly_readable_traits

(C++20)

Algorithm concepts and utilities

Indirect callable concepts

indirectly_unary_invocableindirectly_regular_unary_invocable

(C++20)(C++20)

indirect_unary_predicate

(C++20)

indirect_binary_predicate

(C++20)

indirect_equivalence_relation

(C++20)

indirect_strict_weak_order

(C++20)

Common algorithm requirements

indirectly_movable

(C++20)

indirectly_movable_storable

(C++20)

indirectly_copyable

(C++20)

indirectly_copyable_storable

(C++20)

indirectly_swappable

(C++20)

indirectly_comparable

(C++20)

permutable

(C++20)

mergeable

(C++20)

sortable

(C++20)

(C++20)

(C++20)

(C++26)

make_reverse_iterator

(C++14)

move_iterator

(C++11)

make_move_iterator

(C++11)

default_sentinel_tdefault_sentinel

(C++20)(C++20)

unreachable_sentinel_tunreachable_sentinel

(C++20)(C++20)

front_insert_iterator

(C++20)

(C++20)

(C++20)

(C++23)

(C++23)

(C++23)

(C++23)

(C++23)

Iterator customization points

(C++20)

(C++20)

(C++20)

(C++20)

(C++20)

(C++20)

(C++11)(C++14)

(C++14)(C++14)

(C++11)(C++14)

(C++14)(C++14)

(C++17)(C++20)

(C++17)

(C++17)

Defined in header <iterator>

template< class I, class Comp = ranges::less, class Proj = std::identity >

concept sortable =
std::permutable <I> &&

std::indirect_strict_weak_order <Comp, std::projected <I, Proj>>;

(since C++20)

The sortable concept specifies the requirements for algorithms that permute a range into an ordered range according to Comp.

[edit] Semantic requirements

std::sortable<I, Comp, Proj> is modeled only if all concepts it subsumes are modeled.

[edit] See also

ranges::sort

(C++20)

sorts a range into ascending order
(algorithm function object)[edit]

ranges::stable_sort

(C++20)

sorts a range of elements while preserving order between equal elements
(algorithm function object)[edit]

ranges::partial_sort

(C++20)

sorts the first N elements of a range
(algorithm function object)[edit]

ranges::nth_element

(C++20)

partially sorts the given range making sure that it is partitioned by the given element
(algorithm function object)[edit]

ranges::inplace_merge

(C++20)

merges two ordered ranges in-place
(algorithm function object)[edit]

ranges::push_heap

(C++20)

adds an element to a max heap
(algorithm function object)[edit]

ranges::pop_heap

(C++20)

removes the largest element from a max heap
(algorithm function object)[edit]

ranges::make_heap

(C++20)

creates a max heap out of a range of elements
(algorithm function object)[edit]

ranges::sort_heap

(C++20)

turns a max heap into a range of elements sorted in ascending order
(algorithm function object)[edit]

ranges::next_permutation

(C++20)

generates the next greater lexicographic permutation of a range of elements
(algorithm function object)[edit]

ranges::prev_permutation

(C++20)

generates the next smaller lexicographic permutation of a range of elements
(algorithm function object)[edit]

cppreference.com

Namespaces

Variants

Views

Actions

std::sortable

[edit] Semantic requirements

[edit] See also

Navigation

Toolbox