Struct BoxedBitSet 

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

Implementations

impl<A, V> BoxedBitSet<A, V>

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

pub fn with_capacity(bits: usize) -> Self

where A: Default,

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

pub fn as_raw_mut_slice(&mut self) -> &mut [A]

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

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(&mut self) -> Option<V>

where V: TryFrom<usize>,

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

where V: TryFrom<usize>,

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

where V: Copy + AsPrimitive<usize>,

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

where V: AsPrimitive<usize>,

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

where V: AsPrimitive<usize>,

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

where V: AsPrimitive<usize>,

pub fn toggle(&mut self, id: V)

where V: AsPrimitive<usize>,

pub fn clear(&mut self)

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

where V: TryFrom<usize>,

pub fn append(&mut self, other: &mut Self)

pub fn iter(&self) -> BitSliceIter<'_, T, V>

where T: 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 difference<'a>(&'a self, other: &'a Self) -> impl Iterator<Item = V> + 'a

where T: BitAndAssign, V: TryFrom<usize>,

pub fn intersection<'a>( &'a self, other: &'a Self, ) -> impl Iterator<Item = V> + 'a

where T: BitAndAssign, V: TryFrom<usize>,

pub fn union<'a>(&'a self, other: &'a Self) -> impl Iterator<Item = V> + 'a

where T: BitAndAssign, V: TryFrom<usize>,

pub fn symmetric_difference<'a>( &'a self, other: &'a Self, ) -> impl Iterator<Item = V> + 'a

where T: BitAndAssign, V: TryFrom<usize>,

pub fn raw_words(&self) -> &[T]

Raw word slice accessor.

Trait Implementations

impl<A: PrimInt, V> BitAnd for BoxedBitSet<A, V>

type Output = BoxedBitSet<A, V>

The resulting type after applying the & operator.

fn bitand(self, rhs: Self) -> Self

Performs the & operation.

impl<A: PrimInt, V> BitAndAssign for BoxedBitSet<A, V>

fn bitand_assign(&mut self, rhs: Self)

Performs the &= operation.

impl<A: PrimInt, V> BitOr for BoxedBitSet<A, V>

type Output = BoxedBitSet<A, V>

The resulting type after applying the | operator.

fn bitor(self, rhs: Self) -> Self

Performs the | operation.

impl<A: PrimInt, V> BitOrAssign for BoxedBitSet<A, V>

fn bitor_assign(&mut self, rhs: Self)

Performs the |= operation.

impl<A: PrimInt, V> BitXor for BoxedBitSet<A, V>

type Output = BoxedBitSet<A, V>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: Self) -> Self

Performs the ^ operation.

impl<A: PrimInt, V> BitXorAssign for BoxedBitSet<A, V>

fn bitxor_assign(&mut self, rhs: Self)

Performs the ^= operation.

impl<A: Clone, V> Clone for BoxedBitSet<A, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: PrimInt + BitAndAssign, V> Debug for BoxedBitSet<A, V>

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

Formats the value using the given formatter.

impl<A, V> Deref for BoxedBitSet<A, V>

type Target = BitSlice<A, V>

The resulting type after dereferencing.

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

Dereferences the value.

impl<A, V> DerefMut for BoxedBitSet<A, V>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<A: PrimInt, V> Extend<BoxedBitSet<A, V>> for BoxedBitSet<A, V>

fn extend<I: IntoIterator<Item = Self>>(&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<A: PrimInt, V> FromIterator<BoxedBitSet<A, V>> for BoxedBitSet<A, V>

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

Creates a value from an iterator.

impl<A: PrimInt + Hash, V> Hash for BoxedBitSet<A, V>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, A: PrimInt + BitAndAssign, V: TryFrom<usize>> IntoIterator for &'a BoxedBitSet<A, V>

type Item = V

The type of the elements being iterated over.

type IntoIter = BitSliceIter<'a, A, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<A: PrimInt, V> Not for BoxedBitSet<A, V>

type Output = BoxedBitSet<A, V>

The resulting type after applying the ! operator.

fn not(self) -> Self

Performs the unary ! operation.

impl<A: PrimInt, V> PartialEq for BoxedBitSet<A, V>

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A: PrimInt, V> Sub for BoxedBitSet<A, V>

type Output = BoxedBitSet<A, V>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self

Performs the - operation.

impl<A: PrimInt, V> SubAssign for BoxedBitSet<A, V>

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<A: PrimInt, V> Eq for BoxedBitSet<A, V>