Struct TruthTable 

pub struct TruthTable { /* private fields */ }

A truth table representing a boolean function.

The truth table stores the output for each possible input combination. For n input variables, there are 2^n rows in the table.

Example

use problemreductions::truth_table::TruthTable;

// Create AND gate truth table
let and_gate = TruthTable::from_outputs(2, vec![false, false, false, true]);
assert!(!and_gate.evaluate(&[false, false]));
assert!(!and_gate.evaluate(&[true, false]));
assert!(and_gate.evaluate(&[true, true]));

Implementations

impl TruthTable

pub fn from_outputs(num_inputs: usize, outputs: Vec<bool>) -> Self

Create a truth table from a vector of boolean outputs.

The outputs vector must have exactly 2^num_inputs elements. Index i corresponds to the input where the j-th bit represents variable j.

pub fn from_function<F>(num_inputs: usize, f: F) -> Self

where F: Fn(&[bool]) -> bool,

Create a truth table from a function.

The function takes a slice of booleans (the input) and returns the output.

pub fn num_inputs(&self) -> usize

Get the number of input variables.

pub fn num_rows(&self) -> usize

Get the number of rows (2^num_inputs).

pub fn evaluate(&self, input: &[bool]) -> bool

Evaluate the truth table for a given input.

pub fn evaluate_config(&self, config: &[usize]) -> bool

Evaluate using a usize config (0/1 values).

pub fn outputs(&self) -> &BitVec

Get the output values as a bitvec.

pub fn outputs_vec(&self) -> Vec<bool>

Get all outputs as a vector of bools.

pub fn index_to_input(&self, index: usize) -> Vec<bool>

Get the input configuration for a given row index.

pub fn count_ones(&self) -> usize

Count the number of true outputs.

pub fn count_zeros(&self) -> usize

Count the number of false outputs.

pub fn is_satisfiable(&self) -> bool

Check if the function is satisfiable (has at least one true output).

pub fn is_tautology(&self) -> bool

Check if the function is a tautology (all outputs are true).

pub fn is_contradiction(&self) -> bool

Check if the function is a contradiction (all outputs are false).

pub fn satisfying_assignments(&self) -> Vec<Vec<bool>>

Get all satisfying assignments.

pub fn and(num_inputs: usize) -> Self

Create an AND gate truth table.

pub fn or(num_inputs: usize) -> Self

Create an OR gate truth table.

pub fn not() -> Self

Create a NOT gate truth table (1 input).

pub fn xor(num_inputs: usize) -> Self

Create an XOR gate truth table.

pub fn nand(num_inputs: usize) -> Self

Create a NAND gate truth table.

pub fn nor(num_inputs: usize) -> Self

Create a NOR gate truth table.

pub fn xnor(num_inputs: usize) -> Self

Create an XNOR gate truth table.

pub fn implies() -> Self

Create an implication gate (a -> b = !a OR b). Input 0 is ‘a’, input 1 is ‘b’.

pub fn and_with(&self, other: &TruthTable) -> TruthTable

Combine two truth tables using AND.

pub fn or_with(&self, other: &TruthTable) -> TruthTable

Combine two truth tables using OR.

pub fn negate(&self) -> TruthTable

Negate the truth table.

Trait Implementations

impl Clone for TruthTable

fn clone(&self) -> TruthTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TruthTable

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TruthTable

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for TruthTable

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

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for TruthTable

impl StructuralPartialEq for TruthTable