Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../language/../experimental/ranges.html below:
Extensions for ranges - cppreference.com
The C++ Extensions for Ranges, ISO/IEC TS 21425:2017, specifies one modification to the core language and defines new components for the C++ standard library listed on this page.
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.
Core language concepts specifies that a type is the same as another type
(concept) [edit] specifies that a type is derived from another type
(concept) [edit] specifies that a type is implicitly convertible to another type
(concept) [edit] specifies that two types share a common reference type
(concept) [edit] specifies that two types share a common type
(concept) [edit] specifies that a type is an integral type
(concept) [edit] specifies that a type is an integral type that is signed
(concept) [edit] specifies that a type is an integral type that is not signed
(concept) [edit] specifies that a type is assignable from another type
(concept) [edit] specifies that a type can be swapped or that two types can be swapped with each other
(concept) [edit] Comparison concepts specifies that a type can be used in Boolean contexts
(concept) [edit] specifies that two types can be compared for equality using operators == and !=
(concept) [edit] specifies that operator == is an equivalence relation
(concept) [edit] specifies that the comparison operators on the type yield a total order
(concept) [edit] Object concepts specifies that an object of the type can be destroyed
(concept) [edit] specifies that a variable of the type can be constructed from or bound to a set of argument types
(concept) [edit] specifies that an object of a type can be default constructed
(concept) [edit] specifies that an object of a type can be move constructed
(concept) [edit] specifies that an object of a type can be copy constructed and move constructed
(concept) [edit] specifies that an object of a type can be moved and swapped
(concept) [edit] specifies that an object of a type can be copied, moved, and swapped
(concept) [edit] specifies that an object of a type can be copied, moved, swapped, and default constructed
(concept) [edit] specifies that a type is regular, that is, it is both Semiregular and EqualityComparable
(concept) [edit] Callable concepts specifies that a callable type can be invoked with a given set of argument types
(concept) [edit] specifies that a callable type is a Boolean predicate
(concept) [edit] specifies that a callable type is a binary relation
(concept) [edit] specifies that a Relation imposes a strict weak ordering
(concept) [edit] Random number generator concept specifies that a type qualifies as a uniform random number generator
(concept) [edit] Utility components swaps the value of two objects
(customization point object)[edit] replaces the argument with a new value and returns its previous value
(function template) [edit] Function objects invokes a Callable object with the given arguments
(function template) [edit] function object implementing x == y
(class template) [edit] function object implementing x != y
(class template) [edit] function object implementing x > y
(class template) [edit] function object implementing x < y
(class template) [edit] function object implementing x >= y
(class template) [edit] function object implementing x <= y
(class template) [edit] function object that returns its argument unchanged
(class) [edit] Metaprogramming and type traits checks if objects of a type can be swapped with objects of same or different type
(class template) [edit] determine the common reference type of a set of types
(class template) [edit] determine the common type of a set of types
(class template) [edit] Tagged pairs and tuples specifies that a type is a tag specifier
(concept) [edit] specifies that a type represents a tag specifier and its element type
(concept) [edit] augument a tuple-like type with named accessors
(class template) [edit] alias template for a tagged std::pair
(alias template)[edit] convenience function for creating a tagged_pair
(function template) [edit] alias template for a tagged std::tuple
(alias template)[edit] convenience function for creating a tagged_tuple
(function template) [edit] tag specifiers for use with ranges::tagged
(class) [edit] Iterator concepts specifies that a type is readable by applying operator *
(concept) [edit] specifies that a value can be written to an iterator's referenced object
(concept) [edit] specifies that a Semiregular type can be incremented with pre- and post-increment operators
(concept) [edit] specifies that the increment operation on a WeaklyIncrementable type is equality-preserving and that the type is EqualityComparable
(concept) [edit] specifies that objects of a type can be incremented and dereferenced
(concept) [edit] specifies that objects of a type is a sentinel for an Iterator type
(concept) [edit] specifies that the - operator can be applied to an iterator and a sentinel to calculate their difference in constant time
(concept) [edit] specifies that a type is an input iterator, that is, its referenced values can be read and it can be both pre- and post-incremented
(concept) [edit] specifies that a type is an output iterator for a given value type, that is, values of that type can be written to it and it can be both pre- and post-incremented
(concept) [edit] specifies that an InputIterator is a forward iterator, supporting equality comparison and multi-pass
(concept) [edit] specifies that a ForwardIterator is a bidirectional iterator, supporting movement backwards
(concept) [edit] specifies that a BidirectionalIterator is a random-access iterator, supporting advancement in constant time and subscripting
(concept) [edit] Indirect callable concepts specifies that a callable type can be invoked with the result of dereferencing a Readable type
(concept) [edit] specifies that a callable object, when invoked with the result of dereferencing a Readable type, satisfies Predicate
(concept) [edit] specifies that a callable object, when invoked with the result of dereferencing some Readable types, satisfies Relation
(concept) [edit] specifies that a callable object, when invoked with the result of dereferencing some Readable types, satisfies StrictWeakOrder
(concept) [edit] Common algorithm requirements specifies that values may be moved from a Readable type to a Writable type
(concept) [edit] specifies that values may be moved from a Readable type to a Writable type and that the move may be performed via an intermediate object
(concept) [edit] specifies that values may be copied from a Readable type to a Writable type
(concept) [edit] specifies that values may be copied from a Readable type to a Writable type and that the copy may be performed via an intermediate object
(concept) [edit] specifies that the values referenced by two Readable types can be swapped
(concept) [edit] specifies that the values referenced by two Readable types can be compared
(concept) [edit] specifies the common requirements of algorithms that reorder elements in place
(concept) [edit] specifies the requirements of algorithms that merge sorted sequences into an output sequence by copying elements
(concept) [edit] specifies the common requirements of algorithms that permute sequences into ordered sequences
(concept) [edit] Concept utilities compute the result of invoking a callable object on the result of dereferencing some set of Readable types
(class template) [edit] helper template for specifying the constraints on algorithms that accept projections
(class template) [edit] Iterator primitives Iterator utilities casts the result of dereferencing an object to its associated rvalue reference type
(customization point object)[edit] swap the values referenced by two dereferenceable objects
(customization point object)[edit] Iterator traits obtains the difference type of a WeaklyIncrementable type
(class template) [edit] obtains the value type of a Readable type
(class template) [edit] obtains the iterator category of an input iterator type
(class template) [edit] compatibility traits class that collects an iteratorâs associated types
(alias template)[edit] obtains a dereferenceable object's associated reference types
(alias template)[edit] Iterator category tags empty class types used to indicate iterator categories
(class) [edit] std::iterator_traits specializations specializes std::iterator_traits for ranges TS iterators
(class template specialization) [edit] Iterator operations advances an iterator by given distance
(function template) [edit] returns the distance between an iterator and a sentinel, or between the beginning and the end of a range
(function template) [edit] increment an iterator
(function template) [edit] decrement an iterator
(function template) [edit] Iterator adaptors iterator adaptor for reverse-order traversal
(class template) [edit] iterator adaptor for insertion at the end of a container
(class template) [edit] iterator adaptor for insertion at the front of a container
(class template) [edit] iterator adaptor for insertion into a container
(class template) [edit] iterator adaptor which dereferences to an rvalue reference
(class template) [edit] sentinel adaptor for use with move_iterator
(class template) [edit] adapt an iterator-sentinel pair into a common iterator type for use with legacy algorithms
(class template) [edit] iterator adaptor that keeps track of its distance from its starting position
(class template) [edit] empty sentinel type for use with iterator types that know the bound of their range
(class) [edit] wrapper for a possibly dangling iterator
(class template) [edit] alias template that wraps the iterator type of an rvalue range with dangling
(alias template)[edit] sentinel type used with any iterator to denote an infinite range
(class) [edit] Stream iterators input iterator that reads from std::basic_istream
(class template) [edit] output iterator that writes to std::basic_ostream
(class template) [edit] input iterator that reads from std::basic_streambuf
(class template) [edit] output iterator that writes to std::basic_streambuf
(class template) [edit] Non-modifying sequence operations checks if a predicate is true for all, any or none of the elements in a range
(function template) [edit] applies a function to a range of elements
(function template) [edit] returns the number of elements satisfying specific criteria
(function template) [edit] finds the first position where two ranges differ
(function template) [edit] determines if two sets of elements are the same
(function template) [edit] returns true if one range is lexicographically less than another
(function template) [edit] finds the first element satisfying specific criteria
(function template) [edit] finds the last sequence of elements in a certain range
(function template) [edit] searches for any one of a set of elements
(function template) [edit] finds the first two adjacent items that are equal (or satisfy a given predicate)
(function template) [edit] searches for a range of elements
(function template) [edit] searches for a number consecutive copies of an element in a range
(function template) [edit] Modifying sequence operations copies a range of elements to a new location
(function template) [edit] copies a number of elements to a new location
(function template) [edit] copies a range of elements in backwards order
(function template) [edit] moves a range of elements to a new location
(function template) [edit] moves a range of elements to a new location in backwards order
(function template) [edit] assigns a range of elements a certain value
(function template) [edit] assigns a value to a number of elements
(function template) [edit] applies a function to a range of elements
(function template) [edit] saves the result of a function in a range
(function template) [edit] saves the result of N applications of a function
(function template) [edit] removes elements satisfying specific criteria
(function template) [edit] copies a range of elements omitting those that satisfy specific criteria
(function template) [edit] replaces all values satisfying specific criteria with another value
(function template) [edit] copies a range, replacing elements satisfying specific criteria with another value
(function template) [edit] swaps two ranges of elements
(function template) [edit] reverses the order of elements in a range
(function template) [edit] creates a copy of a range that is reversed
(function template) [edit] rotates the order of elements in a range
(function template) [edit] copies and rotate a range of elements
(function template) [edit] randomly re-orders elements in a range
(function template) [edit] removes consecutive duplicate elements in a range
(function template) [edit] creates a copy of some range of elements that contains no consecutive duplicates
(function template) [edit] Partitioning operations determines if the range is partitioned by the given predicate
(function template) [edit] divides a range of elements into two groups
(function template) [edit] copies a range dividing the elements into two groups
(function template) [edit] divides elements into two groups while preserving their relative order
(function template) [edit] locates the partition point of a partitioned range
(function template) [edit] Sorting operations checks whether a range is sorted into ascending order
(function template) [edit] finds the largest sorted subrange
(function template) [edit] sorts a range into ascending order
(function template) [edit] sorts the first N elements of a range
(function template) [edit] copies and partially sorts a range of elements
(function template) [edit] sorts a range of elements while preserving order between equal elements
(function template) [edit] partially sorts the given range making sure that it is partitioned by the given element
(function template) [edit] Binary search operations (on sorted ranges) returns an iterator to the first element not less than the given value
(function template) [edit] returns an iterator to the first element greater than a certain value
(function template) [edit] determines if an element exists in a certain range
(function template) [edit] returns range of elements matching a specific key
(function template) [edit] Set operations (on sorted ranges) merges two sorted ranges
(function template) [edit] merges two ordered ranges in-place
(function template) [edit] returns true if one set is a subset of another
(function template) [edit] computes the difference between two sets
(function template) [edit] computes the intersection of two sets
(function template) [edit] computes the symmetric difference between two sets
(function template) [edit] computes the union of two sets
(function template) [edit] Heap operations checks if the given range is a max heap
(function template) [edit] finds the largest subrange that is a max heap
(function template) [edit] creates a max heap out of a range of elements
(function template) [edit] adds an element to a max heap
(function template) [edit] removes the largest element from a max heap
(function template) [edit] turns a max heap into a range of elements sorted in ascending order
(function template) [edit] Minimum/maximum operations returns the greater of the given values
(function template) [edit] returns the largest element in a range
(function template) [edit] returns the smaller of the given values
(function template) [edit] returns the smallest element in a range
(function template) [edit] returns the smaller and larger of two elements
(function template) [edit] returns the smallest and the largest elements in a range
(function template) [edit] Permutation operations determines if a sequence is a permutation of another sequence
(function template) [edit] generates the next greater lexicographic permutation of a range of elements
(function template) [edit] generates the next smaller lexicographic permutation of a range of elements
(function template) [edit]
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4