Extensions for ranges

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Experimental

Technical Specification

Filesystem library (filesystem TS)

Library fundamentals (library fundamentals TS)

Library fundamentals 2 (library fundamentals TS v2)

Library fundamentals 3 (library fundamentals TS v3)

Extensions for parallelism (parallelism TS)

Extensions for parallelism 2 (parallelism TS v2)

Extensions for concurrency (concurrency TS)

Extensions for concurrency 2 (concurrency TS v2)

Concepts (concepts TS)

Ranges (ranges TS)

Reflection (reflection TS)

Mathematical special functions (special functions TR)

Experimental Non-TS

Pattern Matching

Linear Algebra

std::execution

Contracts

2D Graphics

 

Ranges

Concepts

General utilities

Iterators

Ranges

Algorithms

 

The C++ Extensions for Ranges, ISO/IEC TS 21425:XXXX, specifies one modification to the core language and defines new components for the C++ standard library listed on this page.

The Ranges TS is based on the C++14 standard as modified by the Concepts TS.

Core language changes

The Ranges TS modifies the specification of the range-based for loop to permit differently typed begin and end iterators. This change permits the use of sentinels and is also present in C++17.

Concepts

Defined in header <experimental/ranges/concepts>
Defined in namespace std::experimental::ranges
Core language concepts
Same	(concept)
DerivedFrom	(concept)
ConvertibleTo	(concept)
CommonReference	(concept)
Common	(concept)
Integral	(concept)
SignedIntegral	(concept)
UnsignedIntegral	(concept)
Assignable	(concept)
Swappable	(concept)
Comparison concepts
Boolean	(concept)
WeaklyEqualityComparableEqualityComparable	(concept)
StrictTotallyOrdered	(concept)
Object concepts
Destructible	(concept)
Constructible	(concept)
DefaultConstructible	(concept)
MoveConstructible	(concept)
CopyConstructible	(concept)
Movable	(concept)
Copyable	(concept)
Semiregular	(concept)
Regular	(concept)
Callable concepts
InvocableRegularInvocable	(concept)
Predicate	(concept)
Relation	(concept)
StrictWeakOrder	(concept)

General utilities

Utility components
Defined in header <experimental/ranges/utility>
Defined in namespace std::experimental::ranges
swap	(customization point object)
exchange	(function template)
Function objects
Defined in header <experimental/ranges/functional>
Defined in namespace std::experimental::ranges
invoke	(function template)
equal_to	(class template)
not_equal_to	(class template)
greater	(class template)
less	(class template)
greater_equal	(class template)
less_equal	(class template)
identity	(class template)
Metaprogramming and type traits
Defined in header <type_traits>
Defined in namespace std
is_swappable_withis_swappableis_nothrow_swappable_withis_nothrow_swappable	(class template)
basic_common_referencecommon_reference	(class template)
common_type	(class template)
Tagged pairs and tuples
Defined in namespace std::experimental::ranges
Defined in header <experimental/ranges/utility>
TagSpecifier	(concept)
TaggedType	(concept)
tagged	(class template)
tagged_pair	(alias template)
make_tagged_pair	(function template)
Defined in header <experimental/ranges/tuple>
tagged_tuple	(alias template)
make_tagged_tuple	(function template)

Iterators

