packed_array 0.2.0

Packed Array aka sparse set structure with compile-time known size
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

use packed_array::PackedArray;

#[test]
fn creation() {
    let a = PackedArray::<u32, 10>::new();
    assert_eq!(a.len(), 0);
}

#[test]
fn append_remove() {
    let mut a = PackedArray::<i16, 15>::new();
    let i1 = a.append(90);
    let i2 = a.append(18);
    let i3 = a.append(-80);
    assert_eq!(a.len(), 3);
    assert_eq!(a[i1], 90);
    assert_eq!(a[i2], 18);
    assert_eq!(a[i3], -80);

    a.remove(i3);
    assert_eq!(a.len(), 2);
    assert_eq!(a[i1], 90);
    assert_eq!(a[i2], 18);

    a.remove(i1);
    assert_eq!(a.len(), 1);
    assert_eq!(a[i2], 18);
}

#[test]
fn references() {
    let mut a = PackedArray::<i16, 15>::new();
    let i1 = a.append(90);
    let i2 = a.append(18);

    let number = &mut a[i2];
    *number = 80;
    assert_eq!(a[i2], 80);
    assert_eq!(a[i1], 90);
}

#[test]
fn iteration() {
    let mut a = PackedArray::<i16, 15>::new();
    a.append(90);
    a.append(18);

    let mut i = 0;
    for item in a.iter() {
        assert_eq!(*item, a[i]);
        i += 1;
    }
}

#[test]
fn iteration_mut() {
    let mut a = PackedArray::<i16, 15>::new();
    let i1 = a.append(90);
    let i2 = a.append(18);

    for item in a.iter_mut() {
        *item += 1;
    }
    assert_eq!(a[i1], 91);
    assert_eq!(a[i2], 19);
}