Struct compacts::bits::Set

pub struct Set { /* fields omitted */ }

Set is a set of u32.

Methods

impl Set

pub fn write_to<W: Write>(&self, write: W) -> Result<()>

pub fn read_from<R: Read>(read: R) -> Result<Self>

impl Set

pub fn new() -> Self

pub fn clear(&mut self)

pub fn get(&self, x: u32) -> bool

pub fn put(&mut self, x: u32, enabled: bool) -> bool

pub fn insert(&mut self, x: u32) -> bool

pub fn remove(&mut self, x: u32) -> bool

pub fn shrink(&mut self)

impl Set

Important traits for And<'a, L, R>

impl<'a, L, R> Iterator for And<'a, L, R> where
    L: Iterator<Item = Cow<'a, Entry>>,
    R: Iterator<Item = Cow<'a, Entry>>,  type Item = Cow<'a, Entry>;

pub fn and<'a, T>(&'a self, that: T) -> And<'a, SetEntries<'a>, T::IntoIter> where     T: IntoIterator<Item = Cow<'a, Entry>>,

Important traits for Or<'a, L, R>

impl<'a, L, R> Iterator for Or<'a, L, R> where
    L: Iterator<Item = Cow<'a, Entry>>,
    R: Iterator<Item = Cow<'a, Entry>>,  type Item = Cow<'a, Entry>;

pub fn or<'a, T>(&'a self, that: T) -> Or<'a, SetEntries<'a>, T::IntoIter> where     T: IntoIterator<Item = Cow<'a, Entry>>,

Important traits for AndNot<'a, L, R>

impl<'a, L, R> Iterator for AndNot<'a, L, R> where
    L: Iterator<Item = Cow<'a, Entry>>,
    R: Iterator<Item = Cow<'a, Entry>>,  type Item = Cow<'a, Entry>;

pub fn and_not<'a, T>(     &'a self,     that: T ) -> AndNot<'a, SetEntries<'a>, T::IntoIter> where     T: IntoIterator<Item = Cow<'a, Entry>>,

Important traits for Xor<'a, L, R>

impl<'a, L, R> Iterator for Xor<'a, L, R> where
    L: Iterator<Item = Cow<'a, Entry>>,
    R: Iterator<Item = Cow<'a, Entry>>,  type Item = Cow<'a, Entry>;

pub fn xor<'a, T>(&'a self, that: T) -> Xor<'a, SetEntries<'a>, T::IntoIter> where     T: IntoIterator<Item = Cow<'a, Entry>>,

pub fn bits<'a>(     &'a self ) -> impl Iterator<Item = u32> + 'a

Trait Implementations

impl Debug for Set

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

Formats the value using the given formatter.

impl Clone for Set

fn clone(&self) -> Set

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for Set

fn default() -> Set

Returns the "default value" for a type.

impl PartialEq for Set

fn eq(&self, other: &Set) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Set) -> bool

This method tests for !=.

impl Eq for Set

impl<'a> IntoIterator for &'a Set

type Item = Cow<'a, Entry>

The type of the elements being iterated over.

type IntoIter = SetEntries<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: AsRef<[u32]>> From<T> for Set

fn from(v: T) -> Self

Performs the conversion.

impl<'a> FromIterator<Entry> for Set

fn from_iter<I>(iter: I) -> Self where     I: IntoIterator<Item = Entry>,

Creates a value from an iterator.

impl<'a> FromIterator<Cow<'a, Entry>> for Set

fn from_iter<I>(iter: I) -> Self where     I: IntoIterator<Item = Cow<'a, Entry>>,

Creates a value from an iterator.

impl Index<u32> for Set

type Output = bool

The returned type after indexing.

fn index(&self, i: u32) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PopCount<u64> for Set

const MAX_BOUND: u64

MAX_BOUND: u64 = 1 << 32

fn count1(&self) -> u64

fn count0(&self) -> T where     T: Sub<Output = T>,

impl Rank<u32> for Set

fn rank1(&self, i: u32) -> u32

Returns occurences of non-zero bit in [0, i). rank1(i) should be equal to i - self.rank0(i).

fn rank0(&self, i: T) -> T where     T: Sub<Output = T> + Copy,

Returns occurences of zero bit in [0, i). rank0(i) should be equal to i - self.rank1(i).

impl Select1<u32> for Set

fn select1(&self, c: u32) -> Option<u32>

Returns the position of 'c+1'th appearance of non-zero bit.

impl Select0<u32> for Set

fn select0(&self, c: u32) -> Option<u32>

Returns the position of 'c+1'th appearance of non-zero bit.