Struct horde::sync_table::Write

pub struct Write<'a, K, V, S = DefaultHashBuilder> { /* fields omitted */ }

A handle to a SyncTable with write access.

Implementations

impl<'a, K, V, S> Write<'a, K, V, S>

pub fn read(&self) -> Read<'_, K, V, S>

Creates a Read handle which gives access to read operations.

pub fn hasher(&self) -> &'a S

Returns a reference to the table’s BuildHasher.

impl<'a, K: Send, V: Send + Clone, S: BuildHasher> Write<'a, K, V, S>

pub fn remove<Q: ?Sized>(
    &mut self,
    key: &Q,
    hash: Option<u64>
) -> Option<(&'a K, &'a V)> where
    K: Borrow<Q>,
    Q: Eq + Hash, 

Removes an element from the table, and returns a reference to it if was present.

impl<'a, K: Hash + Eq + Send + Clone, V: Send + Clone, S: BuildHasher> Write<'a, K, V, S>

pub fn insert(&mut self, key: K, value: V, hash: Option<u64>) -> bool

Inserts a element into the table. Returns false if it already exists and doesn’t update the value.

impl<'a, K: Hash + Send + Clone, V: Send + Clone, S: BuildHasher> Write<'a, K, V, S>

pub fn insert_new(
    &mut self,
    key: K,
    value: V,
    hash: Option<u64>
) -> (&'a K, &'a V)

Inserts a new element into the table, and returns a reference to it.

This does not check if the given element already exists in the table.

pub fn reserve_one(&mut self)

Reserve room for one more element.

impl<K: Hash + Send, V: Send, S: BuildHasher> Write<'_, K, V, S>

pub fn replace<I: IntoIterator<Item = (K, V)>>(
    &mut self,
    iter: I,
    capacity: usize
)

Replaces the content of the table with the content of the iterator. All the elements must be unique. capacity specifies the new capacity if it’s greater than the length of the iterator.