A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://en.cppreference.com/w/cpp/../cpp/experimental/ranges/iterator/BidirectionalIterator.html below:

std::experimental::ranges::BidirectionalIterator - cppreference.com

template< class I >

concept bool BidirectionalIterator =
    ForwardIterator<I> &&
    DerivedFrom<ranges::iterator_category_t<I>, ranges::bidirectional_iterator_tag> &&
    requires(I i) {
        { --i } -> Same<I>&;
        { i-- } -> Same<I>&&;

    };
(ranges TS)

The concept BidirectionalIterator<I> refines ForwardIterator by adding the ability to move an iterator backward.

A bidirectional iterator r is said to be decrementable if and only if there exists some s such that ++s == r. All decrementable iterators r shall be in the domain of the expressions --r and r--.

Let a and b be decrementable objects of type I. BidirectionalIterator<I> is satisfied only if:

[edit] Equality preservation

An expression is equality preserving if it results in equal outputs given equal inputs.

Every expression required to be equality preserving is further required 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-expression is required to be equality preserving and stable, and the evaluation of the expression may only modify its non-constant operands. Operands that are constant must not be modified.


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