std::experimental::ranges::Sortable

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Technical specifications

Filesystem library (filesystem TS)

Library fundamentals (library fundamentals TS)

Library fundamentals 2 (library fundamentals 2 TS)

Extensions for parallelism (parallelism TS)

Extensions for concurrency (concurrency TS)

Concepts (concepts TS)

Ranges (ranges TS)

Special mathematical functions (special math TR)

 

Ranges

Concepts

General utilities

Iterators

Algorithms

 

Iterators library

Iterator concepts
Readable Writable Sentinel	WeaklyIncrementable Incrementable SizedSentinel	Iterator InputIterator OutputIterator	ForwardIterator BidirectionalIterator RandomAccessIterator
Indirect callable concepts
IndirectInvocableIndirectRegularInvocable	IndirectPredicate	IndirectRelation	IndirectStrictWeakOrder
Common algorithm requirements
IndirectlyMovable IndirectlyMovableStorable	IndirectlyCopyable IndirectlyCopyableStorable	IndirectlySwappable IndirectlyComparable	Permutable Mergeable Sortable
Range concepts
Range SizedRange View	BoundedRange InputRange OutputRange	ForwardRange BidirectionalRange RandomAccessRange
Concept utilities
indirect_result_of projected	disable_sized_sentinel disable_sized_range	view_base enable_view
Iterator utilities and operations
iter_move iter_swap	advance distance	next prev
Iterator traits
difference_type value_type iterator_category iterator_traits	reference_t rvalue_reference_t iter_common_reference_t std::iterator_traits<InputIterator>std::iterator_traits<OutputIterator>	is_indirectly_movableis_nothrow_indirectly_movable is_indirectly_swappableis_nothrow_indirectly_swappable	input_iterator_tagoutput_iterator_tagforward_iterator_tagbidirectional_iterator_tagrandom_access_iterator_tag
Iterator adaptors
reverse_iterator move_iterator move_sentinel	back_insert_iterator front_insert_iterator insert_iterator	common_iterator counted_iterator default_sentinel	dangling safe_iterator_t unreachable
Stream iterators
istream_iterator	ostream_iterator	istreambuf_iterator	ostreambuf_iterator
Range access
begincbegin	endcend	rbegincrbegin	rendcrend
Range primitives
iterator_t sentinel_t	distance size	datacdata	empty

 

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).