Struct rustc_trait_selection::traits::structural_match::Search

pub(in traits::structural_match) struct Search<'a, 'tcx> {
    span: Span,
    infcx: InferCtxt<'a, 'tcx>,
    seen: FxHashSet<DefId>,
}

This implements the traversal over the structure of a given type to try to find instances of ADTs (specifically structs or enums) that do not implement the structural-match traits (StructuralPartialEq and StructuralEq).

Fields

span: Span

infcx: InferCtxt<'a, 'tcx>

seen: FxHashSet<DefId>

Tracks ADTs previously encountered during search, so that we will not recur on them again.

Implementations

impl<'a, 'tcx> Search<'a, 'tcx>

pub(in traits::structural_match) fn tcx(
    &self
) -> TyCtxt<'tcx>

pub(in traits::structural_match) fn type_marked_structural(
    &self,
    adt_ty: Ty<'tcx>
) -> bool

Trait Implementations

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

type BreakTy = NonStructuralMatchTy<'tcx>

pub fn visit_ty(&mut self, ty: 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, ()>