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> &&
indirect_strict_weak_order<R, projected<I, P>>;