more-itertools 0.1.6

A rust implementation of python more-itertools
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

use std::collections::VecDeque;

use crate::error::Error;


pub struct InterleaveLongest<T> {
    buf: VecDeque<T>,
    buf2: VecDeque<Option<T>>,
    iter_vec: Vec<Box<dyn Iterator<Item = Result<T,Error>>>>,
    iter_finished: bool,
    fillnone: bool,
    fillvalue: Option<T>
}

impl<T> Iterator for InterleaveLongest<T> 
where
T: Clone
{
    type Item = Result<T,Error>;

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            if self.iter_finished {
                return None;
            }

            if self.buf.len() > 0 {
                let ret = self.buf.pop_front().unwrap();
                return Some(Ok(ret));
            }

            assert_eq!(0, self.buf2.len());

            for i in self.iter_vec.iter_mut() {
                match i.next() {
                    None => {
                        self.buf2.push_back(None);
                    },
                    Some(v) => {
                        match v {
                            Ok(ok_v) => {
                                self.buf2.push_back(Some(ok_v));
                            },
                            Err(err_v) => { // upstream error
                                self.iter_finished = true;
                                return Some(Err(err_v));
                            }
                        } 
                    }
                }
            }

            if self.buf2.iter().all(|x| match x {
                None => { return true; },
                Some(_) => { return false; }
            }) {
                self.iter_finished = true;
            } else {
                while self.buf2.len() > 0 {
                    match self.buf2.pop_front() {
                        None => {
                            
                        },
                        Some(v) => {
                            if !v.is_none() {
                                self.buf.push_back(v.unwrap());
                            } else {
                                if self.fillnone {
                                    self.buf.push_back(self.fillvalue.as_ref().unwrap().clone());
                                }
                            }
                        }
                    }
                }
            }
        }   
    }
}

pub fn interleave_longest<T>(iter_vec: Vec<Box<dyn Iterator<Item = Result<T,Error>>>>, fillvalue: Option<T>) -> Box<dyn Iterator<Item = Result<T,Error>>> 
where T: Clone + 'static
{
    let fillnone;
    match fillvalue {
        None => { fillnone = false },
        Some(_) => { fillnone = true }
    }

    Box::new(InterleaveLongest {
        buf: VecDeque::new(),
        buf2: VecDeque::new(),
        iter_vec,
        iter_finished: false,
        fillnone: fillnone,
        fillvalue
    })
}

#[cfg(test)]
mod tests {
    use crate::{error, utils::{extract_value_from_result_vec, generate_okok_iterator, generate_okokerr_iterator}};

    use super::*;

    #[test]
    fn test1() {
        let mut v = Vec::new();
        v.push(generate_okok_iterator(vec![1,2,3]));
        v.push(generate_okok_iterator(vec![4,5]));
        v.push(generate_okok_iterator(vec![6,7,8]));

        let ret = interleave_longest(v, None).collect::<Vec<_>>();
        assert_eq!(vec![1, 4, 6, 2, 5, 7, 3, 8], extract_value_from_result_vec(ret).0);
        //println!("{:?}", ret);


        let mut v = Vec::new();
        v.push(generate_okok_iterator(vec![1,2,3]));
        v.push(generate_okok_iterator(vec![4,5]));
        v.push(generate_okok_iterator(vec![6,7,8]));

        let ret = interleave_longest(v, Some(0)).collect::<Vec<_>>();
        assert_eq!(vec![1, 4, 6, 2, 5, 7, 3, 0, 8], extract_value_from_result_vec(ret).0);
        //println!("{:?}", ret);

        let mut v = Vec::new();
        v.push(generate_okok_iterator(vec![1,2,3]));
        v.push(generate_okokerr_iterator(vec![4,5], error::overflow_error("[test]".to_string())));
        v.push(generate_okok_iterator(vec![6,7,8]));

        let ret = interleave_longest(v, None).collect::<Vec<_>>();
        let ret1 = extract_value_from_result_vec(ret);
        assert_eq!(vec![1, 4, 6, 2, 5, 7], ret1.0);
        assert_eq!(error::Kind::OverflowError, ret1.1.unwrap().kind());
    }
}