# Concept Subspace :: sus :: cmp :: PartialOrd

template <class Lhs, class Rhs = Lhs>concept PartialOrd

requires

Ord<Lhs, Rhs> || StrongOrd<Lhs, Rhs> ||

requires(const std::remove_reference_t<Lhs>& lhs, const Rhs& rhs) {

{ lhs <=> rhs } -> std::same_as<std::partial_ordering>;

}

Concept for types that form a partial ordering (aka
`std::partial_ordering`

).

# Determining PartialOrd strictly

`PartialOrd`

will be satisfied if the types
satisfy `StrongOrd`

or `Ord`

.
To determine if a partial ordering is the strongest type of ordering between
the types, use `ExclusivePartialOrd`

.