orx-concurrent-queue 1.2.0

A high performance and convenient thread safe queue that can concurrently grow and shrink with push, extend, pop and pull capabilities.
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

use crate::ConcurrentQueue;
use core::sync::atomic::Ordering;

#[test]
fn num_getters() {
    let queue = ConcurrentQueue::new();
    let order = Ordering::Relaxed;

    let mut wr = 0;
    let mut p = 0;

    // write
    for _ in 0..10 {
        assert_eq!(queue.num_write_reserved(order), wr);
        assert_eq!(queue.num_written(order), wr);
        assert_eq!(queue.num_popped(order), p);

        queue.push('x');
        wr += 1;
    }

    // pop
    for _ in 0..6 {
        assert_eq!(queue.num_write_reserved(order), wr);
        assert_eq!(queue.num_written(order), wr);
        assert_eq!(queue.num_popped(order), p);

        _ = queue.pop();
        p += 1;
    }

    // write
    for _ in 4..20 {
        assert_eq!(queue.num_write_reserved(order), wr);
        assert_eq!(queue.num_written(order), wr);
        assert_eq!(queue.num_popped(order), p);

        queue.push('x');
        wr += 1;
    }

    // pop
    for _ in 0..20 {
        assert_eq!(queue.num_write_reserved(order), wr);
        assert_eq!(queue.num_written(order), wr);
        assert_eq!(queue.num_popped(order), p);

        _ = queue.pop();
        p += 1;
    }

    assert!(queue.is_empty());
    assert_eq!(wr, 26);
    assert_eq!(p, 26);
}