BitSet::new

pub static fn new() -> BitSet

use collections::bitset::{BitSet};

Empty set with no word storage (grows on insert).

Returns#

BitSet

See also#

• BitSet: A set of non-negative ints stored as bits.
• BitSet::with_capacity: Empty set with storage for at least bits indices (0 → no words).
• BitSet::size: Number of set bits (cardinality).
• BitSet::is_empty: Returns true when no bit is set.
• BitSet::capacity: Current bit capacity (words.len() * 63); grows when inserting past it.
• BitSet::insert: Insert index i; returns true when newly set.
• BitSet::contains: True when index i is set.
• BitSet::remove: Clear index i; returns true when a bit was unset.