Struct Resolver 

pub(super) struct Resolver<'a, 'db> {
    ctx: &'a mut WriteBackCtxt<'db>,
    should_normalize: bool,
    nested_goals: &'a mut Vec<Goal<'db, Predicate<'db>>>,
}

Fields

ctx: &'a mut WriteBackCtxt<'db>

should_normalize: bool

Whether we should normalize, disabled when resolving predicates.

nested_goals: &'a mut Vec<Goal<'db, Predicate<'db>>>

Implementations

impl<'a, 'db> Resolver<'a, 'db>

pub(super) fn new( ctx: &'a mut WriteBackCtxt<'db>, should_normalize: bool, nested_goals: &'a mut Vec<Goal<'db, Predicate<'db>>>, ) -> Resolver<'a, 'db>

fn handle_term<T>( &mut self, value: T, outer_exclusive_binder: impl FnOnce(T) -> DebruijnIndex, ) -> T

where T: Into<Term<'db>> + TypeSuperFoldable<DbInterner<'db>> + Copy,

Trait Implementations

impl<'db> TypeFolder<DbInterner<'db>> for Resolver<'_, 'db>

fn cx(&self) -> DbInterner<'db>

fn fold_region(&mut self, r: Region<'db>) -> Region<'db>

fn fold_ty(&mut self, ty: Ty<'db>) -> Ty<'db>

fn fold_const(&mut self, ct: Const<'db>) -> Const<'db>

fn fold_predicate(&mut self, predicate: Predicate<'db>) -> Predicate<'db>

fn fold_binder<T>(&mut self, t: Binder<I, T>) -> Binder<I, T>

where T: TypeFoldable<I>,

fn fold_clauses( &mut self, c: <I as Interner>::Clauses, ) -> <I as Interner>::Clauses