easier 0.3.0

making rust easier
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
60
61

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

pub trait UniqueExtension: IntoIterator {
    /// Returns an iterator with unique items
    /// The ordering is guaranteed to be the same as the original
    /// ```rust
    /// use easier::prelude::*;
    /// let arr = ["1", "1", "22", "333", "333", "1"];
    /// let mut unique = arr.unique();
    /// assert_eq!(unique.next(), Some("1"));
    /// ```
    fn unique(self) -> IntoIter<Self::Item>
    where
        Self::Item: Eq + Hash + Clone;
}

impl<I> UniqueExtension for I
where
    I: IntoIterator,
{
    ///note this turns into a vec, then back into an iterator
    fn unique(self) -> IntoIter<Self::Item>
    where
        Self::Item: Eq + Hash + Clone,
    {
        let mut map = HashSet::new();
        let mut vec = vec![];
        for item in self {
            if map.contains(&item) {
                continue;
            }
            map.insert(item.clone());
            vec.push(item);
        }
        vec.into_iter()
    }
}

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

    #[test]
    fn test_unique() {
        let arr = ["1", "1", "22", "333", "333", "1"];
        let mut unique = arr.unique();
        assert_eq!(unique.next(), Some("1"));
        assert_eq!(unique.next(), Some("22"));
        assert_eq!(unique.next(), Some("333"));
        assert_eq!(unique.next(), None);
    }
    #[test]
    fn doc() {
        let vec = vec![1, 3, 2, 2, 1];
        let uniques = vec.into_iter().unique().to_vec();
        assert_eq!(uniques, [1, 3, 2]);
    }
}