std::experimental::ranges::Incrementable
Technical Specification | ||||
Filesystem library (filesystem TS) | ||||
Library fundamentals (library fundamentals TS) | ||||
Library fundamentals 2 (library fundamentals TS v2) | ||||
Library fundamentals 3 (library fundamentals TS v3) | ||||
Extensions for parallelism (parallelism TS) | ||||
Extensions for parallelism 2 (parallelism TS v2) | ||||
Extensions for concurrency (concurrency TS) | ||||
Extensions for concurrency 2 (concurrency TS v2) | ||||
Concepts (concepts TS) | ||||
Ranges (ranges TS) | ||||
Reflection (reflection TS) | ||||
Mathematical special functions (special functions TR) | ||||
Experimental Non-TS | ||||
Pattern Matching | ||||
Linear Algebra | ||||
std::execution | ||||
Contracts | ||||
2D Graphics |
Iterator concepts | |||||||||||||||||||||||
|
|||||||||||||||||||||||
Indirect callable concepts | |||||||||||||||||||||||
Common algorithm requirements | |||||||||||||||||||||||
Concept utilities | |||||||||||||||||||||||
Iterator utilities and operations | |||||||||||||||||||||||
Iterator traits | |||||||||||||||||||||||
Iterator adaptors | |||||||||||||||||||||||
Stream iterators | |||||||||||||||||||||||
Defined in header <experimental/ranges/iterator>
|
||
template
<
class I >
concept bool Incrementable =
|
(ranges TS) | |
The concept Incrementable<I>
specifies the requirements on a type that can be incremented (with the pre- and post-increment operators). The increment operations (including those required by WeaklyIncrementable
) are required to be equality-preserving, and the type is required to be EqualityComparable
Let a
and b
be incrementable objects of type I
. Incrementable<I>
is satisfied only if:
- If bool(a == b) then bool(a++ == b)
- If bool(a == b) then bool ( void (a++ ), a) == ++b)
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 required to be stable
Unless noted otherwise, every expression used in a requires-expression
Notes
The requirement that a
equals b
implies ++a
equals ++b
allows the use of multi-pass algorithms with Incrementable
types.