Enum rustc_middle::ty::ExistentialPredicate

pub enum ExistentialPredicate<'tcx> {
    Trait(ExistentialTraitRef<'tcx>),
    Projection(ExistentialProjection<'tcx>),
    AutoTrait(DefId),
}

Variants

Trait(ExistentialTraitRef<'tcx>)

E.g., Iterator.

Projection(ExistentialProjection<'tcx>)

E.g., Iterator::Item = T.

AutoTrait(DefId)

E.g., Send.

Implementations

impl<'tcx> ExistentialPredicate<'tcx>

pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering

Compares via an ordering that will not change if modules are reordered or other changes are made to the tree. In particular, this ordering is preserved across incremental compilations.

Trait Implementations

impl<'tcx> Clone for ExistentialPredicate<'tcx>

fn clone(&self) -> ExistentialPredicate<'tcx>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'tcx> Copy for ExistentialPredicate<'tcx>

impl<'tcx> Debug for ExistentialPredicate<'tcx>

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

Formats the value using the given formatter.

impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for ExistentialPredicate<'tcx>

fn decode(__decoder: &mut __D) -> Result<Self, <__D as Decoder>::Error>

impl<'tcx> Display for ExistentialPredicate<'tcx>

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

Formats the value using the given formatter.

impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for ExistentialPredicate<'tcx>

fn encode(&self, __encoder: &mut __E) -> Result<(), <__E as Encoder>::Error>

impl<'tcx> Eq for ExistentialPredicate<'tcx>

impl<'tcx> Hash for ExistentialPredicate<'tcx>

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, 

Feeds a slice of this type into the given Hasher.

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ExistentialPredicate<'tcx>

fn hash_stable(
    &self,
    __hcx: &mut StableHashingContext<'__ctx>,
    __hasher: &mut StableHasher
)

impl<'a, 'tcx> Lift<'tcx> for ExistentialPredicate<'a>

type Lifted = ExistentialPredicate<'tcx>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Ord for ExistentialPredicate<'tcx>

fn cmp(&self, other: &ExistentialPredicate<'tcx>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<'tcx> PartialEq<ExistentialPredicate<'tcx>> for ExistentialPredicate<'tcx>

fn eq(&self, other: &ExistentialPredicate<'tcx>) -> bool

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

fn ne(&self, other: &ExistentialPredicate<'tcx>) -> bool

This method tests for !=.

impl<'tcx> PartialOrd<ExistentialPredicate<'tcx>> for ExistentialPredicate<'tcx>

fn partial_cmp(&self, other: &ExistentialPredicate<'tcx>) -> Option<Ordering>

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

fn lt(&self, other: &ExistentialPredicate<'tcx>) -> bool

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

fn le(&self, other: &ExistentialPredicate<'tcx>) -> bool

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

fn gt(&self, other: &ExistentialPredicate<'tcx>) -> bool

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

fn ge(&self, other: &ExistentialPredicate<'tcx>) -> bool

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

impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for ExistentialPredicate<'tcx>

type Output = P

type Error = Error

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

impl<'tcx> StructuralEq for ExistentialPredicate<'tcx>

impl<'tcx> StructuralPartialEq for ExistentialPredicate<'tcx>

impl<'tcx> TypeFoldable<'tcx> for ExistentialPredicate<'tcx>

fn super_fold_with<__F: TypeFolder<'tcx>>(&self, __folder: &mut __F) -> Self

fn super_visit_with<__F: TypeVisitor<'tcx>>(
    &self,
    __folder: &mut __F
) -> ControlFlow<()>

fn fold_with<F: TypeFolder<'tcx>>(&self, folder: &mut F) -> Self

fn visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> ControlFlow<()>

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 self has any regions that escape binder (and hence are not bound by it).

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

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.

fn visit_tys_shallow(
    &self,
    visit: impl FnMut(Ty<'tcx>) -> ControlFlow<()>
) -> ControlFlow<()>

A visitor that does not recurse into types, works like fn walk_shallow in Ty.