Struct ValueSet 

struct ValueSet<'a, 'tcx> {
    indices: HashTable<VnIndex>,
    hashes: IndexVec<VnIndex, u64>,
    values: IndexVec<VnIndex, Value<'a, 'tcx>>,
    types: IndexVec<VnIndex, Ty<'tcx>>,
}

Stores and deduplicates pairs of (Value, Ty) into in VnIndex numbered values.

This data structure is mostly a partial reimplementation of FxIndexMap<VnIndex, (Value, Ty)>. We do not use a regular FxIndexMap to skip hashing values that are unique by construction, like opaque values, address with provenance and non-deterministic constants.

Fields

indices: HashTable<VnIndex>

hashes: IndexVec<VnIndex, u64>

values: IndexVec<VnIndex, Value<'a, 'tcx>>

types: IndexVec<VnIndex, Ty<'tcx>>

Implementations

impl<'a, 'tcx> ValueSet<'a, 'tcx>

fn new(num_values: usize) -> ValueSet<'a, 'tcx>

fn insert_unique( &mut self, ty: Ty<'tcx>, value: impl FnOnce(VnOpaque) -> Value<'a, 'tcx>, ) -> VnIndex

Insert a (Value, Ty) pair without hashing or deduplication. This always creates a new VnIndex.

fn insert(&mut self, ty: Ty<'tcx>, value: Value<'a, 'tcx>) -> (VnIndex, bool)

Insert a (Value, Ty) pair to be deduplicated. Returns true as second tuple field if this value did not exist previously.

fn value(&self, index: VnIndex) -> Value<'a, 'tcx>

Return the Value associated with the given VnIndex.

fn ty(&self, index: VnIndex) -> Ty<'tcx>

Return the type associated with the given VnIndex.

fn forget(&mut self, index: VnIndex)

Replace the value associated with index with an opaque value.

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: 104 bytes