Skip to content

Search topics & cppreference

Search all study topics, concept maps, and 6,587 C++ and C reference pages.

std::experimental::ranges::Sortable

The Sortable concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, ranges::sort).

NotebookLM
template< class I, class R = ranges::less<>, class P = ranges::identity >
concept bool Sortable =
    Permutable<I> &&
    IndirectStrictWeakOrder<R, ranges::projected<I, P>>;
(ranges TS)

The Sortable concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, ranges::sort).

Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.