pub(in solve) struct ProofTreeBuilder<I: Interner> {
    state: Option<Box<DebugSolver<I>>>,
}
Expand description

The core data structure when building proof trees.

In case the current evaluation does not generate a proof tree, state is simply None and we avoid any work.

The possible states of the solver are represented via variants of DebugSolver. For any nested computation we call ProofTreeBuilder::new_nested_computation_kind which creates a new ProofTreeBuilder to temporarily replace the current one. Once that nested computation is done, ProofTreeBuilder::nested_computation_kind is called to add the finished nested evaluation to the parent.

We provide additional information to the current state by calling methods such as ProofTreeBuilder::probe_kind.

The actual structure closely mirrors the finished proof trees. At the end of trait solving ProofTreeBuilder::finalize is called to recursively convert the whole structure to a finished proof tree.

Fields§

§state: Option<Box<DebugSolver<I>>>

Implementations§

source§

impl<'tcx> ProofTreeBuilder<TyCtxt<'tcx>>

source

fn new( state: impl Into<DebugSolver<TyCtxt<'tcx>>> ) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

fn nested<T: Into<DebugSolver<TyCtxt<'tcx>>>>( &self, state: impl FnOnce() -> T ) -> Self

source

fn as_mut(&mut self) -> Option<&mut DebugSolver<TyCtxt<'tcx>>>

source

pub fn take_and_enter_probe(&mut self) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn finalize(self) -> Option<GoalEvaluation<TyCtxt<'tcx>>>

source

pub fn new_maybe_root( tcx: TyCtxt<'tcx>, generate_proof_tree: GenerateProofTree ) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn new_root() -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn new_noop() -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn is_noop(&self) -> bool

source

pub(in solve) fn new_goal_evaluation( &mut self, goal: Goal<TyCtxt<'tcx>, Predicate<'tcx>>, orig_values: &[GenericArg<'tcx>], kind: GoalEvaluationKind ) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn new_canonical_goal_evaluation( &mut self, goal: CanonicalInput<TyCtxt<'tcx>> ) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn finalize_evaluation( &mut self, tcx: TyCtxt<'tcx> ) -> Option<&'tcx [GoalEvaluationStep<TyCtxt<'tcx>>]>

source

pub fn canonical_goal_evaluation( &mut self, canonical_goal_evaluation: ProofTreeBuilder<TyCtxt<'tcx>> )

source

pub fn goal_evaluation_kind( &mut self, kind: WipCanonicalGoalEvaluationKind<TyCtxt<'tcx>> )

source

pub fn goal_evaluation( &mut self, goal_evaluation: ProofTreeBuilder<TyCtxt<'tcx>> )

source

pub fn new_goal_evaluation_step( &mut self, var_values: CanonicalVarValues<'tcx>, instantiated_goal: QueryInput<TyCtxt<'tcx>, Predicate<'tcx>> ) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn goal_evaluation_step( &mut self, goal_evaluation_step: ProofTreeBuilder<TyCtxt<'tcx>> )

source

pub fn add_var_value<T: Into<GenericArg<'tcx>>>(&mut self, arg: T)

source

pub fn enter_probe(&mut self)

source

pub fn probe_kind(&mut self, probe_kind: ProbeKind<TyCtxt<'tcx>>)

source

pub fn probe_final_state( &mut self, infcx: &InferCtxt<'tcx>, max_input_universe: UniverseIndex )

source

pub fn add_normalizes_to_goal( &mut self, infcx: &InferCtxt<'tcx>, max_input_universe: UniverseIndex, goal: Goal<TyCtxt<'tcx>, NormalizesTo<'tcx>> )

source

pub fn add_goal( &mut self, infcx: &InferCtxt<'tcx>, max_input_universe: UniverseIndex, source: GoalSource, goal: Goal<TyCtxt<'tcx>, Predicate<'tcx>> )

source

pub(crate) fn record_impl_args( &mut self, infcx: &InferCtxt<'tcx>, max_input_universe: UniverseIndex, impl_args: GenericArgsRef<'tcx> )

source

pub fn make_canonical_response(&mut self, shallow_certainty: Certainty)

source

pub fn finish_probe(self) -> ProofTreeBuilder<TyCtxt<'tcx>>

source

pub fn start_evaluate_added_goals(&mut self)

source

pub fn start_evaluate_added_goals_step(&mut self)

source

pub fn evaluate_added_goals_result( &mut self, result: Result<Certainty, NoSolution> )

source

pub fn query_result(&mut self, result: QueryResult<TyCtxt<'tcx>>)

Auto Trait Implementations§

§

impl<I> DynSend for ProofTreeBuilder<I>

§

impl<I> DynSync for ProofTreeBuilder<I>

§

impl<I> Freeze for ProofTreeBuilder<I>

§

impl<I> RefUnwindSafe for ProofTreeBuilder<I>

§

impl<I> Send for ProofTreeBuilder<I>

§

impl<I> Sync for ProofTreeBuilder<I>

§

impl<I> Unpin for ProofTreeBuilder<I>

§

impl<I> UnwindSafe for ProofTreeBuilder<I>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

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

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

source§

fn upcast(self, interner: I) -> U

source§

impl<I, T> UpcastFrom<I, T> for T

source§

fn upcast_from(from: T, _tcx: I) -> T

source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T
where T: Send + Sync,

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