Skip to content

Search topics & cppreference

Search all study topics, concept maps, and 6,587 C++ and C reference pages.

std::input_or_output_iterator

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

NotebookLM
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.

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.

*i is required to be equality-preserving, although the increment operations required by weakly_incrementable are not.

Example

A minimum iterator.

snippet.cpp
#include <cstddef>
#include <iterator>
 
struct SimpleIterator
{
    using difference_type = std::ptrdiff_t;
 
    int operator*();
 
    SimpleIterator& operator++();
    void operator++(int) { ++*this; }
};
 
static_assert(std::input_or_output_iterator<SimpleIterator>);

Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.