Enum StructureTree 

pub enum StructureTree {
    Coordinate {
        class: CubeStructure,
        num_vars: usize,
        bits: usize,
    },
    Permutation {
        sym: VariableSymmetry,
        num_vars: usize,
    },
    Residue {
        truth: Vec<bool>,
    },
    Separable {
        num_vars: usize,
        constant: bool,
        blocks: Vec<(Vec<usize>, StructureTree)>,
    },
    LinearReduced {
        num_vars: usize,
        invariance_basis: Vec<usize>,
        free_positions: Vec<usize>,
        inner: Box<StructureTree>,
    },
    AffineReduced {
        num_vars: usize,
        linear_form: usize,
        invariance_basis: Vec<usize>,
        free_positions: Vec<usize>,
        inner: Box<StructureTree>,
    },
}

A recursive structural decomposition of a Boolean function: the fixed point of the deep finder.

Variants

Coordinate

A coordinate-lens leaf (constant/junta/affine/symmetric/low-degree), reconstructable from class.

Fields

class: CubeStructure

num_vars: usize

bits: usize

Permutation

A permutation-symmetry leaf: the orbit painting reconstructs it.

Fields

sym: VariableSymmetry

num_vars: usize

Residue

The incompressible residue — stored raw (no axis compressed it).

Fields

truth: Vec<bool>

Separable

Split into independent blocks, each recursively decomposed.

Fields

num_vars: usize

constant: bool

blocks: Vec<(Vec<usize>, StructureTree)>

LinearReduced

Reduced by an invariance subspace; inner is the decomposition of the smaller function.

Fields

num_vars: usize

invariance_basis: Vec<usize>

free_positions: Vec<usize>

inner: Box<StructureTree>

AffineReduced

Peeled a linear form ⟨c,x⟩, then reduced; inner decomposes the residual h.

Fields

num_vars: usize

linear_form: usize

invariance_basis: Vec<usize>

free_positions: Vec<usize>

inner: Box<StructureTree>

Implementations

impl StructureTree

pub fn depth(&self) -> usize

The nesting depth of the decomposition (0 for a leaf).

pub fn total_description_bits(&self) -> usize

The total description size in bits: the sum over the leaves, with a small charge per structural node.

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

Rebuild the full 2ⁿ truth table by composing the recursive descriptions — the whole-tree witness.

Trait Implementations

impl Clone for StructureTree

fn clone(&self) -> StructureTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StructureTree

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

Formats the value using the given formatter.

impl PartialEq for StructureTree

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

impl StructuralPartialEq for StructureTree