Struct AigNode 

pub struct AigNode { /* private fields */ }

Node in the and-inverter graph.

Trait Implementations

impl Clone for AigNode

fn clone(&self) -> AigNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AigNode

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

Formats the value using the given formatter.

impl Hash for AigNode

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 IntoIterator for AigNode

type Item = NodeId

The type of the elements being iterated over.

type IntoIter = IntoIter<NodeId, 2>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl MutNetworkNode for AigNode

fn set_input(&mut self, i: usize, signal: Self::NodeId)

Set the input of a node.

impl MutNetworkNodeWithReferenceCount for AigNode

fn reference(&mut self)

Increment the reference counter.

fn dereference(&mut self)

Decrement the reference counter.

impl NetworkNode for AigNode

type NodeId = NodeId

ID type used to identify nodes in the network.

fn num_inputs(&self) -> usize

Get the number of inputs into this node.

fn get_input(&self, i: usize) -> Self::NodeId

Get the i-th input.

fn function(&self) -> SmallTruthTable

Get the logic function of the node.

fn normalized(self) -> SimplifyResult<Self, Self::NodeId>

Bring the node into a canonical form by reordering and inverting the inputs (if possible). This increases the effectiveness of structural hashing.

impl NetworkNodeWithReferenceCount for AigNode

fn num_references(&self) -> usize

Get the number of references to this node.

impl Ord for AigNode

fn cmp(&self, other: &AigNode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for AigNode

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

fn partial_cmp(&self, other: &AigNode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for AigNode

impl Eq for AigNode

impl StructuralPartialEq for AigNode