Struct Frequencies 

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

A commutative data structure for exact frequency counts.

Implementations

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

pub fn new() -> Frequencies<T>

Create a new frequency table with no samples.

pub fn with_capacity(capacity: usize) -> Self

pub fn add(&mut self, v: T)

Add a value to the frequency table.

pub fn count(&self, v: &T) -> u64

Return the number of occurrences of v in the data.

pub fn cardinality(&self) -> u64

Return the cardinality (number of unique elements) in the data.

pub fn most_frequent(&self) -> (Vec<(&T, u64)>, u64)

Return a Vec of elements, their corresponding counts in descending order, and the total count.

pub fn least_frequent(&self) -> (Vec<(&T, u64)>, u64)

Return a Vec of elements, their corresponding counts in ascending order, and the total count.

pub fn par_frequent(&self, least: bool) -> (Vec<(&T, u64)>, u64)

where for<'a> (&'a T, u64): Send, T: Ord,

Return a Vec of elements, their corresponding counts in order based on the least parameter, and the total count. Uses parallel sort.

pub fn len(&self) -> usize

Returns the cardinality of the data.

pub fn is_empty(&self) -> bool

Returns true if there is no frequency/cardinality data.

pub fn unique_values(&self) -> UniqueValues<'_, T>

Return an iterator over the unique values of the data.

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

where T: Ord,

Get the top N most frequent items without sorting the entire vector This is much faster than most_frequent() when you only need a few items

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

where T: Ord,

Similar to top_n but for least frequent items

pub fn items_with_count(&self, n: u64) -> Vec<&T>

Get items with exactly n occurrences

pub fn total_count(&self) -> u64

Get the sum of all counts

pub fn has_count(&self, n: u64) -> bool

Check if any item occurs exactly n times

pub fn increment_by(&mut self, v: T, count: u64)

Add specialized method for single increment

Trait Implementations

impl<T: Clone> Clone for Frequencies<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Eq + Hash> Commute for Frequencies<T>

fn merge(&mut self, v: Frequencies<T>)

Merges the value other into self.

fn consume<I: Iterator<Item = Self>>(&mut self, other: I)

Merges the values in the iterator into self.

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

Available on debug-assertions enabled only.

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

Formats the value using the given formatter.

impl<T: Eq + Hash> Default for Frequencies<T>

fn default() -> Frequencies<T>

Returns the “default value” for a type.

impl<T: Eq + Hash> Extend<T> for Frequencies<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, it: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

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

fn from_iter<I: IntoIterator<Item = T>>(it: I) -> Frequencies<T>

Creates a value from an iterator.