Struct Counter 

pub struct Counter<T: Eq + Hash + Copy + PartialOrd + PartialEq> { /* private fields */ }

Implementations

impl<T: Eq + Hash + Copy + PartialOrd + PartialEq> Counter<T>

pub fn new() -> Self

pub fn from(self, iterable: impl IntoIterator<Item = T> + Clone) -> Counter<T>

pub fn get(&self, key: T) -> Option<usize>

pub fn update(&mut self, key: T, count: usize)

pub fn elements(&self) -> impl IntoIterator<Item = T>

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

pub fn most_common(&self, n: usize) -> Vec<(&T, &usize)>

pub fn substract(&self, other: &Self) -> Counter<T>

pub fn total(&self) -> usize

pub fn clear(&mut self)

Trait Implementations

impl<T: Clone + Eq + Hash + Copy + PartialOrd + PartialEq> Clone for Counter<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Eq + Hash + Copy + PartialOrd + PartialEq> Default for Counter<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: PartialEq + Eq + Hash + Copy + PartialOrd + PartialEq> PartialEq for Counter<T>

fn eq(&self, other: &Counter<T>) -> 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 + Eq + Hash + Copy + PartialOrd + PartialEq> Eq for Counter<T>

impl<T: Eq + Hash + Copy + PartialOrd + PartialEq> StructuralPartialEq for Counter<T>