Struct AtomicBoxedBitSet 

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

Heap-allocated atomic bitset with dynamically sized storage.

AtomicBoxedBitSet<A, V> is the atomic counterpart of BoxedBitSet. It owns a Box<[A]> of atomic words and delegates common operations to AtomicBitSlice<A, V> via Deref.

Atomicity guarantees

Each individual method (insert, remove, contains, …) performs atomic operations per word. The bitset as a whole is not a single atomic unit — concurrent modifications to bits in different words are independent atomic operations with no cross-word transactional guarantee. See AtomicBitSlice for details.

Implementations

impl<A: Radium, V> AtomicBoxedBitSet<A, V>

where A::Item: PrimInt,

pub fn from_boxed_slice(store: Box<[A]>) -> Self

impl<A: Radium + Default, V> AtomicBoxedBitSet<A, V>

where A::Item: PrimInt,

pub fn with_capacity(bits: usize) -> Self

impl<A: Radium, V> AtomicBoxedBitSet<A, V>

where A::Item: PrimInt,

pub fn drain(&self) -> BoxedBitSet<A::Item, V>

where A::Item: Default,

Atomically drain all bits, returning a non-atomic BoxedBitSet containing the drained values. The source is left empty.

Each word is swapped independently — this is NOT an atomic snapshot of the entire bitset.

Methods from Deref<Target = AtomicBitSlice<A, V>>

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

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,

Trait Implementations

impl<A: Radium, V> Deref for AtomicBoxedBitSet<A, V>

where A::Item: PrimInt,

type Target = AtomicBitSlice<A, V>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.