Struct LatticeOp

pub(crate) struct LatticeOp<'infcx, 'tcx> {
    infcx: &'infcx InferCtxt<'tcx>,
    trace: TypeTrace<'tcx>,
    param_env: ParamEnv<'tcx>,
    kind: LatticeOpKind,
    obligations: Vec<PredicateObligation<'tcx>>,
}

A greatest lower bound“ (common subtype) or least upper bound (common supertype).

Fields

infcx: &'infcx InferCtxt<'tcx>

trace: TypeTrace<'tcx>

param_env: ParamEnv<'tcx>

kind: LatticeOpKind

obligations: Vec<PredicateObligation<'tcx>>

Implementations

impl<'infcx, 'tcx> LatticeOp<'infcx, 'tcx>

pub(crate) fn new( infcx: &'infcx InferCtxt<'tcx>, trace: TypeTrace<'tcx>, param_env: ParamEnv<'tcx>, kind: LatticeOpKind, ) -> LatticeOp<'infcx, 'tcx>

pub(crate) fn into_obligations(self) -> Vec<PredicateObligation<'tcx>>

impl<'infcx, 'tcx> LatticeOp<'infcx, 'tcx>

fn relate_bound( &mut self, v: Ty<'tcx>, a: Ty<'tcx>, b: Ty<'tcx>, ) -> RelateResult<'tcx, ()>

Trait Implementations

impl<'tcx> PredicateEmittingRelation<InferCtxt<'tcx>> for LatticeOp<'_, 'tcx>

fn span(&self) -> Span

fn structurally_relate_aliases(&self) -> StructurallyRelateAliases

Whether aliases should be related structurally. This is pretty much always No unless you’re equating in some specific locations of the new solver. See the comments in these use-cases for more details.

fn param_env(&self) -> ParamEnv<'tcx>

fn register_predicates( &mut self, preds: impl IntoIterator<Item: Upcast<TyCtxt<'tcx>, Predicate<'tcx>>>, )

Register predicates that must hold in order for this relation to hold. This uses the default param_env of the obligation.

fn register_goals( &mut self, goals: impl IntoIterator<Item = Goal<'tcx, Predicate<'tcx>>>, )

Register obligations that must hold in order for this relation to hold

fn register_alias_relate_predicate(&mut self, a: Ty<'tcx>, b: Ty<'tcx>)

Register AliasRelate obligation(s) that both types must be related to each other.

impl<'tcx> TypeRelation<TyCtxt<'tcx>> for LatticeOp<'_, 'tcx>

fn tys(&mut self, a: Ty<'tcx>, b: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>>

Relates two types using a given lattice.

fn cx(&self) -> TyCtxt<'tcx>

fn relate_with_variance<T: Relate<TyCtxt<'tcx>>>( &mut self, variance: Variance, _info: VarianceDiagInfo<TyCtxt<'tcx>>, a: T, b: T, ) -> RelateResult<'tcx, T>

Switch variance for the purpose of relating a and b.

fn regions( &mut self, a: Region<'tcx>, b: Region<'tcx>, ) -> RelateResult<'tcx, Region<'tcx>>

fn consts( &mut self, a: Const<'tcx>, b: Const<'tcx>, ) -> RelateResult<'tcx, Const<'tcx>>

fn binders<T>( &mut self, a: Binder<'tcx, T>, b: Binder<'tcx, T>, ) -> RelateResult<'tcx, Binder<'tcx, T>>

where T: Relate<TyCtxt<'tcx>>,

fn relate<T>(&mut self, a: T, b: T) -> Result<T, TypeError<I>>

where T: Relate<I>,

Generic relation routine suitable for most anything.

fn relate_item_args( &mut self, item_def_id: <I as Interner>::DefId, a_arg: <I as Interner>::GenericArgs, b_arg: <I as Interner>::GenericArgs, ) -> Result<<I as Interner>::GenericArgs, TypeError<I>>

Relate the two args for the given item. The default is to look up the variance for the item and proceed accordingly.

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