Struct rustc_query_system::query::caches::DefaultCache
source · pub struct DefaultCache<K, V> {
cache: Lock<FxHashMap<K, (V, DepNodeIndex)>>,
}
Fields§
§cache: Lock<FxHashMap<K, (V, DepNodeIndex)>>
Trait Implementations§
source§impl<K, V> Default for DefaultCache<K, V>
impl<K, V> Default for DefaultCache<K, V>
source§impl<K, V> QueryCache for DefaultCache<K, V>where
K: Eq + Hash + Clone + Debug,
V: Clone + Debug,
impl<K, V> QueryCache for DefaultCache<K, V>where
K: Eq + Hash + Clone + Debug,
V: Clone + Debug,
type Key = K
source§fn lookup<R, OnHit>(&self, key: &K, on_hit: OnHit) -> Result<R, ()>where
OnHit: FnOnce(&V, DepNodeIndex) -> R,
fn lookup<R, OnHit>(&self, key: &K, on_hit: OnHit) -> Result<R, ()>where
OnHit: FnOnce(&V, DepNodeIndex) -> R,
Checks if the query is already computed and in the cache.
It returns the shard index and a lock guard to the shard,
which will be used if the query is not in the cache and we need
to compute it. Read more
fn complete(&self, key: K, value: V, index: DepNodeIndex) -> Self::Stored
fn iter(&self, f: &mut dyn FnMut(&Self::Key, &Self::Value, DepNodeIndex))
Auto Trait Implementations§
impl<K, V> !RefUnwindSafe for DefaultCache<K, V>
impl<K, V> Send for DefaultCache<K, V>where
K: Send,
V: Send,
impl<K, V> !Sync for DefaultCache<K, V>
impl<K, V> Unpin for DefaultCache<K, V>where
K: Unpin,
V: Unpin,
impl<K, V> UnwindSafe for DefaultCache<K, V>where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
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: 40 bytes