Struct BitSlice 

pub struct BitSlice<T, V>(/* private fields */);

Unsized shared base for all bitset types. Wraps a raw [T] primitive slice.

All operations use direct primitive bit manipulation (count_ones, bit masking, etc.), not bitvec’s generic algorithms.

Owned types (BitSet, BoxedBitSet) implement Deref<Target = BitSlice<T, V>> so common methods are defined here once.

Implementations

impl<T: PrimInt, V> BitSlice<T, 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<T: PrimInt + BitAndAssign, V> Debug for BitSlice<T, V>

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

Formats the value using the given formatter.

impl<T: PrimInt + Hash, V> Hash for BitSlice<T, V>

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

Feeds this value into the given Hasher.

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

type Item = V

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PrimInt, V> PartialEq for BitSlice<T, 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<T: PrimInt, V> Eq for BitSlice<T, V>