Struct TwoLevelCache

pub struct TwoLevelCache<K1, K2, Out>(RefCell<HashMap<K1, (bool, HashMap<K2, Pin<Box<Out>>>)>>);

Pretty much copies the cache from rustc_utils, but adds a second layer so we can chech for recursion on only part of the key

Tuple Fields

0: RefCell<HashMap<K1, (bool, HashMap<K2, Pin<Box<Out>>>)>>

Implementations

impl<K1: Eq + Hash + Clone, K2: Eq + Hash + Clone, Out> TwoLevelCache<K1, K2, Out>

pub fn len(&self) -> usize

Size of the cache

pub fn get(&self, key: (K1, K2), compute: impl FnOnce((K1, K2)) -> Out) -> &Out

Returns the cached value for the given key, or runs compute if the value is not in cache.

Panics

If this is a recursive invocation for this key.

pub fn get_maybe_recursive( &self, key: (K1, K2), compute: impl FnOnce((K1, K2)) -> Out, ) -> Option<&Out>

Returns the cached value for the given key, or runs compute if the value is not in cache.

Returns None if this is a recursive invocation of get for key key.

pub fn try_retrieve<'a>( &'a self, key: (K1, K2), compute: impl FnOnce((K1, K2)) -> Option<Out>, ) -> Retrieval<&'a Out>

Try to retrieve a value from the cache with a potentially fallible or recursive computation.

pub fn is_in_cache(&self, key: &(K1, K2)) -> bool

pub(crate) unsafe fn clear(&self)

Safety: Invalidates all references

Trait Implementations

impl<K1, K2, Out> Default for TwoLevelCache<K1, K2, Out>

fn default() -> Self

Returns the “default value” for a type.