Enum twenty_first::shared_math::circuit::CircuitExpression

pub enum CircuitExpression<T: Clone + Debug + Add<Output = T> + Mul<Output = T> + Sub<Output = T> + Zero + One + Hash + Eq> {
    Constant(T),
    Input(usize),
    BinaryOperation(BinOp, Rc<RefCell<Circuit<T>>>, Rc<RefCell<Circuit<T>>>),
}

A circuit expression is a recursive data structure. It is a directed, acyclic graph of binary operations on the input variables. It has multiple roots, making it a “multitree.”

The leafs of the tree are

• constants (T)
• input variables

An inner node, representing some binary operation, is either addition, multiplication, or subtraction. The left and right children of the node are the operands of the binary operation. The left and right children are not themselves CircuitExpressions, but rather Circuits, which is a wrapper around CircuitExpression that manages additional bookkeeping information.

Variants

Constant(T)

Input(usize)

BinaryOperation(BinOp, Rc<RefCell<Circuit<T>>>, Rc<RefCell<Circuit<T>>>)

Trait Implementations

impl<T: Clone + Clone + Debug + Add<Output = T> + Mul<Output = T> + Sub<Output = T> + Zero + One + Hash + Eq> Clone for CircuitExpression<T>

fn clone(&self) -> CircuitExpression<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Clone + Debug + Add<Output = T> + Mul<Output = T> + Sub<Output = T> + Zero + One + Hash + Eq> Debug for CircuitExpression<T>

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

Formats the value using the given formatter.

impl<T: Clone + Debug + Add<Output = T> + Mul<Output = T> + Sub<Output = T> + Zero + One + Hash + Eq> Hash for CircuitExpression<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Clone + Debug + Add<Output = T> + Mul<Output = T> + Sub<Output = T> + Zero + One + Hash + Eq> PartialEq<CircuitExpression<T>> for CircuitExpression<T>

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

This method tests for self and other values to be equal, and is used by ==.

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

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