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
use std::collections::HashSet;
use holo_hash::ActionHash;
use holo_hash::AgentPubKey;
use holochain_serialized_bytes::prelude::*;
#[cfg(test)]
mod test;
#[derive(Serialize, Deserialize, SerializedBytes, Debug, PartialEq, Eq, Hash, Clone)]
pub struct ChainFilter<H: Eq + Ord + std::hash::Hash = ActionHash> {
pub chain_top: H,
pub filters: ChainFilters<H>,
pub include_cached_entries: bool,
}
#[derive(Serialize, Deserialize, Debug, Eq, Clone)]
pub enum ChainFilters<H: Eq + Ord + std::hash::Hash = ActionHash> {
ToGenesis,
Take(u32),
Until(HashSet<H>),
Both(u32, HashSet<H>),
}
impl<H: Eq + Ord + std::hash::Hash> core::hash::Hash for ChainFilters<H> {
fn hash<HH: std::hash::Hasher>(&self, state: &mut HH) {
core::mem::discriminant(self).hash(state);
match self {
ChainFilters::ToGenesis => (),
ChainFilters::Take(t) => t.hash(state),
ChainFilters::Until(u) => {
let mut u: Vec<_> = u.iter().collect();
u.sort_unstable();
u.hash(state);
}
ChainFilters::Both(t, u) => {
let mut u: Vec<_> = u.iter().collect();
u.sort_unstable();
u.hash(state);
t.hash(state);
}
}
}
}
impl<H: Eq + Ord + std::hash::Hash> core::cmp::PartialEq for ChainFilters<H> {
fn eq(&self, other: &Self) -> bool {
match (self, other) {
(Self::Take(l0), Self::Take(r0)) => l0 == r0,
(Self::Until(a), Self::Until(b)) => {
let mut a: Vec<_> = a.iter().collect();
let mut b: Vec<_> = b.iter().collect();
a.sort_unstable();
b.sort_unstable();
a == b
}
(Self::Both(l0, a), Self::Both(r0, b)) => {
let mut a: Vec<_> = a.iter().collect();
let mut b: Vec<_> = b.iter().collect();
a.sort_unstable();
b.sort_unstable();
l0 == r0 && a == b
}
_ => core::mem::discriminant(self) == core::mem::discriminant(other),
}
}
}
#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]
pub struct MustGetAgentActivityInput {
pub author: AgentPubKey,
pub chain_filter: ChainFilter,
}
impl<H: Eq + Ord + std::hash::Hash> ChainFilter<H> {
pub fn new(chain_top: H) -> Self {
Self {
chain_top,
filters: Default::default(),
include_cached_entries: false,
}
}
pub fn take(mut self, n: u32) -> Self {
self.filters = match self.filters {
ChainFilters::ToGenesis => ChainFilters::Take(n),
ChainFilters::Take(old_n) => ChainFilters::Take(old_n.min(n)),
ChainFilters::Until(u) => ChainFilters::Both(n, u),
ChainFilters::Both(old_n, u) => ChainFilters::Both(old_n.min(n), u),
};
self
}
pub fn include_cached_entries(mut self) -> Self {
self.include_cached_entries = true;
self
}
pub fn until(mut self, action_hash: H) -> Self {
self.filters = match self.filters {
ChainFilters::ToGenesis => ChainFilters::Until(Some(action_hash).into_iter().collect()),
ChainFilters::Take(n) => ChainFilters::Both(n, Some(action_hash).into_iter().collect()),
ChainFilters::Until(mut u) => {
u.insert(action_hash);
ChainFilters::Until(u)
}
ChainFilters::Both(n, mut u) => {
u.insert(action_hash);
ChainFilters::Both(n, u)
}
};
self
}
pub fn get_until(&self) -> Option<&HashSet<H>> {
match &self.filters {
ChainFilters::Until(u) => Some(u),
ChainFilters::Both(_, u) => Some(u),
_ => None,
}
}
pub fn get_take(&self) -> Option<u32> {
match &self.filters {
ChainFilters::Take(s) => Some(*s),
ChainFilters::Both(s, _) => Some(*s),
_ => None,
}
}
}
impl<H: Eq + Ord + std::hash::Hash> Default for ChainFilters<H> {
fn default() -> Self {
Self::ToGenesis
}
}