Struct Solver 

pub struct Solver {
    pub array: Vec<TSet>,
    /* private fields */
}

Fields

array: Vec<TSet>

Implementations

impl Solver

pub fn new() -> Solver

pub fn get_set(&self, set_id: TSetId) -> TSet

pub fn get_set_ref(&self, set_id: TSetId) -> &TSet

pub fn get_id(&mut self, inst: TSet) -> TSetId

pub fn has_bit_set(&mut self, set_id: TSetId, idx: usize, bit: u64) -> bool

pub fn pp_collect_ranges(tset: &TSet) -> BTreeSet<(u8, u8)>

pub fn pp_first(&self, tset: &TSet) -> char

pub fn byte_ranges(&self, tset: TSetId) -> Vec<(u8, u8)>

pub fn pp(&self, tset: TSetId) -> String

impl Solver

pub fn full() -> TSet

pub fn empty() -> TSet

pub fn or_id(&mut self, set1: TSetId, set2: TSetId) -> TSetId

pub fn and_id(&mut self, set1: TSetId, set2: TSetId) -> TSetId

pub fn not_id(&mut self, set_id: TSetId) -> TSetId

pub fn is_sat_id(&mut self, set1: TSetId, set2: TSetId) -> bool

pub fn unsat_id(&mut self, set1: TSetId, set2: TSetId) -> bool

pub fn byte_count(&self, set_id: TSetId) -> u32

pub fn collect_bytes(&self, set_id: TSetId) -> Vec<u8>

pub fn single_byte(&self, set_id: TSetId) -> Option<u8>

pub fn is_empty_id(&self, set1: TSetId) -> bool

pub fn is_full_id(&self, set1: TSetId) -> bool

pub fn contains_id(&mut self, large_id: TSetId, small_id: TSetId) -> bool

pub fn u8_to_set_id(&mut self, byte: u8) -> TSetId

pub fn range_to_set_id(&mut self, start: u8, end: u8) -> TSetId

pub fn and(set1: &TSet, set2: &TSet) -> TSet

pub fn is_sat(set1: &TSet, set2: &TSet) -> bool

pub fn or(set1: &TSet, set2: &TSet) -> TSet

pub fn not(set: &TSet) -> TSet

pub fn is_full(set: &TSet) -> bool

pub fn is_empty(set: &TSet) -> bool

pub fn contains(large: &TSet, small: &TSet) -> bool

pub fn u8_to_set(byte: u8) -> TSet

pub fn range_to_set(start: u8, end: u8) -> TSet