Struct CoverMap 

pub struct CoverMap { /* private fields */ }

A Caching implementation keyed by the depth and the instances of a subproblem: paths reaching the same instances at the same depth share one entry.

Entries live in an arena, found by depth, then number of instances, then instances. Each entry keeps its instances, one word per 64 rows, so the memory grows with the size of the dataset.

Trait Implementations

impl Caching for CoverMap

fn init(&mut self) -> Index

Clears the cache and creates the root entry.

fn root_index(&mut self) -> Index

Index of the root entry.

fn root(&self) -> Option<&CacheEntry>

The root entry.

fn insert(&mut self, path: &[usize], cover: &Cover) -> Index

Finds the entry of the subproblem, creating it if needed. The index is New for an entry that has not been evaluated yet.

fn find(&self, path: &[usize], cover: &Cover) -> Option<&CacheEntry>

The entry of the subproblem, if cached.

fn keyed_by_cover(&self) -> bool

Whether lookups use cover.

fn node(&self, key: &CacheKey) -> Option<&CacheEntry>

The entry for key.

fn contains(&self, key: &CacheKey) -> bool

Whether the cache has an entry for key.

fn update_root(&mut self) -> Option<CacheEntryUpdater<'_>>

An updater for the root entry.

fn update_node(&mut self, key: &CacheKey) -> Option<CacheEntryUpdater<'_>>

An updater for the entry of key.

fn size(&self) -> usize

Number of entries.

fn is_empty(&self) -> bool

Whether the cache has no entry.

impl Default for CoverMap

fn default() -> CoverMap

Returns the “default value” for a type.