Difference between revisions of "cpp/named req/ContiguousIterator"
From cppreference.com
m (fmt) |
m (+C++17 in title) |
||
| Line 1: | Line 1: | ||
| − | {{cpp/named req/title|ContiguousIterator}} | + | {{cpp/named req/title|ContiguousIterator|notes={{mark since c++17}}}} |
{{cpp/named req/navbar}} | {{cpp/named req/navbar}} | ||
Latest revision as of 12:02, 8 November 2022
A LegacyContiguousIterator is a LegacyIterator whose logically adjacent elements are also physically adjacent in memory.
A pointer to an element of an array satisfies all requirements of LegacyContiguousIterator.
Contents |
[edit] Requirements
The type It satisfies LegacyContiguousIterator if
- The type It satisfies LegacyIterator
And, for every
- a, a dereferenceable iterator of type It
- 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).
[edit] Standard library
The following standard library types are LegacyContiguousIterators.
- array::iterator.
- basic_string_view::iterator.
- basic_string::iterator.
- vector::iterator for
value_typeother than bool. - The return type of begin(valarray) and end(valarray).
[edit] Notes
Fancy pointer to object types are also required to satisfy LegacyContiguousIterator.
|
LegacyContiguousIterator is replaced with the |
(since C++20) |
[edit] See also
| (C++20) |
specifies that a random_access_iterator is a contiguous iterator, referring to elements that are contiguous in memory (concept) |
| Iterator library | provides definitions for iterators, iterator traits, adaptors, and utility functions |
