[go: up one dir, main page]

Struct lever::table::hoptable::HOPTable[−][src]

pub struct HOPTable<K, V, S = RandomState> where
    K: 'static + PartialEq + Eq + Hash + Clone + Send + Sync,
    V: 'static + Clone + Send + Sync,
    S: BuildHasher,  { /* fields omitted */ }

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

impl<K, V> HOPTable<K, V, RandomState> where
    K: PartialEq + Eq + Hash + Clone + Send + Sync,
    V: Clone + Send + Sync, [src]

pub fn new() -> Self[src]

pub fn with_capacity(cap: usize) -> Self[src]

impl<K, V, S> HOPTable<K, V, S> where
    K: PartialEq + Eq + Hash + Clone + Send + Sync,
    V: Clone + Send + Sync,
    S: BuildHasher, [src]

pub fn remove(&self, k: &K) -> Result<Arc<Option<V>>>[src]

pub fn get(&self, k: &K) -> Option<V>[src]

pub fn insert(&self, k: K, v: V) -> Result<Arc<Option<V>>>[src]

Auto Trait Implementations

impl<K, V, S> RefUnwindSafe for HOPTable<K, V, S> where
    S: RefUnwindSafe, [src]

impl<K, V, S> Send for HOPTable<K, V, S> where
    S: Send, [src]

impl<K, V, S> Sync for HOPTable<K, V, S> where
    S: Sync, [src]

impl<K, V, S> Unpin for HOPTable<K, V, S> where
    S: Unpin, [src]

impl<K, V, S> UnwindSafe for HOPTable<K, V, S> where
    S: UnwindSafe, [src]

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.