Struct contrail_collections::bit_set::BitSet

pub struct BitSet<M> { /* fields omitted */ }

A bit set.

Methods

impl<M> BitSet<M> where
    M: StorageMode, 

pub fn new_full(builder: &mut TrailBuilder, len: u64) -> Self

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

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

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)

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)

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

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)

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

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>

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>

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

impl<M: Clone> Clone for BitSet<M>

fn clone(&self) -> BitSet<M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M: Copy> Copy for BitSet<M>