Struct Histogram 

pub struct Histogram<T: Eq + Hash> {
    pub lookup: IndexMap<T, usize>,
}

A convenience to analyze the distribution of generated values

Fields

lookup: IndexMap<T, usize>

Implementations

impl<T: Eq + Hash> Histogram<T>

pub fn from(iter: impl IntoIterator<Item = T>) -> Self

pub fn iter(&self) -> impl Iterator<Item = (&T, usize)>

Returns an iterator over the histogram entries, sorted by occurrence count in ascending order.

Trait Implementations

impl<T: Debug + Eq + Hash> Debug for Histogram<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash> FromIterator<T> for Histogram<T>

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

Creates a value from an iterator.

impl<'a, T: Eq + Hash> IntoIterator for &'a Histogram<T>

type Item = (&'a T, usize)

The type of the elements being iterated over.

type IntoIter = Map<Iter<'a, T, usize>, fn((&'a T, &'a usize)) -> (&'a T, usize)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Eq + Hash> IntoIterator for Histogram<T>

type Item = (T, usize)

The type of the elements being iterated over.

type IntoIter = IntoIter<T, usize>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.