pub enum ValTreeKind<'tcx> {
Leaf(ScalarInt),
Branch(Box<[ValTree<'tcx>]>),
}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)
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(Box<[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 variant index as a u32 field, followed by all the fields of the variant.
ZST types are represented as an empty slice.
Implementations§
Source§impl<'tcx> ValTreeKind<'tcx>
impl<'tcx> ValTreeKind<'tcx>
pub fn unwrap_leaf(&self) -> ScalarInt
pub fn unwrap_branch(&self) -> &[ValTree<'tcx>]
pub fn try_to_scalar(&self) -> Option<Scalar>
pub fn try_to_scalar_int(&self) -> Option<ScalarInt>
pub fn try_to_branch(&self) -> Option<&[ValTree<'tcx>]>
Trait Implementations§
Source§impl<'tcx> ArenaAllocatable<'tcx> for ValTreeKind<'tcx>
impl<'tcx> ArenaAllocatable<'tcx> for ValTreeKind<'tcx>
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut Self
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = Self>, ) -> &'tcx mut [Self]
Source§impl<'tcx> Borrow<ValTreeKind<'tcx>> for InternedInSet<'tcx, ValTreeKind<'tcx>>
impl<'tcx> Borrow<ValTreeKind<'tcx>> for InternedInSet<'tcx, ValTreeKind<'tcx>>
Source§fn borrow<'a>(&'a self) -> &'a ValTreeKind<'tcx>
fn borrow<'a>(&'a self) -> &'a ValTreeKind<'tcx>
Source§impl<'tcx> Clone for ValTreeKind<'tcx>
impl<'tcx> Clone for ValTreeKind<'tcx>
Source§fn clone(&self) -> ValTreeKind<'tcx>
fn clone(&self) -> ValTreeKind<'tcx>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<'tcx> Debug for ValTreeKind<'tcx>
impl<'tcx> Debug for ValTreeKind<'tcx>
Source§impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for ValTreeKind<'tcx>
impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for ValTreeKind<'tcx>
Source§impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for ValTreeKind<'tcx>
impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for ValTreeKind<'tcx>
Source§impl<'tcx> Hash for ValTreeKind<'tcx>
impl<'tcx> Hash for ValTreeKind<'tcx>
Source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ValTreeKind<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ValTreeKind<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl<'tcx> PartialEq for ValTreeKind<'tcx>
impl<'tcx> PartialEq for ValTreeKind<'tcx>
impl<'tcx> Eq for ValTreeKind<'tcx>
impl<'tcx> StructuralPartialEq for ValTreeKind<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for ValTreeKind<'tcx>
impl<'tcx> DynSync for ValTreeKind<'tcx>
impl<'tcx> Freeze for ValTreeKind<'tcx>
impl<'tcx> RefUnwindSafe for ValTreeKind<'tcx>
impl<'tcx> Send for ValTreeKind<'tcx>
impl<'tcx> Sync for ValTreeKind<'tcx>
impl<'tcx> Unpin for ValTreeKind<'tcx>
impl<'tcx> UnwindSafe for ValTreeKind<'tcx>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, tcx: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
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.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
T: 'static,
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