Struct AffineReduction 

pub struct AffineReduction {
    pub num_vars: usize,
    pub linear_form: usize,
    pub invariance_basis: Vec<usize>,
    pub free_positions: Vec<usize>,
    pub reduced_truth: Vec<bool>,
}

The affine reduction of a Boolean function: f(x) = h(reduced) ⊕ ℓ(x), where ℓ is a linear form and h collapses onto the free coordinates. This peels the COMPLEMENT linear structures (D_a f = 1) that reduce_by_invariance cannot — a residue XOR a linear form is invisible to every other axis but folds here.

Fields

num_vars: usize

linear_form: usize

The linear form ℓ(x) = ⟨c, x⟩ peeled off (as a coefficient bitmask).

invariance_basis: Vec<usize>

free_positions: Vec<usize>

reduced_truth: Vec<bool>

The reduced function h over free_positions.

Implementations

impl AffineReduction

pub fn reconstruct(&self) -> Option<Vec<bool>>

Rebuild the truth table: f(x) = h(coset-rep of x) ⊕ ⟨c, x⟩.

Trait Implementations

impl Clone for AffineReduction

fn clone(&self) -> AffineReduction

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AffineReduction

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

Formats the value using the given formatter.

impl PartialEq for AffineReduction

fn eq(&self, other: &AffineReduction) -> 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 AffineReduction

impl StructuralPartialEq for AffineReduction