Struct AtomicBitSlice 

pub struct AtomicBitSlice<A, V>(/* private fields */);

Unsized shared base for multi-word atomic bitset types.

AtomicBitSlice<A, V> is to atomic bitsets what BitSlice<T, V> is to non-atomic ones: a #[repr(transparent)] wrapper around [A] that provides common query and mutation methods. Owned types (AtomicBitSet<[A; N], V> and AtomicBoxedBitSet<A, V>) implement Deref<Target = AtomicBitSlice<A, V>>.

Atomicity guarantees

Each individual method (insert, remove, contains, …) performs atomic operations per word. However, the bitset as a whole is not a single atomic unit when it spans multiple words. Concurrent modifications to bits within the same word are correctly synchronized via fetch_or / fetch_and with AcqRel ordering. Modifications to bits in different words are independent atomic operations — there is no cross-word transactional guarantee.

Read-only methods (len, iter, contains, is_subset, …) load each word with Relaxed ordering and do not take a consistent snapshot of the entire bitset. If another thread modifies the set concurrently, these methods may observe a mix of old and new state across different words.

Implementations

impl<A, V> AtomicBitSlice<A, V>

pub fn as_raw_slice(&self) -> &[A]

impl<A, V> AtomicBitSlice<A, V>

where A: Radium, A::Item: PrimInt,

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn first(&self) -> Option<V>

where V: TryFrom<usize>,

pub fn last(&self) -> Option<V>

where V: TryFrom<usize>,

pub fn pop_first(&self) -> Option<V>

where V: TryFrom<usize>, A::Item: BitOps,

pub fn pop_last(&self) -> Option<V>

where V: TryFrom<usize>, A::Item: BitOps,

pub fn contains(&self, id: &V) -> bool

where V: Copy + AsPrimitive<usize>,

pub fn insert(&self, id: V) -> bool

where V: AsPrimitive<usize>, A::Item: BitOps,

pub fn remove(&self, id: V) -> bool

where V: AsPrimitive<usize>, A::Item: BitOps,

pub fn set(&self, id: V, value: bool)

where V: AsPrimitive<usize>, A::Item: BitOps,

pub fn toggle(&self, id: V)

where V: AsPrimitive<usize>, A::Item: BitOps,

pub fn clear(&self)

pub fn retain(&self, f: impl FnMut(V) -> bool)

where V: TryFrom<usize>, A::Item: BitOps,

pub fn iter(&self) -> impl Iterator<Item = V> + '_

where A::Item: BitAndAssign, V: TryFrom<usize>,

pub fn is_subset(&self, other: &Self) -> bool

pub fn is_superset(&self, other: &Self) -> bool

pub fn is_disjoint(&self, other: &Self) -> bool

pub fn union_from(&self, other: &[A::Item])

where A::Item: BitOps + Copy,