std::experimental::ranges::Swappable, std::experimental::ranges::SwappableWith
| 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 |
| Core language concepts | |||||||||||||
| |||||||||||||
| Object concepts | |||||||||||||
| Comparison concepts | |||||||||||||
| Callable concepts | |||||||||||||
| URNG concept | |||||||||||||
| Defined in header <experimental/ranges/concepts>
|
||
| template< class T > concept bool Swappable = |
(1) | (ranges TS) |
| template< class T, class U > concept bool SwappableWith = |
(2) | (ranges TS) |
The concept Swappable<T> specifies that lvalues of type T are swappable.
The concept SwappableWith<T, U> specifies that expressions of the type and value category encoded by T and U are swappable with each other. SwappableWith<T, U> is satisfied only if a call to ranges::swap(u, t), t2 is equal to u and u2 is equal to t.
[edit] 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: 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.