Struct rustc_query_system::cache::Cache

pub struct Cache<Key, Value> {
    hashmap: Lock<FxHashMap<Key, WithDepNode<Value>>>,
}

Fields

hashmap: Lock<FxHashMap<Key, WithDepNode<Value>>>

Implementations

impl<Key, Value> Cache<Key, Value>

pub fn clear(&self)

Actually frees the underlying memory in contrast to what stdlib containers do on clear

impl<Key: Eq + Hash, Value: Clone> Cache<Key, Value>

pub fn get<CTX: DepContext>(&self, key: &Key, tcx: CTX) -> Option<Value>

pub fn insert(&self, key: Key, dep_node: DepNodeIndex, value: Value)

Trait Implementations

impl<Key: Clone, Value: Clone> Clone for Cache<Key, Value>

fn clone(&self) -> Cache<Key, Value>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Key, Value> Default for Cache<Key, Value>

fn default() -> Self

Returns the “default value” for a type.

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