rings-core 0.1.0

Chord DHT implementation with ICE
Documentation 
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

use crate::dht::did::SortRing;
use crate::dht::Did;

#[derive(Debug, Clone)]
pub struct Successor {
    id: Did,
    max: usize,
    successors: Vec<Did>,
}

impl Successor {
    pub fn new(id: &Did) -> Self {
        Self {
            id: *id,
            max: 3,
            successors: vec![],
        }
    }

    pub fn is_none(&self) -> bool {
        self.successors.is_empty()
    }

    pub fn min(&self) -> Did {
        if self.is_none() {
            self.id
        } else {
            self.successors[0]
        }
    }

    pub fn max(&self) -> Did {
        if self.is_none() {
            self.id
        } else {
            self.successors[self.successors.len() - 1]
        }
    }

    pub fn update(&mut self, successor: Did) {
        if self.successors.contains(&successor) || successor == self.id {
            return;
        }
        self.successors.push(successor);
        self.successors.sort(self.id);
        self.successors.truncate(self.max);
    }

    pub fn list(&self) -> Vec<Did> {
        self.successors.clone()
    }
}