Struct BitMap 

pub struct BitMap<E, S> { /* private fields */ }

Implementations

impl<E, S> BitMap<E, S>

where E: Copy + Into<u32> + TryFrom<u32>, S: BitStorage,

pub fn new() -> Self

pub fn insert(&mut self, e: E)

pub fn contains(&self, e: E) -> bool

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<E, S>

Iterate elements in ascending order. The smallest element (if any) is self.iter().next().

Trait Implementations

impl<E, S: BitStorage> BitOr for BitMap<E, S>

type Output = BitMap<E, S>

The resulting type after applying the | operator.

fn bitor(self, rhs: Self) -> Self

Performs the | operation.

impl<E, S: BitStorage> BitOrAssign for BitMap<E, S>

fn bitor_assign(&mut self, rhs: Self)

Performs the |= operation.

impl<E: Clone, S: Clone> Clone for BitMap<E, S>

fn clone(&self) -> BitMap<E, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Copy, S: Copy> Copy for BitMap<E, S>

impl<E: Debug, S: Debug> Debug for BitMap<E, S>

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

Formats the value using the given formatter.

impl<E: Default, S: Default> Default for BitMap<E, S>

fn default() -> BitMap<E, S>

Returns the “default value” for a type.

impl<E: Eq, S: Eq> Eq for BitMap<E, S>

impl<E, S> FromIterator<E> for BitMap<E, S>

where E: Copy + Into<u32> + TryFrom<u32>, S: BitStorage,

fn from_iter<I: IntoIterator<Item = E>>(iter: I) -> Self

Creates a value from an iterator.

impl<E: Hash, S: Hash> Hash for BitMap<E, S>

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<E: Ord, S: Ord> Ord for BitMap<E, S>

fn cmp(&self, other: &BitMap<E, S>) -> 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<E: PartialEq, S: PartialEq> PartialEq for BitMap<E, S>

fn eq(&self, other: &BitMap<E, S>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<E: PartialOrd, S: PartialOrd> PartialOrd for BitMap<E, S>

fn partial_cmp(&self, other: &BitMap<E, S>) -> 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<E: PartialEq, S: PartialEq> StructuralPartialEq for BitMap<E, S>