dedekind::sequences::detail_relprod Namespace Reference

The composed predicate for \(R;S\) over the finite ℕ-prefix \([0,M)\) middle. Carries M (so the bound survives repeated squaring) and the two operand IsRelPredicate operands. The \(\exists\)-over-the-middle is the short-circuiting std::ranges::any_of over a lazy iota generator: it advances only to the first witness \(b\), so a hit returns immediately ( \(\top \vee x = \top\)) — O(1) memory (no bool accumulator threaded), O(M) steps worst-case, no array. More...

Classes
struct	IsMiddle
	Whether b is a middle for \((a, c)\): \(R(a,b) \wedge S(b,c)\), with b the i-th element of ℕ. More...

Detailed Description

The composed predicate for \(R;S\) over the finite ℕ-prefix \([0,M)\) middle. Carries M (so the bound survives repeated squaring) and the two operand IsRelPredicate operands. The \(\exists\)-over-the-middle is the short-circuiting std::ranges::any_of over a lazy iota generator: it advances only to the first witness \(b\), so a hit returns immediately ( \(\top \vee x = \top\)) — O(1) memory (no bool accumulator threaded), O(M) steps worst-case, no array.