Expand description
A hash multiset implemented as a HashMap where the value is usize.
A mset, multiset, or bag is a set that allows multiple occurances of an
element. This implementation is backed by an underlying HashMap instance
and supports an API similar to set with some additions to make multiple
additions and removals easier and a Cloneconstraint for efficiency of
storage.
See the MultiSet struct documentation for more examples and specific
constraints.
Structs
A lazy iterator producing elements in the difference of
MultiSets.An iterator over the element counts of a
MultiSet.A lazy iterator producing elements in the intersection of
MultiSets.An owning iterator over the items of a
MultiSet.An iterator over the items of a
MultiSet.A hash multiset implemented as a
HashMap where the value is usize.A lazy iterator producing elements in the symmetric difference of
MultiSets.A lazy iterator producing elements in the union of
MultiSets.Type Definitions
An iterator over the elements of a
MultiSet.