Defined in header <experimental/ranges/iterator>
Iterator concepts
Defined in namespace std::experimental::ranges
Readable	(concept)
Writable	(concept)
WeaklyIncrementable	(concept)
Incrementable	(concept)
Iterator	(concept)
Sentinel	(concept)
SizedSentinel	(concept)
disable_sized_sentinel	(variable template)
InputIterator	(concept)
OutputIterator	(concept)
ForwardIterator	(concept)
BidirectionalIterator	(concept)
RandomAccessIterator	(concept)
Indirect callable concepts
IndirectInvocableIndirectRegularInvocable	(concept)
IndirectPredicate	(concept)
IndirectRelation	(concept)
IndirectStrictWeakOrder	(concept)
indirect_result_of	(class template)
projected	(class template)
Common algorithm requirements
IndirectlyMovable	(concept)
IndirectlyMovableStorable	(concept)
IndirectlyCopyable	(concept)
IndirectlyCopyableStorable	(concept)
IndirectlySwappable	(concept)
IndirectlyComparable	(concept)
Permutable	(concept)
Mergeable	(concept)
Sortable	(concept)
Iterator primitives
Iterator utilities
Defined in namespace std::experimental::ranges
iter_move	(customization point object)
iter_swap	(customization point object)
Iterator traits
Defined in namespace std::experimental::ranges
difference_type	(class template)
value_type	(class template)
iterator_category	(class template)
iterator_traits	(alias template)
reference_t	(alias template)
rvalue_reference_t	(alias template)
iter_common_reference_t	(alias template)
is_indirectly_movableis_nothrow_indirectly_movable	(class template)
is_indirectly_swappableis_nothrow_indirectly_swappable	(class template)
Iterator category tags
Defined in namespace std::experimental::ranges
input_iterator_tagoutput_iterator_tagforward_iterator_tagbidirectional_iterator_tagrandom_access_iterator_tag	empty class types used to indicate iterator categories (class)
std::iterator_traits specializations
Defined in namespace std
std::iterator_traits<InputIterator>std::iterator_traits<OutputIterator>	Specializes std::iterator_traits for ranges TS iterators (class template specialization)
Iterator operations
Defined in namespace std::experimental::ranges
advance	(function template)
distance	(function template)
next	(function template)
prev	(function template)
Iterator adaptors
Defined in namespace std::experimental::ranges
reverse_iterator	(class template)
back_insert_iterator	(class template)
front_insert_iterator	(class template)
insert_iterator	(class template)
move_iterator	(class template)
move_sentinel	(class template)
common_iterator	(class template)
counted_iterator	(class template)
default_sentinel	(class)
dangling	(class template)
safe_iterator_t	(alias template)
unreachable	(class)
Stream iterators
Defined in namespace std::experimental::ranges
istream_iterator	(class template)
ostream_iterator	(class template)
istreambuf_iterator	(class template)
ostreambuf_iterator	(class template)
Range concepts
Defined in namespace std::experimental::ranges
iterator_t	(alias template)
sentinel_t	(alias template)
Range	(concept)
SizedRange	(concept)
disable_sized_range	(variable template)
view_base	(class)
enable_view	(class template)
View	(concept)
BoundedRange	(concept)
InputRange	(concept)
OutputRange	(concept)
ForwardRange	(concept)
BidirectionalRange	(concept)
RandomAccessRange	(concept)
Range access
Defined in namespace std::experimental::ranges
begin	(customization point object)
end	(customization point object)
cbegin	(customization point object)
cend	(customization point object)
rbegin	(customization point object)
rend	(customization point object)
crbegin	(customization point object)
crend	(customization point object)
Range primitives
Defined in namespace std::experimental::ranges
distance	(function template)
size	(customization point object)
empty	(customization point object)
data	(customization point object)
cdata	(customization point object)

Algorithms

