ExistentialPredicate in rustc_trait_selection::infer::canonical::ir - Rust
Description: API documentation for the Rust `ExistentialPredicate` enum in crate `rustc_trait_selection`.

Skip to main content

## ExistentialPredicate

# Enum ExistentialPredicate

Source

    pub enum ExistentialPredicate<I>where
        I: Interner,{
        Trait(ExistentialTraitRef<I>),
        Projection(ExistentialProjection<I>),
        AutoTrait(<I as Interner>::TraitId),
    }

## Variants§

§

### Trait(ExistentialTraitRef<I>)

E.g., `Iterator`.

§

### Projection(ExistentialProjection<I>)

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

§

### AutoTrait(<I as Interner>::TraitId)

E.g., `Send`.

## Trait Implementations§

Source§

### impl<I> Clone for ExistentialPredicate<I>
where I: Interner,

Source§

#### fn clone(&self) -> ExistentialPredicate<I>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from `source`. Read more
Source§

### impl<I> Debug for ExistentialPredicate<I>
where I: Interner,

Source§

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

Formats the value using the given formatter. Read more
Source§

### impl<I, __D> Decodable<__D> for ExistentialPredicate<I>
where I: Interner, __D: Decoder, ExistentialTraitRef<I>: Decodable<__D>, ExistentialProjection<I>: Decodable<__D>, <I as Interner>::TraitId: Decodable<__D>,

Source§

#### fn decode(__decoder: &mut __D) -> ExistentialPredicate<I>

Source§

### impl<I, __E> Encodable<__E> for ExistentialPredicate<I>
where I: Interner, __E: Encoder, ExistentialTraitRef<I>: Encodable<__E>, ExistentialProjection<I>: Encodable<__E>, <I as Interner>::TraitId: Encodable<__E>,

Source§

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

Source§

### impl<'tcx> ExistentialPredicateStableCmpExt<'tcx> for ExistentialPredicate<TyCtxt<'tcx>>

Source§

#### fn stable_cmp( &self, tcx: TyCtxt<'tcx>, other: &ExistentialPredicate<TyCtxt<'tcx>>, ) -> 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.

Source§

### impl<I> Hash for ExistentialPredicate<I>
where I: Interner,

Source§

#### fn hash<__H>(&self, __state: &mut __H)
where __H: Hasher,

Feeds this value into the given `Hasher`. Read more
1.3.0 · Source§

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

Feeds a slice of this type into the given `Hasher`. Read more
Source§

### impl<I, J> Lift<J> for ExistentialPredicate<I>
where I: Interner, J: Interner, ExistentialTraitRef<I>: Lift<J, Lifted = ExistentialTraitRef<J>>, ExistentialProjection<I>: Lift<J, Lifted = ExistentialProjection<J>>, <I as Interner>::TraitId: Lift<J, Lifted = <J as Interner>::TraitId>,

Source§

#### type Lifted = ExistentialPredicate<J>

Source§

#### fn lift_to_interner(self, interner: J) -> ExistentialPredicate<J>

Source§

### impl<I> PartialEq for ExistentialPredicate<I>
where I: Interner,

Source§

#### fn eq(&self, __other: &ExistentialPredicate<I>) -> bool

Tests for `self` and `other` values to be equal, and is used by `==`.
1.0.0 (const: unstable) · Source§

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

Tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

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

Source§

#### fn print(&self, p: &mut P) -> Result<(), Error>

Source§

### impl<I> StableHash for ExistentialPredicate<I>
where I: Interner, ExistentialTraitRef<I>: StableHash, ExistentialProjection<I>: StableHash, <I as Interner>::TraitId: StableHash,

Source§

#### fn stable_hash<__Hcx>( &self, __hcx: &mut __Hcx, __hasher: &mut StableHasher<SipHasher128>, )
where __Hcx: StableHashCtxt,

Source§

### impl<I> TypeFoldable<I> for ExistentialPredicate<I>
where I: Interner, ExistentialTraitRef<I>: TypeFoldable<I>, ExistentialProjection<I>: TypeFoldable<I>, <I as Interner>::TraitId: TypeFoldable<I>,

Source§

#### fn try_fold_with<__F>( self, __folder: &mut __F, ) -> Result<ExistentialPredicate<I>, <__F as FallibleTypeFolder<I>>::Error>
where __F: FallibleTypeFolder<I>,

The entry point for folding. To fold a value `t` with a folder `f` call: `t.try_fold_with(f)`. Read more
Source§

#### fn fold_with<__F>(self, __folder: &mut __F) -> ExistentialPredicate<I>
where __F: TypeFolder<I>,

