Struct ProofTreeBuilder 

pub(crate) struct ProofTreeBuilder<D, I = I>
where
    D: SolverDelegate<Interner = I>,
    I: Interner,
{
    state: Option<Box<Option<Probe<I>>>>,
    _infcx: PhantomData<D>,
}

We need to know whether to build a prove tree while evaluating. We pass a ProofTreeBuilder with state: Some(None) into the search graph which then causes the initial EvalCtxt::compute_goal to actually build a proof tree which then gets written into the state.

Building the proof tree for a single evaluation step happens via the EvaluationStepBuilder which is updated by the EvalCtxt when appropriate.

Fields

state: Option<Box<Option<Probe<I>>>>

_infcx: PhantomData<D>

Implementations

impl<D: SolverDelegate<Interner = I>, I: Interner> ProofTreeBuilder<D>

pub(crate) fn new() -> ProofTreeBuilder<D>

pub(crate) fn new_noop() -> ProofTreeBuilder<D>

pub(crate) fn is_noop(&self) -> bool

pub(crate) fn new_evaluation_step( &mut self, var_values: CanonicalVarValues<I>, ) -> EvaluationStepBuilder<D>

pub(crate) fn finish_evaluation_step( &mut self, goal_evaluation_step: EvaluationStepBuilder<D>, )

pub(crate) fn unwrap(self) -> Probe<I>

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: 8 bytes