template<typename P>
}
A relation is bounded (composable over a finite middle) iff its predicate carries a prefix_bound.
Definition relprod.cppm:125
constexpr std::size_t prefix_bound(const dedekind::order::ProductRestrict< Pp, dedekind::sets::Cmp< dedekind::sets::Rel::Lt, dedekind::sets::Projection< 1 >, dedekind::sets::Const< K > > > &p)
prefix_bound(p) — recover the finite-prefix bound M carried by a bounded relation's predicate p: eith...
Definition relprod.cppm:110
A relation is bounded (composable over a finite middle) iff its predicate carries a prefix_bound.