pub struct Glb<'combine, 'infcx, 'tcx> {
fields: &'combine mut CombineFields<'infcx, 'tcx>,
}
Expand description
“Greatest lower bound” (common subtype)
Fields§
§fields: &'combine mut CombineFields<'infcx, 'tcx>
Implementations§
Trait Implementations§
source§impl<'combine, 'infcx, 'tcx> LatticeDir<'infcx, 'tcx> for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> LatticeDir<'infcx, 'tcx> for Glb<'combine, 'infcx, 'tcx>
fn infcx(&self) -> &'infcx InferCtxt<'tcx>
fn cause(&self) -> &ObligationCause<'tcx>
fn relate_bound( &mut self, v: Ty<'tcx>, a: Ty<'tcx>, b: Ty<'tcx> ) -> RelateResult<'tcx, ()>
fn define_opaque_types(&self) -> DefineOpaqueTypes
source§impl<'tcx> ObligationEmittingRelation<'tcx> for Glb<'_, '_, 'tcx>
impl<'tcx> ObligationEmittingRelation<'tcx> for Glb<'_, '_, 'tcx>
fn span(&self) -> Span
source§fn structurally_relate_aliases(&self) -> StructurallyRelateAliases
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>
source§fn register_predicates(
&mut self,
obligations: impl IntoIterator<Item: ToPredicate<'tcx>>
)
fn register_predicates( &mut self, obligations: impl IntoIterator<Item: ToPredicate<'tcx>> )
Register predicates that must hold in order for this relation to hold. Uses
a default obligation cause,
ObligationEmittingRelation::register_obligations
should
be used if control over the obligation causes is required.source§fn register_obligations(&mut self, obligations: PredicateObligations<'tcx>)
fn register_obligations(&mut self, obligations: PredicateObligations<'tcx>)
Register obligations that must hold in order for this relation to hold
source§fn register_type_relate_obligation(&mut self, a: Ty<'tcx>, b: Ty<'tcx>)
fn register_type_relate_obligation(&mut self, a: Ty<'tcx>, b: Ty<'tcx>)
Register
AliasRelate
obligation(s) that both types must be related to each other.source§impl<'tcx> TypeRelation<'tcx> for Glb<'_, '_, 'tcx>
impl<'tcx> TypeRelation<'tcx> for Glb<'_, '_, 'tcx>
fn tcx(&self) -> TyCtxt<'tcx>
source§fn relate_with_variance<T: Relate<'tcx>>(
&mut self,
variance: Variance,
_info: VarianceDiagInfo<'tcx>,
a: T,
b: T
) -> RelateResult<'tcx, T>
fn relate_with_variance<T: Relate<'tcx>>( &mut self, variance: Variance, _info: VarianceDiagInfo<'tcx>, a: T, b: T ) -> RelateResult<'tcx, T>
Switch variance for the purpose of relating
a
and b
.fn tys(&mut self, a: Ty<'tcx>, b: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>>
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<'tcx>,
source§fn relate<T>(&mut self, a: T, b: T) -> Result<T, TypeError<'tcx>>where
T: Relate<'tcx>,
fn relate<T>(&mut self, a: T, b: T) -> Result<T, TypeError<'tcx>>where
T: Relate<'tcx>,
Generic relation routine suitable for most anything.
source§fn relate_item_args(
&mut self,
item_def_id: DefId,
a_arg: &'tcx List<GenericArg<'tcx>>,
b_arg: &'tcx List<GenericArg<'tcx>>
) -> Result<&'tcx List<GenericArg<'tcx>>, TypeError<'tcx>>
fn relate_item_args( &mut self, item_def_id: DefId, a_arg: &'tcx List<GenericArg<'tcx>>, b_arg: &'tcx List<GenericArg<'tcx>> ) -> Result<&'tcx List<GenericArg<'tcx>>, TypeError<'tcx>>
Relate the two args for the given item. The default
is to look up the variance for the item and proceed
accordingly.
Auto Trait Implementations§
impl<'combine, 'infcx, 'tcx> !DynSend for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> !DynSync for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> Freeze for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> !RefUnwindSafe for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> !Send for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> !Sync for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> Unpin for Glb<'combine, 'infcx, 'tcx>
impl<'combine, 'infcx, 'tcx> !UnwindSafe for Glb<'combine, 'infcx, 'tcx>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
§impl<T> Filterable for T
impl<T> Filterable for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
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: 8 bytes