simple_kbuckets 0.2.0

Simple implementation of a Kademlia-like hash table.
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

use std::fmt::Debug;

/// Trait that table keys must implement.
pub trait Key: Debug + Clone + Ord + PartialEq {
    fn bitxor(&self, other: &Self) -> Self;
    fn bits(&self) -> usize;
}

impl Key for u64 {
    fn bitxor(&self, other: &u64) -> u64 {
        self ^ other
    }
    fn bits(&self) -> usize {
        (64 - self.leading_zeros()) as usize
    }
}

impl Key for Vec<u8> {
    fn bitxor(&self, other: &Vec<u8>) -> Vec<u8> {
        assert!(self.len() == other.len());
        self.iter().zip(other.iter()).map(|(digit1, digit2)| digit1 ^ digit2).collect()
    }
    fn bits(&self) -> usize {
        let mut bits = self.len()*8;
        for digit in self {
            if *digit == 0 {
                bits -= 8;
            }
            else {
                return bits - digit.leading_zeros() as usize
            }
        }
        assert!(bits == 0);
        0
    }
}