Struct phreak_engine::multiset::MultiSet

pub struct MultiSet<T> where
    T: PartialEq + Eq + Hash,  { /* fields omitted */ }

A multiset or 'bag' is a set where items can be added multiple times

Example: '<< 1,1,2,4,4,4 >>'

Implementation detail: this set drops the redundant items and keeps a reference count

Methods

impl<T> MultiSet<T> where
    T: PartialEq + Eq + Hash, 

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn capacity(&self) -> usize

Returns the number of unique items the set can hold without allocating

pub fn clear(&mut self)

Drop all items from the set

pub fn is_empty(&self) -> bool

Returns true if no items exist in the set

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

Returns true if the item occurs at least once

pub fn count(&self, value: &T) -> usize

Returns the number of occurrences of the given item in the set

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

Insert an item to the set.

This method will drop the item if it already exists in the set, and increases the count instead, using reference counting instead of data duplication.

pub fn remove(&mut self, value: &T) -> bool

Removes an item from the set, and returns wetter it was present or not.

Important traits for Iter<'a, T>

impl<'a, T> Iterator for Iter<'a, T> type Item = &'a T;

pub fn iter(&self) -> Iter<T>

Trait Implementations

impl<T: Debug> Debug for MultiSet<T> where
    T: PartialEq + Eq + Hash, 

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

Formats the value using the given formatter.