Struct AtomicIdSet

pub struct AtomicIdSet<I> { /* private fields */ }

A set of IDs that may be accessed concurrently.

AtomicIdSet is backed by an array of AtomicU64. This allows individual ID bits to be added, removed, or tested atomically. But operations that span multiple AtomicU64 values are non-atomic.

Implementations

impl<I: Id> AtomicIdSet<I>

pub fn new(value: IdSet<I>) -> Self

Creates a new AtomicIdSet from an IdSet.

pub fn load(&self, ordering: Ordering) -> IdSet<I>

Loads the value of the set with the given ordering.

This operation is not atomic. When racing with a Self::store operation, this load may return a set that contains a portion of the new value and a portion of the old value. Load on each specific word is atomic, and follows the specified ordering.

Note that load with [Ordering::Release] is a valid operation, which is different from the normal atomic operations. When coupled with [Ordering::Release], it actually performs fetch_or(0, Release).

pub fn store(&self, value: &IdSet<I>, ordering: Ordering)

Stores a new value to the set with the given ordering.

This operation is not atomic. When racing with a Self::load operation, that load may return a set that contains a portion of the new value and a portion of the old value. Load on each specific word is atomic, and follows the specified ordering.

pub fn add(&self, id: I, ordering: Ordering)

Atomically adds an ID with the given ordering.

pub fn remove(&self, id: I, ordering: Ordering)

Atomically removes an ID with the given ordering.

pub fn contains(&self, id: I, ordering: Ordering) -> bool

Atomically checks if the set contains the specified ID.

Trait Implementations

impl<I: Debug> Debug for AtomicIdSet<I>

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

Formats the value using the given formatter.