stdexperimentalrangesrandomaccessiterator(3)
std::experimental::ranges::RandomAccessIterator - std::experimental::ranges::RandomAccessIterator
Synopsis
Defined in header<experimental / ranges / iterator>
template <class I>
concept bool RandomAccessIterator =
BidirectionalIterator<I> &&
DerivedFrom<ranges::iterator_category_t<I>, ranges::random_access_iterator_tag> &&
StrictTotallyOrdered<I> &&
SizedSentinel<I, I> &&
requires(I i, const I j, const ranges::difference_type_t<I> n)
{
{
i += n
} -> Same<I> &;
(ranges TS)
{
j + n
} -> Same<I> &&;
{
n + j
} -> Same<I> &&;
{
i -= n
} -> Same<I> &;
{
j - n
} -> Same<I> &&;
j[n];
requires Same<decltype(j[n]), ranges::reference_t<I>>;
};The concept RandomAccessIterator<I> refines BidirectionalIterator by adding support for constant time advancement with the +=, +, -=, and - operators, constant time computation of distance with -, and array notation with subscripting. Let a and b be valid iterators of type I such that b is reachable from a, and let n be a value of type ranges::difference_type_t<I> equal to b - a. RandomAccessIterator<I> is satisfied only if:
* (a += n) is equal to b.
- std::addressof(a += n) is equal to std::addressof(a).
- (a + n) is equal to (a += n).
- (a + n) is equal to (n + a).
- For any two positive integers x and y, if a + (x + y) is valid, then a + (x + y) is equal to (a + x) + y.
- a + 0 is equal to a.
- If (a + (n - 1)) is valid, then –b is equal to (a + (n - 1)).
- (b += -n) and (b -= n) are both equal to a.
- std::addressof(b -= n) is equal to std::addressof(b).
- (b - n) is equal to (b -= n).
- If b is dereferenceable, then a[n] is valid and is equal to *b.
- bool(a <= b) is true .
Equality preservation
An expression is equality preserving if it results in equal outputs given equal inputs.