FreeBSD Manual Pages
std::input_...put_iterator(3) C++ Standard Libarystd::input_...put_iterator(3) NAME std::input_or_output_iterator - std::input_or_output_iterator Synopsis Defined in header <iterator> template <class I> concept input_or_output_iterator = requires(I i) { (since C++20) { *i } -> /*can-reference*/; } && std::weakly_incrementable<I>; 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 An expression is equality preserving if it results in equal outputs given equal inputs. * The inputs to an expression consist of its operands. * The outputs of an expression consist of its result and all operands modified by the expression (if any). In specification of standard concepts, operands are defined as the largest subexpressions that include only: * an id-expression, and * invocations of std::move, std::forward, and std::declval. The cv-qualification and value category of each operand is deter- mined by assuming that each template type parameter denotes a cv-unqualified complete non-array object type. Every expression required to be equality preserving is further re- quired to be stable: two evaluations of such an expression with the same input objects must have equal outputs absent any explicit intervening modification of those input objects. Unless noted otherwise, every expression used in a requires-expres- sion is required to be equality preserving and stable, and the evaluation of the ex- pression may modify only its non-constant operands. Operands that are constant must not be modified. Notes input_or_output_iterator itself only specifies operations for deref- erencing and incrementing an iterator. Most algorithms will require additional operations, for example: * comparing iterators with sentinels (see sentinel_for); * reading values from an iterator (see indirectly_readable and in- put_iterator) * writing values to an iterator (see indirectly_writable and out- put_iterator) * a richer set of iterator movements (see forward_iterator, bidirectional_iterator, random_access_iterator) Unlike the LegacyIterator requirements, the input_or_output_iterator concept does not require copyability. http://cppreference.com 2022.07.31 std::input_...put_iterator(3)
Want to link to this manual page? Use this URL:
<https://man.freebsd.org/cgi/man.cgi?query=std::input_or_output_iterator&sektion=3&manpath=FreeBSD+Ports+15.0>