Struct rustc_middle::ty::OutlivesPredicate
source · [−]pub struct OutlivesPredicate<A, B>(pub A, pub B);
Tuple Fields
0: A
1: B
Trait Implementations
sourceimpl<A: Clone, B: Clone> Clone for OutlivesPredicate<A, B>
impl<A: Clone, B: Clone> Clone for OutlivesPredicate<A, B>
sourcefn clone(&self) -> OutlivesPredicate<A, B>
fn clone(&self) -> OutlivesPredicate<A, B>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<A: Debug, B: Debug> Debug for OutlivesPredicate<A, B>
impl<A: Debug, B: Debug> Debug for OutlivesPredicate<A, B>
sourceimpl<'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>,
sourceimpl<'tcx> Display for OutlivesPredicate<Region<'tcx>, Region<'tcx>>
impl<'tcx> Display for OutlivesPredicate<Region<'tcx>, Region<'tcx>>
sourceimpl<'tcx> Display for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>
impl<'tcx> Display for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>
sourceimpl<'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>,
sourceimpl<A: Hash, B: Hash> Hash for OutlivesPredicate<A, B>
impl<A: Hash, B: Hash> Hash for OutlivesPredicate<A, B>
sourceimpl<'__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
)
sourceimpl<'__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>>
sourceimpl<A: Ord, B: Ord> Ord for OutlivesPredicate<A, B>
impl<A: Ord, B: Ord> Ord for OutlivesPredicate<A, B>
sourcefn cmp(&self, other: &OutlivesPredicate<A, B>) -> Ordering
fn cmp(&self, other: &OutlivesPredicate<A, B>) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl<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>
sourcefn eq(&self, other: &OutlivesPredicate<A, B>) -> bool
fn eq(&self, other: &OutlivesPredicate<A, B>) -> bool
sourceimpl<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>
sourcefn partial_cmp(&self, other: &OutlivesPredicate<A, B>) -> Option<Ordering>
fn partial_cmp(&self, other: &OutlivesPredicate<A, B>) -> Option<Ordering>
1.0.0 · sourcefn 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 moresourceimpl<'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>,
sourceimpl<'tcx, A, B> TypeFoldable<'tcx> for OutlivesPredicate<A, B>where
A: TypeFoldable<'tcx>,
B: TypeFoldable<'tcx>,
impl<'tcx, A, B> TypeFoldable<'tcx> for OutlivesPredicate<A, B>where
A: TypeFoldable<'tcx>,
B: TypeFoldable<'tcx>,
sourcefn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<'tcx, A, B> TypeVisitable<'tcx> for OutlivesPredicate<A, B>where
A: TypeVisitable<'tcx>,
B: TypeVisitable<'tcx>,
impl<'tcx, A, B> TypeVisitable<'tcx> for OutlivesPredicate<A, B>where
A: TypeVisitable<'tcx>,
B: TypeVisitable<'tcx>,
sourcefn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
sourcefn 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. Read moresourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read morefn has_escaping_bound_vars(&self) -> bool
fn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Option<ErrorGuaranteed>
fn has_param_types_or_consts(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_infer_types_or_consts(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
sourcefn 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. Read more
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
sourcefn 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. Read more
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
sourcefn 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. Read moreimpl<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
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> 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). Read more
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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.