[−][src]Struct contrail_collections::bit_set::BitSet
A bit set.
Methods
impl<M> BitSet<M> where
M: StorageMode,
[src]
M: StorageMode,
pub fn new_full(builder: &mut TrailBuilder, len: u64) -> Self
[src]
Creates a new bit set with a capacity of len
with the values 0..len
in the set.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_full(&mut builder, 100); let trail = builder.finish(); assert_eq!(bit_set.capacity(), 100); for i in 0..100 { assert!(bit_set.contains(&trail, i)); }
pub fn new_empty(builder: &mut TrailBuilder, len: u64) -> Self
[src]
Creates a new bit set with a capacity of len
with no values in the set.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let trail = builder.finish(); assert_eq!(bit_set.capacity(), 100); for i in 0..100 { assert!(!bit_set.contains(&trail, i)); }
pub fn capacity(&self) -> u64
[src]
Returns the capacity of the bit set.
The bit set can store elements in the range 0..capacity
.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let trail = builder.finish(); assert_eq!(bit_set.capacity(), 100);
pub fn clear(&self, trail: &mut Trail)
[src]
Removes all elements from the bit set.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); bit_set.insert(&mut trail, 42); assert!(bit_set.contains(&trail, 42)); bit_set.clear(&mut trail); assert!(!bit_set.contains(&trail, 42));
pub fn insert(&self, trail: &mut Trail, value: u64)
[src]
Inserts an element in the bit set.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); assert!(!bit_set.contains(&trail, 42)); bit_set.insert(&mut trail, 42); assert!(bit_set.contains(&trail, 42));
pub fn contains(&self, trail: &Trail, value: u64) -> bool
[src]
Checks if the bit set contains the given element.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); assert!(!bit_set.contains(&trail, 42)); bit_set.insert(&mut trail, 42); assert!(bit_set.contains(&trail, 42));
pub fn remove(&self, trail: &mut Trail, value: u64)
[src]
Removes the given element from the bit set.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); bit_set.insert(&mut trail, 42); assert!(bit_set.contains(&trail, 42)); bit_set.remove(&mut trail, 42); assert!(!bit_set.contains(&trail, 42));
pub fn count_between(&self, trail: &Trail, min: u64, max: u64) -> u64
[src]
Counts the number of elements in the bitset between the two given values (inclusive).
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); bit_set.insert(&mut trail, 10); bit_set.insert(&mut trail, 20); bit_set.insert(&mut trail, 30); assert_eq!(bit_set.count_between(&trail, 10, 30), 3); assert_eq!(bit_set.count_between(&trail, 11, 29), 1);
pub fn next_above(&self, trail: &Trail, value: u64) -> Option<u64>
[src]
Returns the next element above the given element in the bit set, or None
if no such
element exists.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); bit_set.insert(&mut trail, 42); assert_eq!(bit_set.next_above(&trail, 33), Some(42)); assert_eq!(bit_set.next_above(&trail, 50), None);
pub fn next_below(&self, trail: &Trail, value: u64) -> Option<u64>
[src]
Returns the next element below the given element in the bit set, or None
if no such
element exists.
Examples
use contrail::TrailBuilder; use contrail_collections::bit_set::BacktrackableBitSet; let mut builder = TrailBuilder::new(); let bit_set = BacktrackableBitSet::new_empty(&mut builder, 100); let mut trail = builder.finish(); bit_set.insert(&mut trail, 42); assert_eq!(bit_set.next_below(&trail, 50), Some(42)); assert_eq!(bit_set.next_below(&trail, 33), None);
Trait Implementations
Auto Trait Implementations
impl<M> RefUnwindSafe for BitSet<M> where
M: RefUnwindSafe,
M: RefUnwindSafe,
impl<M> Send for BitSet<M> where
M: Send,
M: Send,
impl<M> Sync for BitSet<M> where
M: Sync,
M: Sync,
impl<M> Unpin for BitSet<M> where
M: Unpin,
M: Unpin,
impl<M> UnwindSafe for BitSet<M> where
M: UnwindSafe,
M: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> 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<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,