Namespaces
Variants
Views
Actions

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

From cppreference.com
< cpp‎ | named req
(fixed base iterator concept)
(improved description by specifying proper base concept)
Line 2: Line 2:
 
{{cpp/concept/navbar}}
 
{{cpp/concept/navbar}}
  
A {{tt|ContiguousIterator}} is an {{concept|Iterator}} whose logically adjacent elements are also physically adjacent in memory.
+
A {{tt|ContiguousIterator}} is a {{concept|RandomAccessIterator}} 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 {{tt|ContiguousIterator}}.

Revision as of 02:18, 11 April 2018

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

A ContiguousIterator is a 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, 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

Standard library

The following standard library types are Template:concepts.

See also