Struct Multiset 

pub struct Multiset<T> { /* private fields */ }

Multiset for AC matching.

Represents a collection of elements where order doesn’t matter but multiplicity does.

Implementations

impl<T: Eq + Hash + Clone> Multiset<T>

pub fn new() -> Self

Create an empty multiset.

pub fn from_vec(vec: Vec<T>) -> Self

Create a multiset from a vector.

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

Insert an element into the multiset.

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

Remove an element from the multiset.

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

Check if the multiset contains an element.

pub fn is_empty(&self) -> bool

Check if the multiset is empty.

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

Get the number of occurrences of an element.

pub fn is_subset(&self, other: &Multiset<T>) -> bool

Check if this is a subset of another multiset.

Trait Implementations

impl<T: Clone> Clone for Multiset<T>

fn clone(&self) -> Multiset<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Multiset<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash + Clone> Default for Multiset<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eq + Hash> PartialEq for Multiset<T>

fn eq(&self, other: &Self) -> 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<T: Eq + Hash> Eq for Multiset<T>