Namespaces
Variants

std::experimental::ranges:: Sortable

From cppreference.net
template < class I, class R = ranges:: less <> , class P = ranges:: identity >

concept bool Sortable =
Permutable < I > &&

IndirectStrictWeakOrder < R, ranges :: projected < I, P >> ;
(ranges TS)

Sortable 개념은 시퀀스를 정렬된 시퀀스로 재배열하는 알고리즘들의 공통 요구사항을 지정합니다 (예를 들어, ranges::sort ).