Difference between revisions of "cpp/named req/ContiguousIterator"
From cppreference.com
(named req/core) |
(n recent drafts contiguous iterators are RandomAccessIterators and model the contiguous_iterator concept. It is not entirely clear if contiguous iterators in C++17 were, but contiguous containers were defined as having RandomAccessIterators.) |
||
| Line 2: | Line 2: | ||
{{cpp/named req/navbar}} | {{cpp/named req/navbar}} | ||
| − | A {{named req|ContiguousIterator}} is | + | A {{named req|ContiguousIterator}} is a {{named req|RandomAccessIterator}} whose logically adjacent elements are also physically adjacent in memory. |
A pointer to an element of an array satisfies all requirements of {{named req/core|ContiguousIterator}}. | A pointer to an element of an array satisfies all requirements of {{named req/core|ContiguousIterator}}. | ||
| Line 9: | Line 9: | ||
The type {{tt|It}} satisfies {{named req/core|ContiguousIterator}} if | The type {{tt|It}} satisfies {{named req/core|ContiguousIterator}} if | ||
| − | * The type {{tt|It}} satisfies {{named req| | + | * The type {{tt|It}} satisfies {{named req|RandomAccessIterator}} |
And, for every | And, for every | ||
Revision as of 07:16, 15 December 2019
A LegacyContiguousIterator is a LegacyRandomAccessIterator whose logically adjacent elements are also physically adjacent in memory.
A pointer to an element of an array satisfies all requirements of LegacyContiguousIterator.
Requirements
The type It satisfies LegacyContiguousIterator if
- The type
Itsatisfies LegacyRandomAccessIterator
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)
