berblom 0.1.0

A novel web-of-trust algorithm for trust calculation.
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
53
54

//! Types that are required for the BFS queue implementation.

use std::cmp::Ordering;

#[derive(Clone, Debug)]
pub struct NodePriority {
    length: usize,
    trust_amount: u8,
}

impl NodePriority {
    pub fn new(length: usize, trust_amount: u8) -> Self {
        NodePriority {
            length,
            trust_amount,
        }
    }
}

use std::fmt;

impl fmt::Display for NodePriority {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(
            f,
            "[ length: {}, trust: {} ]",
            self.length, self.trust_amount
        )
    }
}

impl Ord for NodePriority {
    fn cmp(&self, other: &Self) -> Ordering {
        match self.length.cmp(&other.length) {
            Ordering::Equal => self.trust_amount.cmp(&other.trust_amount),
            Ordering::Less => Ordering::Greater,
            Ordering::Greater => Ordering::Less,
        }
    }
}

impl PartialOrd for NodePriority {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl PartialEq for NodePriority {
    fn eq(&self, other: &Self) -> bool {
        self.length == other.length && self.trust_amount == other.trust_amount
    }
}

impl Eq for NodePriority {}