Struct Table 

pub struct Table<Q: Key> { /* private fields */ }

A table that lives for a session: emptied rarely, by filling its slots with the vacant pattern (all bits set — a memset).

Implementations

impl<Q: Key> Table<Q>

pub fn new() -> Table<Q>

pub fn get(&self, k: &Q) -> Option<u32>

pub fn insert(&mut self, k: Q, v: u32)

Inserts a key that is not present (v is never EMPTY: ids stay below it).

pub fn contains(&self, k: &Q) -> bool

pub fn clear(&mut self)

Empties the table, keeping its storage.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn bytes(&self) -> usize

Trait Implementations

impl<Q: Clone + Key> Clone for Table<Q>

fn clone(&self) -> Table<Q>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Q: Key> Default for Table<Q>

fn default() -> Self

Returns the “default value” for a type.