Struct AnfPolynomial

pub struct AnfPolynomial { /* private fields */ }

Polynomial representation of Boolean function in Algebraic Normal Form (ANF).

The ANF representation is a XOR sum of monomials, where each monomial is a AND product of variables.

Implementations

impl AnfPolynomial

pub fn get_polynomial_small(&self) -> Option<u64>

Get the polynomial in ANF representation in unsigned 64-bit integer format. The unsigned representation of ANF is explained in README.md.

Returns None if the polynomial is too big to fit in a 64-bit integer (ie more than 6 variables).

pub fn get_polynomial_big(&self) -> BigUint

Get the polynomial in ANF representation in big unsigned integer format. The unsigned representation of ANF is explained in README.md.

pub fn get_degree(&self) -> usize

Get the degree of the polynomial.

The degree of the polynomial is the maximum number of variables in a monomial.

pub fn to_string(&self) -> String

Returns the string representation of the polynomial.

The monomials are ordered by the number of variables in the monomial in descending order, and then by the lexicographic order of the variables.

Example: “x0*x1 + x0 + x1 + x2”, the ‘+’ operator is the XOR operator, and the ‘*’ operator is the AND operator.

pub fn from_str( anf_polynomial: &str, num_variables: usize, ) -> Result<Self, BooleanFunctionError>

Computes the ANF polynomial from string representation

Representation must be in the form “x0*x2*x3 + x2*x3 + x1 + 1”.

X’s index starts at 0, meaning the maximum index is variable count - 1.

Parameters:

• anf_polynomial: The string representation of the ANF form
• num_variables: Variable count of the polynomial

Returns:

The ANF polynomial, or an error if the input string doesn’t respect the format and unsafe_disable_safety_checks feature is not activated.

pub fn get_boolean_function_type(&self) -> BooleanFunctionType

Returns Boolean function internal storage type:

• Small for u64 internal storage (less or equal than 6 variables Boolean function)
• Big for BigUInt internal storage (more than 6 variables Boolean function)

pub fn to_boolean_function(&self) -> BooleanFunction

Convert ANF polynomial to the corresponding Boolean Function, using fast ANF transform algorithm

Returns

A Boolean function corresponding to the polynomial

Trait Implementations

impl Clone for AnfPolynomial

fn clone(&self) -> AnfPolynomial

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AnfPolynomial

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

Formats the value using the given formatter.

impl Display for AnfPolynomial

Display implementation for AnfPolynomial.

Internally uses the AnfPolynomial::to_string method.

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

Formats the value using the given formatter.

impl PartialEq for AnfPolynomial

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

impl StructuralPartialEq for AnfPolynomial