pub enum AllowedOutcome {
Inconsistent,
Allowed(Vec<(u64, u64)>),
}Expand description
The per-variable allowed-value congruence of a ℤ/m system, for any composite m. By CRT over the
prime-power components, each variable’s solution-projection is a coset x_g ≡ residue (mod modulus) —
the tightest congruence the system forces on it. Generalizes forcing: modulus = m is a single value
(fully forced), 1 < modulus < m is partial (confined to a value-subset), modulus = 1 is free.
Within each prime-power component the coset modulus is gcd(p^k, kernel column at g) from
solve_space_prime_power; the components recombine by CRT. Inconsistent if any component is.
Variants§
Auto Trait Implementations§
impl Freeze for AllowedOutcome
impl RefUnwindSafe for AllowedOutcome
impl Send for AllowedOutcome
impl Sync for AllowedOutcome
impl Unpin for AllowedOutcome
impl UnsafeUnpin for AllowedOutcome
impl UnwindSafe for AllowedOutcome
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more