Struct LruHandleTable

pub struct LruHandleTable<K: LruKey, T: LruValue> {
    list: Vec<*mut LruHandle<K, T>>,
    elems: usize,
}

Fields

list: Vec<*mut LruHandle<K, T>>

elems: usize

Implementations

impl<K: LruKey, T: LruValue> LruHandleTable<K, T>

fn new() -> Self

unsafe fn find_pointer( &self, idx: usize, key: &K, ) -> (*mut LruHandle<K, T>, *mut LruHandle<K, T>)

unsafe fn remove(&mut self, hash: u64, key: &K) -> *mut LruHandle<K, T>

unsafe fn insert( &mut self, hash: u64, h: *mut LruHandle<K, T>, ) -> *mut LruHandle<K, T>

Insert a handle into the hash table. Return the handle of the previous value if the key exists.

unsafe fn lookup(&self, hash: u64, key: &K) -> *mut LruHandle<K, T>

unsafe fn resize(&mut self)

unsafe fn for_all<F>(&self, f: &mut F)

where F: FnMut(&K, &T),