Skip to main content

ClassicalExpr

Enum ClassicalExpr 

Source
pub enum ClassicalExpr {
    In(u32),
    Const(bool),
    Not(Box<ClassicalExpr>),
    Xor(Box<[ClassicalExpr]>),
    And(Box<[ClassicalExpr]>),
    Or(Box<[ClassicalExpr]>),
    Select(Box<[ClassicalExpr; 3]>),
    Parity {
        inputs: Box<[u32]>,
        constant: bool,
    },
}
Expand description

Combinational logic over a classical node’s incoming Value edges.

ClassicalExpr::In reads the edge whose slot equals its index (SSA-by-slot): the slot is carried on the edge, so the binding survives edge reordering under edits rather than depending on iteration order.

Variants§

§

In(u32)

Read one incoming edge slot.

§

Const(bool)

A compile-time-constant bit — an input-less producer. Carries a deterministic feedback sign (constant-sign folds to no op).

§

Not(Box<ClassicalExpr>)

Boolean negation.

§

Xor(Box<[ClassicalExpr]>)

Ordered parity operands; the empty parity is false.

§

And(Box<[ClassicalExpr]>)

Ordered conjunction operands; the empty conjunction is true.

§

Or(Box<[ClassicalExpr]>)

Ordered disjunction operands; the empty disjunction is false.

§

Select(Box<[ClassicalExpr; 3]>)

[condition, when_false, when_true]. All three operands must be known, including the unselected value; this is combinational dataflow (SEM-EXPR).

§

Parity

Affine parity of ordered input slots and a constant XOR term. Repeated slots stay present: every input must be known even when its Boolean contributions cancel (SEM-EXPR). No expression nodes per slot.

Fields

§inputs: Box<[u32]>

Ordered input slots.

§constant: bool

Constant XOR term.

Implementations§

Source§

impl ClassicalExpr

Source

pub fn parity(inputs: impl IntoIterator<Item = u32>, constant: bool) -> Self

Build an affine parity, retaining input order and multiplicity.

Source

pub fn xor(operands: impl IntoIterator<Item = Self>) -> Self

Build a parity list, collapsing empty and singleton lists. Preserves operand order, duplicates, and nested expressions.

§Panics

Panics only if the collected operand count changes before extraction.

Source

pub fn select(condition: Self, when_false: Self, when_true: Self) -> Self

Select a value with explicit false/true operand order (SEM-EXPR). Literal branches use smaller operators without dropping unknown inputs.

Source

pub fn operands(&self) -> &[Self]

Direct expression children in evaluation order. Compact Self::Parity stores slots directly; use Self::for_each_input to visit all inputs.

Source

pub fn eval(&self, input: &mut impl FnMut(u32) -> Option<bool>) -> Option<bool>

Fold the expression over three-valued inputs: None (an input that is unevaluable in the caller’s context) propagates. The reference evaluator every consumer shares.

Source

pub fn for_each_input(&self, f: &mut impl FnMut(u32))

Visit every In(slot) leaf, left to right.

Source

pub fn is_linear(&self) -> bool

Whether the expression is XOR-expressible (In/Const/Not/Xor/Parity only). A static backend folds a linear condition into OBSERVABLE_INCLUDE; a nonlinear (And/Or/Select) one needs a dynamic backend.

Trait Implementations§

Source§

impl Clone for ClassicalExpr

Source§

fn clone(&self) -> ClassicalExpr

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for ClassicalExpr

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for ClassicalExpr

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Eq for ClassicalExpr

Source§

impl Hash for ClassicalExpr

Source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

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

Feeds a slice of this type into the given Hasher. Read more
Source§

impl PartialEq for ClassicalExpr

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl Serialize for ClassicalExpr

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl StructuralPartialEq for ClassicalExpr

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
where T: BorrowMut<BorrowedSelf>, BorrowedSelf: BitwiseMut + ?Sized,

§

fn assign_index(&mut self, index: usize, to: bool)

§

fn negate_index(&mut self, index: usize)

§

fn clear_bits(&mut self)

§

fn assign_random( &mut self, bit_count: usize, random_number_generator: &mut impl RngExt, )
where BorrowedSelf: BitLength,

§

impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
where Bits: BorrowMut<BorrowedSelf> + ?Sized, Other: Borrow<BorrowedOther> + ?Sized, BorrowedSelf: Bitwise + BitwisePairMut<BorrowedOther> + ?Sized, BorrowedOther: Bitwise + ?Sized,

§

fn assign(&mut self, other: &Other)

§

fn bitxor_assign(&mut self, other: &Other)

§

fn bitand_assign(&mut self, other: &Other)

§

fn bitor_assign(&mut self, other: &Other)

§

impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
where T: Borrow<BorrowedSelf> + ?Sized, Other: Borrow<BorrowedOther> + ?Sized, BorrowedSelf: Bitwise + BitwisePair<BorrowedOther> + ?Sized, BorrowedOther: Bitwise + ?Sized,

§

fn dot(&self, other: &Other) -> bool

§

fn and_weight(&self, other: &Other) -> usize

§

fn or_weight(&self, other: &Other) -> usize

§

fn xor_weight(&self, other: &Other) -> usize

§

impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
where T: Borrow<BorrowedSelf>, BorrowedSelf: Bitwise + ?Sized,

§

fn index(&self, index: usize) -> bool

§

fn weight(&self) -> usize

§

fn parity(&self) -> bool

§

fn is_zero(&self) -> bool

§

fn is_unit(&self, index: usize) -> bool

§

fn support<'a>(&'a self) -> impl SortedIterator
where BorrowedSelf: 'a,

§

fn max_support(&self) -> Option<usize>

§

fn min_support(&self) -> Option<usize>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.