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
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

use crate::ConcurrentQueue;
use orx_fixed_vec::FixedVec;
use orx_pinned_vec::IntoConcurrentPinnedVec;
use orx_split_vec::SplitVec;
use std::string::{String, ToString};
use test_case::test_matrix;

#[test_matrix([
    FixedVec::new(20),
    SplitVec::with_doubling_growth_and_max_concurrent_capacity(),
    SplitVec::with_linear_growth_and_fragments_capacity(2, 64),
])]
fn into_iter_empty<P>(vec: P)
where
    P: IntoConcurrentPinnedVec<String> + Clone,
{
    let iter = || {
        let queue = ConcurrentQueue::from(vec.clone());
        queue.into_iter()
    };

    let consume_all = iter().count();
    assert_eq!(consume_all, 0);

    let mut consume_half = iter();
    for _ in 0..10 {
        _ = consume_half.next();
    }

    let _consume_none = iter();
}

#[test_matrix([
    FixedVec::new(30),
    SplitVec::with_doubling_growth_and_max_concurrent_capacity(),
    SplitVec::with_linear_growth_and_fragments_capacity(2, 64),
])]
fn into_iter_none_used<P>(vec: P)
where
    P: IntoConcurrentPinnedVec<String> + Clone,
{
    let iter = || {
        let queue = ConcurrentQueue::from(vec.clone());
        for i in 0..20 {
            queue.push(i.to_string());
        }
        queue.into_iter()
    };

    let consume_all = iter().count();
    assert_eq!(consume_all, 20);

    let mut consume_half = iter();
    for _ in 0..10 {
        _ = consume_half.next();
    }

    let _consume_none = iter();
}

#[test_matrix([
    FixedVec::new(30),
    SplitVec::with_doubling_growth_and_max_concurrent_capacity(),
    SplitVec::with_linear_growth_and_fragments_capacity(2, 64),
])]
fn into_iter_half_used<P>(vec: P)
where
    P: IntoConcurrentPinnedVec<String> + Clone,
{
    let iter = || {
        let queue = ConcurrentQueue::from(vec.clone());
        for i in 0..20 {
            queue.push(i.to_string());
        }
        for _ in 0..7 {
            _ = queue.pop();
        }
        queue.into_iter()
    };

    let consume_all = iter().count();
    assert_eq!(consume_all, 13);

    let mut consume_half = iter();
    for _ in 0..10 {
        _ = consume_half.next();
    }

    let _consume_none = iter();
}

#[test_matrix([
    FixedVec::new(30),
    SplitVec::with_doubling_growth_and_max_concurrent_capacity(),
    SplitVec::with_linear_growth_and_fragments_capacity(2, 64),
])]
fn into_iter_fully_used<P>(vec: P)
where
    P: IntoConcurrentPinnedVec<String> + Clone,
{
    let iter = || {
        let queue = ConcurrentQueue::from(vec.clone());
        for i in 0..20 {
            queue.push(i.to_string());
        }
        while let Some(_) = queue.pop() {}
        queue.into_iter()
    };

    let consume_all = iter().count();
    assert_eq!(consume_all, 0);

    let mut consume_half = iter();
    for _ in 0..10 {
        _ = consume_half.next();
    }

    let _consume_none = iter();
}