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

//! 🔍 Detect Duplicates in a Collection (Generic, Hashable)
//!
//! Returns true if the collection contains any duplicate elements.
//!
//! # Type Parameters
//! * `T`: The element type. Must implement `Eq` + `Hash`.
//!
//! # Arguments
//! * `slice` - The slice to check for duplicates.
//!
//! # Returns
//! * `bool` - True if duplicates exist, false otherwise.
//!
//! # Example
//! ```rust
//! use pofk_algorithm::set_algorithms::has_duplicates::has_duplicates;
//! let arr = [1, 2, 3, 2];
//! assert!(has_duplicates(&arr));
//! ```
use std::collections::HashSet;
pub fn has_duplicates<T: Eq + std::hash::Hash>(slice: &[T]) -> bool {
    let mut seen = HashSet::new();
    for item in slice {
        if !seen.insert(item) {
            return true;
        }
    }
    false
}