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
use crate::FnCache;
use std::sync::Arc;
pub struct VecCache<'f, O> {
pub(crate) cache: Vec<O>,
f: Arc<dyn Fn(&mut Self, &usize) -> O + 'f + Send + Sync>,
}
impl<'f, O> FnCache<usize, O> for VecCache<'f, O> {
fn get(&mut self, input: usize) -> &O {
let len = self.cache.len();
if len <= input {
self.cache.reserve(input - len + 1);
}
while self.cache.len() <= input {
let next = self.cache.len();
let next_val = self.compute(next).into();
self.cache.push(next_val);
}
self.cache.get(input).unwrap()
}
}
impl<'f, O> VecCache<'f, O> {
pub fn new<F>(f: F) -> Self
where
F: Fn(&usize) -> O + 'f + Send + Sync,
{
Self::recursive(move |_, x| f(x))
}
pub fn recursive<F>(f: F) -> Self
where
F: Fn(&mut Self, &usize) -> O + 'f + Send + Sync,
{
VecCache {
cache: Vec::default(),
f: Arc::new(f),
}
}
fn compute(&mut self, input: usize) -> O {
(self.f.clone())(self, &input)
}
pub fn clear(&mut self) {
self.cache.clear();
}
pub fn len(&self) -> usize {
self.cache.len()
}
pub fn reserve(&mut self, additional: usize) {
self.cache.reserve(additional)
}
}