Struct BitSet

pub struct BitSet(/* private fields */);

Stores a set of numbers which are expected to be rather small.

Inserting a very small value is cheap while inserting a large one may be very expensive.

Unless you’re managing small numbers yourself, you should likely prefer SmallBitSet, which has a bit larger memory size, but does not allocate for small numbers.

Implementations

impl BitSet

pub fn new() -> Self

Creates a new empty bit set.

pub fn insert(&mut self, value: usize)

Inserts a number into the set.

pub fn contains(&self, value: usize) -> bool

Whether a number is present in the set.

Trait Implementations

impl Clone for BitSet

fn clone(&self) -> BitSet

Returns a copy 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() -> Self

Returns the “default value” for a type.

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 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 StructuralPartialEq for BitSet