1.1 KiB
1.1 KiB
[alg.req.sortable]
24 Iterators library [iterators]
24.3 Iterator requirements [iterator.requirements]
24.3.7 Common algorithm requirements [alg.req]
24.3.7.8 Concept sortable [alg.req.sortable]
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 &&indirect_strict_weak_order<R, projected<I, P>>;