Struct rustc_infer::infer::resolve::UnresolvedTypeFinder

pub struct UnresolvedTypeFinder<'a, 'tcx> {
    infcx: &'a InferCtxt<'a, 'tcx>,
}

The unresolved type finder walks a type searching for type variables that don't yet have a value. The first unresolved type is stored. It does not construct the fully resolved type (which might involve some hashing and so forth).

Fields

infcx: &'a InferCtxt<'a, 'tcx>

Implementations

impl<'a, 'tcx> UnresolvedTypeFinder<'a, 'tcx>

pub fn new(infcx: &'a InferCtxt<'a, 'tcx>) -> Self

Trait Implementations

impl<'a, 'tcx> TypeVisitor<'tcx> for UnresolvedTypeFinder<'a, 'tcx>

type BreakTy = (Ty<'tcx>, Option<Span>)

pub fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow<Self::BreakTy>

pub fn visit_binder<T>(
    &mut self,
    t: &Binder<T>
) -> ControlFlow<Self::BreakTy, ()> where
    T: TypeFoldable<'tcx>, 

pub fn visit_region(
    &mut self,
    r: &'tcx RegionKind
) -> ControlFlow<Self::BreakTy, ()>

pub fn visit_const(
    &mut self,
    c: &'tcx Const<'tcx>
) -> ControlFlow<Self::BreakTy, ()>

pub fn visit_predicate(
    &mut self,
    p: Predicate<'tcx>
) -> ControlFlow<Self::BreakTy, ()>