cpp/named req/RandomAccessIterator

An Iterator that can be moved to point to any element in constant time.

A standard pointer satisfies this concept.

Requirements

• Template:concept
• Template:concept

Expression	Return	Equivalent expression	Notes
Template:cpp	Template:cpp	Template:cpp	n can b both positive or negative Constant complexity
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp	Strict total ordering relation: !(a < a) if a < b then !(b < a) if a < b and b < c then a < c a < b or b < a or a == b (exactly one of the expression is true)
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp
Template:cpp	Template:cpp	Template:cpp

Table Notes

• It is the type implementing this concept
• i, a, b are objects of type It
• n is an integer of type difference_type