pub struct HOPTable<K, V, S = RandomState> where
K: 'static + PartialEq + Eq + Hash + Clone + Send + Sync,
V: 'static + Clone + Send + Sync,
S: BuildHasher, { /* private fields */ }Expand description
Lever Neighborhood based cache-oblivious concurrent table.
Designed for fast access under heavy contention. Best for related lookups in the known key space. Also best for buffer management.
Implementations
Auto Trait Implementations
impl<K, V, S> RefUnwindSafe for HOPTable<K, V, S> where
S: RefUnwindSafe,
impl<K, V, S> Send for HOPTable<K, V, S> where
S: Send,
impl<K, V, S> Sync for HOPTable<K, V, S> where
S: Sync,
impl<K, V, S> Unpin for HOPTable<K, V, S> where
S: Unpin,
impl<K, V, S> UnwindSafe for HOPTable<K, V, S> where
S: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more