Struct LutNode 

pub struct LutNode<NodeId> { /* private fields */ }

Step of a boolean chain. The operator implemented by the step is represented by a truth-table.

Implementations

impl<NodeId> LutNode<NodeId>

pub fn new(truth_table: SmallTruthTable, inputs: SmallVec<[NodeId; 6]>) -> Self

Create a new k-LUT node. The node function is specified by the truth_table.

Trait Implementations

impl<NodeId: Clone> Clone for LutNode<NodeId>

fn clone(&self) -> LutNode<NodeId>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<NodeId: Hash> Hash for LutNode<NodeId>

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<NodeId> IntoIterator for LutNode<NodeId>

type Item = NodeId

The type of the elements being iterated over.

type IntoIter = IntoIter<[NodeId; 6]>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<NodeId: IdType + EdgeWithInversion> MutNetworkNodeWithReferenceCount for LutNode<NodeId>

fn reference(&mut self)

Increment the reference counter.

fn dereference(&mut self)

Decrement the reference counter.

impl<NodeId: IdType + EdgeWithInversion> NetworkNode for LutNode<NodeId>

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<NodeId: IdType + EdgeWithInversion> NetworkNodeWithReferenceCount for LutNode<NodeId>

fn num_references(&self) -> usize

Get the number of references to this node.

impl<NodeId: PartialEq> PartialEq for LutNode<NodeId>

fn eq(&self, other: &LutNode<NodeId>) -> 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<NodeId: Eq> Eq for LutNode<NodeId>

impl<NodeId> StructuralPartialEq for LutNode<NodeId>