23 Iterators library [iterators]

23.3 Iterator requirements [iterator.requirements]

23.3.4 Iterator concepts [iterator.concepts]

23.3.4.1 General [iterator.concepts.general]

For a type I, let ITER_TRAITS(I) denote the type I if iterator_traits names a specialization generated from the primary template.

Otherwise, ITER_TRAITS(I) denotes iterator_traits.

(1.1)
If the qualified-id ITER_TRAITS(I)::iterator_concept is valid and names a type, then ITER_CONCEPT(I) denotes that type.
(1.2)
Otherwise, if the qualified-id ITER_TRAITS(I)::iterator_category is valid and names a type, then ITER_CONCEPT(I) denotes that type.
(1.3)
Otherwise, if iterator_traits names a specialization generated from the primary template, then ITER_CONCEPT(I) denotes random_access_iterator_tag.
(1.4)
Otherwise, ITER_CONCEPT(I) does not denote a type.

[Note

ITER_TRAITS enables independent syntactic determination of an iterator's category and concept.

— end note

]

[Example

struct I {
  using value_type = int;
  using difference_type = int;

  int operator*() const;
  I& operator++();
  I operator++(int);
  I& operator--();
  I operator--(int);

  bool operator==(I) const;
};

iterator_traits::iterator_category denotes input_iterator_tag, and ITER_CONCEPT(I) denotes random_access_iterator_tag.

— end example

]

23.3.4.2 Concept indirectly_readable [iterator.concept.readable]

Types that are indirectly readable by applying operator* model the indirectly_readable concept, including pointers, smart pointers, and iterators.

template<class In>
  concept indirectly-readable-impl =
    requires(const In in) {
      typename iter_value_t<In>;
      typename iter_reference_t<In>;
      typename iter_rvalue_reference_t<In>;
      { *in } -> same_as<iter_reference_t<In>>;
      { ranges::iter_move(in) } -> same_as<iter_rvalue_reference_t<In>>;
    } &&
    common_reference_with<iter_reference_t<In>&&, iter_value_t<In>&> &&
    common_reference_with<iter_reference_t<In>&&, iter_rvalue_reference_t<In>&&> &&
    common_reference_with<iter_rvalue_reference_t<In>&&, const iter_value_t<In>&>;

template<class In>
  concept indirectly_readable =
    indirectly-readable-impl<remove_cvref_t<In>>;

Given a value i of type I, I models indirectly_readable only if the expression *i is equality-preserving.

[Note

The expression *i is indirectly required to be valid via the exposition-only dereferenceable concept ([iterator.synopsis]).

— end note

]

23.3.4.3 Concept indirectly_writable [iterator.concept.writable]

The indirectly_writable concept specifies the requirements for writing a value into an iterator's referenced object.

template<class Out, class T>
  concept indirectly_writable =
    requires(Out&& o, T&& t) {
      *o = std::forward<T>(t);  // not required to be equality-preserving
      *std::forward<Out>(o) = std::forward<T>(t);   // not required to be equality-preserving
      const_cast<const iter_reference_t<Out>&&>(*o) =
        std::forward<T>(t);     // not required to be equality-preserving
      const_cast<const iter_reference_t<Out>&&>(*std::forward<Out>(o)) =
        std::forward<T>(t);     // not required to be equality-preserving
    };

Let E be an expression such that decltype((E)) is T, and let o be a dereferenceable object of type Out.

Out and T model indirectly_writable<Out, T> only if

(2.1)
If Out and T model indirectly_readable<Out> && same_as<iter_value_t<Out>, decay_t<T>>, then *o after any above assignment is equal to the value of E before the assignment.

After evaluating any above assignment expression, o is not required to be dereferenceable.

If E is an xvalue ([basic.lval]), the resulting state of the object it denotes is valid but unspecified ([lib.types.movedfrom]).

[Note

The only valid use of an operator* is on the left side of the assignment statement.

Assignment through the same value of the indirectly writable type happens only once.

— end note

]

[Note

indirectly_writable has the awkward const_cast expressions to reject iterators with prvalue non-proxy reference types that permit rvalue assignment but do not also permit const rvalue assignment.

Consequently, an iterator type I that returns std::string by value does not model indirectly_writable<I, std::string>.

— end note

]

23.3.4.4 Concept weakly_incrementable [iterator.concept.winc]

