pub struct ConstVid<'tcx> {
pub index: u32,
pub phantom: PhantomData<&'tcx ()>,
}
Expand description
A const
variable ID.
Fields
index: u32
phantom: PhantomData<&'tcx ()>
Trait Implementations
sourceimpl<'a, 'tcx> HashStable<StableHashingContext<'a>> for ConstVid<'tcx>
impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for ConstVid<'tcx>
fn hash_stable(
&self,
hcx: &mut StableHashingContext<'a>,
hasher: &mut StableHasher
)
sourceimpl<'tcx> Ord for ConstVid<'tcx>
impl<'tcx> Ord for ConstVid<'tcx>
sourceimpl<'tcx> PartialOrd<ConstVid<'tcx>> for ConstVid<'tcx>
impl<'tcx> PartialOrd<ConstVid<'tcx>> for ConstVid<'tcx>
sourcefn partial_cmp(&self, other: &ConstVid<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &ConstVid<'tcx>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
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 more
sourceimpl<'tcx> UnifyKey for ConstVid<'tcx>
impl<'tcx> UnifyKey for ConstVid<'tcx>
type Value = ConstVarValue<'tcx>
fn index(&self) -> u32
fn from_index(i: u32) -> Self
fn tag() -> &'static str
sourcefn order_roots(
a: Self,
a_value: &Self::Value,
b: Self,
b_value: &Self::Value
) -> Option<(Self, Self)>
fn order_roots(
a: Self,
a_value: &Self::Value,
b: Self,
b_value: &Self::Value
) -> Option<(Self, Self)>
If true, then self
should be preferred as root to other
.
Note that we assume a consistent partial ordering, so
returning true implies that other.prefer_as_root_to(self)
would return false. If there is no ordering between two keys
(i.e., a.prefer_as_root_to(b)
and b.prefer_as_root_to(a)
both return false) then the rank will be used to determine the
root in an optimal way. Read more
impl<'tcx> Copy for ConstVid<'tcx>
impl<'tcx> Eq for ConstVid<'tcx>
impl<'tcx> StructuralEq for ConstVid<'tcx>
impl<'tcx> StructuralPartialEq for ConstVid<'tcx>
Auto Trait Implementations
impl<'tcx> RefUnwindSafe for ConstVid<'tcx>
impl<'tcx> Send for ConstVid<'tcx>
impl<'tcx> Sync for ConstVid<'tcx>
impl<'tcx> Unpin for ConstVid<'tcx>
impl<'tcx> UnwindSafe for ConstVid<'tcx>
Blanket Implementations
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
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 T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
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 T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
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 more
sourceimpl<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>>::Output where
I: Iterator<Item = T>,
F: for<'_> FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
impl<'a, T> Captures<'a> for T where
T: ?Sized,
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: 4 bytes