std::strict_weak_order

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Technical specifications

Symbols index

External libraries

 

Concepts library

Core language concepts same_as derived_from convertible_to common_reference_with      common_with integral signed_integral unsigned_integral floating_point swappableswappable_with destructible constructible_from default_initializable move_constructible copy_constructible assignable_from

Comparison concepts equality_comparableequality_comparable_with totally_orderedtotally_ordered_with Object concepts movable copyable semiregular regular Callable concepts invocableregular_invocable predicate relation equivalence_relation strict_weak_order

 

Defined in header <concepts>
template < class R, class T, class U > concept strict_weak_order = std::relation<R, T, U>;		(since C++20)

The concept strict_weak_order<R, T, U> specifies that the relation R imposes a strict weak ordering on its arguments.

Semantic requirements

A relation r is a strict weak ordering if

• it is irreflexive: for all x, r(x, x) is false;
• it is transitive: for all a, b and c, if r(a, b) and r(b, c) are both true then r(a, c) is true;
• let e(a, b) be !r(a, b) && !r(b, a), then e is transitive: e(a, b) && e(b, c) implies e(a, c).

Under these conditions, it can be shown that e is an equivalence relation, and r induces a strict total ordering on the equivalence classes determined by e.

Notes

The distinction between relation and strict_weak_order is purely semantic.