Struct RecursiveSim

pub struct RecursiveSim<'a, N> { /* private fields */ }

Very simple network simulator. Not so efficient though.

Implementations

impl<'a, N> RecursiveSim<'a, N>

pub fn new(network: &'a N) -> Self

Create a new simulator for the network.

impl<'a, N> RecursiveSim<'a, N>

where N: Network<LogicValue = bool>, N::Signal: EdgeWithInversion,

pub fn simulate( &self, outputs: &'a [N::Signal], inputs: &[N::LogicValue], ) -> impl Iterator<Item = N::LogicValue> + 'a

Simulate the values of the specified outputs given the primary inputs.

Trait Implementations

impl<'a, N> BooleanSystem for RecursiveSim<'a, N>

where N: Network<LogicValue = bool>, N::Signal: EdgeWithInversion + Ord,

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<'a, N: Network> NumInputs for RecursiveSim<'a, N>

fn num_inputs(&self) -> usize

Get the number of inputs of the boolean function.

impl<'a, N: Network> NumOutputs for RecursiveSim<'a, N>

fn num_outputs(&self) -> usize

Get the number of outputs of the boolean function.

impl<'a, N> PartialBooleanSystem for RecursiveSim<'a, N>

where N: Network<LogicValue = bool>, N::Signal: EdgeWithInversion + Ord,

type LiteralId = usize

An identifier for an input of the boolean formula.

type TermId = <N as Network>::Signal

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.