Struct ShardedSet 

pub struct ShardedSet<K, S = RandomState> { /* private fields */ }

Implementations

impl<K, S> ShardedSet<K, S>

where K: Hash + Eq, S: BuildHasher + Default,

pub fn new() -> Self

pub fn insert(&self, key: K) -> bool

Whether key was newly inserted. Prefer extend_weighted for bulk work.

pub fn contains(&self, key: &K) -> bool

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn extend_weighted(&self, items: impl IntoIterator<Item = (K, u64)>) -> u64

Insert every key, taking each shard’s lock at most once. Returns the summed weight of the keys that were not already present.

pub fn try_extend_weighted<E>( &self, items: impl IntoIterator<Item = Result<(K, u64), E>>, ) -> Result<u64, E>

Like Self::extend_weighted, but stops at the first Err and returns it. Items are bucketed as they arrive, so the caller need not collect them first.

pub fn extend(&self, keys: impl IntoIterator<Item = K>)

pub fn shard_lens(&self) -> Vec<usize>

Number of keys in every shard, for distribution checks.

Trait Implementations

impl<K: Debug, S: Debug> Debug for ShardedSet<K, S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K, S> Default for ShardedSet<K, S>

where K: Hash + Eq, S: BuildHasher + Default,

fn default() -> Self

Returns the “default value” for a type.