Struct KevySet 

pub struct KevySet<K>(/* private fields */);

HashSet-shaped wrapper over KevyMap<K, ()>.

Carries the same per-shard / single-trust-domain assumptions; differs from std::HashSet only by hashing through KevyHash (one-call inlinable) and exposing the underlying KevyMap’s bucket-address API via KevySet::as_map for callers that want prefetch.

Implementations

impl<K> KevySet<K>

pub fn new() -> Self

Construct an empty set without allocating.

pub fn with_capacity(cap_hint: usize) -> Self

Construct a set sized for cap_hint members without growing.

pub fn len(&self) -> usize

Live member count.

pub fn is_empty(&self) -> bool

Whether len() == 0.

pub fn capacity(&self) -> usize

Allocated slot count of the underlying map.

pub fn clear(&mut self)

Drop every member and reset the metadata. Keeps the allocation.

pub fn iter(&self) -> SetIter<'_, K>

&K iterator over all members (unspecified order).

pub fn iter_from_slot(&self, start: usize) -> impl Iterator<Item = &K>

Borrow the underlying map (gives access to the bucket-addr / prefetch API). An iterator that begins at slot start and wraps once around the whole table. Take the first element for an arbitrary member in O(1) expected time — the pattern SPOP and SRANDMEMBER need, and the one Redis’s dictGetRandomKey uses.

Not perfectly uniform: a member sitting after a long run of empty slots is likelier to be picked than one in a dense cluster. Redis has the same bias for the same reason, and the contract is “arbitrary”, not “uniform”. What it is NOT is the identical member every single time, which is what iter().next() gives you.

pub fn as_map(&self) -> &KevyMap<K, ()>

The backing map, for callers that want its bucket addresses (prefetch).

impl<K: KevyHash + Eq> KevySet<K>

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

Insert key. Returns true if newly added, false if it was already present (matches HashSet::insert).

impl<K> KevySet<K>

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

where K: Borrow<Q>, Q: KevyHash + Eq + ?Sized,

Whether key is a member of the set.

pub fn remove<Q>(&mut self, key: &Q) -> bool

where K: Borrow<Q>, Q: KevyHash + Eq + ?Sized,

Remove key; returns true if it was present (matches HashSet::remove).

Trait Implementations

impl<K: Clone> Clone for KevySet<K>

fn clone(&self) -> KevySet<K>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug> Debug for KevySet<K>

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

Formats the value using the given formatter.

impl<K> Default for KevySet<K>

fn default() -> Self

Returns the “default value” for a type.

impl<K: KevyHash + Eq> Extend<K> for KevySet<K>

fn extend<I: IntoIterator<Item = K>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K: KevyHash + Eq> FromIterator<K> for KevySet<K>

fn from_iter<I: IntoIterator<Item = K>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a, K> IntoIterator for &'a KevySet<K>

type Item = &'a K

The type of the elements being iterated over.

type IntoIter = SetIter<'a, K>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.