Struct hax_frontend_exporter::PredicateSearcher

pub struct PredicateSearcher<'tcx> {
    tcx: TyCtxt<'tcx>,
    param_env: ParamEnv<'tcx>,
    candidates: HashMap<PolyTraitPredicate<'tcx>, Candidate<'tcx>>,
}

Stores a set of predicates along with where they came from.

Fields

tcx: TyCtxt<'tcx>

param_env: ParamEnv<'tcx>

candidates: HashMap<PolyTraitPredicate<'tcx>, Candidate<'tcx>>

Local clauses available in the current context.

Implementations

impl<'tcx> PredicateSearcher<'tcx>

pub fn new_for_owner(tcx: TyCtxt<'tcx>, owner_id: DefId) -> Self

Initialize the elaborator with the predicates accessible within this item.

fn extend(&mut self, candidates: impl IntoIterator<Item = Candidate<'tcx>>)

Insert new candidates and all their parent predicates. This deduplicates predicates to avoid divergence.

fn extend_parents(&mut self, new_candidates: Vec<Candidate<'tcx>>)

Add the parents of these candidates. This is a separate function to avoid polymorphic recursion due to the closures capturing the type parameters of this function.

fn add_associated_type_refs( &mut self, ty: Binder<'tcx, Ty<'tcx>>, warn: &impl Fn(&str), ) -> Result<(), String>

If the type is a trait associated type, we add any relevant bounds to our context.

fn resolve_local( &mut self, target: PolyTraitPredicate<'tcx>, warn: &impl Fn(&str), ) -> Result<Option<Candidate<'tcx>>, String>

Resolve a local clause by looking it up in this set. If the predicate applies to an associated type, we add the relevant implied associated type bounds to the set as well.

pub fn resolve( &mut self, tref: &PolyTraitRef<'tcx>, warn: &impl Fn(&str), ) -> Result<ImplExpr<'tcx>, String>

Resolve the given trait reference in the local context.