Struct SolutionSpaceP 

pub struct SolutionSpaceP {
    pub num_vars: usize,
    pub p: u64,
    pub particular: Vec<u64>,
    pub kernel_basis: Vec<Vec<u64>>,
}

The complete solution space of a GF(p) linear system A x = b, in symmetry-broken form: one particular solution x₀ plus a basis of the kernel (null space). Every solution is x₀ + a GF(p) combination of the kernel basis, so all p^{n−rank} solutions are generated from this compressed witness. The kernel is the translation symmetry of the solution coset — the GF(p) analogue of crate::gf2::SolutionSpace, and the substrate of the affine SAT-side break: a variable the kernel never moves is forced to a single value.

Fields

num_vars: usize

p: u64

particular: Vec<u64>

kernel_basis: Vec<Vec<u64>>

Implementations

impl SolutionSpaceP

pub fn count(&self) -> u128

The number of solutions: p^{dim kernel}.

pub fn enumerate(&self) -> Vec<Vec<u64>>

Generate every solution: x₀ plus each GF(p) combination of the kernel basis.

Trait Implementations

impl Clone for SolutionSpaceP

fn clone(&self) -> SolutionSpaceP

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SolutionSpaceP

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for SolutionSpaceP

fn eq(&self, other: &SolutionSpaceP) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for SolutionSpaceP

impl StructuralPartialEq for SolutionSpaceP