Struct rustc_trait_selection::traits::structural_match::Search

struct Search<'tcx> {
    span: Span,
    tcx: TyCtxt<'tcx>,
    seen: FxHashSet<DefId>,
    adt_const_param: bool,
}

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

tcx: TyCtxt<'tcx>

seen: FxHashSet<DefId>

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

adt_const_param: bool

Implementations

impl<'tcx> Search<'tcx>

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

Trait Implementations

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

type BreakTy = Ty<'tcx>

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

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

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

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

fn visit_unevaluated(
    &mut self,
    uv: Unevaluated<'tcx, Option<Promoted>>
) -> ControlFlow<Self::BreakTy, ()>

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

fn visit_mir_const(
    &mut self,
    c: ConstantKind<'tcx>
) -> ControlFlow<Self::BreakTy, ()>

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