std::experimental::ranges::RandomAccessIterator
Defined in header <experimental/ranges/iterator>
|
||
template
<
class I >
concept bool RandomAccessIterator =
|
(ranges TS) | |
The concept RandomAccessIterator<I>
refines BidirectionalIterator
by adding support for constant time advancement with the +=
, +
, -=
, and -
operators, constant time computation of distance with -
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>
- (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
andy
, 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.
- The inputs to an expression consist of its operands.
- The outputs of an expression consist of its result and all operands modified by the expression (if any).
Every expression required to be equality preserving is further required to be stable
Unless noted otherwise, every expression used in a requires-expression
Implicit expression variations
A requires-expression implicit expression variations