Difference between revisions of "cpp/named req/ContiguousIterator"
From cppreference.com
(fixed base iterator concept) |
|||
| Line 9: | Line 9: | ||
The type {{tt|It}} satisfies {{tt|ContiguousIterator}} if | The type {{tt|It}} satisfies {{tt|ContiguousIterator}} if | ||
| − | * The type {{tt|It}} satisfies {{concept| | + | * The type {{tt|It}} satisfies {{concept|RandomAccessIterator}} |
And, for every | And, for every | ||
Revision as of 02:15, 11 April 2018
Template:cpp/concept/title Template:cpp/concept/navbar
A ContiguousIterator is an Template:concept whose logically adjacent elements are also physically adjacent in memory.
A pointer to an element of an array satisfies all requirements of ContiguousIterator.
Requirements
The type It satisfies ContiguousIterator if
- The type
Itsatisfies Template:concept
And, for every
-
a, a dereferenceable iterator of typeIt -
n, an integral value
such that
- a + n is a valid and dereferenceable iterator value
then
- *(a + n) is equivalent to *(std::addressof(*a) + n).
Standard library
The following standard library types are Template:concepts.
- array::iterator.
- basic_string_view::iterator.
- vector::iterator for value_type other than bool.
- The return type of begin(valarray) and end(valarray)