The weakly_incrementable concept specifies the requirements on types that can be incremented with the pre- and post-increment operators.

The increment operations are not required to be equality-preserving, nor is the type required to be equality_comparable.

template<class T>
  inline constexpr bool is-integer-like = see below;            // exposition only

template<class T>
  inline constexpr bool is-signed-integer-like = see below;     // exposition only

template<class I>
  concept weakly_incrementable =
    default_initializable<I> && movable<I> &&
    requires(I i) {
      typename iter_difference_t<I>;
      requires is-signed-integer-like<iter_difference_t<I>>;
      { ++i } -> same_as<I&>;   // not required to be equality-preserving
      i++;                      // not required to be equality-preserving
    };

A type I is an integer-class type if it is in a set of implementation-defined class types that behave as integer types do, as defined in below.

The range of representable values of an integer-class type is the continuous set of values over which it is defined.

The values 0 and 1 are part of the range of every integer-class type.

If any negative numbers are part of the range, the type is a signed-integer-class type; otherwise, it is an unsigned-integer-class type.

For every integer-class type I, let B(I) be a hypothetical extended integer type of the same signedness with the smallest width ([basic.fundamental]) capable of representing the same range of values.

The width of I is equal to the width of B(I).

Let a and b be objects of integer-class type I, let x and y be objects of type B(I) as described above that represent the same values as a and b respectively, and let c be an lvalue of any integral type.

(5.1)
For every unary operator @ for which the expression @x is well-formed, @a shall also be well-formed and have the same value, effects, and value category as @x provided that value is representable by I.

If @x has type bool, so too does @a; if @x has type B(I), then @a has type I.
(5.2)
For every assignment operator @= for which c @= x is well-formed, c @= a shall also be well-formed and shall have the same value and effects as c @= x.

The expression c @= a shall be an lvalue referring to c.
(5.3)
For every binary operator @ for which x @ y is well-formed, a @ b shall also be well-formed and shall have the same value, effects, and value category as x @ y provided that value is representable by I.

If x @ y has type bool, so too does a @ b; if x @ y has type B(I), then a @ b has type I.

Expressions of integer-class type are explicitly convertible to any integral type.

Expressions of integral type are both implicitly and explicitly convertible to any integer-class type.

Conversions between integral and integer-class types do not exit via an exception.

An expression E of integer-class type I is contextually convertible to bool as if by bool(E != I(0)).

All integer-class types model regular ([concepts.object]) and totally_ordered ([concept.totallyordered]).

A value-initialized object of integer-class type has value 0.

For every (possibly cv-qualified) integer-class type I, numeric_limits is specialized such that:

(10.1)
numeric_limits::is_specialized is true,
(10.2)
numeric_limits::is_signed is true if and only if I is a signed-integer-class type,
(10.3)
numeric_limits::is_integer is true,
(10.4)
numeric_limits::is_exact is true,
(10.5)
numeric_limits::digits is equal to the width of the integer-class type,
(10.6)
numeric_limits::digits10 is equal to static_cast<int>(digits * log10(2)), and
(10.7)
numeric_limits::min() and numeric_limits::max() return the lowest and highest representable values of I, respectively, and numeric_limits::lowest() returns numeric_limits::min().

A type I is integer-like if it models integral or if it is an integer-class type.

A type I is signed-integer-like if it models signed_integral or if it is a signed-integer-class type.

A type I is unsigned-integer-like if it models unsigned_integral or if it is an unsigned-integer-class type.

is-integer-like is true if and only if I is an integer-like type.

is-signed-integer-like is true if and only if I is a signed-integer-like type.

Let i be an object of type I.

When i is in the domain of both pre- and post-increment, i is said to be incrementable.

I models weakly_incrementable only if

(13.1)
The expressions ++i and i++ have the same domain.
(13.2)
If i is incrementable, then both ++i and i++ advance i to the next element.
(13.3)
If i is incrementable, then addressof(++i) is equal to addressof(i).

[Note

For weakly_incrementable types, a equals b does not imply that ++a equals ++b.

(Equality does not guarantee the substitution property or referential transparency.)

Algorithms on weakly incrementable types should never attempt to pass through the same incrementable value twice.

They should be single-pass algorithms.

These algorithms can be used with istreams as the source of the input data through the istream_iterator class template.

— end note

]

23.3.4.5 Concept incrementable [iterator.concept.inc]

