Struct frequency_btreemap::BTreeMapFrequency
[−]
[src]
pub struct BTreeMapFrequency<T, N = usize> where
T: Ord,
N: Num, { /* fields omitted */ }
A frequency counter backed by a BTreeMap
.
Methods
impl<T, N> BTreeMapFrequency<T, N> where
T: Ord,
N: Num,
[src]
T: Ord,
N: Num,
fn new() -> BTreeMapFrequency<T, N>
Creates an empty BTreeMapFrequency
, a frequency counter backed
by a BTreeMap.
fn len(&self) -> usize
Returns the number of elements that have been counted.
fn is_empty(&self) -> bool
Returns true if the counter contains no elements.
Trait Implementations
impl<'t, T, N> Frequency<'t, T> for BTreeMapFrequency<T, N> where
T: 't + Ord,
N: 't + Num + Clone,
[src]
T: 't + Ord,
N: 't + Num + Clone,
type N = N
The type used to record counts.
type Iter = Iter<'t, T, Self::N>
The type of an iterator over item-count pairs.
type Items = Keys<'t, T, Self::N>
The type of an iterator over items.
type Counts = Values<'t, T, Self::N>
The type of an iterator over counts.
fn count(&self, key: &T) -> Self::N
Returns the count of an item.
fn increment(&mut self, value: T)
Increments the count for an item.
fn iter(&'t self) -> Self::Iter
An iterator visiting all key-value pairs. Iterator element type is (&'t T, &'t usize)
. Read more
fn items(&'t self) -> Self::Items
An iterator visiting all keys in arbitrary order. Iterator element type is &'t T
. Read more
fn counts(&'t self) -> Self::Counts
An iterator visiting all counts in arbitrary order. Iterator element type is &'t usize
. Read more
impl<T, N> Default for BTreeMapFrequency<T, N> where
T: Ord,
N: Num,
[src]
T: Ord,
N: Num,
fn default() -> BTreeMapFrequency<T, N>
Creates an empty BTreeMapFrequency<T, V, S>
, a frequency counter backed
by a BTreeMap with the Default
value for the hasher.
impl<T, N> Extend<T> for BTreeMapFrequency<T, N> where
T: Ord,
N: Num + Clone,
[src]
T: Ord,
N: Num + Clone,
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
Extends a collection with the contents of an iterator. Read more
impl<T, N> FromIterator<T> for BTreeMapFrequency<T, N> where
T: Ord,
N: Num + Clone,
[src]
T: Ord,
N: Num + Clone,
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
Creates a value from an iterator. Read more
impl<'t, T, N> IntoIterator for &'t BTreeMapFrequency<T, N> where
T: 't + Ord,
N: 't + Num + Clone,
[src]
T: 't + Ord,
N: 't + Num + Clone,
type Item = <<BTreeMapFrequency<T, N> as Frequency<'t, T>>::Iter as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = <BTreeMapFrequency<T, N> as Frequency<'t, T>>::Iter
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
Creates an iterator from a value. Read more
impl<T, N> AsRef<BTreeMap<T, N>> for BTreeMapFrequency<T, N> where
T: Ord,
N: Num,
[src]
T: Ord,
N: Num,
impl<T, N> AsMut<BTreeMap<T, N>> for BTreeMapFrequency<T, N> where
T: Ord,
N: Num,
[src]
T: Ord,
N: Num,