Enum rustc_middle::ty::sty::BoundVariableKind
source · pub enum BoundVariableKind {
Ty(BoundTyKind),
Region(BoundRegionKind),
Const,
}
Variants§
Implementations§
source§impl BoundVariableKind
impl BoundVariableKind
pub fn expect_region(self) -> BoundRegionKind
pub fn expect_ty(self) -> BoundTyKind
pub fn expect_const(self)
Trait Implementations§
source§impl Clone for BoundVariableKind
impl Clone for BoundVariableKind
source§fn clone(&self) -> BoundVariableKind
fn clone(&self) -> BoundVariableKind
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 Debug for BoundVariableKind
impl Debug for BoundVariableKind
source§impl Hash for BoundVariableKind
impl Hash for BoundVariableKind
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for BoundVariableKind
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for BoundVariableKind
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl Ord for BoundVariableKind
impl Ord for BoundVariableKind
source§fn cmp(&self, other: &BoundVariableKind) -> Ordering
fn cmp(&self, other: &BoundVariableKind) -> 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 PartialEq<BoundVariableKind> for BoundVariableKind
impl PartialEq<BoundVariableKind> for BoundVariableKind
source§fn eq(&self, other: &BoundVariableKind) -> bool
fn eq(&self, other: &BoundVariableKind) -> bool
source§impl PartialOrd<BoundVariableKind> for BoundVariableKind
impl PartialOrd<BoundVariableKind> for BoundVariableKind
source§fn partial_cmp(&self, other: &BoundVariableKind) -> Option<Ordering>
fn partial_cmp(&self, other: &BoundVariableKind) -> 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 moreimpl Copy for BoundVariableKind
impl Eq for BoundVariableKind
impl StructuralEq for BoundVariableKind
impl StructuralPartialEq for BoundVariableKind
Auto Trait Implementations§
impl RefUnwindSafe for BoundVariableKind
impl !Send for BoundVariableKind
impl !Sync for BoundVariableKind
impl Unpin for BoundVariableKind
impl UnwindSafe for BoundVariableKind
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<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). Read more
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx 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 moresource§impl<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,
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> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo]) -> T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.
Size: 20 bytes
Size for each variant:
Ty
: 8 bytesRegion
: 20 bytesConst
: 0 bytes