The incrementable concept specifies requirements on types that can be incremented with the pre- and post-increment operators.

The increment operations are required to be equality-preserving, and the type is required to be equality_comparable.

[Note

This supersedes the annotations on the increment expressions in the definition of weakly_incrementable.

— end note

]

template<class I>
  concept incrementable =
    regular<I> &&
    weakly_incrementable<I> &&
    requires(I i) {
      { i++ } -> same_as<I>;
    };

Let a and b be incrementable objects of type I.

I models incrementable only if

(2.1)
If bool(a == b) then bool(a++ == b).
(2.2)
If bool(a == b) then bool(((void)a++, a) == ++b).

[Note

The requirement that a equals b implies ++a equals ++b (which is not true for weakly incrementable types) allows the use of multi-pass one-directional algorithms with types that model incrementable.

— end note

]

23.3.4.6 Concept input_or_output_iterator [iterator.concept.iterator]

The input_or_output_iterator concept forms the basis of the iterator concept taxonomy; every iterator models input_or_output_iterator.

This concept specifies operations for dereferencing and incrementing an iterator.

Most algorithms will require additional operations to compare iterators with sentinels ([iterator.concept.sentinel]), to read ([iterator.concept.input]) or write ([iterator.concept.output]) values, or to provide a richer set of iterator movements ([iterator.concept.forward], [iterator.concept.bidir], [iterator.concept.random.access]).

template<class I>
  concept input_or_output_iterator =
    requires(I i) {
      { *i } -> can-reference;
    } &&
    weakly_incrementable<I>;

[Note

Unlike the Cpp17Iterator requirements, the input_or_output_iterator concept does not require copyability.

— end note

]

23.3.4.7 Concept sentinel_for [iterator.concept.sentinel]

The sentinel_for concept specifies the relationship between an input_or_output_iterator type and a semiregular type whose values denote a range.

🔗

template<class S, class I>
  concept sentinel_for =
    semiregular<S> &&
    input_or_output_iterator<I> &&
    weakly-equality-comparable-with<S, I>; // See [concept.equalitycomparable]

Let s and i be values of type S and I such that [i, s) denotes a range.

Types S and I model sentinel_for<S, I> only if

(2.1)
i == s is well-defined.
(2.2)
If bool(i != s) then i is dereferenceable and [++i, s) denotes a range.

The domain of == is not static.

Given an iterator i and sentinel s such that [i, s) denotes a range and i != s, i and s are not required to continue to denote a range after incrementing any other iterator equal to i.

Consequently, i == s is no longer required to be well-defined.

23.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]

The sized_sentinel_for concept specifies requirements on an input_or_output_iterator type I and a corresponding sentinel_for that allow the use of the - operator to compute the distance between them in constant time.

🔗

template<class S, class I>
  concept sized_sentinel_for =
    sentinel_for<S, I> &&
    !disable_sized_sentinel_for<remove_cv_t<S>, remove_cv_t<I>> &&
    requires(const I& i, const S& s) {
      { s - i } -> same_as<iter_difference_t<I>>;
      { i - s } -> same_as<iter_difference_t<I>>;
    };

Let i be an iterator of type I, and s a sentinel of type S such that [i, s) denotes a range.

Let N be the smallest number of applications of ++i necessary to make bool(i == s) be true.

S and I model sized_sentinel_for<S, I> only if

(2.1)
If N is representable by iter_difference_t, then s - i is well-defined and equals N.
(2.2)
If $- N$ is representable by iter_difference_t, then i - s is well-defined and equals $- N$ .

🔗

template<class S, class I>
  inline constexpr bool disable_sized_sentinel_for = false;

Remarks: Pursuant to [namespace.std], users may specialize disable_sized_sentinel_for for cv-unqualified non-array object types S and I if S and/or I is a program-defined type.

Such specializations shall be usable in constant expressions ([expr.const]) and have type const bool.

[Note

disable_sized_sentinel_for allows use of sentinels and iterators with the library that satisfy but do not in fact model sized_sentinel_for.

— end note

]

[Example

The sized_sentinel_for concept is modeled by pairs of random_access_iterators ([iterator.concept.random.access]) and by counted iterators and their sentinels ([counted.iterator]).

— end example

]

23.3.4.9 Concept input_iterator [iterator.concept.input]