Defined in header <experimental/ranges/algorithm>
Tag specifiers
Defined in namespace std::experimental::ranges::tag
inin1in2outout1out2funminmaxbeginend	Tag specifiers for use with ranges::tagged (class)
Non-modifying sequence operations
Defined in namespace std::experimental::ranges
all_ofany_ofnone_of	checks if a predicate is true for all, any or none of the elements in a range (function template)
for_each	applies a function to a range of elements (function template)
countcount_if	returns the number of elements satisfying specific criteria (function template)
mismatch	finds the first position where two ranges differ (function template)
equal	determines if two sets of elements are the same (function template)
findfind_iffind_if_not	finds the first element satisfying specific criteria (function template)
find_end	finds the last sequence of elements in a certain range (function template)
find_first_of	searches for any one of a set of elements (function template)
adjacent_find	finds the first two adjacent items that are equal (or satisfy a given predicate) (function template)
search	searches for a range of elements (function template)
search_n	searches for a number consecutive copies of an element in a range (function template)
Modifying sequence operations
Defined in namespace std::experimental::ranges
copycopy_if	copies a range of elements to a new location (function template)
copy_n	copies a number of elements to a new location (function template)
copy_backward	copies a range of elements in backwards order (function template)
move	moves a range of elements to a new location (function template)
move_backward	moves a range of elements to a new location in backwards order (function template)
fill	assigns a range of elements a certain value (function template)
fill_n	assigns a value to a number of elements (function template)
transform	applies a function to a range of elements (function template)
generate	saves the result of a function in a range (function template)
generate_n	saves the result of N applications of a function (function template)
removeremove_if	removes elements satisfying specific criteria (function template)
remove_copyremove_copy_if	copies a range of elements omitting those that satisfy specific criteria (function template)
replacereplace_if	replaces all values satisfying specific criteria with another value (function template)
replace_copyreplace_copy_if	copies a range, replacing elements satisfying specific criteria with another value (function template)
swap_ranges	swaps two ranges of elements (function template)
reverse	reverses the order of elements in a range (function template)
reverse_copy	creates a copy of a range that is reversed (function template)
rotate	rotates the order of elements in a range (function template)
rotate_copy	copies and rotate a range of elements (function template)
shuffle	randomly re-orders elements in a range (function template)
unique	removes consecutive duplicate elements in a range (function template)
unique_copy	creates a copy of some range of elements that contains no consecutive duplicates (function template)
Partitioning operations
Defined in namespace std::experimental::ranges
is_partitioned	determines if the range is partitioned by the given predicate (function template)
partition	divides a range of elements into two groups (function template)
partition_copy	copies a range dividing the elements into two groups (function template)
stable_partition	divides elements into two groups while preserving their relative order (function template)
partition_point	locates the partition point of a partitioned range (function template)
Sorting operations
Defined in namespace std::experimental::ranges
is_sorted	checks whether a range is sorted into ascending order (function template)
is_sorted_until	finds the largest sorted subrange (function template)
sort	sorts a range into ascending order (function template)
partial_sort	sorts the first N elements of a range (function template)
partial_sort_copy	copies and partially sorts a range of elements (function template)
stable_sort	sorts a range of elements while preserving order between equal elements (function template)
nth_element	partially sorts the given range making sure that it is partitioned by the given element (function template)
Binary search operations (on sorted ranges)
Defined in namespace std::experimental::ranges
lower_bound	returns an iterator to the first element not less than the given value (function template)
upper_bound	returns an iterator to the first element greater than a certain value (function template)
binary_search	determines if an element exists in a certain range (function template)
equal_range	returns range of elements matching a specific key (function template)
Set operations (on sorted ranges)
Defined in namespace std::experimental::ranges
merge	merges two sorted ranges (function template)
inplace_merge	merges two ordered ranges in-place (function template)
includes	returns true if one set is a subset of another (function template)
set_difference	computes the difference between two sets (function template)
set_intersection	computes the intersection of two sets (function template)
set_symmetric_difference	computes the symmetric difference between two sets (function template)
set_union	computes the union of two sets (function template)
Heap operations
Defined in namespace std::experimental::ranges
is_heap	checks if the given range is a max heap (function template)
is_heap_until	finds the largest subrange that is a max heap (function template)
make_heap	creates a max heap out of a range of elements (function template)
push_heap	adds an element to a max heap (function template)
pop_heap	removes the largest element from a max heap (function template)
sort_heap	turns a max heap into a range of elements sorted in ascending order (function template)
Minimum/maximum operations
Defined in namespace std::experimental::ranges
max	returns the greater of the given values (function template)
max_element	returns the largest element in a range (function template)
min	returns the smaller of the given values (function template)
min_element	returns the smallest element in a range (function template)
minmax	returns the smaller and larger of two elements (function template)
minmax_element	returns the smallest and the largest elements in a range (function template)
lexicographical_compare	returns true if one range is lexicographically less than another (function template)
is_permutation	determines if a sequence is a permutation of another sequence (function template)
next_permutation	generates the next greater lexicographic permutation of a range of elements (function template)
prev_permutation	generates the next smaller lexicographic permutation of a range of elements (function template)

Random number generator concept

Defined in header <experimental/ranges/random>
Defined in namespace std::experimental::ranges
UniformRandomNumberGenerator	(concept)