Struct rustc_trait_selection::solve::inspect::InspectGoal

pub struct InspectGoal<'a, 'tcx> {
    infcx: &'a SolverDelegate<'tcx>,
    depth: usize,
    orig_values: Vec<GenericArg<'tcx>>,
    goal: Goal<'tcx, Predicate<'tcx>>,
    result: Result<Certainty, NoSolution>,
    evaluation_kind: CanonicalGoalEvaluationKind<TyCtxt<'tcx>>,
    normalizes_to_term_hack: Option<NormalizesToTermHack<'tcx>>,
    source: GoalSource,
}

Fields

infcx: &'a SolverDelegate<'tcx>

depth: usize

orig_values: Vec<GenericArg<'tcx>>

goal: Goal<'tcx, Predicate<'tcx>>

result: Result<Certainty, NoSolution>

evaluation_kind: CanonicalGoalEvaluationKind<TyCtxt<'tcx>>

normalizes_to_term_hack: Option<NormalizesToTermHack<'tcx>>

source: GoalSource

Implementations

impl<'a, 'tcx> InspectGoal<'a, 'tcx>

pub fn infcx(&self) -> &'a InferCtxt<'tcx>

pub fn goal(&self) -> Goal<'tcx, Predicate<'tcx>>

pub fn result(&self) -> Result<Certainty, NoSolution>

pub fn source(&self) -> GoalSource

pub fn depth(&self) -> usize

fn candidates_recur( &'a self, candidates: &mut Vec<InspectCandidate<'a, 'tcx>>, steps: &mut Vec<&'a ProbeStep<TyCtxt<'tcx>>>, probe: &'a Probe<TyCtxt<'tcx>>, )

pub fn candidates(&'a self) -> Vec<InspectCandidate<'a, 'tcx>>

pub fn unique_applicable_candidate( &'a self, ) -> Option<InspectCandidate<'a, 'tcx>>

Returns the single candidate applicable for the current goal, if it exists.

Returns None if there are either no or multiple applicable candidates.

fn new( infcx: &'a InferCtxt<'tcx>, depth: usize, root: GoalEvaluation<TyCtxt<'tcx>>, normalizes_to_term_hack: Option<NormalizesToTermHack<'tcx>>, source: GoalSource, ) -> Self

pub(crate) fn visit_with<V: ProofTreeVisitor<'tcx>>( &self, visitor: &mut V, ) -> V::Result

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