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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
use std::ops::Bound;
use std::ops::RangeBounds;
use crate::*;
pub const FULL_LEN: u64 = 2u64.pow(32);
pub const FULL_LEN_F: f64 = FULL_LEN as f64;
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct ArcRange {
pub start: Bound<u32>,
pub end: Bound<u32>,
}
impl ArcRange {
pub fn is_empty(&self) -> bool {
matches!((self.start_bound(), self.end_bound()), (Bound::Excluded(a), Bound::Excluded(b)) if a == b)
}
pub fn len(&self) -> u64 {
match (self.start_bound(), self.end_bound()) {
(Bound::Included(start), Bound::Included(end)) if end < start => {
U32_LEN - *start as u64 + *end as u64 + 1
}
(Bound::Included(start), Bound::Included(end)) if start == end => 1,
(Bound::Included(start), Bound::Included(end)) => (end - start) as u64 + 1,
(Bound::Excluded(_), Bound::Excluded(_)) => 0,
_ => unreachable!("Ranges are either completely inclusive or completely exclusive"),
}
}
}
impl RangeBounds<u32> for ArcRange {
fn start_bound(&self) -> Bound<&u32> {
match &self.start {
Bound::Included(i) => Bound::Included(i),
Bound::Excluded(i) => Bound::Excluded(i),
Bound::Unbounded => unreachable!("No unbounded ranges for arcs"),
}
}
fn end_bound(&self) -> Bound<&u32> {
match &self.end {
Bound::Included(i) => Bound::Included(i),
Bound::Excluded(i) => Bound::Excluded(i),
Bound::Unbounded => unreachable!("No unbounded ranges for arcs"),
}
}
fn contains<U>(&self, _item: &U) -> bool
where
u32: PartialOrd<U>,
U: ?Sized + PartialOrd<u32>,
{
unimplemented!("Contains doesn't make sense for this type of range due to redundant holding near the bounds. Use DhtArcRange::contains")
}
}
#[derive(Copy, Clone, Debug, derive_more::Deref, serde::Serialize, serde::Deserialize)]
pub struct DhtArc(#[deref] DhtArcRange, Option<DhtLocation>);
impl DhtArc {
pub fn bounded(a: DhtArcRange) -> Self {
Self(a, None)
}
pub fn empty(loc: DhtLocation) -> Self {
Self(DhtArcRange::Empty, Some(loc))
}
pub fn full(loc: DhtLocation) -> Self {
Self(DhtArcRange::Full, Some(loc))
}
pub fn start_loc(&self) -> DhtLocation {
match (self.0, self.1) {
(DhtArcRange::Empty, Some(loc)) => loc,
(DhtArcRange::Full, Some(loc)) => loc,
(DhtArcRange::Bounded(lo, _), _) => lo,
_ => unreachable!(),
}
}
pub fn inner(self) -> DhtArcRange {
self.0
}
pub fn from_parts(a: DhtArcRange, loc: DhtLocation) -> Self {
if a.is_bounded() {
Self::bounded(a)
} else {
Self(a, Some(loc))
}
}
pub fn from_start_and_half_len<L: Into<DhtLocation>>(start: L, half_len: u32) -> Self {
let start = start.into();
let a = DhtArcRange::from_start_and_half_len(start, half_len);
Self::from_parts(a, start)
}
pub fn from_start_and_len<L: Into<DhtLocation>>(start: L, len: u64) -> Self {
let start = start.into();
let a = DhtArcRange::from_start_and_len(start, len);
Self::from_parts(a, start)
}
pub fn from_bounds<L: Into<DhtLocation>>(start: L, end: L) -> Self {
let start = start.into();
let end = end.into();
let a = DhtArcRange::from_bounds(start, end);
Self::from_parts(a, start)
}
pub fn update_length(&mut self, new_length: u64) {
*self = Self::from_start_and_len(self.start_loc(), new_length)
}
pub fn range(&self) -> ArcRange {
match (self.0, self.1) {
(DhtArcRange::Empty, Some(loc)) => ArcRange {
start: Bound::Excluded(loc.as_u32()),
end: Bound::Excluded(loc.as_u32()),
},
(DhtArcRange::Full, Some(loc)) => ArcRange {
start: Bound::Included(loc.as_u32()),
end: Bound::Included(loc.as_u32().wrapping_sub(1)),
},
(DhtArcRange::Bounded(lo, hi), _) => ArcRange {
start: Bound::Included(lo.as_u32()),
end: Bound::Included(hi.as_u32()),
},
_ => unimplemented!(),
}
}
pub fn to_ascii(&self, len: usize) -> String {
let mut s = self.0.to_ascii(len);
let start = loc_downscale(len, self.start_loc());
s.replace_range(start..start + 1, "@");
s
}
}
impl From<DhtArc> for DhtArcRange {
fn from(a: DhtArc) -> Self {
a.inner()
}
}
impl From<&DhtArc> for DhtArcRange {
fn from(a: &DhtArc) -> Self {
a.inner()
}
}
#[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, serde::Serialize, serde::Deserialize)]
pub enum DhtArcRange<T = DhtLocation> {
Empty,
Full,
Bounded(T, T),
}
impl<T: PartialOrd + num_traits::Num> DhtArcRange<T> {
pub fn contains<B: std::borrow::Borrow<T>>(&self, t: B) -> bool {
match self {
Self::Empty => false,
Self::Full => true,
Self::Bounded(lo, hi) => {
let t = t.borrow();
if lo <= hi {
lo <= t && t <= hi
} else {
lo <= t || t <= hi
}
}
}
}
}
impl<T> DhtArcRange<T> {
pub fn map<U, F: Fn(T) -> U>(self, f: F) -> DhtArcRange<U> {
match self {
Self::Empty => DhtArcRange::Empty,
Self::Full => DhtArcRange::Full,
Self::Bounded(lo, hi) => DhtArcRange::Bounded(f(lo), f(hi)),
}
}
}
impl<T: num_traits::AsPrimitive<u32>> DhtArcRange<T> {
pub fn from_bounds(start: T, end: T) -> DhtArcRange<DhtLocation> {
let start = start.as_();
let end = end.as_();
if is_full(start, end) {
DhtArcRange::Full
} else {
DhtArcRange::Bounded(DhtLocation::new(start), DhtLocation::new(end))
}
}
pub fn from_start_and_len(start: T, len: u64) -> DhtArcRange<DhtLocation> {
let start = start.as_();
if len == 0 {
DhtArcRange::Empty
} else {
let end = start.wrapping_add(((len - 1) as u32).min(u32::MAX));
DhtArcRange::from_bounds(start, end)
}
}
pub fn from_start_and_half_len(start: T, half_len: u32) -> DhtArcRange<DhtLocation> {
Self::from_start_and_len(start, half_to_full_len(half_len))
}
pub fn new_generic(start: T, end: T) -> Self {
if is_full(start.as_(), end.as_()) {
Self::Full
} else {
Self::Bounded(start, end)
}
}
}
impl DhtArcRange<u32> {
pub fn canonical(self) -> DhtArcRange {
match self {
DhtArcRange::Empty => DhtArcRange::Empty,
DhtArcRange::Full => DhtArcRange::Full,
DhtArcRange::Bounded(lo, hi) => {
DhtArcRange::from_bounds(DhtLocation::new(lo), DhtLocation::new(hi))
}
}
}
}
impl DhtArcRange<DhtLocation> {
pub fn new_empty() -> Self {
Self::Empty
}
pub fn to_bounds_grouped(&self) -> Option<(DhtLocation, DhtLocation)> {
match self {
Self::Empty => None,
Self::Full => Some((DhtLocation::MIN, DhtLocation::MAX)),
&Self::Bounded(lo, hi) => Some((lo, hi)),
}
}
pub fn to_primitive_bounds_detached(&self) -> (Option<u32>, Option<u32>) {
self.to_bounds_grouped()
.map(|(a, b)| (Some(a.as_u32()), Some(b.as_u32())))
.unwrap_or_default()
}
pub fn is_empty(&self) -> bool {
matches!(self, Self::Empty)
}
pub fn is_full(&self) -> bool {
matches!(self, Self::Full)
}
pub fn is_bounded(&self) -> bool {
matches!(self, Self::Bounded(_, _))
}
pub fn overlaps(&self, other: &Self) -> bool {
let a = DhtArcSet::from(self);
let b = DhtArcSet::from(other);
a.overlap(&b)
}
pub fn overlap_coverage(&self, other: &Self) -> f64 {
let a = DhtArcSet::from(self);
let b = DhtArcSet::from(other);
let c = a.intersection(&b);
c.size() as f64 / a.size() as f64
}
pub fn coverage(&self) -> f64 {
self.length() as f64 / 2f64.powf(32.0)
}
pub fn length(&self) -> u64 {
match self {
DhtArcRange::Empty => 0,
DhtArcRange::Full => 2u64.pow(32),
DhtArcRange::Bounded(lo, hi) => {
(hi.as_u32().wrapping_sub(lo.as_u32()) as u64).wrapping_add(1)
}
}
}
pub fn half_length(&self) -> u32 {
full_to_half_len(self.length())
}
pub fn to_ascii(&self, len: usize) -> String {
let empty = || " ".repeat(len);
let full = || "-".repeat(len);
let decide = |lo: &DhtLocation, hi: &DhtLocation| {
let mid = loc_upscale(len, (len / 2) as i32);
if lo < hi {
if hi.as_u32() - lo.as_u32() < mid {
empty()
} else {
full()
}
} else if lo.as_u32() - hi.as_u32() < mid {
full()
} else {
empty()
}
};
match self {
Self::Full => full(),
Self::Empty => empty(),
Self::Bounded(lo0, hi0) => {
let lo = loc_downscale(len, *lo0);
let hi = loc_downscale(len, *hi0);
if lo0 <= hi0 {
if lo >= hi {
vec![decide(lo0, hi0)]
} else {
vec![
" ".repeat(lo),
"-".repeat(hi - lo + 1),
" ".repeat((len - hi).saturating_sub(1)),
]
}
} else if lo <= hi {
vec![decide(lo0, hi0)]
} else {
vec![
"-".repeat(hi + 1),
" ".repeat((lo - hi).saturating_sub(1)),
"-".repeat(len - lo),
]
}
.join("")
}
}
}
#[cfg(any(test, feature = "test_utils"))]
pub fn to_ascii_with_ops<L: Into<crate::loc8::Loc8>, I: IntoIterator<Item = L>>(
&self,
len: usize,
ops: I,
) -> String {
use crate::loc8::Loc8;
let mut buf = vec![0; len];
let mut s = self.to_ascii(len);
for o in ops {
let o: Loc8 = o.into();
let o: DhtLocation = o.into();
let loc = loc_downscale(len, o);
buf[loc] += 1;
}
for (i, v) in buf.into_iter().enumerate() {
if v > 0 {
let c = format!("{:x}", v.min(0xf));
s.replace_range(i..i + 1, &c);
}
}
s
}
pub fn canonical(self) -> DhtArcRange {
self
}
}
pub fn is_full(start: u32, end: u32) -> bool {
(start == super::dht_arc_set::MIN && end >= super::dht_arc_set::MAX)
|| end == start.wrapping_sub(1)
}
pub fn full_to_half_len(full_len: u64) -> u32 {
if full_len == 0 {
0
} else {
((full_len / 2) as u32).wrapping_add(1).min(MAX_HALF_LENGTH)
}
}
pub fn half_to_full_len(half_len: u32) -> u64 {
if half_len == 0 {
0
} else if half_len >= MAX_HALF_LENGTH {
U32_LEN
} else {
(half_len as u64 * 2).wrapping_sub(1)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn arc_contains() {
let convergent = DhtArcRange::Bounded(10, 20);
let divergent = DhtArcRange::Bounded(20, 10);
assert!(!convergent.contains(0));
assert!(!convergent.contains(5));
assert!(convergent.contains(10));
assert!(convergent.contains(15));
assert!(convergent.contains(20));
assert!(!convergent.contains(25));
assert!(!convergent.contains(u32::MAX));
assert!(divergent.contains(0));
assert!(divergent.contains(5));
assert!(divergent.contains(10));
assert!(!divergent.contains(15));
assert!(divergent.contains(20));
assert!(divergent.contains(25));
assert!(divergent.contains(u32::MAX));
}
#[test]
fn test_length() {
let full = 2u64.pow(32);
assert_eq!(DhtArcRange::Empty.length(), 0);
assert_eq!(DhtArcRange::from_bounds(0, 0).length(), 1);
assert_eq!(DhtArcRange::from_bounds(0, 1).length(), 2);
assert_eq!(DhtArcRange::from_bounds(1, 0).length(), full);
assert_eq!(DhtArcRange::from_bounds(2, 0).length(), full - 1);
}
#[test]
fn test_ascii() {
let cent = u32::MAX / 100 + 1;
assert_eq!(
DhtArc::from_bounds(cent * 30, cent * 60).to_ascii(10),
" @--- ".to_string()
);
assert_eq!(
DhtArc::from_bounds(cent * 33, cent * 63).to_ascii(10),
" @--- ".to_string()
);
assert_eq!(
DhtArc::from_bounds(cent * 29, cent * 59).to_ascii(10),
" @--- ".to_string()
);
assert_eq!(
DhtArc::from_bounds(cent * 60, cent * 30).to_ascii(10),
"---- @---".to_string()
);
assert_eq!(
DhtArc::from_bounds(cent * 63, cent * 33).to_ascii(10),
"---- @---".to_string()
);
assert_eq!(
DhtArc::from_bounds(cent * 59, cent * 29).to_ascii(10),
"--- @----".to_string()
);
assert_eq!(
DhtArc::from_bounds(cent * 99, cent * 0).to_ascii(10),
"- @".to_string()
);
}
}