The input_iterator concept defines requirements for a type whose referenced values can be read (from the requirement for indirectly_readable ([iterator.concept.readable])) and which can be both pre- and post-incremented.

[Note

Unlike the Cpp17InputIterator requirements ([input.iterators]), the input_iterator concept does not need equality comparison since iterators are typically compared to sentinels.

— end note

]

template<class I>
  concept input_iterator =
    input_or_output_iterator<I> &&
    indirectly_readable<I> &&
    requires { typename ITER_CONCEPT(I); } &&
    derived_from<ITER_CONCEPT(I), input_iterator_tag>;

23.3.4.10 Concept output_iterator [iterator.concept.output]

The output_iterator concept defines requirements for a type that can be used to write values (from the requirement for indirectly_writable ([iterator.concept.writable])) and which can be both pre- and post-incremented.

[Note

Output iterators are not required to model equality_comparable.

— end note

]

template<class I, class T>
  concept output_iterator =
    input_or_output_iterator<I> &&
    indirectly_writable<I, T> &&
    requires(I i, T&& t) {
      *i++ = std::forward<T>(t);        // not required to be equality-preserving
    };

Let E be an expression such that decltype((E)) is T, and let i be a dereferenceable object of type I.

I and T model output_iterator<I, T> only if *i++ = E; has effects equivalent to:

*i = E;
++i;

[Note

Algorithms on output iterators should never attempt to pass through the same iterator twice.

They should be single-pass algorithms.

— end note

]

23.3.4.11 Concept forward_iterator [iterator.concept.forward]

The forward_iterator concept adds copyability, equality comparison, and the multi-pass guarantee, specified below.

template<class I>
  concept forward_iterator =
    input_iterator<I> &&
    derived_from<ITER_CONCEPT(I), forward_iterator_tag> &&
    incrementable<I> &&
    sentinel_for<I, I>;

The domain of == for forward iterators is that of iterators over the same underlying sequence.

However, value-initialized iterators of the same type may be compared and shall compare equal to other value-initialized iterators of the same type.

[Note

Value-initialized iterators behave as if they refer past the end of the same empty sequence.

— end note

]

Pointers and references obtained from a forward iterator into a range [i, s) shall remain valid while [i, s) continues to denote a range.

Two dereferenceable iterators a and b of type X offer the multi-pass guarantee if:

(4.1)
a == b implies ++a == ++b and
(4.2)
the expression ((void)[](X x){++x;}(a), *a) is equivalent to the expression *a.

[Note

The requirement that a == b implies ++a == ++b and the removal of the restrictions on the number of assignments through a mutable iterator (which applies to output iterators) allow the use of multi-pass one-directional algorithms with forward iterators.

— end note

]

23.3.4.12 Concept bidirectional_iterator [iterator.concept.bidir]

The bidirectional_iterator concept adds the ability to move an iterator backward as well as forward.

template<class I>
  concept bidirectional_iterator =
    forward_iterator<I> &&
    derived_from<ITER_CONCEPT(I), bidirectional_iterator_tag> &&
    requires(I i) {
      { --i } -> same_as<I&>;
      { i-- } -> same_as<I>;
    };

A bidirectional iterator r is decrementable if and only if there exists some q such that ++q == r.

Decrementable iterators r shall be in the domain of the expressions --r and r--.

Let a and b be equal objects of type I.

I models bidirectional_iterator only if:

(3.1)
If a and b are decrementable, then all of the following are true:
- (3.1.1)
  addressof(--a) == addressof(a)
- (3.1.2)
  bool(a-- == b)
- (3.1.3)
  after evaluating both a-- and --b, bool(a == b) is still true
- (3.1.4)
  bool(++(--a) == b)
(3.2)
If a and b are incrementable, then bool(--(++a) == b).

23.3.4.13 Concept random_access_iterator [iterator.concept.random.access]

The random_access_iterator concept adds support for constant-time advancement with +=, +, -=, and -, as well as the computation of distance in constant time with -.

Random access iterators also support array notation via subscripting.

template<class I>
  concept random_access_iterator =
    bidirectional_iterator<I> &&
    derived_from<ITER_CONCEPT(I), random_access_iterator_tag> &&
    totally_ordered<I> &&
    sized_sentinel_for<I, I> &&
    requires(I i, const I j, const iter_difference_t<I> n) {
      { i += n } -> same_as<I&>;
      { j +  n } -> same_as<I>;
      { n +  j } -> same_as<I>;
      { i -= n } -> same_as<I&>;
      { j -  n } -> same_as<I>;
      {  j[n]  } -> same_as<iter_reference_t<I>>;
    };

