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
use std::cmp::Ordering;
use std::collections::BTreeMap;
use crate::{Author, Chronofold, LogIndex, Op, Timestamp};
#[derive(PartialEq, Eq, Clone, Debug)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct Version<A: Author> {
log_indices: BTreeMap<A, LogIndex>,
}
impl<A: Author> Version<A> {
pub fn new() -> Self {
Self::default()
}
pub fn inc(&mut self, timestamp: &Timestamp<A>) {
self.log_indices
.entry(timestamp.1)
.and_modify(|t| *t = LogIndex(usize::max(t.0, (timestamp.0).0)))
.or_insert(timestamp.0);
}
pub fn iter<'a>(&'a self) -> impl Iterator<Item = Timestamp<A>> + 'a {
self.log_indices.iter().map(|(a, i)| Timestamp(*i, *a))
}
}
impl<A: Author> Default for Version<A> {
fn default() -> Self {
Self {
log_indices: BTreeMap::new(),
}
}
}
impl<A: Author> PartialOrd for Version<A> {
fn partial_cmp(&self, other: &Version<A>) -> Option<Ordering> {
let gt = |lhs: &Version<A>, rhs: &Version<A>| {
rhs.log_indices.iter().all(|(a, rhs_idx)| {
lhs.get(a)
.map(|lhs_idx| lhs_idx >= *rhs_idx)
.unwrap_or(false)
})
};
if self == other {
Some(Ordering::Equal)
} else if gt(self, other) {
Some(Ordering::Greater)
} else if gt(other, self) {
Some(Ordering::Less)
} else {
None
}
}
}
impl<A: Author> Version<A> {
pub fn get(&self, author: &A) -> Option<LogIndex> {
self.log_indices.get(author).cloned()
}
}
impl<A: Author, T: Clone> Chronofold<A, T> {
pub fn version(&self) -> &Version<A> {
&self.version
}
pub fn iter_newer_ops<'a>(
&'a self,
version: &'a Version<A>,
) -> impl Iterator<Item = Op<A, T>> + 'a {
self.iter_ops(..)
.filter(move |op| match version.log_indices.get(&op.id.1) {
None => true,
Some(idx) => op.id.0 > *idx,
})
}
}