murrelet_common 0.1.3

common functions for murrelet, a livecode framework
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181

struct PrevCurrNextNoLoopIter<'a, T> {
    data: &'a [T], // view of the data
    len: usize,
    index: usize, // where we currently are
}

impl<'a, T> PrevCurrNextNoLoopIter<'a, T> {
    fn new(data: &'a [T]) -> Self {
        Self {
            data,
            index: 0,
            len: data.len(),
        }
    }
}

impl<'a, T> Iterator for PrevCurrNextNoLoopIter<'a, T> {
    type Item = (&'a T, &'a T, &'a T);

    fn next(&mut self) -> Option<Self::Item> {
        // if we're at the end, return
        if self.index + 2 >= self.len {
            return None;
        }
        let result = (
            &self.data[self.index],
            &self.data[self.index + 1],
            &self.data[self.index + 2],
        );
        self.index += 1;
        Some(result)
    }
}

pub fn prev_curr_next_no_loop_iter<'a, T>(
    v: &'a [T],
) -> Box<dyn Iterator<Item = (&'a T, &'a T, &'a T)> + 'a> {
    let iter = PrevCurrNextNoLoopIter::new(v);
    Box::new(iter)
}

struct PrevCurrNextWithLoopIter<'a, T> {
    data: &'a [T], // view of the data
    len: usize,
    index: usize, // where we currently are
}

impl<'a, T> PrevCurrNextWithLoopIter<'a, T> {
    fn new(data: &'a [T]) -> Self {
        Self {
            data,
            len: data.len(),
            index: 0,
        }
    }
}

impl<'a, T> Iterator for PrevCurrNextWithLoopIter<'a, T> {
    type Item = (&'a T, &'a T, &'a T);

    fn next(&mut self) -> Option<Self::Item> {
        // if we're at the end, return
        if self.index >= self.len {
            return None;
        }

        if self.index + 2 == self.len {
            let result = (
                &self.data[self.index],
                &self.data[self.index + 1],
                &self.data[0],
            );
            self.index += 1;
            return Some(result);
        }

        if self.index + 1 == self.len {
            let result = (&self.data[self.index], &self.data[0], &self.data[1]);
            self.index += 1;
            return Some(result);
        }

        let result = (
            &self.data[self.index],
            &self.data[self.index + 1],
            &self.data[self.index + 2],
        );
        self.index += 1;
        Some(result)
    }
}

pub fn prev_curr_next_loop_iter<'a, T>(
    v: &'a [T],
) -> Box<dyn Iterator<Item = (&'a T, &'a T, &'a T)> + 'a> {
    let iter = PrevCurrNextWithLoopIter::new(v);
    Box::new(iter)
}

struct CurrNextNoLoopIter<'a, T> {
    data: &'a [T], // view of the data
    len: usize,
    index: usize, // where we currently are
}

impl<'a, T> CurrNextNoLoopIter<'a, T> {
    fn new(data: &'a [T]) -> Self {
        Self {
            data,
            len: data.len(),
            index: 0,
        }
    }
}

impl<'a, T> Iterator for CurrNextNoLoopIter<'a, T> {
    type Item = (&'a T, &'a T);

    fn next(&mut self) -> Option<Self::Item> {
        // if we're at the end, return
        if self.index + 1 >= self.len {
            return None;
        }
        let result = (&self.data[self.index], &self.data[self.index + 1]);
        self.index += 1;
        Some(result)
    }
}

pub fn curr_next_no_loop_iter<'a, T>(v: &'a [T]) -> Box<dyn Iterator<Item = (&'a T, &'a T)> + 'a> {
    let iter = CurrNextNoLoopIter::new(v);
    Box::new(iter)
}

struct CurrNextWithLoopIter<'a, T> {
    data: &'a [T], // view of the data
    len: usize,
    index: usize, // where we currently are
}

impl<'a, T> CurrNextWithLoopIter<'a, T> {
    fn new(data: &'a [T]) -> Self {
        Self {
            data,
            index: 0,
            len: data.len(),
        }
    }
}

impl<'a, T> Iterator for CurrNextWithLoopIter<'a, T> {
    type Item = (&'a T, &'a T);

    fn next(&mut self) -> Option<Self::Item> {
        // if we're at the end, return
        if self.index >= self.len {
            return None;
        }

        if self.index + 1 == self.len {
            let result = (&self.data[self.index], &self.data[0]);
            self.index += 1;
            return Some(result);
        }

        let result = (&self.data[self.index], &self.data[self.index + 1]);
        self.index += 1;
        Some(result)
    }
}

impl<'a, T> ExactSizeIterator for CurrNextWithLoopIter<'a, T> {
    fn len(&self) -> usize {
        self.len
    }
}

pub fn curr_next_loop_iter<'a, T>(v: &'a [T]) -> Box<dyn Iterator<Item = (&'a T, &'a T)> + 'a> {
    let iter = CurrNextWithLoopIter::new(v);
    Box::new(iter)
}