frodo-ring 0.1.0

Ring queue with FIFO ordering with no allocations
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

#![no_std]

use frodo_ring::FrodoRing;

fn main() {
    let mut ring = FrodoRing::<u8, 6>::new();

    assert!(ring.push(0x1).is_ok());
    assert!(ring.push(0x2).is_ok());
    assert!(ring.push(0x3).is_ok());
    assert!(ring.push(0x4).is_ok());

    assert_eq!(ring.remove_at(1), Some(0x2));
    assert_eq!(ring.at(0), Some(&0x1));
    assert_eq!(ring.at(1), None);
    assert_eq!(ring.at(2), Some(&0x3));
    assert_eq!(ring.at(3), Some(&0x4));

    assert!(ring.push(0x5).is_ok());
    assert_eq!(ring.at(0), Some(&0x1));
    assert_eq!(ring.at(1), None);
    assert_eq!(ring.at(2), Some(&0x3));
    assert_eq!(ring.at(3), Some(&0x4));
    assert_eq!(ring.at(4), Some(&0x5));

    assert_eq!(ring.remove_at(0), Some(0x1));
    assert_eq!(ring.at(0), Some(&0x3));
    assert_eq!(ring.at(1), Some(&0x4));
    assert_eq!(ring.at(2), Some(&0x5));
    assert_eq!(ring.at(3), None);

    assert_eq!(ring.remove_at(1), Some(0x4));
    assert_eq!(ring.at(0), Some(&0x3));
    assert_eq!(ring.at(1), None);
    assert_eq!(ring.at(2), Some(&0x5));
    assert_eq!(ring.at(3), None);

    assert!(ring.push(0x6).is_ok());
    assert_eq!(ring.at(0), Some(&0x3));
    assert_eq!(ring.at(1), None);
    assert_eq!(ring.at(2), Some(&0x5));
    assert_eq!(ring.at(3), Some(&0x6));

    assert!(ring.push(0x7).is_ok());
    assert_eq!(ring.at(0), Some(&0x3));
    assert_eq!(ring.at(1), None);
    assert_eq!(ring.at(2), Some(&0x5));
    assert_eq!(ring.at(3), Some(&0x6));
    assert_eq!(ring.at(4), Some(&0x7));

    assert!(ring.push(0x8).is_ok());
}