Namespaces
Variants
Views
Actions

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

From cppreference.com
< cpp‎ | named req
m
Line 5: Line 5:
  
 
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}}.
 
{{cpp/concept/concept note}}
 
  
 
===Requirements===
 
===Requirements===

Revision as of 09:15, 1 December 2017

Template:cpp/concept/title Template:cpp/concept/navbar

A ContiguousIterator is an Template:concept 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

And, given

  • a, a dereferenceable iterator of type It
  • n, an integral value

Then

  • a + n is valid
  • If a + n results in a dereferenceable iterator of type It, then *(a + n) is equivalent to *(std::addressof(*a) + n).

Standard library

The following standard library types are Template:concepts.

See also