The entry point for folding. To fold a value `t` with a folder `f` call: `t.fold_with(f)`. Read more
Source§

### impl<I> TypeVisitable<I> for ExistentialPredicate<I>
where I: Interner, ExistentialTraitRef<I>: TypeVisitable<I>, ExistentialProjection<I>: TypeVisitable<I>, <I as Interner>::TraitId: TypeVisitable<I>,

Source§

#### fn visit_with<__V>( &self, __visitor: &mut __V, ) -> <__V as TypeVisitor<I>>::Result
where __V: TypeVisitor<I>,

The entry point for visiting. To visit a value `t` with a visitor `v` call: `t.visit_with(v)`. Read more
Source§

### impl<I> Copy for ExistentialPredicate<I>
where I: Interner,

Source§

### impl<I> Eq for ExistentialPredicate<I>
where I: Interner,

## Auto Trait Implementations§

§

### impl<I> DynSend for ExistentialPredicate<I>
where <I as Interner>::TraitId: DynSend, <I as Interner>::GenericArgs: DynSend, <I as Interner>::TraitAssocTermId: DynSend, <I as Interner>::Term: DynSend,

§

### impl<I> DynSync for ExistentialPredicate<I>
where <I as Interner>::TraitId: DynSync, <I as Interner>::GenericArgs: DynSync, <I as Interner>::TraitAssocTermId: DynSync, <I as Interner>::Term: DynSync,

§

### impl<I> Freeze for ExistentialPredicate<I>
where <I as Interner>::TraitId: Freeze, <I as Interner>::GenericArgs: Freeze, <I as Interner>::TraitAssocTermId: Freeze, <I as Interner>::Term: Freeze,

§

### impl<I> RefUnwindSafe for ExistentialPredicate<I>
where <I as Interner>::TraitId: RefUnwindSafe, <I as Interner>::GenericArgs: RefUnwindSafe, <I as Interner>::TraitAssocTermId: RefUnwindSafe, <I as Interner>::Term: RefUnwindSafe,

§

### impl<I> Send for ExistentialPredicate<I>
where <I as Interner>::TraitId: Send, <I as Interner>::GenericArgs: Send, <I as Interner>::TraitAssocTermId: Send, <I as Interner>::Term: Send,

§

### impl<I> Sync for ExistentialPredicate<I>
where <I as Interner>::TraitId: Sync, <I as Interner>::GenericArgs: Sync, <I as Interner>::TraitAssocTermId: Sync, <I as Interner>::Term: Sync,

§

### impl<I> Unpin for ExistentialPredicate<I>
where <I as Interner>::TraitId: Unpin, <I as Interner>::GenericArgs: Unpin, <I as Interner>::TraitAssocTermId: Unpin, <I as Interner>::Term: Unpin,

§

### impl<I> UnsafeUnpin for ExistentialPredicate<I>
where <I as Interner>::TraitId: UnsafeUnpin, <I as Interner>::GenericArgs: UnsafeUnpin, <I as Interner>::TraitAssocTermId: UnsafeUnpin, <I as Interner>::Term: UnsafeUnpin,

§

### impl<I> UnwindSafe for ExistentialPredicate<I>
where <I as Interner>::TraitId: UnwindSafe, <I as Interner>::GenericArgs: UnwindSafe, <I as Interner>::TraitAssocTermId: UnwindSafe, <I as Interner>::Term: UnwindSafe,

## Blanket Implementations§

Source§

### impl<T> Aligned for T

Source§

#### const ALIGN: Alignment

Alignment of `Self`.
Source§

### impl<T> Any for T
where T: 'static + ?Sized,

Source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
Source§

### impl<T> AnyEq for T
where T: Any + PartialEq,

Source§

#### fn equals(&self, other: &(dyn Any + 'static)) -> bool

Source§

#### fn as_any(&self) -> &(dyn Any + 'static)

Source§

### impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

Source§

#### fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T

Source§

#### fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]

Source§

### impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

Source§

#### fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T

Source§

#### fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]

Source§

### impl<T> Borrow<T> for T
where T: ?Sized,

Source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

### impl<T> CloneToUninit for T
where T: Clone,

Source§

#### unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (`clone_to_uninit`)
Performs copy-assignment from `self` to `dest`. Read more
Source§

### impl<T, R> CollectAndApply<T, R> for T

Source§

#### fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to `f(&iter.collect::<Vec<_>>())`.

Source§

#### type Output = R

Source§

### impl<'tcx, T> DepNodeKey<'tcx> for T
where T: StableHash + Debug,

Source§

#### default fn key_fingerprint_style() -> KeyFingerprintStyle

Source§

