Struct Trie 

pub struct Trie { /* private fields */ }

A Caching implementation as a trie of items stored in an arena.

Implementations

impl Trie

pub fn new() -> Self

An empty trie.

Trait Implementations

impl Caching for Trie

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 Trie

fn default() -> Trie

Returns the “default value” for a type.