[−][src]Struct monotonic_solver::Solver

pub struct Solver<'a, T, A = ()> {
    pub cache: &'a HashSet<T>,
    pub filter_cache: &'a HashSet<T>,
    pub accelerator: &'a mut A,
}

Solver argument to inference function.

Fields

cache: &'a HashSet<T>

A hash set used check whether a fact has been inferred.

filter_cache: &'a HashSet<T>

A filter cache to filter out facts deliberately.

This is used to e.g. reduce proofs automatically.

accelerator: &'a mut A

Stores acceleration data structures, reused monotonically.

Implementations

impl<'a, T, A> Solver<'a, T, A> where
    T: Hash + Eq, [src]

pub fn can_add(&self, new_expr: &T) -> bool[src]

Returns true if new expression can be added to facts.

Auto Trait Implementations

impl<'a, T, A> RefUnwindSafe for Solver<'a, T, A> where
    A: RefUnwindSafe,
    T: RefUnwindSafe, 

impl<'a, T, A> Send for Solver<'a, T, A> where
    A: Send,
    T: Sync, 

impl<'a, T, A> Sync for Solver<'a, T, A> where
    A: Sync,
    T: Sync, 

impl<'a, T, A> Unpin for Solver<'a, T, A>

impl<'a, T, A = ()> !UnwindSafe for Solver<'a, T, A>

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.