# std::experimental::ranges::Sortable

From cppreference.com
< cpp‎ | experimental‎ | ranges

template <class I, class R = ranges::less<>, class P = ranges::identity> concept bool Sortable() { return ranges::Permutable<I>() && ranges::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`).

Retrieved from "http://en.cppreference.com/mwiki/index.php?title=cpp/experimental/ranges/iterator/Sortable&oldid=89360"