Struct BitSet 

pub struct BitSet { /* private fields */ }

Implementations

impl BitSet

pub fn new(size: usize) -> Self

Examples found in repository

crates/competitive/src/data_structure/bitset.rs (line 143)

    fn from_iter<T: IntoIterator<Item = bool>>(iter: T) -> Self {
        let mut set = BitSet::new(0);
        set.extend(iter);
        set
    }

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn ones(size: usize) -> Self

pub fn get(&self, i: usize) -> bool

Examples found in repository

crates/competitive/src/algorithm/automata_learning.rs (line 384)

    pub fn construct_dfa(&mut self) -> DeterministicFiniteAutomaton {
        let sigma = self.automaton.sigma();
        let mut dfa = DeterministicFiniteAutomaton {
            states: vec![],
            initial_state: 0,
        };
        let mut i_prefix = 0;
        while i_prefix < self.prefixes.len() {
            let mut delta = vec![];
            for x in 0..sigma {
                let prefix: Vec<usize> =
                    self.prefixes[i_prefix].iter().cloned().chain([x]).collect();
                let index = self.add_prefix(prefix);
                delta.push(index);
            }
            dfa.states.push(DfaState {
                delta,
                accept: self.table[i_prefix].get(0),
            });
            i_prefix += 1;
        }
        dfa
    }

pub fn set(&mut self, i: usize, b: bool)

pub fn count_ones(&self) -> u64

Examples found in repository

crates/competitive/src/data_structure/bitset.rs (line 56)

    pub fn count_zeros(&self) -> u64 {
        self.size as u64 - self.count_ones()
    }

pub fn count_zeros(&self) -> u64

pub fn push(&mut self, b: bool)

Examples found in repository

crates/competitive/src/algorithm/automata_learning.rs (lines 356-359)

    fn add_suffix(&mut self, suffix: Vec<usize>) {
        if self.suffixes.contains(&suffix) {
            return;
        }
        for (prefix, table) in self.prefixes.iter_mut().zip(&mut self.table) {
            table.push(
                self.automaton
                    .behavior(prefix.iter().cloned().chain(suffix.iter().cloned())),
            );
        }
        self.suffixes.push(suffix);
        self.row_map.clear();
        for (i_prefix, row) in self.table.iter().enumerate() {
            self.row_map.insert(row.clone(), i_prefix);
        }
    }

pub fn shl_bitor_assign(&mut self, rhs: usize)

pub fn shr_bitor_assign(&mut self, rhs: usize)

Trait Implementations

impl<'b> BitAnd<&'b BitSet> for &BitSet

type Output = BitSet

The resulting type after applying the & operator.

fn bitand(self, rhs: &'b BitSet) -> Self::Output

Performs the & operation.

impl<'a> BitAnd<&'a BitSet> for BitSet

type Output = BitSet

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a Self) -> Self::Output

Performs the & operation.

impl<'a> BitAndAssign<&'a BitSet> for BitSet

fn bitand_assign(&mut self, rhs: &'a Self)

Performs the &= operation.

impl<'b> BitOr<&'b BitSet> for &BitSet

type Output = BitSet

The resulting type after applying the | operator.

fn bitor(self, rhs: &'b BitSet) -> Self::Output

Performs the | operation.

impl<'a> BitOr<&'a BitSet> for BitSet

type Output = BitSet

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a Self) -> Self::Output

Performs the | operation.

impl<'a> BitOrAssign<&'a BitSet> for BitSet

fn bitor_assign(&mut self, rhs: &'a Self)

Performs the |= operation.

impl<'b> BitXor<&'b BitSet> for &BitSet

type Output = BitSet

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'b BitSet) -> Self::Output

Performs the ^ operation.

impl<'a> BitXor<&'a BitSet> for BitSet

type Output = BitSet

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a Self) -> Self::Output

Performs the ^ operation.

impl<'a> BitXorAssign<&'a BitSet> for BitSet

fn bitxor_assign(&mut self, rhs: &'a Self)

Performs the ^= operation.

impl Clone for BitSet

fn clone(&self) -> BitSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BitSet

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

Formats the value using the given formatter.

impl Default for BitSet

fn default() -> BitSet

Returns the “default value” for a type.

impl Extend<bool> for BitSet

fn extend<T: IntoIterator<Item = bool>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<bool> for BitSet

fn from_iter<T: IntoIterator<Item = bool>>(iter: T) -> Self

Creates a value from an iterator.

impl Hash for BitSet

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Not for &BitSet

type Output = BitSet

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl Not for BitSet

type Output = BitSet

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl Ord for BitSet

fn cmp(&self, other: &BitSet) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for BitSet

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for BitSet

fn partial_cmp(&self, other: &BitSet) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Shl<usize> for BitSet

type Output = BitSet

The resulting type after applying the << operator.

fn shl(self, rhs: usize) -> Self::Output

Performs the << operation.

impl ShlAssign<usize> for BitSet

fn shl_assign(&mut self, rhs: usize)

Performs the <<= operation.

impl Shr<usize> for BitSet

type Output = BitSet

The resulting type after applying the >> operator.

fn shr(self, rhs: usize) -> Self::Output

Performs the >> operation.

impl ShrAssign<usize> for BitSet

fn shr_assign(&mut self, rhs: usize)

Performs the >>= operation.

impl Eq for BitSet

impl StructuralPartialEq for BitSet