Struct DecisionTable

pub struct DecisionTable { /* private fields */ }

Implementations

impl DecisionTable

pub fn new<T1, T2>(columns: T2) -> Self

where T1: Into<Domain>, T2: IntoIterator<Item = T1>,

Create a new DecisionTable with rows having specified number of input columns

Examples found in repository

examples/wikipedia2.rs (line 17)

fn without_dont_care_symbol() {
  let boolean_domain = Domain::from(vec!["no", "yes"]);
  let mut table = DecisionTable::new(vec![&boolean_domain, &boolean_domain]);

  table.add(Row::new(vec!["yes", "yes"], "100"));
  table.add(Row::new(vec!["no", "yes"], "100"));
  table.add(Row::new(vec!["yes", "no"], "011"));
  table.add(Row::new(vec!["no", "no"], "001"));

  // Complete!
  print_completeness(&table);

  table.remove(&Row::new(vec!["no", "yes"], "100"));

  // Incomplete!
  print_completeness(&table);
}

examples/wikipedia1.rs (line 17)

fn main() {
  let boolean_domain = Domain::from(vec!["no", "yes"]);
  let mut table = DecisionTable::new(vec![&boolean_domain, &boolean_domain, &boolean_domain]);

  table.add(Row::new(vec!["no", "yes", "no"], "01110"));
  table.add(Row::new(vec!["no", "yes", "yes"], "00011"));
  table.add(Row::new(vec!["no", "no", "no"], "11100"));
  table.add(Row::new(vec!["no", "no", "yes"], "00001"));
  table.add(Row::new(vec!["yes", "yes", "no"], "00100"));
  table.add(Row::new(vec!["yes", "yes", "yes"], "00010"));
  table.add(Row::new(vec!["yes", "no", "no"], "00100"));
  table.add(Row::new(vec!["yes", "no", "yes"], "00000"));

  // Complete!
  print_completeness(&table);

  table.remove(&Row::new(vec!["yes", "no", "yes"], "00000"));

  // Incomplete!
  print_completeness(&table);
}

pub fn columns_len(&self) -> usize

pub fn rows_len(&self) -> usize

pub fn rows<'a>(&'a self) -> impl Iterator<Item = &'a Row>

Iterate through all rows

pub fn contains<'a, T>(&self, input: T) -> bool

where T: Into<&'a Vec<Cell>> + Clone,

pub fn add(&mut self, row: Row)

Examples found in repository

examples/wikipedia2.rs (line 19)

fn without_dont_care_symbol() {
  let boolean_domain = Domain::from(vec!["no", "yes"]);
  let mut table = DecisionTable::new(vec![&boolean_domain, &boolean_domain]);

  table.add(Row::new(vec!["yes", "yes"], "100"));
  table.add(Row::new(vec!["no", "yes"], "100"));
  table.add(Row::new(vec!["yes", "no"], "011"));
  table.add(Row::new(vec!["no", "no"], "001"));

  // Complete!
  print_completeness(&table);

  table.remove(&Row::new(vec!["no", "yes"], "100"));

  // Incomplete!
  print_completeness(&table);
}

examples/wikipedia1.rs (line 19)

fn main() {
  let boolean_domain = Domain::from(vec!["no", "yes"]);
  let mut table = DecisionTable::new(vec![&boolean_domain, &boolean_domain, &boolean_domain]);

  table.add(Row::new(vec!["no", "yes", "no"], "01110"));
  table.add(Row::new(vec!["no", "yes", "yes"], "00011"));
  table.add(Row::new(vec!["no", "no", "no"], "11100"));
  table.add(Row::new(vec!["no", "no", "yes"], "00001"));
  table.add(Row::new(vec!["yes", "yes", "no"], "00100"));
  table.add(Row::new(vec!["yes", "yes", "yes"], "00010"));
  table.add(Row::new(vec!["yes", "no", "no"], "00100"));
  table.add(Row::new(vec!["yes", "no", "yes"], "00000"));

  // Complete!
  print_completeness(&table);

  table.remove(&Row::new(vec!["yes", "no", "yes"], "00000"));

  // Incomplete!
  print_completeness(&table);
}

pub fn remove(&mut self, row: &Row) -> bool

Returns true if the removed row existed

Examples found in repository

examples/wikipedia2.rs (line 27)

fn without_dont_care_symbol() {
  let boolean_domain = Domain::from(vec!["no", "yes"]);
  let mut table = DecisionTable::new(vec![&boolean_domain, &boolean_domain]);

  table.add(Row::new(vec!["yes", "yes"], "100"));
  table.add(Row::new(vec!["no", "yes"], "100"));
  table.add(Row::new(vec!["yes", "no"], "011"));
  table.add(Row::new(vec!["no", "no"], "001"));

  // Complete!
  print_completeness(&table);

  table.remove(&Row::new(vec!["no", "yes"], "100"));

  // Incomplete!
  print_completeness(&table);
}

examples/wikipedia1.rs (line 31)

fn main() {
  let boolean_domain = Domain::from(vec!["no", "yes"]);
  let mut table = DecisionTable::new(vec![&boolean_domain, &boolean_domain, &boolean_domain]);

  table.add(Row::new(vec!["no", "yes", "no"], "01110"));
  table.add(Row::new(vec!["no", "yes", "yes"], "00011"));
  table.add(Row::new(vec!["no", "no", "no"], "11100"));
  table.add(Row::new(vec!["no", "no", "yes"], "00001"));
  table.add(Row::new(vec!["yes", "yes", "no"], "00100"));
  table.add(Row::new(vec!["yes", "yes", "yes"], "00010"));
  table.add(Row::new(vec!["yes", "no", "no"], "00100"));
  table.add(Row::new(vec!["yes", "no", "yes"], "00000"));

  // Complete!
  print_completeness(&table);

  table.remove(&Row::new(vec!["yes", "no", "yes"], "00000"));

  // Incomplete!
  print_completeness(&table);
}

pub fn is_complete(&self) -> bool

Returns true if the table includes every possible combination of inputs.

Examples found in repository

examples/wikipedia1.rs (line 8)

fn print_completeness(table: &DecisionTable) {
  if table.is_complete() {
    println!("Complete!");
  } else {
    println!("Incomplete!");
  }
}

examples/wikipedia2.rs (line 8)

fn print_completeness(table: &DecisionTable) {
  if table.is_complete() {
    println!("Complete!");
  } else {
    println!("Incomplete!");
  }
}