pub fn structure_tree(truth: &[bool]) -> Option<StructureTree>Expand description
Recursively decompose a Boolean function to the fixed point of the deep finder: peel the tightest axis,
then re-run on the smaller function(s) it exposes, until a coordinate leaf or the residue. None if
truth.len() is not a power of two.