1 use std::iter::FromIterator;
2 use std::marker::PhantomData;
3
4 #[derive(Clone)]
5 #[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
6 pub struct MapSpecialCase<I, F> {
7 iter: I,
8 f: F,
9 }
10
11 pub trait MapSpecialCaseFn<T> {
12 type Out;
call(&mut self, t: T) -> Self::Out13 fn call(&mut self, t: T) -> Self::Out;
14 }
15
16 impl<I, R> Iterator for MapSpecialCase<I, R>
17 where
18 I: Iterator,
19 R: MapSpecialCaseFn<I::Item>,
20 {
21 type Item = R::Out;
22
next(&mut self) -> Option<Self::Item>23 fn next(&mut self) -> Option<Self::Item> {
24 self.iter.next().map(|i| self.f.call(i))
25 }
26
size_hint(&self) -> (usize, Option<usize>)27 fn size_hint(&self) -> (usize, Option<usize>) {
28 self.iter.size_hint()
29 }
30
fold<Acc, Fold>(self, init: Acc, mut fold_f: Fold) -> Acc where Fold: FnMut(Acc, Self::Item) -> Acc,31 fn fold<Acc, Fold>(self, init: Acc, mut fold_f: Fold) -> Acc
32 where
33 Fold: FnMut(Acc, Self::Item) -> Acc,
34 {
35 let mut f = self.f;
36 self.iter.fold(init, move |acc, v| fold_f(acc, f.call(v)))
37 }
38
collect<C>(self) -> C where C: FromIterator<Self::Item>,39 fn collect<C>(self) -> C
40 where
41 C: FromIterator<Self::Item>,
42 {
43 let mut f = self.f;
44 self.iter.map(move |v| f.call(v)).collect()
45 }
46 }
47
48 impl<I, R> DoubleEndedIterator for MapSpecialCase<I, R>
49 where
50 I: DoubleEndedIterator,
51 R: MapSpecialCaseFn<I::Item>,
52 {
next_back(&mut self) -> Option<Self::Item>53 fn next_back(&mut self) -> Option<Self::Item> {
54 self.iter.next_back().map(|i| self.f.call(i))
55 }
56 }
57
58 impl<I, R> ExactSizeIterator for MapSpecialCase<I, R>
59 where
60 I: ExactSizeIterator,
61 R: MapSpecialCaseFn<I::Item>,
62 {
63 }
64
65 /// An iterator adapter to apply a transformation within a nested `Result::Ok`.
66 ///
67 /// See [`.map_ok()`](../trait.Itertools.html#method.map_ok) for more information.
68 pub type MapOk<I, F> = MapSpecialCase<I, MapSpecialCaseFnOk<F>>;
69
70 /// See [`MapOk`](struct.MapOk.html).
71 #[deprecated(note = "Use MapOk instead", since = "0.10.0")]
72 pub type MapResults<I, F> = MapOk<I, F>;
73
74 impl<F, T, U, E> MapSpecialCaseFn<Result<T, E>> for MapSpecialCaseFnOk<F>
75 where
76 F: FnMut(T) -> U,
77 {
78 type Out = Result<U, E>;
call(&mut self, t: Result<T, E>) -> Self::Out79 fn call(&mut self, t: Result<T, E>) -> Self::Out {
80 t.map(|v| self.0(v))
81 }
82 }
83
84 #[derive(Clone)]
85 pub struct MapSpecialCaseFnOk<F>(F);
86
87 /// Create a new `MapOk` iterator.
map_ok<I, F, T, U, E>(iter: I, f: F) -> MapOk<I, F> where I: Iterator<Item = Result<T, E>>, F: FnMut(T) -> U,88 pub fn map_ok<I, F, T, U, E>(iter: I, f: F) -> MapOk<I, F>
89 where
90 I: Iterator<Item = Result<T, E>>,
91 F: FnMut(T) -> U,
92 {
93 MapSpecialCase {
94 iter,
95 f: MapSpecialCaseFnOk(f),
96 }
97 }
98
99 /// An iterator adapter to apply `Into` conversion to each element.
100 ///
101 /// See [`.map_into()`](../trait.Itertools.html#method.map_into) for more information.
102 pub type MapInto<I, R> = MapSpecialCase<I, MapSpecialCaseFnInto<R>>;
103
104 impl<T: Into<U>, U> MapSpecialCaseFn<T> for MapSpecialCaseFnInto<U> {
105 type Out = U;
call(&mut self, t: T) -> Self::Out106 fn call(&mut self, t: T) -> Self::Out {
107 t.into()
108 }
109 }
110
111 #[derive(Clone)]
112 pub struct MapSpecialCaseFnInto<U>(PhantomData<U>);
113
114 /// Create a new [`MapInto`](struct.MapInto.html) iterator.
map_into<I, R>(iter: I) -> MapInto<I, R>115 pub fn map_into<I, R>(iter: I) -> MapInto<I, R> {
116 MapSpecialCase {
117 iter,
118 f: MapSpecialCaseFnInto(PhantomData),
119 }
120 }
121