Struct SearchGraph 

pub struct SearchGraph<D, X = X>
where
    D: Delegate<Cx = X>,
    X: Cx,
{
    root_depth: AvailableDepth,
    stack: Stack<X>,
    provisional_cache: HashMap<<X as Cx>::Input, Vec<ProvisionalCacheEntry<X>>, FxBuildHasher>,
    _marker: PhantomData<D>,
}

Fields

root_depth: AvailableDepth

stack: Stack<X>

provisional_cache: HashMap<<X as Cx>::Input, Vec<ProvisionalCacheEntry<X>>, FxBuildHasher>

_marker: PhantomData<D>

Implementations

impl<D, X> SearchGraph<D, X>

where D: Delegate<Cx = X>, X: Cx,

pub fn new(root_depth: usize) -> SearchGraph<D, X>

pub fn is_empty(&self) -> bool

pub fn debug_current_depth(&self) -> usize

The number of goals currently in the search graph. This should only be used for debugging purposes.

pub fn enter_single_candidate(&mut self)

pub fn finish_single_candidate(&mut self) -> CandidateHeadUsages

pub fn ignore_candidate_head_usages(&mut self, usages: CandidateHeadUsages)

pub fn evaluate_root_goal_for_proof_tree( cx: X, root_depth: usize, input: <X as Cx>::Input, inspect: &mut <D as Delegate>::ProofTreeBuilder, ) -> <X as Cx>::Result

pub fn evaluate_goal( &mut self, cx: X, input: <X as Cx>::Input, step_kind_from_parent: PathKind, inspect: &mut <D as Delegate>::ProofTreeBuilder, ) -> <X as Cx>::Result

Probably the most involved method of the whole solver.

While goals get computed via D::compute_goal, this function handles caching, overflow, and cycles.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 64 bytes