Struct rustc_middle::ty::OutlivesPredicate
source · pub struct OutlivesPredicate<A, B>(pub A, pub B);
Expand description
A: B
Tuple Fields§
§0: A
§1: B
Trait Implementations§
source§impl<A: Clone, B: Clone> Clone for OutlivesPredicate<A, B>
impl<A: Clone, B: Clone> Clone for OutlivesPredicate<A, B>
source§fn clone(&self) -> OutlivesPredicate<A, B>
fn clone(&self) -> OutlivesPredicate<A, B>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<'tcx, A, B, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for OutlivesPredicate<A, B>where
A: Decodable<__D>,
B: Decodable<__D>,
impl<'tcx, A, B, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for OutlivesPredicate<A, B>where A: Decodable<__D>, B: Decodable<__D>,
source§impl<'tcx, A, B, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for OutlivesPredicate<A, B>where
A: Encodable<__E>,
B: Encodable<__E>,
impl<'tcx, A, B, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for OutlivesPredicate<A, B>where A: Encodable<__E>, B: Encodable<__E>,
source§impl<'__ctx, A, B> HashStable<StableHashingContext<'__ctx>> for OutlivesPredicate<A, B>where
A: HashStable<StableHashingContext<'__ctx>>,
B: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, A, B> HashStable<StableHashingContext<'__ctx>> for OutlivesPredicate<A, B>where A: HashStable<StableHashingContext<'__ctx>>, B: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'__lifted, A, B> Lift<'__lifted> for OutlivesPredicate<A, B>where
A: Lift<'__lifted>,
B: Lift<'__lifted>,
impl<'__lifted, A, B> Lift<'__lifted> for OutlivesPredicate<A, B>where A: Lift<'__lifted>, B: Lift<'__lifted>,
type Lifted = OutlivesPredicate<<A as Lift<'__lifted>>::Lifted, <B as Lift<'__lifted>>::Lifted>
fn lift_to_tcx( self, __tcx: TyCtxt<'__lifted> ) -> Option<OutlivesPredicate<A::Lifted, B::Lifted>>
source§impl<A: Ord, B: Ord> Ord for OutlivesPredicate<A, B>
impl<A: Ord, B: Ord> Ord for OutlivesPredicate<A, B>
source§fn cmp(&self, other: &OutlivesPredicate<A, B>) -> Ordering
fn cmp(&self, other: &OutlivesPredicate<A, B>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<A: PartialEq, B: PartialEq> PartialEq<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>
impl<A: PartialEq, B: PartialEq> PartialEq<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>
source§fn eq(&self, other: &OutlivesPredicate<A, B>) -> bool
fn eq(&self, other: &OutlivesPredicate<A, B>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<A: PartialOrd, B: PartialOrd> PartialOrd<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>
impl<A: PartialOrd, B: PartialOrd> PartialOrd<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>
source§fn partial_cmp(&self, other: &OutlivesPredicate<A, B>) -> Option<Ordering>
fn partial_cmp(&self, other: &OutlivesPredicate<A, B>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<'tcx, T, U, P: PrettyPrinter<'tcx>> Print<'tcx, P> for OutlivesPredicate<T, U>where
T: Print<'tcx, P, Output = P, Error = P::Error>,
U: Print<'tcx, P, Output = P, Error = P::Error>,
impl<'tcx, T, U, P: PrettyPrinter<'tcx>> Print<'tcx, P> for OutlivesPredicate<T, U>where T: Print<'tcx, P, Output = P, Error = P::Error>, U: Print<'tcx, P, Output = P, Error = P::Error>,
source§impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>
impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>
fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>
source§impl<'tcx, A, B> TypeFoldable<TyCtxt<'tcx>> for OutlivesPredicate<A, B>where
A: TypeFoldable<TyCtxt<'tcx>>,
B: TypeFoldable<TyCtxt<'tcx>>,
impl<'tcx, A, B> TypeFoldable<TyCtxt<'tcx>> for OutlivesPredicate<A, B>where A: TypeFoldable<TyCtxt<'tcx>>, B: TypeFoldable<TyCtxt<'tcx>>,
source§fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F ) -> Result<Self, __F::Error>
source§fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
fn fold_with<F>(self, folder: &mut F) -> Selfwhere F: TypeFolder<I>,
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<'tcx, A, B> TypeVisitable<TyCtxt<'tcx>> for OutlivesPredicate<A, B>where
A: TypeVisitable<TyCtxt<'tcx>>,
B: TypeVisitable<TyCtxt<'tcx>>,
impl<'tcx, A, B> TypeVisitable<TyCtxt<'tcx>> for OutlivesPredicate<A, B>where A: TypeVisitable<TyCtxt<'tcx>>, B: TypeVisitable<TyCtxt<'tcx>>,
source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V ) -> ControlFlow<__V::BreakTy>
impl<A: Copy, B: Copy> Copy for OutlivesPredicate<A, B>
impl<A: Eq, B: Eq> Eq for OutlivesPredicate<A, B>
impl<A, B> StructuralEq for OutlivesPredicate<A, B>
impl<A, B> StructuralPartialEq for OutlivesPredicate<A, B>
Auto Trait Implementations§
impl<A, B> RefUnwindSafe for OutlivesPredicate<A, B>where A: RefUnwindSafe, B: RefUnwindSafe,
impl<A, B> Send for OutlivesPredicate<A, B>where A: Send, B: Send,
impl<A, B> Sync for OutlivesPredicate<A, B>where A: Sync, B: Sync,
impl<A, B> Unpin for OutlivesPredicate<A, B>where A: Unpin, B: Unpin,
impl<A, B> UnwindSafe for OutlivesPredicate<A, B>where A: UnwindSafe, B: UnwindSafe,
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]
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
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
This method turns the parameters of a DepNodeConstructor into an opaque
Fingerprint to be used in DepNode.
Not all DepNodeParams support being turned into a Fingerprint (they
don’t need to if the corresponding DepNode is anonymous).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<'tcx, T> IsSuggestable<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
impl<'tcx, T> IsSuggestable<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> 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> TypeVisitableExt<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>>,
impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>>,
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free.source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if this type has any regions that escape binder
(and
hence are not bound by it).source§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
Return
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_inherent_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_generators(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
“Free” regions in this context means that it has any region
that is not (a) erased or (b) late-bound.
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
Indicates whether this value references only ‘global’
generic parameters that are the same regardless of what fn we are
in. This is used for caching.
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
source§fn has_non_region_late_bound(&self) -> bool
fn has_non_region_late_bound(&self) -> bool
True if there are any late-bound non-region variables
source§fn has_late_bound_vars(&self) -> bool
fn has_late_bound_vars(&self) -> bool
True if there are any late-bound variables
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
Indicates whether this value still has parameters/placeholders/inference variables
which could be replaced later, in a way that would change the results of
impl
specialization.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: &[QueryInfo], _guar: ErrorGuaranteed ) -> T
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.