The input_iterator
concept is a refinement of input_or_output_iterator
, adding the requirement that the referenced values can be read (via indirectly_readable
) and the requirement that the iterator concept tag be present.
Definition of this concept is specified via an exposition-only alias template /*ITER_CONCEPT*/.
In order to determine /*ITER_CONCEPT*/<I>, let ITER_TRAITS<I> denote I if the specialization std::iterator_traits<I> is generated from the primary template, or std::iterator_traits<I> otherwise:
Unlike the LegacyInputIterator requirements, the input_iterator
concept does not require equality_comparable
, since input iterators are typically compared with sentinels.
A minimum input iterator.
#include <cstddef> #include <iterator> class SimpleInputIterator { public: using difference_type = std::ptrdiff_t; using value_type = int; int operator*() const; SimpleInputIterator& operator++(); void operator++(int) { ++*this; } }; static_assert(std::input_iterator<SimpleInputIterator>);[edit] See also specifies that objects of a type can be incremented and dereferenced
input_iterator
is a forward iterator, supporting equality comparison and multi-pass
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4