#### default fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns a query key into an opaque `Fingerprint` to be used in `DepNode`.
Source§

#### default fn try_recover_key(_: TyCtxt<'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<T> DynClone for T
where T: Clone,

Source§

#### fn __clone_box(&self, _: Private) -> *mut ()

Source§

### impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

### impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

### impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

#### fn equivalent(&self, key: &K) -> bool

Compare self to `key` and return `true` if they are equal.
Source§

### impl<T> From<T> for T

Source§

#### fn from(t: T) -> T

Returns the argument unchanged.

Source§

### impl<T> Instrument for T

Source§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided `Span`, returning an `Instrumented` wrapper. Read more
Source§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
Source§

### impl<T, U> Into<U> for T
where U: From<T>,

Source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

Source§

### impl<T> IntoEither for T

Source§

#### fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts `self` into a `Left` variant of `Either<Self, Self>` if `into_left` is `true`. Converts `self` into a `Right` variant of `Either<Self, Self>` otherwise. Read more
Source§

#### fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts `self` into a `Left` variant of `Either<Self, Self>` if `into_left(&self)` returns `true`. Converts `self` into a `Right` variant of `Either<Self, Self>` otherwise. Read more
Source§

### impl<K> IntoQueryKey<K> for K

Source§

#### fn into_query_key(self) -> K

Argument conversion from `Self` to `K`. This should always be a very cheap conversion, e.g. `LocalDefId::to_def_id`.
Source§

### impl<'tcx, T> IsSuggestable<'tcx> for T
where T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,

Source§

#### fn is_suggestable(self, tcx: TyCtxt<'tcx>, infer_suggestable: bool) -> bool

Whether this makes sense to suggest in a diagnostic. Read more
Source§

#### fn make_suggestable( self, tcx: TyCtxt<'tcx>, infer_suggestable: bool, placeholder: Option<Ty<'tcx>>, ) -> Option<T>

Source§

### impl<T> MaybeResult<T> for T

Source§

#### type Error = !

Source§

#### fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

Source§

#### fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

Source§

### impl<T> Pointable for T

Source§

#### const ALIGN: usize

The alignment of pointer.
Source§

#### type Init = T

The type for initializers.
Source§

#### unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

#### unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

#### unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

### impl<T> Same for T

Source§

#### type Output = T

Should always be `Self`
Source§

### impl<T> ToOwned for T
where T: Clone,

Source§

#### type Owned = T

The resulting type after obtaining ownership.
Source§

#### fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

#### fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

#### type Error = Infallible

The type returned in the event of a conversion error.
Source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

### impl<I, T> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

Source§

#### fn has_type_flags(&self, flags: TypeFlags) -> bool

Source§

#### 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 error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>

Source§

#### fn non_region_error_reported( &self, ) -> Result<(), <I as Interner>::ErrorGuaranteed>

Source§

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

Returns `true` if this type has regions that are not a part of the type. For example, given a `for<'a> fn(&'a i32)` this function returns `false`, while given a `fn(&'a i32)` it returns `true`. The latter can occur when traversing through the former. Read more
Source§

#### fn has_aliases(&self) -> bool

Source§

#### fn has_opaque_types(&self) -> bool

Source§

#### fn has_coroutines(&self) -> bool

Source§

#### fn references_error(&self) -> bool

Source§

#### fn has_non_region_param(&self) -> bool

Source§

#### fn has_regions(&self) -> bool

Source§

#### fn has_infer_regions(&self) -> bool

Source§

#### fn has_infer_types(&self) -> bool

Source§

#### fn has_non_region_infer(&self) -> bool

Source§

#### fn has_infer(&self) -> bool

Source§

#### fn has_placeholders(&self) -> bool

Source§

#### fn has_non_region_placeholders(&self) -> bool

Source§

#### fn has_param(&self) -> bool

Source§

#### 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.
Source§

#### fn has_erased_regions(&self) -> bool

Source§

#### fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.
Source§

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

True if there are any late-bound regions
Source§

#### fn has_non_region_bound_vars(&self) -> bool

True if there are any late-bound non-region variables
Source§

#### fn has_bound_vars(&self) -> bool

True if there are any bound variables
Source§

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

#### fn has_non_region_error(&self) -> bool

True if a type or const error is reachable
Source§

### impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

#### fn upcast(self, interner: I) -> U

Source§

### impl<I, T> UpcastFrom<I, T> for T

Source§

#### fn upcast_from(from: T, _tcx: I) -> T

Source§

### impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

#### fn vzip(self) -> V

Source§

### impl<T> WithSubscriber for T

Source§

#### fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

### impl<T> ErasedDestructor for T
where T: 'static,

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