|
| 1 | +use core::ops::{Generator, GeneratorState}; |
| 2 | +use core::iter::{Iterator, FusedIterator}; |
| 3 | +use core::marker::Unpin; |
| 4 | +use core::pin::Pin; |
| 5 | + |
| 6 | +/// `GenIterReturn<G>` holds a generator `G` or the return value of `G`, |
| 7 | +/// `&mut GenIterReturn<G>` acts as an iterator. |
| 8 | +/// |
| 9 | +/// Differences with `GenIter<G>`: |
| 10 | +/// 1. able to get return value of a generator |
| 11 | +/// 2. safe to call `next()` after generator is done without panic |
| 12 | +/// 3. maybe less efficient than `GenIter<G>` |
| 13 | +#[derive(Copy, Clone, Debug)] |
| 14 | +pub struct GenIterReturn<G: Generator + Unpin>(Result<G::Return, G>); |
| 15 | + |
| 16 | +impl<G: Generator + Unpin> GenIterReturn<G> { |
| 17 | + #[inline] |
| 18 | + pub fn new(g: G) -> Self { |
| 19 | + GenIterReturn(Err(g)) |
| 20 | + } |
| 21 | + |
| 22 | + #[inline] |
| 23 | + pub fn is_done(&self) -> bool { |
| 24 | + self.0.is_ok() |
| 25 | + } |
| 26 | + |
| 27 | + #[inline] |
| 28 | + pub fn return_or_self(self) -> Result<G::Return, Self> { |
| 29 | + match self.0 { |
| 30 | + Ok(r) => Ok(r), |
| 31 | + Err(_) => Err(self), |
| 32 | + } |
| 33 | + } |
| 34 | +} |
| 35 | + |
| 36 | +/// Force use `&mut g` as iterator to prevent the code below, |
| 37 | +/// in which return value cannot be got. |
| 38 | +/// ```compile_fail |
| 39 | +/// // !!INVALID CODE!! |
| 40 | +/// # #![feature(generators)] |
| 41 | +/// # use gen_iter::gen_iter_return; |
| 42 | +/// let mut g = gen_iter_return!({ yield 1; return "done"; }); |
| 43 | +/// for v in g {} // invalid, because `GenIterReturn<G>` is not `Iterator` |
| 44 | +/// let ret = g.return_or_self(); // g is dropped after for loop |
| 45 | +/// ``` |
| 46 | +impl<G: Generator + Unpin> Iterator for &mut GenIterReturn<G> { |
| 47 | + type Item = G::Yield; |
| 48 | + |
| 49 | + #[inline] |
| 50 | + fn next(&mut self) -> Option<Self::Item> { |
| 51 | + match self.0 { |
| 52 | + Ok(_) => None, |
| 53 | + Err(ref mut g) => match Pin::new(g).resume(()) { |
| 54 | + GeneratorState::Yielded(y) => Some(y), |
| 55 | + GeneratorState::Complete(r) => { |
| 56 | + self.0 = Ok(r); |
| 57 | + None |
| 58 | + }, |
| 59 | + } |
| 60 | + } |
| 61 | + } |
| 62 | +} |
| 63 | + |
| 64 | +/// `GenIterReturn<G>` satisfies the trait `FusedIterator` |
| 65 | +impl<G: Generator + Unpin> FusedIterator for &mut GenIterReturn<G> {} |
| 66 | + |
| 67 | +impl<G: Generator + Unpin> From<G> for GenIterReturn<G> { |
| 68 | + #[inline] |
| 69 | + fn from(g: G) -> Self { |
| 70 | + GenIterReturn::new(g) |
| 71 | + } |
| 72 | +} |
| 73 | + |
| 74 | +/// macro to simplify iterator - via - generator with return value construction |
| 75 | +/// ``` |
| 76 | +/// #![feature(generators)] |
| 77 | +/// |
| 78 | +/// use gen_iter::gen_iter_return; |
| 79 | +/// |
| 80 | +/// let mut g = gen_iter_return!({ |
| 81 | +/// yield 1; |
| 82 | +/// yield 2; |
| 83 | +/// return "done"; |
| 84 | +/// }); |
| 85 | +/// |
| 86 | +/// assert_eq!((&mut g).collect::<Vec<_>>(), [1, 2]); // use `&mut g` as an iterator |
| 87 | +/// assert_eq!(g.is_done(), true); // check whether generator is done |
| 88 | +/// assert_eq!((&mut g).next(), None); // safe to call `next()` after done |
| 89 | +/// assert_eq!(g.return_or_self().ok(), Some("done")); // get return value of generator |
| 90 | +/// ``` |
| 91 | +#[macro_export] |
| 92 | +macro_rules! gen_iter_return { |
| 93 | + ($block: block) => { |
| 94 | + $crate::GenIterReturn::new(|| $block) |
| 95 | + }; |
| 96 | + (move $block: block) => { |
| 97 | + $crate::GenIterReturn::new(move || $block) |
| 98 | + } |
| 99 | +} |
| 100 | + |
| 101 | +#[cfg(test)] |
| 102 | +mod tests { |
| 103 | + use super::GenIterReturn; |
| 104 | + |
| 105 | + /// test `new` and all instance method, |
| 106 | + /// and show that it won't panic when call `next()` even exhausted. |
| 107 | + #[test] |
| 108 | + fn it_works() { |
| 109 | + let mut g = GenIterReturn::new(|| { |
| 110 | + yield 1; |
| 111 | + return "done"; |
| 112 | + }); |
| 113 | + |
| 114 | + assert_eq!((&mut g).next(), Some(1)); |
| 115 | + assert_eq!(g.is_done(), false); |
| 116 | + |
| 117 | + g = match g.return_or_self() { |
| 118 | + Ok(_) => panic!("generator is done but should not"), |
| 119 | + Err(g) => g |
| 120 | + }; |
| 121 | + |
| 122 | + assert_eq!((&mut g).next(), None); |
| 123 | + assert_eq!(g.is_done(), true); |
| 124 | + |
| 125 | + assert_eq!((&mut g).next(), None); // it won't panic when call `next()` even exhausted. |
| 126 | + |
| 127 | + assert_eq!(g.return_or_self().ok(), Some("done")); |
| 128 | + } |
| 129 | + |
| 130 | + #[test] |
| 131 | + fn from_generator() { |
| 132 | + let mut g = GenIterReturn::from(|| { |
| 133 | + yield 1; |
| 134 | + return "done"; |
| 135 | + }); |
| 136 | + |
| 137 | + assert_eq!((&mut g).next(), Some(1)); |
| 138 | + assert_eq!((&mut g).next(), None); |
| 139 | + |
| 140 | + assert_eq!(g.is_done(), true); |
| 141 | + assert_eq!(g.return_or_self().ok(), Some("done")); |
| 142 | + } |
| 143 | + |
| 144 | + /// normal usage using macro `gen_iter_return` |
| 145 | + #[test] |
| 146 | + fn macro_usage() { |
| 147 | + let mut g = gen_iter_return!(move { |
| 148 | + yield 1; |
| 149 | + yield 2; |
| 150 | + return "done"; |
| 151 | + }); |
| 152 | + |
| 153 | + let (mut sum, mut count) = (0, 0); |
| 154 | + for y in &mut g { |
| 155 | + sum += y; |
| 156 | + count += 1; |
| 157 | + } |
| 158 | + assert_eq!((sum, count), (3, 2)); |
| 159 | + |
| 160 | + assert_eq!(g.is_done(), true); |
| 161 | + assert_eq!(g.return_or_self().ok(), Some("done")); |
| 162 | + } |
| 163 | +} |
0 commit comments