splitter 0.2.5

A string and slice splitter library
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132


/// The info returned by a separator
/// 
/// `pos`: the position of where the next separator starts
/// 
/// `size`: the size of the next separator
#[derive(Debug)]
pub struct SepInfo {
    pub pos: usize,
    pub size: usize,
}

/// The trait every separator has to implement
pub trait Separator<T> {
    /// A separator will have to say, where the next separator in the slice
    /// is located (and what size it has), by providing a [`SepInfo`]
    fn separate(&self, _: &[T]) -> Option<SepInfo>;
}

impl<T: PartialEq> Separator<T> for T {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        ts.iter().enumerate().find(|(_, t)| *t == self).map(|(pos, _)| SepInfo {
            pos, size: 1,
        })
    }
}

impl<T: PartialEq> Separator<T> for &[T] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        let mut pos = 0;
        let len = ts.len();
        let size = self.len();
        while (pos + size) <= len {
            if ts[pos..pos + size].starts_with(self) {
                return Some(SepInfo { pos, size });
            }
            pos += 1;
        }
        None
    }
}

impl<T: PartialEq, const N: usize> Separator<T> for &[T; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        let mut pos = 0;
        let len = ts.len();
        while (pos + N) <= len {
            if ts[pos..pos + N].starts_with(*self) {
                return Some(SepInfo { pos, size: N });
            }
            pos += 1;
        }
        None
    }
}

impl<T: PartialEq, const N: usize> Separator<T> for [T; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        let mut pos = 0;
        let len = ts.len();
        while (pos + N) <= len {
            if ts[pos..pos + N].starts_with(self) {
                return Some(SepInfo { pos, size: N });
            }
            pos += 1;
        }
        None
    }
}

impl<T: PartialEq> Separator<T> for &[&[T]] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize> Separator<T> for &[&[T; N]] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize> Separator<T> for &[[T; N]] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize> Separator<T> for &[&[T]; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize, const M: usize> Separator<T> for &[&[T; M]; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize, const M: usize> Separator<T> for &[[T; M]; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize> Separator<T> for [&[T]; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize, const M: usize> Separator<T> for [&[T; M]; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}

impl<T: PartialEq, const N: usize, const M: usize> Separator<T> for [[T; M]; N] {
    fn separate(&self, ts: &[T]) -> Option<SepInfo> {
        self.iter().filter_map(|e| e.separate(ts))
            .min_by_key(|SepInfo { pos, size: _ }| *pos)
    }
}