Struct chalk_recursive::fixed_point::cache::Cache

pub struct Cache<K, V>
where
    K: Hash + Eq + Debug,
    V: Debug + Clone,
{
    data: Arc<Mutex<CacheData<K, V>>>,
}

The “cache” stores results for goals that we have completely solved. Things are added to the cache when we have completely processed their result, and it can be shared amongst many solvers.

Fields

data: Arc<Mutex<CacheData<K, V>>>

Implementations

impl<K, V> Cache<K, V>

where K: Hash + Eq + Debug, V: Debug + Clone,

pub fn new() -> Self

pub fn insert(&self, goal: K, result: V)

Record a cache result.

pub fn get(&self, goal: &K) -> Option<V>

Record a cache result.

Trait Implementations

impl<K, V> Clone for Cache<K, V>

where K: Hash + Eq + Debug, V: Debug + Clone,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Default for Cache<K, V>

where K: Hash + Eq + Debug, V: Debug + Clone,

fn default() -> Self

Returns the “default value” for a type.