Difference between revisions of "cpp/named req/ContiguousIterator"
From cppreference.com
m (Text replace - "cpp/concept" to "cpp/named req") |
m (Text replace - "{{concept" to "{{named req") |
||
| Line 2: | Line 2: | ||
{{cpp/named req/navbar}} | {{cpp/named req/navbar}} | ||
| − | A {{tt|ContiguousIterator}} is an {{ | + | A {{tt|ContiguousIterator}} is an {{named req|Iterator}} whose logically adjacent elements are also physically adjacent in memory. |
A pointer to an element of an array satisfies all requirements of {{tt|ContiguousIterator}}. | A pointer to an element of an array satisfies all requirements of {{tt|ContiguousIterator}}. | ||
| 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 {{ | + | * The type {{tt|It}} satisfies {{named req|Iterator}} |
And, for every | And, for every | ||
| Line 25: | Line 25: | ||
===Standard library=== | ===Standard library=== | ||
| − | The following standard library types are {{ | + | The following standard library types are {{named req|ContiguousIterator}}s. |
* {{ltt|cpp/container/array|array::iterator}}. | * {{ltt|cpp/container/array|array::iterator}}. | ||
Revision as of 14:14, 15 June 2018
A ContiguousIterator is an LegacyIterator 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 LegacyIterator
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 LegacyContiguousIterators.
- array::iterator.
- basic_string_view::iterator.
- vector::iterator for value_type other than bool.
- The return type of begin(valarray) and end(valarray)
