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
use crate::queue::ConcurrentQueue;
use alloc::string::ToString;
use orx_concurrent_bag::ConcurrentBag;
use orx_fixed_vec::FixedVec;
use orx_pinned_vec::IntoConcurrentPinnedVec;
use orx_split_vec::SplitVec;
use std::{collections::HashSet, fmt::Debug, hash::Hash};
use test_case::test_matrix;

#[cfg(miri)]
const N: usize = 51;
#[cfg(not(miri))]
const N: usize = 4735;

const NUM_PUSHERS_POPPERS: usize = 8;

#[test_matrix(
    [FixedVec::new(N * NUM_PUSHERS_POPPERS), SplitVec::with_doubling_growth_and_max_concurrent_capacity(), SplitVec::with_linear_growth_and_fragments_capacity(10, 64)],
    [|x| x, |x| x.to_string()])
]
fn push_pop<P, T>(vec: P, f: impl Fn(usize) -> T + Sync)
where
    P: IntoConcurrentPinnedVec<T> + Clone,
    T: Send + Clone + Ord + Debug + Hash,
{
    let vec = vec.clone();
    assert!(vec.is_empty());

    let f = &f;
    let queue = ConcurrentQueue::from(vec);
    let q = &queue;
    let collected = ConcurrentBag::new();

    let mut potential = HashSet::new();
    for t in 0..NUM_PUSHERS_POPPERS {
        match usize::is_multiple_of(t, 2) {
            true => {}
            false => {
                for i in 0..N {
                    potential.insert(f(t * N + i));
                }
            }
        }
    }

    std::thread::scope(|s| {
        for t in 0..NUM_PUSHERS_POPPERS {
            match usize::is_multiple_of(t, 2) {
                true => {
                    s.spawn(|| {
                        for _ in 0..N {
                            if let Some(value) = q.pop() {
                                collected.push(value);
                            }
                        }
                    });
                }
                false => {
                    s.spawn(move || {
                        for i in 0..N {
                            q.push(f(t * N + i));
                        }
                    });
                }
            }
        }
    });

    let mut collected = collected.into_inner().to_vec();
    collected.sort();

    let mut iter = collected.iter().cloned();
    if let Some(mut prev) = iter.next() {
        for c in iter {
            potential.contains(&c);
            assert_ne!(prev, c);
            prev = c;
        }
    }
}