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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
/*
 * Copyright 2016 rs-transducers developers
 *
 * Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
 * http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
 * <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
 * option. This file may not be copied, modified, or distributed
 * except according to those terms.
 */
pub mod transducers;
pub mod applications;

pub enum StepResult {
    Continue,
    Stop
}

/// Defines a reducing function from I to O with step errors of E
pub trait Reducing<I, O, E> {
    /// The type of each value after the reducing function
    type Item;

    /// Transducers must call the underlying `init`
    /// TODO: may not be required at all. Not currently used by any implementation
    fn init(&mut self) {}

    /// Each step, may fail
    /// TODO: the return type to contain an indicator of early termination
    fn step(&mut self, value: I) -> Result<StepResult, E>;

    /// Transducers must call the underlying `complete`
    fn complete(&mut self) -> Result<(), E>;
}

/// Defines a transducer that transforms a reducing function RI into
/// a reducing function RO
pub trait Transducer<RI> {
    type RO;
    fn new(self, reducing_fn: RI) -> Self::RO;
}

/// Composed transducers
pub struct ComposedTransducer<AT, BT> {
    a: AT,
    b: BT
}

impl <RI, RT, RO, AT, BT> Transducer<RI> for ComposedTransducer<AT, BT>
    where AT: Transducer<RI, RO=RT>,
          BT: Transducer<RT, RO=RO> {
    type RO = RO;

    fn new(self, reducing_fn: RI) -> Self::RO {
        self.b.new(self.a.new(reducing_fn))
    }
}

pub fn compose<AT, BT>(a: AT, b: BT) -> ComposedTransducer<AT, BT> {
    ComposedTransducer {
        a: a,
        b: b
    }
}

#[cfg(test)]
mod test {
    use std::collections::HashMap;
    use std::thread;

    use super::transducers;
    use super::applications::vec::{Into, Ref};
    use super::applications::iter::TransduceIter;
    use super::applications::channels::transducing_channel;

    #[test]
    fn test_vec_ref() {
        let source = vec![1, 2, 3];
        let transducer = transducers::map(|x| x + 1);
        let result = source.transduce_ref(transducer).unwrap();
        assert_eq!(vec![2, 3, 4], result);
    }

    /// A trivial function to test function references
    fn duplicator(i: isize) -> Vec<isize> {
        vec![i, i]
    }

    #[test]
    fn test_compose() {
        let source = vec![1, 2, 3];
        let ta = transducers::mapcat(duplicator);
        let tb = transducers::map(|x| x * 2);
        let transducer = super::compose(tb, ta);
        let result = source.transduce_into(transducer).unwrap();
        assert_eq!(vec![2, 2, 4, 4, 6, 6], result);
    }

    #[test]
    fn test_iterator() {
        let source = vec![1, 2, 3];
        let transducer = transducers::mapcat(duplicator);
        let result:Vec<isize> = source.into_iter().transduce(transducer).collect();
        assert_eq!(vec![1, 1, 2, 2, 3, 3], result);
    }

    #[test]
    fn test_filter() {
        {
            let source = vec![1, 2, 3, 4, 5];
            let transducer = transducers::filter(|x| x % 2 == 0);
            let result = source.transduce_into(transducer).unwrap();
            assert_eq!(vec![2, 4], result);
        }
        {
            let source = vec![1, 2, 3, 4, 5];
            let transducer = transducers::remove(|x| x % 2 == 0);
            let result = source.transduce_into(transducer).unwrap();
            assert_eq!(vec![1, 3, 5], result);
        }
    }

    #[test]
    fn test_partition() {
        {
            let source = vec![1, 2, 3, 4, 5, 6, 7];
            let transducer = transducers::partition(2);
            let result = source.transduce_into(transducer).unwrap();
            let expected_result:Vec<Vec<usize>> = vec![vec![1, 2], vec![3, 4], vec![5, 6]];
            assert_eq!(expected_result, result);
        }
        {
            let source = vec![1, 2, 3, 4, 5, 6, 7];
            let transducer = transducers::partition_all(2);
            let result = source.transduce_into(transducer).unwrap();
            let expected_result:Vec<Vec<usize>> = vec![vec![1, 2], vec![3, 4], vec![5, 6], vec![7]];
            assert_eq!(expected_result, result);
        }
    }

