Difference between revisions of "cpp/named req/ContiguousIterator"
From cppreference.com
(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.) |
(→See also: see also std::contiguous_iterator) |
||
| Line 33: | Line 33: | ||
===See also=== | ===See also=== | ||
| + | {{dsc begin}} | ||
| + | {{dsc inc | cpp/iterator/dsc ContiguousIterator}} | ||
| + | {{dsc end}} | ||
* [[cpp/iterator|Iterator library]] | * [[cpp/iterator|Iterator library]] | ||
| − | + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
Revision as of 08:01, 21 June 2020
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)
See also
| (C++20) |
specifies that a random_access_iterator is a contiguous iterator, referring to elements that are contiguous in memory (concept) |
