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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
pub use self::group::{Group, Threshold, Count, consolidate_from};
pub use self::consolidate::Consolidate;
pub use self::iterate::Iterate;
pub use self::join::{Join, JoinCore};
pub use self::count::CountTotal;
pub use self::threshold::ThresholdTotal;
pub mod arrange;
pub mod group;
pub mod consolidate;
pub mod iterate;
pub mod join;
pub mod count;
pub mod threshold;
use ::Diff;
use lattice::Lattice;
use trace::{Cursor, consolidate};
struct EditList<'a, V: 'a, T, R> {
values: Vec<(&'a V, usize)>,
edits: Vec<(T, R)>,
}
impl<'a, V:'a, T, R> EditList<'a, V, T, R> where T: Ord+Clone, R: Diff {
#[inline(always)]
fn new() -> Self {
EditList {
values: Vec::new(),
edits: Vec::new(),
}
}
fn load<K, C, L>(&mut self, cursor: &mut C, storage: &'a C::Storage, logic: L)
where K: Eq, V: Clone, C: Cursor<K, V, T, R>, L: Fn(&T)->T {
self.clear();
while cursor.val_valid(storage) {
cursor.map_times(storage, |time1, diff1| self.push(logic(time1), diff1));
self.seal(cursor.val(storage));
cursor.step_val(storage);
}
}
#[inline(always)]
fn clear(&mut self) {
self.values.clear();
self.edits.clear();
}
fn len(&self) -> usize { self.edits.len() }
#[inline(always)]
fn push(&mut self, time: T, diff: R) {
self.edits.push((time, diff));
}
#[inline(always)]
fn seal(&mut self, value: &'a V) {
let prev = self.values.last().map(|x| x.1).unwrap_or(0);
consolidate_from(&mut self.edits, prev);
if self.edits.len() > prev {
self.values.push((value, self.edits.len()));
}
}
fn map<F: FnMut(&V, &T, R)>(&self, mut logic: F) {
for index in 0 .. self.values.len() {
let lower = if index == 0 { 0 } else { self.values[index-1].1 };
let upper = self.values[index].1;
for edit in lower .. upper {
logic(&self.values[index].0, &self.edits[edit].0, self.edits[edit].1);
}
}
}
}
struct ValueHistory<'storage, V: 'storage, T, R> {
edits: EditList<'storage, V, T, R>,
history: Vec<(T, T, usize, usize)>,
buffer: Vec<((&'storage V, T), R)>,
}
impl<'storage, V: Ord+Clone+'storage, T: Lattice+Ord+Clone, R: Diff> ValueHistory<'storage, V, T, R> {
fn new() -> Self {
ValueHistory {
edits: EditList::new(),
history: Vec::new(),
buffer: Vec::new(),
}
}
fn clear(&mut self) {
self.edits.clear();
self.history.clear();
self.buffer.clear();
}
fn load<K, C, L>(&mut self, cursor: &mut C, storage: &'storage C::Storage, logic: L)
where K: Eq, C: Cursor<K, V, T, R>, L: Fn(&T)->T {
self.edits.load(cursor, storage, logic);
}
fn replay_key<'history, K, C, L>(
&'history mut self,
cursor: &mut C,
storage: &'storage C::Storage,
key: &K,
logic: L
) -> HistoryReplay<'storage, 'history, V, T, R>
where K: Eq, C: Cursor<K, V, T, R>, L: Fn(&T)->T
{
self.clear();
cursor.seek_key(storage, key);
if cursor.get_key(storage) == Some(key) {
self.load(cursor, storage, logic);
}
self.replay()
}
fn replay<'history>(&'history mut self) -> HistoryReplay<'storage, 'history, V, T, R> {
self.buffer.clear();
self.history.clear();
for value_index in 0 .. self.edits.values.len() {
let lower = if value_index > 0 { self.edits.values[value_index-1].1 } else { 0 };
let upper = self.edits.values[value_index].1;
for edit_index in lower .. upper {
let time = self.edits.edits[edit_index].0.clone();
self.history.push((time.clone(), time.clone(), value_index, edit_index));
}
}
self.history.sort_by(|x,y| y.cmp(x));
for index in 1 .. self.history.len() {
self.history[index].1 = self.history[index].1.meet(&self.history[index-1].1);
}
HistoryReplay {
replay: self
}
}
}
struct HistoryReplay<'storage, 'history, V, T, R>
where
'storage: 'history,
V: Ord+'storage,
T: Lattice+Ord+Clone+'history,
R: Diff+'history,
{
replay: &'history mut ValueHistory<'storage, V, T, R>
}
impl<'storage, 'history, V, T, R> HistoryReplay<'storage, 'history, V, T, R>
where
'storage: 'history,
V: Ord+'storage,
T: Lattice+Ord+Clone+'history,
R: Diff+'history,
{
fn time(&self) -> Option<&T> { self.replay.history.last().map(|x| &x.0) }
fn meet(&self) -> Option<&T> { self.replay.history.last().map(|x| &x.1) }
fn edit(&self) -> Option<(&V, &T, R)> {
self.replay.history.last().map(|&(ref t, _, v, e)| (self.replay.edits.values[v].0, t, self.replay.edits.edits[e].1))
}
fn buffer(&self) -> &[((&'storage V, T), R)] {
&self.replay.buffer[..]
}
fn step(&mut self) {
let (time, _, value_index, edit_offset) = self.replay.history.pop().unwrap();
self.replay.buffer.push(((self.replay.edits.values[value_index].0, time), self.replay.edits.edits[edit_offset].1));
}
fn step_while_time_is(&mut self, time: &T) -> bool {
let mut found = false;
while self.time() == Some(time) {
found = true;
self.step();
}
found
}
fn advance_buffer_by(&mut self, meet: &T) {
for element in self.replay.buffer.iter_mut() {
(element.0).1 = (element.0).1.join(meet);
}
consolidate(&mut self.replay.buffer, 0);
}
fn is_done(&self) -> bool { self.replay.history.len() == 0 }
fn _print(&self) where V: ::std::fmt::Debug, T: ::std::fmt::Debug, R: ::std::fmt::Debug {
for value_index in 0 .. self.replay.edits.values.len() {
let lower = if value_index > 0 { self.replay.edits.values[value_index-1].1 } else { 0 };
let upper = self.replay.edits.values[value_index].1;
for edit_index in lower .. upper {
println!("{:?}, {:?}, {:?}",
self.replay.edits.values[value_index].0,
self.replay.edits.edits[edit_index].0,
self.replay.edits.edits[edit_index].1
);
}
}
}
}