Struct elements_frequency::Elements

pub struct Elements<'list, T> { /* fields omitted */ }

This struct holds 3 fields:
1.list: The list itself

2. couple_hash: Elements hashed to their frequency. they may come unordered when iterated over.

3. ordered_table: This field holds the ordered frequency table.

Implementations

impl<'list, T> Elements<'list, T> where
    T: Clone + Hash + Eq, 

pub fn new(list: &'list Vec<T>) -> Self

Returns a new instance of the struct.

pub fn hash_couple(&mut self) -> &mut Self

Hash the elements to its frequency.

pub fn update_order(&mut self) -> &Self

When we iterate over the hash, the elements might come unordered. So we update their order in this method in a third list namingly frequency table.

pub fn result(&self) -> &Vec<Row<T>>

Finally we need to chain hash_couple and update_order with result method to get final result.

Examples

use elements_frequency::{Row, Elements};
 
let list = vec![-5, 11, 4, 4, -5, -7, 11];
 
let mut elements = Elements::new(&list);
 
let frequency_table = elements.hash_couple().update_order().result();

Trait Implementations

impl<'list, T: Debug> Debug for Elements<'list, T>

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

Formats the value using the given formatter.