Struct chisel_stringtable::btree_string_table::BTreeStringTable

pub struct BTreeStringTable<'a> { /* private fields */ }

Default implementation just maintains a btree keyed on a 64-bit fxhash value

Implementations

impl<'a> BTreeStringTable<'a>

pub fn new() -> Self

Create a new string table with default initial capacity using the default hasher

Trait Implementations

impl<'a> Clone for BTreeStringTable<'a>

fn clone(&self) -> Self

Clone the contents of a given BTreeStringTable instance

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

Performs copy-assignment from source.

impl<'a> StringTable<'a, u64> for BTreeStringTable<'a>

fn add(&mut self, value: &str) -> u64

Add a new value to the string table. Returns the u32 hash value of the entry. If the entry already exists within the table, then this operation is idempotent, but the hash value is still returned.

fn remove(&mut self, key: u64)

Attempts to remove a given value from the table.

fn get(&self, key: u64) -> Option<&Cow<'a, str>>

Attempts to retrieve a given value from the table.

fn len(&self) -> usize

The number of elements currently within the table

fn contains(&self, value: &str) -> Option<u64>

Check whether a given value already exists within the table. If it does, then return the hash value associated with it. If not, just return None.

fn hash(&self, value: &str) -> u64

Get the hash value associated with a given value. This should be consistent and repeatable between calls for the same value.