Struct SmallBitSet

pub struct SmallBitSet { /* private fields */ }

Efficiently stores a set of numbers which are expected to be very small. Values < 32/64 (depending on the architecture) are stored inline, while values larger than that will lead to an allocation.

Implementations

impl SmallBitSet

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 SmallBitSet

fn clone(&self) -> SmallBitSet

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SmallBitSet

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

Formats the value using the given formatter.

impl Default for SmallBitSet

fn default() -> Self

Returns the “default value” for a type.

impl Hash for SmallBitSet

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 SmallBitSet

fn eq(&self, other: &SmallBitSet) -> 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 SmallBitSet