Struct rustc_middle::ty::ConstVid
source · 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§
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ConstVid<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ConstVid<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<'tcx> Ord for ConstVid<'tcx>
impl<'tcx> Ord for ConstVid<'tcx>
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<'tcx> PartialEq<ConstVid<'tcx>> for ConstVid<'tcx>
impl<'tcx> PartialEq<ConstVid<'tcx>> for ConstVid<'tcx>
source§impl<'tcx> PartialOrd<ConstVid<'tcx>> for ConstVid<'tcx>
impl<'tcx> PartialOrd<ConstVid<'tcx>> for ConstVid<'tcx>
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 moresource§impl<'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
source§fn 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 moreimpl<'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§
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: 4 bytes