The expression strong_order(E, F)
for some subexpressions E and F
is expression-equivalent ([defns.expression-equivalent]) to the following:

- If the decayed types of E and F differ, strong_order(E, F) is ill-formed.
- Otherwise, strong_ordering(strong_order(E, F)) if it is a well-formed expression with overload resolution performed in a context that does not include a declaration of std::strong_order.
- Otherwise, if the decayed type T of E is a floating-point type, yields a value of type strong_ordering that is consistent with the ordering observed by T's comparison operators, and if numeric_limits<T>::is_iec559 is true, is additionally consistent with the totalOrder operation as specified in ISO/IEC/IEEE 60559.
- Otherwise, strong_ordering(E <=> F) if it is a well-formed expression.
- Otherwise, strong_order(E, F) is ill-formed. [ Note: This case can result in substitution failure when strong_order(E, F) appears in the immediate context of a template instantiation. —]
*end note*

The expression weak_order(E, F)
for some subexpressions E and F
is expression-equivalent ([defns.expression-equivalent]) to the following:

- If the decayed types of E and F differ, weak_order(E, F) is ill-formed.
- Otherwise, weak_ordering(weak_order(E, F)) if it is a well-formed expression with overload resolution performed in a context that does not include a declaration of std::weak_order.
- Otherwise, if the decayed type T of E
is a floating-point type,
yields a value of type weak_ordering
that is consistent with the ordering
observed by T's comparison operators and strong_order, and
if numeric_limits<T>::is_iec559 is true,
is additionally consistent with the following equivalence classes,
ordered from lesser to greater:
- together, all negative NaN values;
- negative infinity;
- each normal negative value;
- each subnormal negative value;
- together, both zero values;
- each subnormal positive value;
- each normal positive value;
- positive infinity;
- together, all positive NaN values.

- Otherwise, weak_ordering(E <=> F) if it is a well-formed expression.
- Otherwise, weak_ordering(strong_order(E, F)) if it is a well-formed expression.
- Otherwise, weak_order(E, F) is ill-formed. [ Note: This case can result in substitution failure when std::weak_order(E, F) appears in the immediate context of a template instantiation. —]
*end note*

The expression partial_order(E, F)
for some subexpressions E and F
is expression-equivalent ([defns.expression-equivalent]) to the following:

- If the decayed types of E and F differ, partial_order(E, F) is ill-formed.
- Otherwise, partial_ordering(partial_order(E, F)) if it is a well-formed expression with overload resolution performed in a context that does not include a declaration of std::partial_order.
- Otherwise, partial_ordering(E <=> F) if it is a well-formed expression.
- Otherwise, partial_ordering(weak_order(E, F)) if it is a well-formed expression.
- Otherwise, partial_order(E, F) is ill-formed. [ Note: This case can result in substitution failure when std::partial_order(E, F) appears in the immediate context of a template instantiation. —]
*end note*

The name compare_strong_order_fallback
denotes a customization point object ([customization.point.object]).

The expression compare_strong_order_fallback(E, F)
for some subexpressions E and F
is expression-equivalent ([defns.expression-equivalent]) to:

- If the decayed types of E and F differ, compare_strong_order_fallback(E, F) is ill-formed.
- Otherwise, strong_order(E, F) if it is a well-formed expression.
- Otherwise, if the expressions E == F and E < F
are both well-formed and convertible to bool,
E == F ? strong_ordering::equal : E < F ? strong_ordering::less : strong_ordering::greater

except that E and F are evaluated only once. - Otherwise, compare_strong_order_fallback(E, F) is ill-formed.

The name compare_weak_order_fallback denotes
a customization point object ([customization.point.object]).

The expression compare_weak_order_fallback(E, F)
for some subexpressions E and F
is expression-equivalent ([defns.expression-equivalent]) to:

- If the decayed types of E and F differ, compare_weak_order_fallback(E, F) is ill-formed.
- Otherwise, weak_order(E, F) if it is a well-formed expression.
- Otherwise, if the expressions E == F and E < F
are both well-formed and convertible to bool,
E == F ? weak_ordering::equivalent : E < F ? weak_ordering::less : weak_ordering::greater

except that E and F are evaluated only once. - Otherwise, compare_weak_order_fallback(E, F) is ill-formed.

The name compare_partial_order_fallback denotes
a customization point object ([customization.point.object]).

The expression compare_partial_order_fallback(E, F)
for some subexpressions E and F
is expression-equivalent ([defns.expression-equivalent]) to:

- If the decayed types of E and F differ, compare_partial_order_fallback(E, F) is ill-formed.
- Otherwise, partial_order(E, F) if it is a well-formed expression.
- Otherwise, if the expressions E == F and E < F
are both well-formed and convertible to bool,
E == F ? partial_ordering::equivalent : E < F ? partial_ordering::less : F < E ? partial_ordering::greater : partial_ordering::unordered

except that E and F are evaluated only once. - Otherwise, compare_partial_order_fallback(E, F) is ill-formed.