Struct Accelerator

pub struct Accelerator<T: Symbol> {
    pub index: HashMap<Expr<T>, Vec<usize>>,
    pub len: usize,
    pub last_rule: Option<usize>,
}

Index of sub-expressions.

Fields

index: HashMap<Expr<T>, Vec<usize>>

Index for each sub-expression.

len: usize

The number of facts that has been indexed.

last_rule: Option<usize>

The index of the last rule.

Implementations

impl<T: Symbol> Accelerator<T>

pub fn new() -> Accelerator<T>

Creates a new accelerator.

pub fn constructor() -> fn(&[Expr<T>], &[Expr<T>]) -> Accelerator<T>

Returns a constructor for solve-and-reduce.

pub fn update(&mut self, facts: &[Expr<T>])

where T: Clone + Hash + Eq,

Updates the accelerator with list of facts.