The
Sortable concept specifies the common requirements of
algorithms that permute sequences into ordered sequences (e.g.,
sort)
.
template<class I, class R = ranges::less<>, class P = identity>
concept Sortable =
Permutable<I> &&
IndirectStrictWeakOrder<R, projected<I, P>>;