/rust/registry/src/index.crates.io-6f17d22bba15001f/itertools-0.11.0/src/tee.rs
Line | Count | Source (jump to first uncovered line) |
1 | | use super::size_hint; |
2 | | |
3 | | use std::cell::RefCell; |
4 | | use alloc::collections::VecDeque; |
5 | | use alloc::rc::Rc; |
6 | | |
7 | | /// Common buffer object for the two tee halves |
8 | | #[derive(Debug)] |
9 | | struct TeeBuffer<A, I> { |
10 | | backlog: VecDeque<A>, |
11 | | iter: I, |
12 | | /// The owner field indicates which id should read from the backlog |
13 | | owner: bool, |
14 | | } |
15 | | |
16 | | /// One half of an iterator pair where both return the same elements. |
17 | | /// |
18 | | /// See [`.tee()`](crate::Itertools::tee) for more information. |
19 | | #[must_use = "iterator adaptors are lazy and do nothing unless consumed"] |
20 | | #[derive(Debug)] |
21 | | pub struct Tee<I> |
22 | | where I: Iterator |
23 | | { |
24 | | rcbuffer: Rc<RefCell<TeeBuffer<I::Item, I>>>, |
25 | | id: bool, |
26 | | } |
27 | | |
28 | 0 | pub fn new<I>(iter: I) -> (Tee<I>, Tee<I>) |
29 | 0 | where I: Iterator |
30 | 0 | { |
31 | 0 | let buffer = TeeBuffer{backlog: VecDeque::new(), iter, owner: false}; |
32 | 0 | let t1 = Tee{rcbuffer: Rc::new(RefCell::new(buffer)), id: true}; |
33 | 0 | let t2 = Tee{rcbuffer: t1.rcbuffer.clone(), id: false}; |
34 | 0 | (t1, t2) |
35 | 0 | } |
36 | | |
37 | | impl<I> Iterator for Tee<I> |
38 | | where I: Iterator, |
39 | | I::Item: Clone |
40 | | { |
41 | | type Item = I::Item; |
42 | 0 | fn next(&mut self) -> Option<Self::Item> { |
43 | 0 | // .borrow_mut may fail here -- but only if the user has tied some kind of weird |
44 | 0 | // knot where the iterator refers back to itself. |
45 | 0 | let mut buffer = self.rcbuffer.borrow_mut(); |
46 | 0 | if buffer.owner == self.id { |
47 | 0 | match buffer.backlog.pop_front() { |
48 | 0 | None => {} |
49 | 0 | some_elt => return some_elt, |
50 | | } |
51 | 0 | } |
52 | 0 | match buffer.iter.next() { |
53 | 0 | None => None, |
54 | 0 | Some(elt) => { |
55 | 0 | buffer.backlog.push_back(elt.clone()); |
56 | 0 | buffer.owner = !self.id; |
57 | 0 | Some(elt) |
58 | | } |
59 | | } |
60 | 0 | } |
61 | | |
62 | 0 | fn size_hint(&self) -> (usize, Option<usize>) { |
63 | 0 | let buffer = self.rcbuffer.borrow(); |
64 | 0 | let sh = buffer.iter.size_hint(); |
65 | 0 |
|
66 | 0 | if buffer.owner == self.id { |
67 | 0 | let log_len = buffer.backlog.len(); |
68 | 0 | size_hint::add_scalar(sh, log_len) |
69 | | } else { |
70 | 0 | sh |
71 | | } |
72 | 0 | } |
73 | | } |
74 | | |
75 | | impl<I> ExactSizeIterator for Tee<I> |
76 | | where I: ExactSizeIterator, |
77 | | I::Item: Clone |
78 | | {} |