Difference between revisions of "cpp/named req/RandomAccessIterator"

Revision as of 10:54, 23 March 2012

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

A standard pointer satisfies this 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

@@ Line 8: / Line 8: @@
 ===Requirements===
-* [[cpp/concept/BidirectionalIterator|BidirectionalIterator]]
+* {{concept|BidirectionalIterator}}
-* [[cpp/concept/LessThanComparable|LessThanComparable]]
+* {{concept|LessThanComparable}}