[−][src]Struct shine_graph::bits::BitSet
Hierarchical bitset. Each level indicates if any bit is set in the subtree. http://www.cs.loyola.edu/~binkley/papers/tcsrt08-hbit-vectors.pdf
Methods
impl<B: BitBlock> BitSet<B>[src]
pub fn new() -> BitSet<B>[src]
pub fn new_with_capacity(capacity: usize) -> BitSet<B>[src]
pub fn number_of_set(&self) -> usize[src]
return the number of set bits
pub fn capacity(&self) -> usize[src]
pub fn increase_capacity_to(&mut self, capacity: usize)[src]
pub fn get_capacity(&self) -> usize[src]
Return the count of the bitset that can be stored without (re)allocation.
pub fn reserve(&mut self, additional: usize) -> usize[src]
Reserve memory to store some more bits and return the new capacity. Capacity is rouned up to the nearest block-size.
pub fn get_level(&self, level: usize) -> &[B][src]
pub fn add(&mut self, pos: usize) -> bool[src]
pub fn remove(&mut self, pos: usize) -> bool[src]
pub fn clear(&mut self)[src]
Trait Implementations
impl<B: BitBlock> BitSetView for BitSet<B>[src]
type Bits = B
fn is_empty(&self) -> bool[src]
fn get_level_count(&self) -> usize[src]
fn get_block(&self, level: usize, block: usize) -> B[src]
impl<B: BitBlock> Default for BitSet<B>[src]
Auto Trait Implementations
Blanket Implementations
impl<T> From for T[src]
impl<T, U> Into for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<T> Borrow for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,