pub fn counts_ahash<T: Hash + Eq + Clone>(v: &[T]) -> AHashMap<T, usize>
{
    let mut counts = AHashMap::new();
    v.iter().for_each(|item| *counts.entry(item.clone()).or_default() += 1);
    counts
}
/// same as Itertools::counts() but returns an AHashMap instead of a HashMap
same as Itertools::counts() but returns an AHashMap instead of a HashMap
same as Itertools :: counts () but returns an AHashMap instead of a HashMap
pub fn counts_ahash<T: Hash + Eq + Clone>(v: &[T]) -> AHashMap<T, usize>
{
    let mut counts = AHashMap::new();
    v.iter().for_each(|item| *counts.entry(item.clone()).or_default() += 1);
    counts
}
pub fn counts_ahash < T : Hash + Eq + Clone > ( v : & [ T ] ) -> AHashMap < T , usize > { let mut counts = AHashMap :: new ( ) ; v . iter ( ) . for_each ( | item | * counts . entry ( item . clone ( ) ) . or_default ( ) += 1 ) ; counts }
same as Itertools::counts() but returns an AHashMap instead of a HashMap
same as Itertools :: counts () but returns an AHashMap instead of a HashMap
v
&[T]
v
&[T]