-
Notifications
You must be signed in to change notification settings - Fork 356
Expand file tree
/
Copy pathlazy_buffer.rs
More file actions
200 lines (164 loc) · 4.61 KB
/
Copy pathlazy_buffer.rs
File metadata and controls
200 lines (164 loc) · 4.61 KB
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
use alloc::boxed::Box;
use alloc::vec::Vec;
use core::borrow::BorrowMut;
use core::ops::Deref as _;
use std::iter::Fuse;
use std::ops::Index;
use crate::size_hint::{self, SizeHint};
#[derive(Debug, Clone)]
pub struct LazyBuffer<I: Iterator> {
it: Fuse<I>,
buffer: Vec<I::Item>,
}
impl<I> LazyBuffer<I>
where
I: Iterator,
{
pub fn new(it: I) -> Self {
Self {
it: it.fuse(),
buffer: Vec::new(),
}
}
pub fn len(&self) -> usize {
self.buffer.len()
}
pub fn size_hint(&self) -> SizeHint {
size_hint::add_scalar(self.it.size_hint(), self.len())
}
pub fn count(self) -> usize {
self.len() + self.it.count()
}
pub fn get_next(&mut self) -> bool {
if let Some(x) = self.it.next() {
self.buffer.push(x);
true
} else {
false
}
}
pub fn prefill(&mut self, len: usize) {
let buffer_len = self.buffer.len();
if len > buffer_len {
let delta = len - buffer_len;
self.buffer.extend(self.it.by_ref().take(delta));
}
}
}
impl<I> LazyBuffer<I>
where
I: Iterator,
I::Item: Clone,
{
pub fn get_at(&self, indices: &[usize]) -> Vec<I::Item> {
indices.iter().map(|i| self.buffer[*i].clone()).collect()
}
pub fn get_array<const K: usize>(&self, indices: [usize; K]) -> [I::Item; K] {
indices.map(|i| self.buffer[i].clone())
}
}
impl<I, J> Index<J> for LazyBuffer<I>
where
I: Iterator,
I::Item: Sized,
Vec<I::Item>: Index<J>,
{
type Output = <Vec<I::Item> as Index<J>>::Output;
fn index(&self, index: J) -> &Self::Output {
self.buffer.index(index)
}
}
pub trait MaybeConstUsize: Clone + Copy + std::fmt::Debug {
/*TODO const*/
fn value(self) -> usize;
}
#[derive(Clone, Copy, Debug)]
pub struct ConstUsize<const N: usize>;
impl<const N: usize> MaybeConstUsize for ConstUsize<N> {
fn value(self) -> usize {
N
}
}
impl MaybeConstUsize for usize {
fn value(self) -> usize {
self
}
}
/// A type holding indices, mostly used to pick out different combinations of elements from
/// a pool or buffer of items from an inner iterator in a generic way.
pub trait ArrayOrVecHelper: BorrowMut<[usize]> {
type Item<T>;
type Length: MaybeConstUsize;
fn extract_item<I: Iterator>(&self, pool: &LazyBuffer<I>) -> Self::Item<I::Item>
where
I::Item: Clone;
// TODO if only ever used to index into LazyBuffer, specialize to
// extract_from_fn(Self::Length, Fn(usize) -> usize, &LazyBuffer) -> Item<T>?
fn item_from_fn<T, F: Fn(usize) -> T>(len: Self::Length, f: F) -> Self::Item<T>;
fn len(&self) -> Self::Length;
fn from_fn<F: Fn(usize) -> usize>(k: Self::Length, f: F) -> Self;
/// Create an array/vec/... of indices from 0 to `len - 1`.
fn start(len: Self::Length) -> Self
where
Self: Sized,
{
Self::from_fn(len, |i| i)
}
}
impl ArrayOrVecHelper for Vec<usize> {
type Item<T> = Vec<T>;
type Length = usize;
fn extract_item<I: Iterator>(&self, pool: &LazyBuffer<I>) -> Self::Item<I::Item>
where
I::Item: Clone,
{
pool.get_at(self)
}
fn item_from_fn<T, F: Fn(usize) -> T>(len: Self::Length, f: F) -> Self::Item<T> {
(0..len).map(f).collect()
}
fn len(&self) -> Self::Length {
self.len()
}
fn from_fn<F: Fn(usize) -> usize>(k: Self::Length, f: F) -> Self {
(0..k).map(f).collect()
}
}
impl ArrayOrVecHelper for Box<[usize]> {
type Item<T> = Vec<T>;
type Length = usize;
fn extract_item<I: Iterator>(&self, pool: &LazyBuffer<I>) -> Self::Item<I::Item>
where
I::Item: Clone,
{
pool.get_at(self)
}
fn item_from_fn<T, F: Fn(usize) -> T>(len: Self::Length, f: F) -> Self::Item<T> {
(0..len).map(f).collect()
}
fn len(&self) -> Self::Length {
self.deref().len()
}
fn from_fn<F: Fn(usize) -> usize>(k: Self::Length, f: F) -> Self {
(0..k).map(f).collect()
}
}
impl<const K: usize> ArrayOrVecHelper for [usize; K] {
type Item<T> = [T; K];
type Length = ConstUsize<K>;
fn extract_item<I: Iterator>(&self, pool: &LazyBuffer<I>) -> Self::Item<I::Item>
where
I::Item: Clone,
{
pool.get_array(*self)
}
fn item_from_fn<T, F: Fn(usize) -> T>(_len: Self::Length, f: F) -> Self::Item<T> {
std::array::from_fn(f)
}
fn len(&self) -> Self::Length {
ConstUsize::<K>
}
fn from_fn<F: Fn(usize) -> usize>(_len: Self::Length, f: F) -> Self {
std::array::from_fn(f)
}
}