std::experimental::ranges::sort

 

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

 

Algorithms library

Non-modifying sequence operations
all_ofany_ofnone_of countcount_if	findfind_iffind_if_not find_end find_first_of	adjacent_find search search_n mismatch	equal for_each lexicographical_compare
Modifying sequence operations
copycopy_if copy_n copy_backward move move_backward	fill fill_n generate generate_n swap_ranges shuffle transform	removeremove_if replacereplace_if reverse rotate unique	remove_copyremove_copy_if replace_copyreplace_copy_if reverse_copy rotate_copy unique_copy
Partitioning operations
is_partitioned partition_point	partition partition_copy	stable_partition
Sorting operations
is_sorted is_sorted_until	sort stable_sort	partial_sort partial_sort_copy	nth_element
Binary search operations
lower_bound	upper_bound	binary_search	equal_range
Set operations (on sorted ranges)
merge inplace_merge	includes	set_difference set_intersection	set_symmetric_difference set_union
Heap operations
is_heap is_heap_until	make_heap sort_heap	push_heap pop_heap
Minimum/maximum operations
max max_element	min min_element	minmax minmax_element
Permutations
is_permutation	next_permutation	prev_permutation

 

Defined in header <experimental/ranges/algorithm>
template< ranges::RandomAccessIterator I, ranges::Sentinel<I> S,           class Comp = ranges::less<>, class Proj = ranges::identity>   requires ranges::Sortable<I, Comp, Proj>() I sort( I first, S last, Comp comp = Comp{}, Proj proj = Proj{} );	(1)	(ranges TS)
template< ranges::RandomAccessRange Rng,           class Comp = ranges::less<>, class Proj = ranges::identity>   requires ranges::Sortable<ranges::iterator_t<Rng>, Comp, Proj>() ranges::safe_iterator_t<Rng> sort( Rng&& rng, Comp comp = Comp{}, Proj proj = Proj{} );	(2)	(ranges TS)

1) Sorts the elements in the range [first, last) in ascending order. The order of equal elements is not guaranteed to be preserved. Elements are compared using comp after applying the projection proj.

2) Sorts the elements in the range rng, as if by return ranges::sort(ranges::begin(rng), ranges::end(rng), comp, proj);

Parameters

first, last	-	the range of elements to sort
rng	-	the range of elements to sort
comp	-	the comparator to use
proj	-	the projection to apply to elements to the range

Return value

An iterator pointing past the end of the range (i.e., it compares equal to last for overload (1), and ranges::end(rng) for overload (2)).

Complexity

O(N·log(N)) comparisons, where N is equal to the number of elements in the range.

See also

sort	sorts a range into ascending order (function template)