dedekind::category::IsChainDecidedReflexive Concept Reference

Each law, stated once for every relation on a walkable chain: the certificate the concept reads is the law over the whole chain, for ≤, ≥, ==, or any stateless relation, decided and never registered per operator. A carrier that answers through its own member keeps that answer; a law the compiler cannot evaluate is not decided here. Exported conditions, so a rule elsewhere can yield to these. More...

Concept definition

template<typename T, typename Rel>
concept dedekind::category::IsChainDecidedReflexive =  IsWalkableChain<T, Rel, 1> && !requires {
  T::template is_reflexive_v<Rel>;
} && requires {
  typename std::bool_constant<reflexive_on(Rel{}, unit<T>(Sup{}),
                                           unit<T>(Inf{}))>;
}

Detailed Description

Each law, stated once for every relation on a walkable chain: the certificate the concept reads is the law over the whole chain, for ≤, ≥, ==, or any stateless relation, decided and never registered per operator. A carrier that answers through its own member keeps that answer; a law the compiler cannot evaluate is not decided here. Exported conditions, so a rule elsewhere can yield to these.