Difference between revisions of "cpp/named req/RandomAccessIterator"
From cppreference.com
(brought the whole thing in line with std) |
(added link) |
||
| Line 2: | Line 2: | ||
{{cpp/concept/sidebar}} | {{cpp/concept/sidebar}} | ||
| − | + | A {{tt|RandomAccessIterator}} is a {{concept|BidirectionalIterator}} that can be moved to point to any element in constant time. | |
| − | A standard pointer satisfies this concept. | + | A standard pointer is an example of a type that satisfies this concept. |
===Requirements=== | ===Requirements=== | ||
Revision as of 07:20, 22 May 2012
Template:cpp/concept/title Template:cpp/concept/sidebar
A RandomAccessIterator is a Template:concept that can be moved to point to any element in constant time.
A standard pointer is an example of a type that satisfies this concept.
Requirements
Satisfies Template:concept and, additionally, the following requirements:
| Expression | Return | Equivalent expression | Notes |
|---|---|---|---|
| r += n | It& | if(n>=0) while(n--) ++r; |
|
| i + n | It | It temp = i; return i += n; |
|
| n + i | It | i + n | |
| r -= n | It& | return r += -n; | |
| i - n | It | It temp = i; return i -= n; |
|
| n - i | It | i - n | |
| b - a | difference |
n |
returns n such that a+b==b
|
| i[n] | convertible to reference |
*(i + n) | |
| a < b | contextually convertible to bool | b - a > 0 | Strict total ordering relation:
|
| a > b | contextually convertible to bool | b < a | Total ordering relation opposite to a < b |
| a >= b | contextually convertible to bool | !(a < b) | |
| a <= b | contextually convertible to bool | !(a > b) |
Table Notes
Itis the type implementing this conceptTis the type std::iterator_traits<It>::value_typereferenceis the type std::iterator_traits<It>::referencedifferenceis the type std::iterator_traits<It>::difference_typei,a,bare objects of typeItorconst Itris a value of typeIt&nis an integer of typedifference
The above rules imply that RandomAccessIterator also implements Template:concept.
