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
pub use super::bucket::{Node, K_VALUE};
pub use super::key::*;
use super::*;
pub struct EntryRefView<'a, TPeerId, TVal> {
pub node: NodeRefView<'a, TPeerId, TVal>,
}
pub struct NodeRefView<'a, TKey, TVal> {
pub key: &'a TKey,
pub value: &'a TVal,
}
impl<TKey, TVal> EntryRefView<'_, TKey, TVal> {
pub fn to_owned(&self) -> EntryView<TKey, TVal>
where
TKey: Clone,
TVal: Clone,
{
EntryView {
node: Node {
key: self.node.key.clone(),
value: self.node.value.clone(),
},
}
}
}
#[derive(Clone, Debug)]
pub struct EntryView<TKey, TVal> {
pub node: Node<TKey, TVal>,
}
impl<TKey: AsRef<KeyBytes>, TVal> AsRef<KeyBytes> for EntryView<TKey, TVal> {
fn as_ref(&self) -> &KeyBytes {
self.node.key.as_ref()
}
}
#[derive(Debug)]
pub enum Entry<'a, TPeerId, TVal> {
Present(PresentEntry<'a, TPeerId, TVal>),
Absent(AbsentEntry<'a, TPeerId, TVal>),
SelfEntry,
}
#[derive(Debug)]
struct EntryRef<'a, TKey, TVal> {
bucket: &'a mut KBucket<TKey, TVal>,
key: &'a TKey,
}
impl<'a, TKey, TVal> Entry<'a, TKey, TVal>
where
TKey: Clone + AsRef<KeyBytes>,
TVal: Clone,
{
pub(super) fn new(bucket: &'a mut KBucket<TKey, TVal>, key: &'a TKey) -> Self {
if bucket.position(key).is_some() {
Entry::Present(PresentEntry::new(bucket, key))
} else {
Entry::Absent(AbsentEntry::new(bucket, key))
}
}
pub fn view(&'a mut self) -> Option<EntryRefView<'a, TKey, TVal>> {
match self {
Entry::Present(entry) => Some(EntryRefView {
node: NodeRefView {
key: entry.0.key,
value: entry.value(),
},
}),
_ => None,
}
}
pub fn key(&self) -> Option<&TKey> {
match self {
Entry::Present(entry) => Some(entry.key()),
Entry::Absent(entry) => Some(entry.key()),
Entry::SelfEntry => None,
}
}
pub fn value(&mut self) -> Option<&mut TVal> {
match self {
Entry::Present(entry) => Some(entry.value()),
Entry::Absent(_) => None,
Entry::SelfEntry => None,
}
}
}
#[derive(Debug)]
pub struct PresentEntry<'a, TKey, TVal>(EntryRef<'a, TKey, TVal>);
impl<'a, TKey, TVal> PresentEntry<'a, TKey, TVal>
where
TKey: Clone + AsRef<KeyBytes>,
TVal: Clone,
{
fn new(bucket: &'a mut KBucket<TKey, TVal>, key: &'a TKey) -> Self {
PresentEntry(EntryRef { bucket, key })
}
pub fn key(&self) -> &TKey {
self.0.key
}
pub fn value(&mut self) -> &mut TVal {
&mut self
.0
.bucket
.get_mut(self.0.key)
.expect("We can only build a PresentEntry if the entry is in the bucket; QED")
.value
}
pub fn remove(self) -> EntryView<TKey, TVal> {
let (node, _pos) = self
.0
.bucket
.remove(&self.0.key)
.expect("We can only build a PresentEntry if the entry is in the bucket; QED");
EntryView { node }
}
}
#[derive(Debug)]
pub struct AbsentEntry<'a, TKey, TVal>(EntryRef<'a, TKey, TVal>);
impl<'a, TKey, TVal> AbsentEntry<'a, TKey, TVal>
where
TKey: Clone + AsRef<KeyBytes>,
TVal: Clone,
{
fn new(bucket: &'a mut KBucket<TKey, TVal>, key: &'a TKey) -> Self {
AbsentEntry(EntryRef { bucket, key })
}
pub fn key(&self) -> &TKey {
self.0.key
}
pub fn bucket(&mut self) -> &mut KBucket<TKey, TVal> {
self.0.bucket
}
pub fn insert(&mut self, value: TVal) -> bool {
self.0.bucket.insert(Node {
key: self.0.key.clone(),
value,
})
}
}