Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/named req/ContiguousIterator"

From cppreference.com
< cpp‎ | named req
(Created page with "{{cpp/concept/title|ContiguousIterator}} {{cpp/concept/navbar}} A {{tt|ContiguousIterator}} is an {{concept|Iterator}} whose logically adjacent elements are also physically a...")
 
m (+C++17 in title)
 
(20 intermediate revisions by 7 users not shown)
Line 1: Line 1:
−
{{cpp/concept/title|ContiguousIterator}}
+
{{cpp/named req/title|ContiguousIterator|notes={{mark since c++17}}}}
−
{{cpp/concept/navbar}}
+
{{cpp/named req/navbar}}
  
−
A {{tt|ContiguousIterator}} is an {{concept|Iterator}} whose logically adjacent elements are also physically adjacent in memory.
+
A {{named req|ContiguousIterator}} is a {{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 {{named req/core|ContiguousIterator}}.
−
 
+
−
{{cpp/concept/concept note}}
+
  
 
===Requirements===
 
===Requirements===
−
The type {{tt|It}} satisfies {{tt|ContiguousIterator}} if
+
The type {{c|It}} satisfies {{named req/core|ContiguousIterator}} if
 +
* The type {{c|It}} satisfies {{named req|Iterator}}
  
−
* The type {{tt|It}} satisfies {{concept|Iterator}}
+
And, for every
 +
* {{c|a}}, a dereferenceable iterator of type {{c|It}}
 +
* {{c|n}}, an integral value
  
−
And, given
+
such that
−
* {{tt|a}}, a dereferenceable iterator of type {{tt|It}}
+
−
* {{tt|n}}, an integral value
+
  
−
{{c|a + n}} is valid and results in a dereferenceable iterator of type {{tt|It}}, then {{c|*(a + n)}} is equivalent to {{c|*(std::addressof(*a) + n)}}.
+
* {{c|a + n}} is a valid and dereferenceable iterator value
  
−
===Standard library===
+
then
  
−
The following standard library types are {{concept|ContiguousIterator}}s.
+
* {{c|*(a + n)}} is equivalent to {{c|*(std::addressof(*a) + n)}}.
 +
 
 +
===Standard library===
 +
The following standard library types are {{named req|ContiguousIterator}}s.
  
 
* {{ltt|cpp/container/array|array::iterator}}.
 
* {{ltt|cpp/container/array|array::iterator}}.
 
* {{ltt|cpp/string/basic_string_view|basic_string_view::iterator}}.
 
* {{ltt|cpp/string/basic_string_view|basic_string_view::iterator}}.
−
* {{ltt|cpp/container/vector|vector::iterator}} for {{lc|value_type}} other than {{lc|bool}}.
+
* {{ltt|cpp/string/basic_string|basic_string::iterator}}.
−
* The return type of {{ltt|cpp/numeric/valarray/begin2|begin{{dsc small|(valarray)}}}} and {{ltt|cpp/numeric/valarray/end2|end{{dsc small|(valarray)}}}}
+
* {{ltt|cpp/container/vector|vector::iterator}} for {{tt|value_type}} other than {{c|bool}}.
 +
* The return type of {{ltt|cpp/numeric/valarray/begin2|begin{{dsc small|(valarray)}}}} and {{ltt|cpp/numeric/valarray/end2|end{{dsc small|(valarray)}}}}.
 +
 
 +
===Notes===
 +
[[cpp/named req/Allocator#Fancy pointers|Fancy pointer]] to object types are also required to satisfy {{named req/core|ContiguousIterator}}.
 +
 
 +
{{rrev|since=c++20|
 +
{{named req/core|ContiguousIterator}} is replaced with the {{lconcept|contiguous_iterator}} concept: iterator types in the standard library that are required to satisfy {{named req/core|ContiguousIterator}} in C++17 are required to model {{tt|contiguous_iterator}} in C++20.
 +
}}
  
 
===See also===
 
===See also===
−
* [[cpp/iterator|Iterator library]]
+
{{dsc begin}}
 +
{{dsc inc | cpp/iterator/dsc contiguous_iterator}}
 +
{{see_also_iterator_library}}
 +
{{dsc end}}
  
−
[[de:cpp/concept/ContiguousIterator]]
+
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}
−
[[es:cpp/concept/ContiguousIterator]]
+
−
[[fr:cpp/concept/ContiguousIterator]]
+
−
[[it:cpp/concept/ContiguousIterator]]
+
−
[[ja:cpp/concept/ContiguousIterator]]
+
−
[[pt:cpp/concept/ContiguousIterator]]
+
−
[[ru:cpp/concept/ContiguousIterator]]
+
−
[[zh:cpp/concept/ContiguousIterator]]
+

Latest revision as of 12:02, 8 November 2022

 
C++
 
C++ named requirements
 

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

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

[edit] Standard library

The following standard library types are LegacyContiguousIterators.

[edit] Notes

Fancy pointer to object types are also required to satisfy LegacyContiguousIterator.

LegacyContiguousIterator is replaced with the contiguous_iterator concept: iterator types in the standard library that are required to satisfy LegacyContiguousIterator in C++17 are required to model contiguous_iterator in C++20.

(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) [edit]
Iterator library provides definitions for iterators, iterator traits, adaptors, and utility functions
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/named_req/ContiguousIterator&oldid=144910"