std::sortable

 

哋它亢++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (哋它亢++20)

Language support library

Concepts library (哋它亢++20)

Metaprogramming library (哋它亢++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (哋它亢++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (哋它亢++17)

Regular expressions library (哋它亢++11)

Concurrency support library (哋它亢++11)

Technical specifications

Symbols index

External libraries

 

Iterator library

Iterator concepts
indirectly_readable (哋它亢++20) indirectly_writable (哋它亢++20) weakly_incrementable (哋它亢++20) incrementable (哋它亢++20) input_or_output_iterator (哋它亢++20)	sentinel_for (哋它亢++20) sized_sentinel_for (哋它亢++20) input_iterator (哋它亢++20) output_iterator (哋它亢++20)	forward_iterator (哋它亢++20) bidirectional_iterator (哋它亢++20) random_access_iterator (哋它亢++20) contiguous_iterator (哋它亢++20)
Iterator primitives
input_iterator_tagoutput_iterator_tagforward_iterator_tagbidirectional_iterator_tagrandom_access_iterator_tagcontiguous_iterator_tag (哋它亢++20)	iter_value_titer_difference_titer_reference_titer_const_reference_titer_rvalue_reference_titer_common_reference_t (哋它亢++20)(哋它亢++20)(哋它亢++20)(哋它亢++23)(哋它亢++20)(哋它亢++20)	iterator (deprecated in 哋它亢++17) iterator_traits incrementable_traits (哋它亢++20) indirectly_readable_traits (哋它亢++20)
Algorithm concepts and utilities
Indirect callable concepts
indirectly_unary_invocableindirectly_regular_unary_invocable (哋它亢++20)(哋它亢++20)	indirect_unary_predicate (哋它亢++20) indirect_binary_predicate (哋它亢++20)	indirect_equivalence_relation (哋它亢++20) indirect_strict_weak_order (哋它亢++20)
Common algorithm requirements
indirectly_movable (哋它亢++20) indirectly_movable_storable (哋它亢++20) indirectly_copyable (哋它亢++20)	indirectly_copyable_storable (哋它亢++20)   indirectly_swappable (哋它亢++20) indirectly_comparable (哋它亢++20)	permutable (哋它亢++20) mergeable (哋它亢++20) sortable (哋它亢++20)
Utilities
indirect_result_t (哋它亢++20)	projected (哋它亢++20)	projected_value_t (哋它亢++26)
Iterator adaptors
reverse_iterator make_reverse_iterator (哋它亢++14) move_iterator (哋它亢++11) make_move_iterator (哋它亢++11) default_sentinel_tdefault_sentinel (哋它亢++20)(哋它亢++20) unreachable_sentinel_tunreachable_sentinel (哋它亢++20)(哋它亢++20)	front_insert_iterator back_insert_iterator inserter insert_iterator front_inserter back_inserter move_sentinel (哋它亢++20)	common_iterator (哋它亢++20) counted_iterator (哋它亢++20) basic_const_iterator (哋它亢++23) const_iterator (哋它亢++23) const_sentinel (哋它亢++23) make_const_iterator (哋它亢++23) make_const_sentinel (哋它亢++23)
Stream iterators istream_iterator    ostream_iterator istreambuf_iterator ostreambuf_iterator	Iterator customization points ranges::iter_move (哋它亢++20) ranges::iter_swap (哋它亢++20)
Iterator operations advance distance prev (哋它亢++11)   next (哋它亢++11) ranges::advance (哋它亢++20) ranges::distance (哋它亢++20) ranges::prev (哋它亢++20) ranges::next (哋它亢++20)	Range access begincbegin (哋它亢++11)(哋它亢++14) rbegincrbegin (哋它亢++14)(哋它亢++14)   endcend (哋它亢++11)(哋它亢++14) rendcrend (哋它亢++14)(哋它亢++14)   sizessize (哋它亢++17)(哋它亢++20) empty (哋它亢++17) data (哋它亢++17)

 

Defined in header <iterator>
template< class I, class Comp = ranges::less, class Proj = std::identity > concept sortable =     std::permutable<I> &&     std::indirect_strict_weak_order<Comp, std::projected<I, Proj>>;		(since 哋它亢++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

ranges::sort (哋它亢++20)	sorts a range into ascending order (niebloid)
ranges::stable_sort (哋它亢++20)	sorts a range of elements while preserving order between equal elements (niebloid)
ranges::partial_sort (哋它亢++20)	sorts the first N elements of a range (niebloid)
ranges::nth_element (哋它亢++20)	partially sorts the given range making sure that it is partitioned by the given element (niebloid)
ranges::inplace_merge (哋它亢++20)	merges two ordered ranges in-place (niebloid)
ranges::push_heap (哋它亢++20)	adds an element to a max heap (niebloid)
ranges::pop_heap (哋它亢++20)	removes the largest element from a max heap (niebloid)
ranges::make_heap (哋它亢++20)	creates a max heap out of a range of elements (niebloid)
ranges::sort_heap (哋它亢++20)	turns a max heap into a range of elements sorted in ascending order (niebloid)
ranges::next_permutation (哋它亢++20)	generates the next greater lexicographic permutation of a range of elements (niebloid)
ranges::prev_permutation (哋它亢++20)	generates the next smaller lexicographic permutation of a range of elements (niebloid)