kad 0.6.1

A generic / futures based implementation of the Kademlia Distributed Hash Table (DHT)
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
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

use std::collections::HashMap;
/**
 * rust-kad
 * Integration / external library user tests
 *
 * https://github.com/ryankurte/rust-kad
 * Copyright 2018 Ryan Kurte
 */
use std::fmt::Debug;
use std::marker::PhantomData;
use std::sync::{Arc, Mutex};

use kad::common::*;
use kad::dht::Dht;
use kad::store::HashMapStore;
use kad::table::KNodeTable;
use kad::Config;

use futures::channel::mpsc;
use futures::executor::block_on;

struct MockPeer<Id: Debug, Info: Debug, Data: Debug> {
    dht: Dht<Id, Info, Data, u64>,
}

type PeerMap<Id, Info, Data> = HashMap<Id, MockPeer<Id, Info, Data>>;

struct MockNetwork<Id: Debug, Info: Debug, Data: Debug> {
    peers: Arc<Mutex<PeerMap<Id, Info, Data>>>,
}

impl<Id, Info, Data> MockNetwork<Id, Info, Data>
where
    Id: DatabaseId + Debug + Send + Sync + 'static,
    Info: Debug + Clone + PartialEq + Send + Sync + 'static,
    Data: Debug + Clone + PartialEq + Send + Sync + 'static,
{
    pub fn new(config: Config, nodes: &[Entry<Id, Info>]) -> MockNetwork<Id, Info, Data> {
        let m = MockNetwork {
            peers: Arc::new(Mutex::new(HashMap::new())),
        };

        for n in nodes {
            let config = config.clone();

            let (sink_tx, sink_rx) = mpsc::channel(10);

            let dht = Dht::standard(n.id().clone(), config, sink_tx);

            let peer = MockPeer { dht };

            m.peers.lock().unwrap().insert(n.id().clone(), peer);
        }

        m
    }
}

#[cfg(nope)]
#[test]
fn integration() {
    // TODO: split into separate tests, add benchmarks

    // Setup config
    let mut config = Config::default();
    config.k = 2;

    // Build basic nodes
    let mut nodes = Vec::new();
    for i in 0..16 {
        nodes.push(Entry::<[u8; 1], MockSync>::new(
            [i * 16],
            MockSync::new(i as u64),
        ));
    }
    let n0 = &nodes[0];

    // Create mock network
    let mgr = MockNetwork::<[u8; 1], MockSync, u64>::new(config, &nodes);

    println!("Bootstrapping Network");
    for n in nodes.iter().skip(1) {
        let mut peer = { mgr.peers.lock().unwrap().remove(n.id()).unwrap() };

        block_on(peer.connect(n0.clone(), ())).expect("Error connecting to network");

        mgr.peers.lock().unwrap().insert(n.id().clone(), peer);
    }

    println!("Testing locate across all nodes");
    for n1 in &nodes {
        for n2 in &nodes {
            if n1 == n2 {
                continue;
            }

            let mut peer = { mgr.peers.lock().unwrap().remove(n1.id()).unwrap() };

            let _node =
                block_on(peer.lookup(n2.id().clone(), ())).expect("Error finding node in network");

            mgr.peers.lock().unwrap().insert(n1.id().clone(), peer);
        }
    }

    println!("Testing store");
    let addr = [132];
    let val = vec![112];
    {
        let mut peer = { mgr.peers.lock().unwrap().remove(n0.id()).unwrap() };

        let _res = block_on(peer.store(addr, val, ())).expect("Error storing value");

        mgr.peers.lock().unwrap().insert(n0.id().clone(), peer);
    }

    println!("Testing find values for each node");
    for n in &nodes {
        let mut peer = { mgr.peers.lock().unwrap().remove(n.id()).unwrap() };

        let val = block_on(peer.find(addr, ())).expect("Error finding values");
        assert!(val.len() > 0);

        mgr.peers.lock().unwrap().insert(n.id().clone(), peer);
    }
}