Struct LogicNetwork 

pub struct LogicNetwork<Node> { /* private fields */ }

An implementation of logic networks which is parameterized with the type of the logic node.

Implementations

impl<Node> LogicNetwork<Node>

pub fn new() -> Self

Create a new and empty logic network.

impl<Node> LogicNetwork<Node>

pub fn get_node(&self, node_id: NodeId) -> GeneralNode<&Node>

Get the node value of the given node_id.

pub fn get_logic_node_mut(&mut self, node_id: NodeId) -> Option<&mut Node>

Get a mutable reference to the logic node with the given ID. Returns None if the node is an input, a constant or non-existent.

Trait Implementations

impl<Node> BooleanSystem for LogicNetwork<Node>

where Node: NetworkNode<NodeId = NodeId>,

fn evaluate_term(&self, term: &Self::TermId, input_values: &[bool]) -> bool

Compute the value of the term. The values of all needed literals must be defined by the input_values function.

impl<Node: Clone> Clone for LogicNetwork<Node>

fn clone(&self) -> LogicNetwork<Node>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Node: Default> Default for LogicNetwork<Node>

fn default() -> LogicNetwork<Node>

Returns the “default value” for a type.

impl<Node> Network for LogicNetwork<Node>

where Node: NetworkNode<NodeId = NodeId>,

type Node = Node

Type of the logic node.

type NodeId = NodeId

Identifier of a logic node in this network.

type Signal = NodeId

Type which represents the outputs of network nodes, e.g. signals. In contrast to a NodeId a Signal might also encode a logic inversion.

type LogicValue = bool

Type of signal values. Typically this might be bool.

type NodeFunction = SmallTruthTable

Type which represents the logic function of nodes in the network.

fn num_gates(&self) -> usize

Number of gates present in the network.

fn num_primary_inputs(&self) -> usize

Number of input into the network.

fn num_primary_outputs(&self) -> usize

Number of outputs from the network.

fn foreach_gate(&self, f: impl Fn(Self::Signal))

Visit all network gates in an undefined order. Each gate is visited exactly once.

fn foreach_node(&self, f: impl Fn(&Self::Node))

Visit all logic nodes.

fn get_constant(&self, value: Self::LogicValue) -> Self::Signal

Get a graph signal which represents the constant value.

fn get_constant_value(&self, signal: Self::Signal) -> Option<Self::LogicValue>

Get the value of a signal if it is a constant.

fn get_node_input( &self, node: &Self::Signal, input_index: usize, ) -> Self::Signal

Get an input value of a node.

fn get_source_node(&self, signal: &Self::Signal) -> Self::NodeId

Get the node which computes a signal.

fn get_primary_input(&self, index: usize) -> Self::Signal

Get a primary input by its index.

fn get_primary_output(&self, index: usize) -> Self::Signal

Get a primary output by its index.

fn is_constant(&self, signal: Self::Signal) -> bool

Tell if the signal is directly connected to a constant.

fn is_input(&self, signal: Self::Signal) -> bool

Check if the signal is a primary input.

fn node_function(&self, node: Self::Signal) -> Self::NodeFunction

Get the logic function implemented by the given node.

fn num_node_inputs(&self, node: &Self::Signal) -> usize

Number of inputs into the given node.

fn get_node_output(&self, node: &Self::NodeId) -> Self::Signal

Get the output signal of a node.

impl<Node> NetworkEdit for LogicNetwork<Node>

where Node: NetworkNode<NodeId = NodeId> + Hash + Eq + MutNetworkNodeWithReferenceCount + IntoIterator<Item = NodeId>,

fn create_primary_input(&mut self) -> Self::Signal

Create a new input into the network.

fn create_primary_output(&mut self, signal: Self::Signal) -> Self::Signal

Create an output of the network.

fn substitute(&mut self, old: Self::Signal, new: Self::Signal)

Substitute the old signal with the new signal in all nodes.

fn create_node(&mut self, node: Self::Node) -> Self::NodeId

Insert a new node into the network. Returns the ID of the new node. This function can also return IDs that already existed before. For example if there is already a node with the same inputs.

fn foreach_node_mut(&mut self, f: impl Fn(&mut Self::Node))

Visit all logic nodes as mutable references.

impl<Node> NumInputs for LogicNetwork<Node>

fn num_inputs(&self) -> usize

Get the number of inputs of the boolean function.

impl<Node> NumOutputs for LogicNetwork<Node>

fn num_outputs(&self) -> usize

Get the number of outputs of the boolean function.

impl<Node> PartialBooleanSystem for LogicNetwork<Node>

where Node: NetworkNode<NodeId = NodeId>,

type LiteralId = NodeId

An identifier for an input of the boolean formula.

type TermId = NodeId

An identifier of an intermediate value or output.

fn evaluate_term_partial( &self, term: &Self::TermId, input_values: &[bool], ) -> Option<bool>

Compute the value of the term. The values of all needed literals must be defined by the input_values function. Returns None if the value is not specified for the given inputs.

impl<Node> ReferenceCounted for LogicNetwork<Node>

where Node: NetworkNode<NodeId = NodeId> + NetworkNodeWithReferenceCount,

fn num_references(&self, a: Self::Signal) -> usize

Count the number of nodes which have the signal a in their fan-in.