From cppreference.com
template<classI,classComp=ranges::less,classProj=std::identity>conceptsortable=std::permutable<I>&&std::indirect_strict_weak_order<Comp,std::projected<I,Proj>>;(since C++20)The sortable concept specifies the requirements for algorithms that permute a range into an ordered range according to Comp.
Semantic requirements
std::sortable<I,Comp,Proj> is modeled only if all concepts it subsumes are modeled.
See also
(C++20)
sorts a range of elements
(algorithm function object)
(C++20)
sorts a range of elements while preserving relative order between equivalent elements
(algorithm function object)
(C++20)
sorts the first N elements of a range
(algorithm function object)
(C++20)
finds the Nth element if the range were sorted
(algorithm function object)
(C++20)
merges two ordered ranges in-place
(algorithm function object)
(C++20)
adds an element to a max heap
(algorithm function object)
(C++20)
removes the largest element from a max heap
(algorithm function object)
(C++20)
creates a max heap out of a range of elements
(algorithm function object)
(C++20)
turns a max heap into a sorted range of elements
(algorithm function object)
(C++20)
generates the next greater lexicographic permutation of a range of elements
(algorithm function object)
(C++20)
generates the next smaller lexicographic permutation of a range of elements
(algorithm function object)