lo_ 0.3.1

A modern Rust utility library delivering modularity, performance & extras ported from JavaScript Lodash
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

use std::collections::HashSet;
use std::hash::Hash;

/// Creates an array of unique values that are included in all given arrays. The order and references of result values are determined by the first array.
///
/// # Example
/// ```rust
/// use lo_::intersection;
/// let array1 = vec![1, 2, 3];
/// let array2 = vec![3, 4, 5];
/// let mut result = intersection(&array1, &array2);
/// assert_eq!(result, vec![3]);
///
/// ```
pub fn intersection<T: Eq + Clone + Hash>(array1: &[T], array2: &[T]) -> Vec<T> {
    let set1: HashSet<&T> = array1.iter().collect();
    let set2: HashSet<&T> = array2.iter().collect();

    // Find the common elements and clone them into a Vec
    let common_elements: Vec<T> = set1
        .intersection(&set2)
        .cloned()
        .cloned() // Clone the elements to convert from &&T to T
        .collect();

    common_elements
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_intersection_with_common_elements() {
        let array1 = vec![1, 2, 3, 4, 5];
        let array2 = vec![4, 5, 6, 7, 8];
        let mut result = intersection(&array1, &array2);
        result.sort(); // Sort the result
        let mut expected = vec![4, 5];
        expected.sort(); // Sort the expected output
        assert_eq!(result, expected);
    }

    #[test]
    fn test_intersection_with_no_common_elements() {
        let array1 = vec![1, 2, 3];
        let array2 = vec![4, 5, 6];
        let result = intersection(&array1, &array2);
        assert_eq!(result, vec![]);
    }

    #[test]
    fn test_intersection_with_empty_arrays() {
        let array1: Vec<i32> = vec![];
        let array2: Vec<i32> = vec![];
        let result = intersection(&array1, &array2);
        assert_eq!(result, vec![]);
    }
}