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

//! 🧩 Find Duplicates (Generic, Hashable)
//!
//! Returns a vector of all duplicate elements in the slice.
//!
//! # Type Parameters
//! * `T`: The element type. Must implement `Eq` + `Hash` + `Clone`.
//!
//! # Arguments
//! * `slice` - The slice to search for duplicates.
//!
//! # Returns
//! * `Vec<T>` - A vector containing all duplicates (each duplicate appears once).
//!
//! # Example
//! ```rust
//! use pofk_algorithm::list_algorithms::find_duplicates::find_duplicates;
//! let arr = [1, 2, 2, 3, 4, 4, 4, 5];
//! let mut dups = find_duplicates(&arr);
//! dups.sort();
//! let mut expected = vec![2, 4];
//! expected.sort();
//! assert_eq!(dups, expected);
//! ```
use std::collections::HashSet;
pub fn find_duplicates<T: Eq + std::hash::Hash + Clone>(slice: &[T]) -> Vec<T> {
    let mut seen = HashSet::new();
    let mut duplicates = HashSet::new();
    for item in slice {
        if !seen.insert(item) {
            duplicates.insert(item.clone());
        }
    }
    duplicates.into_iter().collect()
}