Struct rustc_middle::ty::OutlivesPredicate

pub struct OutlivesPredicate<A, B>(pub A, pub B);

A: B

Tuple Fields

0: A

1: B

Trait Implementations

impl<A: Clone, B: Clone> Clone for OutlivesPredicate<A, B>

fn clone(&self) -> OutlivesPredicate<A, B>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for OutlivesPredicate<A, B>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, A, B, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for OutlivesPredicate<A, B>where
    A: Decodable<__D>,
    B: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<'tcx> Display for OutlivesPredicate<Region<'tcx>, Region<'tcx>>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx> Display for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, A, B, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for OutlivesPredicate<A, B>where
    A: Encodable<__E>,
    B: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<A: Hash, B: Hash> Hash for OutlivesPredicate<A, B>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

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
)

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>>

impl<A: Ord, B: Ord> Ord for OutlivesPredicate<A, B>

fn cmp(&self, other: &OutlivesPredicate<A, B>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<A: PartialEq, B: PartialEq> PartialEq<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>

fn eq(&self, other: &OutlivesPredicate<A, B>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A: PartialOrd, B: PartialOrd> PartialOrd<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>

fn partial_cmp(&self, other: &OutlivesPredicate<A, B>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

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>,

type Output = P

type Error = Error

fn print(&self, cx: P) -> Result<Self::Output, Self::Error>

impl<'tcx, A, B> TypeFoldable<'tcx> for OutlivesPredicate<A, B>where
    A: TypeFoldable<'tcx>,
    B: TypeFoldable<'tcx>,

fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
    self,
    __folder: &mut __F
) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

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.

impl<'tcx, A, B> TypeVisitable<'tcx> for OutlivesPredicate<A, B>where
    A: TypeVisitable<'tcx>,
    B: TypeVisitable<'tcx>,

fn visit_with<__V: TypeVisitor<'tcx>>(
    &self,
    __visitor: &mut __V
) -> ControlFlow<__V::BreakTy>

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

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.

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).

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.

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) -> 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 needs_infer(&self) -> bool

fn has_placeholders(&self) -> bool

fn needs_subst(&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

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

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.

fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

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.

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>

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.