blob: fa514ec2d2ea2ec6010badc5866d5c9aff5e3945 [file] [log] [blame]
Jakub Kotura425e552020-12-21 17:28:15 +01001use std::ops::Index;
Joel Galenson6f798712021-04-01 17:03:06 -07002use alloc::vec::Vec;
Jakub Kotura425e552020-12-21 17:28:15 +01003
4#[derive(Debug, Clone)]
5pub struct LazyBuffer<I: Iterator> {
6 pub it: I,
7 done: bool,
8 buffer: Vec<I::Item>,
9}
10
11impl<I> LazyBuffer<I>
12where
13 I: Iterator,
14{
15 pub fn new(it: I) -> LazyBuffer<I> {
16 LazyBuffer {
17 it,
18 done: false,
19 buffer: Vec::new(),
20 }
21 }
22
23 pub fn len(&self) -> usize {
24 self.buffer.len()
25 }
26
Jakub Kotura425e552020-12-21 17:28:15 +010027 pub fn get_next(&mut self) -> bool {
28 if self.done {
29 return false;
30 }
31 let next_item = self.it.next();
32 match next_item {
33 Some(x) => {
34 self.buffer.push(x);
35 true
36 }
37 None => {
38 self.done = true;
39 false
40 }
41 }
42 }
Joel Galenson6f798712021-04-01 17:03:06 -070043
44 pub fn prefill(&mut self, len: usize) {
45 let buffer_len = self.buffer.len();
46
47 if !self.done && len > buffer_len {
48 let delta = len - buffer_len;
49
50 self.buffer.extend(self.it.by_ref().take(delta));
51 self.done = self.buffer.len() < len;
52 }
53 }
Jakub Kotura425e552020-12-21 17:28:15 +010054}
55
56impl<I, J> Index<J> for LazyBuffer<I>
57where
58 I: Iterator,
59 I::Item: Sized,
60 Vec<I::Item>: Index<J>
61{
62 type Output = <Vec<I::Item> as Index<J>>::Output;
63
64 fn index(&self, _index: J) -> &Self::Output {
65 self.buffer.index(_index)
66 }
67}