graphrs 0.11.16

graphrs is a Rust package for the creation, manipulation and analysis of graphs.
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

use std::collections::HashSet;
use std::hash::Hash;
use nohash::{IntSet, IsEnabled};

/// Extends `HashSet` with the `without` method.
pub trait HashSetExt<T> {
    fn without(&self, value: &T) -> HashSet<T>;
}

impl<T> HashSetExt<T> for HashSet<T>
where
    T: Clone + Eq + Hash,
{
    /**
    Returns a copy of the `HashSet` that doesn't contain the specified `value`.
    */
    fn without(&self, value: &T) -> HashSet<T> {
        self.iter().filter(|v| *v != value).cloned().collect()
    }
}

/// Extends `HashSet` with the `without` method.
pub trait IntSetExt<T> {
    fn without(&self, value: &T) -> IntSet<T>;
}

impl<T> IntSetExt<T> for IntSet<T>
where
    T: Clone + Eq + Hash + IsEnabled,
{
    /**
    Returns a copy of the `HashSet` that doesn't contain the specified `value`.
    */
    fn without(&self, value: &T) -> IntSet<T> {
        self.iter().filter(|v| *v != value).cloned().collect()
    }
}

#[cfg(test)]
mod tests {

    use super::*;
    use itertools::Itertools;

    #[test]
    fn test_without_1() {
        let hs1: HashSet<i32> = vec![1, 2, 3].into_iter().collect();
        let hs2 = hs1.without(&2);
        assert_eq!(hs2.len(), 2);
        let v: Vec<i32> = hs2.into_iter().sorted().collect();
        assert_eq!(v, vec![1, 3]);
    }
}