std::experimental::ranges::RandomAccessIterator

From cppreference.com
< cpp‎ | experimental‎ | ranges
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
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> & ;
{ 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>> ;

} ;
(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 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.

  • 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