Struct rustc_query_system::query::caches::DefaultCache [−][src]
pub struct DefaultCache<K, V>(PhantomData<(K, V)>);
Tuple Fields
0: PhantomData<(K, V)>
Trait Implementations
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
type Sharded = FxHashMap<K, (V, DepNodeIndex)>
fn lookup<'s, R, OnHit>(
&self,
state: &'s QueryCacheStore<Self>,
key: &K,
on_hit: OnHit
) -> Result<R, QueryLookup> where
OnHit: FnOnce(&V, DepNodeIndex) -> R,
fn lookup<'s, R, OnHit>(
&self,
state: &'s QueryCacheStore<Self>,
key: &K,
on_hit: OnHit
) -> Result<R, QueryLookup> 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,
lock_sharded_storage: &mut Self::Sharded,
key: K,
value: V,
index: DepNodeIndex
) -> Self::Stored
Auto Trait Implementations
impl<K, V> RefUnwindSafe for DefaultCache<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for DefaultCache<K, V> where
K: Send,
V: Send,
impl<K, V> Sync for DefaultCache<K, V> where
K: Sync,
V: Sync,
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: 0 bytes