Trait BitSet

pub trait BitSet<T> {
    // Required methods
    fn capacity(&self) -> T;
    fn has(&self, _: T) -> bool;
    fn is_empty(&self) -> bool;
    fn size(&self) -> T;
}

A trait for reading values from a bit set.

Required Methods

fn capacity(&self) -> T

Returns the number of bits that can be stored in the set.

Example

use index_set::BitSet;

let bitset: &[u32] = &[0; 4];
assert_eq!(bitset.capacity(), 128);

fn has(&self, _: T) -> bool

Returns true if the set contains the given value.

Example

use index_set::{BitSet, BitSetMut};

let mut bitset: [u32; 4] = [0; 4];
bitset.insert(0);
assert!(bitset.has(0));

fn is_empty(&self) -> bool

Returns true if the set is empty.

Example

use index_set::{BitSet, BitSetMut};

let mut bitset: [u32; 4] = [0; 4];
assert!(BitSet::is_empty(&bitset[..]));

bitset.insert(0);
assert!(!BitSet::is_empty(&bitset[..]));

fn size(&self) -> T

Returns the number of values in the set.

Example

use index_set::{BitSet, BitSetMut};

let mut bitset: [u32; 4] = [0; 4];

bitset.insert(0);
assert_eq!(bitset.size(), 1);

Implementations on Foreign Types

impl BitSet<u16> for [u16]

fn capacity(&self) -> u16

fn has(&self, index: u16) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> u16

impl BitSet<u32> for [u32]

fn capacity(&self) -> u32

fn has(&self, index: u32) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> u32

impl BitSet<u32> for [AtomicU32]

fn capacity(&self) -> u32

fn has(&self, index: u32) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> u32

impl BitSet<u64> for [u64]

fn capacity(&self) -> u64

fn has(&self, index: u64) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> u64

impl BitSet<u64> for [AtomicU64]

fn capacity(&self) -> u64

fn has(&self, index: u64) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> u64

impl BitSet<u128> for [u128]

fn capacity(&self) -> u128

fn has(&self, index: u128) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> u128

impl BitSet<usize> for [usize]

fn capacity(&self) -> usize

fn has(&self, index: usize) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> usize

impl BitSet<usize> for [AtomicUsize]

fn capacity(&self) -> usize

fn has(&self, index: usize) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> usize

impl<Set, T> BitSet<T> for &Set

where Set: BitSet<T> + ?Sized,

fn capacity(&self) -> T

fn has(&self, index: T) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> T

impl<Set, T> BitSet<T> for Box<Set>

where Set: BitSet<T> + ?Sized,

fn capacity(&self) -> T

fn has(&self, index: T) -> bool

fn is_empty(&self) -> bool

fn size(&self) -> T

Implementors