samurai 0.1.5

Very early stage user-space P2P network protocol.
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

use samurai::id::Id;

#[test]
fn add() {
    // Normal addition
    assert_eq!(Id::new(0, 0) + 1, Id::new(0, 1));
    // If low overflows it goes to high
    assert_eq!(Id::new(0, u128::max_value()) + 1, Id::new(1, 0));
    // Does not overflow
    assert_eq!(
        Id::new(u128::max_value(), u128::max_value()) + 1,
        Id::new(u128::max_value(), u128::max_value())
    );
}

#[test]
fn sub() {
    // Normal substraction
    assert_eq!(Id::new(0, 1) - 1, Id::new(0, 0));
    assert_eq!(Id::new(1, 0) - 1, Id::new(0, u128::max_value()));
    // Does not underflow
    assert_eq!(Id::new(0, 0) - 1, Id::new(0, 0));
}

#[test]
fn cmp() {
    assert!(Id::new(0, 1) > Id::new(0, 0));
    assert!(Id::new(1, 0) > Id::new(0, 0));
    assert!(Id::new(1, 0) > Id::new(0, 1));
}

#[test]
fn zero() {
    let id = Id::zero();
    assert_eq!(id, Id::new(0, 0));
}

#[test]
fn max() {
    let id = Id::max();
    assert_eq!(id, Id::new(u128::max_value(), u128::max_value()));
}

#[test]
fn rand() {
    let id0 = Id::rand();
    let id1 = Id::rand();
    assert_ne!(id0, id1);
}

#[test]
fn half() {
    let id = Id::new(0, 9);
    assert_eq!(id.half(), Id::new(0, 4));
}

#[test]
fn bytes() {
    let buf = [0u8; 32];
    let id0 = Id::from_bytes(&buf);
    assert_eq!(id0, Id::zero());

    let buf = [255u8; 32];
    let id0 = Id::from_bytes(&buf);
    assert_eq!(id0, Id::max());
}