let min_size = *sizes.iter().min().unwrap();

        let max_size = *sizes.iter().max().unwrap();

        let mut array = RawArray::new();

        array.resize(max_size);

        fill(&mut array, max_size);

            array.resize(size);

            assert_eq!(array.cap(), size);

        }

        check(&array, min_size);

    }

}

/// not shrink. So probably a temporary thing.

///

/// In debug mode we'll make sure that there are no producers when the queue is

/// dropped. We don't do this in release mode because the runtime is written

/// such that components always remain alive (hence, this queue will remain

/// accessible) while there are references to it.

pub struct QueueDynMpsc<T> {

    // Entire contents are boxed up such that we can create producers that have

    // a pointer to the contents.

    inner: Box<Shared<T>>

}

        if (cur_read + buf_size) & data_lock.compare_mask != cur_limit {

            // Make a bitwise copy of the value and return it. The receiver is

            // responsible for dropping it.

            unsafe {

                let source = data_lock.data.get((cur_read & data_lock.read_mask) as usize);

                // We can perform a store since we're the only ones modifying

                // the atomic.

                self.inner.read_head.store((cur_read + 1) & data_lock.compare_mask, Ordering::Release);

            }

        } else {

            return None;

        }

    }

}

    }

    pub fn push(&self, value: T) {

        let queue = unsafe{ &*self.queue };

        let mut data_lock = queue.data.lock_shared();

        'attempt_write: loop {

            let read_index = queue.read_head.load(Ordering::Acquire);

            if write_index == read_index { // both stored as [0, 2*capacity), so we can check equality without bitwise ANDing

                // Need to resize, try loading read/write index afterwards

                let expected_capacity = data_lock.data.cap();

                data_lock = self.resize(data_lock, expected_capacity);

                write_index = queue.write_head.load(Ordering::Acquire);

                continue 'attempt_write;

                std::ptr::write(data_lock.data.get((write_index & data_lock.read_mask) as usize), value);

            }

            // Update limit head to let reader obtain the written value in a

            // CAS-loop

            while let Err(_) = queue.limit_head.compare_exchange_weak(

            ) {}

            return;

        }

    }

                // to ensure the ringbuffer can distinguish the cases where the

                // ringbuffer is full, and when it is empty.

                let mut read_index = queue.read_head.load(Ordering::Acquire);

                let mut write_index = queue.write_head.load(Ordering::Acquire);

                debug_assert_eq!(write_index, queue.limit_head.load(Ordering::Acquire)); // since we have exclusive access

                read_index &= exclusive_lock.read_mask;

                write_index &= exclusive_lock.read_mask;

                let new_capacity = new_capacity as u32;

                    // The readable elements do not wrap around the ringbuffer

                    write_index += new_capacity;

                } else {

                    // The readable elements do wrap around the ringbuffer

                    write_index += old_capacity as u32;

                    write_index += new_capacity;

                queue.limit_head.store(write_index, Ordering::Release);

                queue.write_head.store(write_index, Ordering::Release);

                // Update the masks

                exclusive_lock.read_mask = new_capacity - 1;

                exclusive_lock.compare_mask = (2 * new_capacity) - 1;

            }

        }

        // Reacquire shared lock

        return queue.data.lock_shared();

    }

        use std::sync::{Arc, Mutex};

        // Rather randomized test. Kind of a stress test. We let the producers

        // produce `u64` values with the high bits containing their identifier.

        // The consumer will try receive as fast as possible until each thread

        // has produced the expected number of values.

        fn take_num_thread_idx(number: u64) -> u64 { return (number >> 32) & 0xFFFFFFFF; }

        fn take_num(number: u64) -> u64 { return number & 0xFFFFFFFF; }

        // Span queue and producers

        for _stress_idx in 0..NUM_STRESS_TESTS {

                            // Finished this one

                            num_done += 1;

                        }

                    }

                    let _exit_guard = can_exit_lock.lock().unwrap();

                })

            };

            // Set up producer threads

            let mut handles = Vec::with_capacity(NUM_PROD_THREADS);

            for prod_idx in 0..NUM_PROD_THREADS {

                let prod_handle = producers.pop().unwrap();

                let handle = std::thread::spawn(move || {

                    for number in 0..NUM_PER_THREAD as u64 {

                        prod_handle.push(base_value + number);

                    }

                });

                handles.push(handle);