    #[test]
    fn test_take() {
        let source = vec![1, 2, 3, 4, 5, 6, 7];
        let transducer = transducers::take(5);
        let result = source.transduce_into(transducer).unwrap();
        assert_eq!(vec![1, 2, 3, 4, 5], result);

        let source2 = vec![1, 2, 3, 4, 5, 6, 7];
        let transducer2 = super::compose(transducers::take(2),
                                         transducers::filter(|x| x % 2 == 0));
        let result = source2.transduce_into(transducer2).unwrap();
        assert_eq!(vec![2, 4], result);
    }

    #[test]
    fn test_drop() {
        let source = vec![1, 2, 3, 4, 5, 6, 7];
        let transducer = transducers::drop(2);
        let result = source.transduce_into(transducer).unwrap();
        assert_eq!(vec![3, 4, 5, 6, 7], result);
    }

    #[test]
    fn test_take_while() {
        let source = vec![1, 2, 3, 4, 5, 6, 7];
        let transducer = transducers::take_while(|x| *x <= 5);
        let result = source.transduce_into(transducer).unwrap();
        assert_eq!(vec![1, 2, 3, 4, 5], result);
    }

    #[test]
    fn test_drop_while() {
        let source = vec![1, 2, 3, 4, 5, 6, 7];
        let transducer = transducers::drop_while(|x| *x <= 5);
        let result = source.transduce_into(transducer).unwrap();
        assert_eq!(vec![6, 7], result);
    }

    #[test]
    fn test_replace() {
        let source = vec![1, 2, 3, 1, 2, 3, 1, 2, 3];
        let mut replacements = HashMap::new();
        replacements.insert(1, 4);
        replacements.insert(3, 7);
        let transducer = transducers::replace(replacements);
        let result = source.transduce_into(transducer).unwrap();
        assert_eq!(vec![4, 2, 7, 4, 2, 7, 4, 2, 7], result);
    }

    #[test]
    fn test_partition_by() {
        let source = vec![1, 2, 3, 4, 5, 6];
        let transducer = transducers::partition_by(|&x| x > 3);
        let result = source.transduce_into(transducer).unwrap();
        let expected_result:Vec<Vec<usize>> = vec![vec![1, 2, 3], vec![4, 5, 6]];
        assert_eq!(expected_result, result);
    }

    #[test]
    fn test_keep() {
        let source = vec![1, 2, 3, 4, 5, 6];
        let transducer = transducers::keep(|x| {
            if x % 2 == 0 {
                Some(x)
            } else {
                None
            }
        });
        let result = source.transduce_into(transducer).unwrap();
        let expected_result = vec![2, 4, 6];
        assert_eq!(expected_result, result);
    }

    #[test]
    fn test_keep_indexed() {
        let source = vec![6, 5, 4, 3, 2, 1];
        let transducer = transducers::keep_indexed(|idx, x| {
            if x > idx {
                Some(x)
            } else {
                None
            }
        });
        let result = source.transduce_into(transducer).unwrap();
        let expected_result = vec![6, 5, 4];
        assert_eq!(expected_result, result);
    }

    #[test]
    fn test_map_indexed() {
        let source = vec![1, 2, 3, 4, 5, 6];
        let transducer = transducers::map_indexed(|idx, x| x + idx);
        let result = source.transduce_into(transducer).unwrap();
        let expected_result = vec![1, 3, 5, 7, 9, 11];
        assert_eq!(expected_result, result);
    }

    #[test]
    fn test_interpose() {
        let source = vec![1, 2, 3, 4];
        let transducer = transducers::interpose(0);
        let result = source.transduce_into(transducer).unwrap();
        let expected_result = vec![1, 0, 2, 0, 3, 0, 4];
        assert_eq!(expected_result, result);
    }

    #[test]
    fn test_dedupe() {
        let source = vec![1, 2, 2, 2, 3, 3, 2, 3, 4];
        let transducer = transducers::dedupe();
        let result = source.transduce_into(transducer).unwrap();
        let expected_result = vec![1, 2, 3, 2, 3, 4];
        assert_eq!(expected_result, result);
    }

    #[test]
    fn test_channels() {
        let transducer = transducers::map(|x| x + 1);
        let (mut tx, rx) = transducing_channel(transducer);
        thread::spawn(move|| {
            for i in 0..3 {
                tx.send(i).unwrap();
            }
            tx.close().unwrap();
        });
        assert_eq!(1, rx.recv().unwrap());
        assert_eq!(2, rx.recv().unwrap());
        assert_eq!(3, rx.recv().unwrap());
    }
}