C++ named requirements: LegacyInputIterator

 

C++

Language

Standard Library Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

C++ named requirements

Basic
DefaultConstructible CopyAssignable CopyConstructible	MoveAssignable (C++11) MoveConstructible (C++11) Destructible
Layout
TrivialType (C++11) TriviallyCopyable (C++11)	StandardLayoutType (C++11) PODType
Library-Wide
EqualityComparable LessThanComparable Swappable (C++11) ValueSwappable (C++11) NullablePointer (C++11) Hash (C++11)	Allocator FunctionObject Callable Predicate BinaryPredicate Compare
Container
Container SequenceContainer ContiguousContainer (C++17) ReversibleContainer	AssociativeContainer AllocatorAwareContainer UnorderedAssociativeContainer (C++11)
Container Elements
DefaultInsertable (C++11) CopyInsertable (C++11) MoveInsertable (C++11)	EmplaceConstructible (C++11) Erasable (C++11)
Iterator
LegacyIterator LegacyOutputIterator LegacyInputIterator LegacyForwardIterator	LegacyBidirectionalIterator LegacyRandomAccessIterator LegacyContiguousIterator (C++17) ConstexprIterator (C++20)
Stream I/O
FormattedInputFunction UnformattedInputFunction	FormattedOutputFunction UnformattedOutputFunction
Random Numbers
SeedSequence (C++11) RandomNumberEngine (C++11)	RandomNumberDistribution (C++11) UniformRandomBitGenerator (C++11) RandomNumberEngineAdaptor (C++11)
Concurrency
BasicLockable (C++11) Lockable (C++11) TimedLockable (C++11)	Mutex (C++11) TimedMutex (C++11) SharedMutex (C++17) SharedTimedMutex (C++14)
Other
CharTraits RegexTraits (C++11) BitmaskType NumericType LiteralType (C++11)	UnaryTypeTrait (C++11) BinaryTypeTrait (C++11) TransformationTrait (C++11) Clock (C++11) TrivialClock (C++11)

 

An LegacyInputIterator is an LegacyIterator that can read from the pointed-to element. LegacyInputIterators only guarantee validity for single pass algorithms: once an LegacyInputIterator i has been incremented, all copies of its previous value may be invalidated.

Requirements

The type It satisfies LegacyInputIterator if

• The type It satisfies LegacyIterator
• The type It satisfies EqualityComparable

And, given

• i and j, values of type It or const It
• reference, the type denoted by std::iterator_traits<It>::reference
• value_type, the type denoted by std::iterator_traits<It>::value_type

The following expressions must be valid and have their specified effects

Expression	Return	Equivalent expression	Notes
i != j	contextually convertible to bool	!(i == j)	Precondition: (i, j) is in the domain of ==.
*i	reference, convertible to value_type	If i == j and (i, j) is in the domain of == then this is equivalent to *j.	Precondition: i is dereferenceable. The expression (void)*i, *i is equivalent to *i.
i->m		(*i).m	Precondition: i is dereferenceable.
++i	It&		Precondition: i is dereferenceable. Postcondition: i is dereferenceable or i is past-the-end. Postcondition: Any copies of the previous value of i are no longer required to be either dereferenceable or to be in the domain of ==.
(void)i++		(void)++i
*i++	convertible to value_type	value_type x = *i; ++i; return x;

Notes

"in the domain of ==" means equality comparison is defined between the two iterator values. For input iterators, equality comparison does not need to be defined for all values, and the set of the values in the domain of == may change over time.

The reference type for an input iterator that is not also a LegacyForwardIterator does not have to be a reference type: dereferencing an input iterator may return a proxy object or value_type itself by value (as in the case of std::istreambuf_iterator).

Concept For the definition of std::iterator_traits, the following exposition-only concept is defined. template<class I> concept __LegacyInputIterator =   __LegacyIterator<I> && std::EqualityComparable<I> && requires(I i) {     typename std::incrementable_traits<I>::difference_type;     typename std::readable_traits<I>::value_type;     typename std::common_reference_t<std::iter_reference_t<I>&&,                                      typename std::readable_traits<I>::value_type&>;     *i++;     typename std::common_reference_t<decltype(*i++)&&,                                      typename std::readable_traits<I>::value_type&>;     requires std::SignedIntegral<typename std::incrementable_traits<I>::difference_type>;   }; where the exposition-only concept __LegacyIterator is described in LegacyIterator#Concept.

(since C++20)

See also

InputIterator

specifies that a type is an input iterator, that is, its referenced values can be read and it can be both pre- and post-incremented (concept)

• Iterator library