Expand description
This datastructure is used to represent the value of constants used in the type system.
We explicitly choose a different datastructure from the way values are processed within
CTFE, as in the type system equal values (according to their PartialEq) must also have
equal representation (== on the rustc data structure, e.g. ValTree) and vice versa.
Since CTFE uses AllocId to represent pointers, it often happens that two different
AllocIds point to equal values. So we may end up with different representations for
two constants whose value is &42. Furthermore any kind of struct that has padding will
have arbitrary values within that padding, even if the values of the struct are the same.
ValTree does not have this problem with representation, as it only contains integers or
lists of (nested) ValTree.
Variants
Leaf(ScalarInt)
ZSTs, integers, bool, char are represented as scalars.
See the ScalarInt documentation for how ScalarInt guarantees that equal values
of these types have the same representation.
Branch(&'tcx [ValTree<'tcx>])
The fields of any kind of aggregate. Structs, tuples and arrays are represented by listing their fields’ values in order. Enums are represented by storing their discriminant as a field, followed by all the fields of the variant.
Implementations
Trait Implementations
sourceimpl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ValTree<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ValTree<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<'tcx> Ord for ValTree<'tcx>
impl<'tcx> Ord for ValTree<'tcx>
sourceimpl<'tcx> PartialOrd<ValTree<'tcx>> for ValTree<'tcx>
impl<'tcx> PartialOrd<ValTree<'tcx>> for ValTree<'tcx>
sourcefn partial_cmp(&self, other: &ValTree<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &ValTree<'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
impl<'tcx> Copy for ValTree<'tcx>
impl<'tcx> Eq for ValTree<'tcx>
impl<'tcx> StructuralEq for ValTree<'tcx>
impl<'tcx> StructuralPartialEq for ValTree<'tcx>
Auto Trait Implementations
impl<'tcx> RefUnwindSafe for ValTree<'tcx>
impl<'tcx> Send for ValTree<'tcx>
impl<'tcx> Sync for ValTree<'tcx>
impl<'tcx> Unpin for ValTree<'tcx>
impl<'tcx> UnwindSafe for ValTree<'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<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘ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 · sourcepub fn borrow_mut(&mut self) -> &mut T
pub 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,
pub default fn fingerprint_style() -> FingerprintStyle
sourcepub default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
pub 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
pub default fn to_debug_str(&self, Ctxt) -> String
sourcepub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<T>
pub 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 DepNodes 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> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into)Uses borrowed data to replace owned data, usually by cloning. Read more
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: 24 bytes
Size for each variant:
Leaf: 17 bytesBranch: 23 bytes