std::input_or_output_iterator

From cppreference.com
< cpp‎ | iterator
 
 
Iterator library
Iterator concepts
input_or_output_iterator
(C++20)
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
Common algorithm requirements
Utilities
(C++20)
Iterator adaptors
Stream iterators
Iterator customization points
Iterator operations
(C++11)
(C++11)
Range access
(C++11)(C++14)
(C++11)(C++14)
(C++17)(C++20)
(C++14)(C++14)
(C++14)(C++14)
(C++17)
(C++17)
 
Defined in header <iterator>
template <class I>

concept input_or_output_iterator =
  requires(I i) {
    { *i } -> /*can-reference*/;
  } &&

  std::weakly_incrementable<I>;
(since C++20)

The input_or_output_iterator concept forms the basis of the iterator concept taxonomy; every iterator type satisfies the input_or_output_iterator requirements.

The exposition-only concept /*can-reference*/ is satisfied if and only if the type is referenceable (in particular, not void).

Equality preservation

Expressions declared in requires-expressions of the standard library concepts are required to be equality-preserving (except where stated otherwise).

Notes

input_or_output_iterator itself only specifies operations for dereferencing and incrementing an iterator. Most algorithms will require additional operations, for example:

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