resiter/
and_then.rs

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
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
//

/// Extension trait for `Iterator<Item = Result<O, E>>` to selectively transform Oks and Errors.
pub trait AndThen<O, E>: Sized {
    /// Map oks selectively, possibly converting them to errors
    ///
    /// ```
    /// use resiter::and_then::AndThen;
    /// use std::str::FromStr;
    ///
    /// let mapped: Vec<_> = ["1", "2", "a", "b", "4", "5"]
    ///     .iter()
    ///     .map(|txt| usize::from_str(txt))
    ///     .and_then_ok(|i| Ok(2 * i))
    ///     .collect();
    ///
    /// assert_eq!(mapped[0], Ok(2));
    /// assert_eq!(mapped[1], Ok(4));
    /// assert!(mapped[2].is_err());
    /// assert!(mapped[3].is_err());
    /// assert_eq!(mapped[4], Ok(8));
    /// assert_eq!(mapped[5], Ok(10));
    /// ```
    fn and_then_ok<F, O2>(self, _: F) -> AndThenOk<Self, F>
    where
        F: FnMut(O) -> Result<O2, E>;

    /// Map errors selectively, possibly converting them to Oks
    ///
    /// ```
    /// use resiter::and_then::AndThen;
    /// use std::str::FromStr;
    ///
    /// let mapped: Vec<_> = ["1", "2", "a", "b", "4", "5"]
    ///     .iter()
    ///     .map(|txt| usize::from_str(txt).map_err(|e| (txt, e)))
    ///     .and_then_err(|(txt, e)| if txt == &"a" { Ok(15) } else { Err(e) })
    ///     .collect();
    ///
    /// assert_eq!(mapped[0], Ok(1));
    /// assert_eq!(mapped[1], Ok(2));
    /// assert_eq!(mapped[2], Ok(15));
    /// assert!(mapped[3].is_err());
    /// assert_eq!(mapped[4], Ok(4));
    /// assert_eq!(mapped[5], Ok(5));
    /// ```
    fn and_then_err<F, E2>(self, _: F) -> AndThenErr<Self, F>
    where
        F: FnMut(E) -> Result<O, E2>;
}

impl<I, O, E> AndThen<O, E> for I
where
    I: Iterator<Item = Result<O, E>> + Sized,
{
    #[inline]
    fn and_then_ok<F, O2>(self, f: F) -> AndThenOk<Self, F>
    where
        F: FnMut(O) -> Result<O2, E>,
    {
        AndThenOk { iter: self, f }
    }

    #[inline]
    fn and_then_err<F, E2>(self, f: F) -> AndThenErr<Self, F>
    where
        F: FnMut(E) -> Result<O, E2>,
    {
        AndThenErr { iter: self, f }
    }
}

#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
pub struct AndThenOk<I, F> {
    iter: I,
    f: F,
}

impl<I, O, E, O2, F> Iterator for AndThenOk<I, F>
where
    I: Iterator<Item = Result<O, E>>,
    F: FnMut(O) -> Result<O2, E>,
{
    type Item = Result<O2, E>;

    fn next(&mut self) -> Option<Self::Item> {
        match self.iter.next() {
            Some(Ok(o)) => Some((self.f)(o)),
            Some(Err(e)) => Some(Err(e)),
            None => None,
        }
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        self.iter.size_hint()
    }
}

#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
pub struct AndThenErr<I, F> {
    iter: I,
    f: F,
}

impl<I, O, E, E2, F> Iterator for AndThenErr<I, F>
where
    I: Iterator<Item = Result<O, E>>,
    F: FnMut(E) -> Result<O, E2>,
{
    type Item = Result<O, E2>;

    fn next(&mut self) -> Option<Self::Item> {
        match self.iter.next() {
            Some(Err(e)) => Some((self.f)(e)),
            Some(Ok(o)) => Some(Ok(o)),
            None => None,
        }
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        self.iter.size_hint()
    }
}