Struct rustc_query_system::query::caches::DefIdCache

pub struct DefIdCache<V> {
    local: Lock<(IndexVec<DefIndex, Option<(V, DepNodeIndex)>>, Vec<DefIndex>)>,
    foreign: DefaultCache<DefId, V>,
}

Fields

local: Lock<(IndexVec<DefIndex, Option<(V, DepNodeIndex)>>, Vec<DefIndex>)>

Stores the local DefIds in a dense map. Local queries are much more often dense, so this is a win over hashing query keys at marginal memory cost (~5% at most) compared to FxHashMap.

The second element of the tuple is the set of keys actually present in the IndexVec, used for faster iteration in iter().

foreign: DefaultCache<DefId, V>

Trait Implementations

impl<V> Default for DefIdCache<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V> QueryCache for DefIdCache<V>

where V: Copy,

type Key = DefId

type Value = V

fn lookup(&self, key: &DefId) -> Option<(V, DepNodeIndex)>

Checks if the query is already computed and in the cache.

fn complete(&self, key: DefId, value: V, index: DepNodeIndex)

fn iter(&self, f: &mut dyn FnMut(&Self::Key, &Self::Value, DepNodeIndex))

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