pofk_algorithm 0.0.3

A collection of efficient algorithms implemented in Rust for real-world projects.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

//! 🆙 Frequency Uniqueness (Generic, Hashable)
//!
//! Returns true if all element frequencies in the slice are unique.
//!
//! # Type Parameters
//! * `T`: The element type. Must implement `Eq` + `Hash`.
//!
//! # Arguments
//! * `slice` - The slice to check.
//!
//! # Returns
//! * `bool` - True if all frequencies are unique, false otherwise.
//!
//! # Example
//! ```rust
//! use pofk_algorithm::set_algorithms::is_frequency_unique::is_frequency_unique;
//! let arr = [1, 2, 2, 3, 3, 3];
//! assert!(is_frequency_unique(&arr));
//! let arr = [1, 2, 2, 3, 3];
//! assert!(!is_frequency_unique(&arr));
//! ```
use std::collections::{HashMap, HashSet};
pub fn is_frequency_unique<T: Eq + std::hash::Hash>(slice: &[T]) -> bool {
    let mut freq = HashMap::new();
    for item in slice {
        *freq.entry(item).or_insert(0) += 1;
    }
    let mut seen = HashSet::new();
    for &count in freq.values() {
        if !seen.insert(count) {
            return false;
        }
    }
    true
}