Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
std::experi...es::Iterator(3) C++ Standard Libarystd::experi...es::Iterator(3)

NAME
       std::experimental::ranges::Iterator - std::experimental::ranges::Itera-
       tor

Synopsis
	  Defined in header <experimental/ranges/iterator>
	  template <class I>

	  concept bool Iterator	=
	  requires(I i)	{				       (ranges TS)
	  { *i } -> auto&&; // Requires: i is dereferenceable
	  } &&

	  WeaklyIncrementable<I>;

	  The  Iterator	concept	forms the basis	of the iterator	concept	taxon-
       omy; every
	  iterator satisfies the Iterator requirements.

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

	  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 only
	  modify  its  non-constant  operands. Operands	that are constant must
       not be modified.

Notes
	  Iterator itself only specifies operations for	dereferencing and  in-
       crementing an
	  iterator.  Most  algorithms  will require additional operations, for
       example:

	    * comparing	iterators with sentinels (see Sentinel);
	    * reading values from an iterator (see Readable and	InputIterator)
	    * writing values to	an iterator (see Writable and OutputIterator)
	    * a	richer set of iterator movements (see  ForwardIterator,	 Bidi-
       rectionalIterator,
	      RandomAccessIterator)

	  The  -> auto&& constraint implies that the result type of the	defer-
       ence cannot be
	  void.

http://cppreference.com		  2022.07.31	 std::experi...es::Iterator(3)

Want to link to this manual page? Use this URL:
<https://man.freebsd.org/cgi/man.cgi?query=std::experimental::ranges::Iterator&sektion=3&manpath=FreeBSD+Ports+15.0>

home | help