Struct AtomicSet 

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

A lock-free concurrent set optimized for read-heavy access patterns.

Reads are a single atomic pointer load with no contention between readers. Writes clone the inner set, mutate the clone, and atomically swap it in.

Not safe for concurrent writers using load/store: the last store wins and earlier updates are silently lost. Use rcu when multiple writers may race, or restrict writes to a single task.

Wrap in Arc for shared ownership across threads.

Implementations

impl<K> AtomicSet<K>

pub fn new() -> Self

Creates a new empty atomic set.

pub fn load(&self) -> Guard<Arc<AHashSet<K>>>

Returns a snapshot guard for direct access to the inner set.

The guard dereferences to AHashSet<K>. Use for operations that need iteration or reference access.

pub fn store(&self, set: AHashSet<K>)

Atomically replaces the inner set.

impl<K> AtomicSet<K>

where K: Eq + Hash + Clone,

pub fn rcu<F>(&self, f: F)

where F: FnMut(&mut AHashSet<K>),

Atomically applies f to a clone of the inner set.

Retries if another writer swapped the set between the clone and the compare-and-swap, so f may run more than once.

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

Returns true if the set contains the given key.

pub fn insert(&self, key: K)

Inserts a key (clone-and-swap).

pub fn remove(&self, key: &K)

Removes a key (clone-and-swap).

pub fn len(&self) -> usize

Returns the number of entries.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

Trait Implementations

impl<K: Debug + Eq + Hash> Debug for AtomicSet<K>

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

Formats the value using the given formatter.

impl<K> Default for AtomicSet<K>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq + Hash> From<AHashSet<K>> for AtomicSet<K>

fn from(set: AHashSet<K>) -> Self

Converts to this type from the input type.