Struct HandleTable

pub struct HandleTable { /* private fields */ }

| We provide our own simple hash table since it | removes a whole bunch of porting hacks and is | also faster than some of the built-in hash | table implementations in some of the | compiler/runtime combinations we have tested. | E.g., readrandom speeds up by ~5% over the g++ | 4.4.3’s builtin hashtable.

Implementations

impl HandleTable

pub fn lookup(&mut self, key_: &Slice, hash_: u32) -> *mut LRUHandle

pub fn insert(&mut self, h: *mut LRUHandle) -> *mut LRUHandle

pub fn remove(&mut self, key_: &Slice, hash_: u32) -> *mut LRUHandle

pub fn find_pointer(&mut self, key_: &Slice, hash_: u32) -> *mut *mut LRUHandle

| Return a pointer to slot that points to | a cache entry that matches key/hash. If | there is no such cache entry, return | a pointer to the trailing slot in the | corresponding linked list.

pub fn resize(&mut self)

Trait Implementations

impl Default for HandleTable

fn default() -> HandleTable

Returns the “default value” for a type.

impl Drop for HandleTable

fn drop(&mut self)

Executes the destructor for this type.