std::experimental::ranges::Sortable
Min standard notice:
The Sortable concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, ranges::sort).
# Declarations
template< class I, class R = ranges::less<>, class P = ranges::identity >
concept bool Sortable =
Permutable<I> &&
IndirectStrictWeakOrder<R, ranges::projected<I, P>>;
(ranges TS)