Let a and b be valid iterators of type I such that b is reachable from a after n applications of ++a, let D be iter_difference_t, and let n denote a value of type D.

I models random_access_iterator only if

(2.1)
(a += n) is equal to b.
(2.2)
addressof(a += n) is equal to addressof(a).
(2.3)
(a + n) is equal to (a += n).
(2.4)
For any two positive values x and y of type D, if (a + D(x + y)) is valid, then (a + D(x + y)) is equal to ((a + x) + y).
(2.5)
(a + D(0)) is equal to a.
(2.6)
If (a + D(n - 1)) is valid, then (a + n) is equal to [](I c){ return ++c; }(a + D(n - 1)).
(2.7)
(b += D(-n)) is equal to a.
(2.8)
(b -= n) is equal to a.
(2.9)
addressof(b -= n) is equal to addressof(b).
(2.10)
(b - n) is equal to (b -= n).
(2.11)
If b is dereferenceable, then a[n] is valid and is equal to *b.
(2.12)
bool(a <= b) is true.

23.3.4.14 Concept contiguous_iterator [iterator.concept.contiguous]

The contiguous_iterator concept provides a guarantee that the denoted elements are stored contiguously in memory.

template<class I>
  concept contiguous_iterator =
    random_access_iterator<I> &&
    derived_from<ITER_CONCEPT(I), contiguous_iterator_tag> &&
    is_lvalue_reference_v<iter_reference_t<I>> &&
    same_as<iter_value_t<I>, remove_cvref_t<iter_reference_t<I>>> &&
    requires(const I& i) {
      { to_address(i) } -> same_as<add_pointer_t<iter_reference_t<I>>>;
    };

Let a and b be dereferenceable iterators and c be a non-dereferenceable iterator of type I such that b is reachable from a and c is reachable from b, and let D be iter_difference_t.

The type I models contiguous_iterator only if

(2.1)
to_address(a) == addressof(*a),
(2.2)
to_address(b) == to_address(a) + D(b - a), and
(2.3)
to_address(c) == to_address(a) + D(c - a).

23 Iterators library [iterators]

23.3 Iterator requirements [iterator.requirements]

23.3.4 Iterator concepts [iterator.concepts]

23.3.4.1 General [iterator.concepts.general]

23.3.4.2 Concept indirectly_­readable [iterator.concept.readable]

23.3.4.3 Concept indirectly_­writable [iterator.concept.writable]

23.3.4.4 Concept weakly_­incrementable [iterator.concept.winc]

23.3.4.5 Concept incrementable [iterator.concept.inc]

23.3.4.6 Concept input_­or_­output_­iterator [iterator.concept.iterator]

23.3.4.7 Concept sentinel_­for [iterator.concept.sentinel]

23.3.4.8 Concept sized_­sentinel_­for [iterator.concept.sizedsentinel]

23.3.4.9 Concept input_­iterator [iterator.concept.input]

23.3.4.10 Concept output_­iterator [iterator.concept.output]

23.3.4.11 Concept forward_­iterator [iterator.concept.forward]

23.3.4.12 Concept bidirectional_­iterator [iterator.concept.bidir]

23.3.4.13 Concept random_­access_­iterator [iterator.concept.random.access]

23.3.4.14 Concept contiguous_­iterator [iterator.concept.contiguous]

23.3.4.2 Concept indirectly_readable [iterator.concept.readable]

23.3.4.3 Concept indirectly_writable [iterator.concept.writable]

23.3.4.4 Concept weakly_incrementable [iterator.concept.winc]

23.3.4.6 Concept input_or_output_iterator [iterator.concept.iterator]

23.3.4.7 Concept sentinel_for [iterator.concept.sentinel]

23.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]

23.3.4.9 Concept input_iterator [iterator.concept.input]

23.3.4.10 Concept output_iterator [iterator.concept.output]

23.3.4.11 Concept forward_iterator [iterator.concept.forward]

23.3.4.12 Concept bidirectional_iterator [iterator.concept.bidir]

23.3.4.13 Concept random_access_iterator [iterator.concept.random.access]

23.3.4.14 Concept contiguous_iterator [iterator.concept.contiguous]