//Demonstration that this queue isn't MPSC public void ConcurrencyTest2() { var q = UnsafeSPSCQueue.Allocate <int>(1600000); int count = 1000000; Thread writer = new Thread(() => { for (int i = 0; i < count / 2; i++) { UnsafeSPSCQueue.Enqueue(q, i); } }); Thread writer2 = new Thread(() => { for (int i = 0; i < count / 2; i++) { UnsafeSPSCQueue.Enqueue(q, i); } }); writer.Start(); writer2.Start(); writer.Join(); writer2.Join(); Assert.AreNotEqual(count, UnsafeSPSCQueue.GetCount(q)); UnsafeSPSCQueue.Free(q); }
private static void SplitQueue(UnsafeSPSCQueue *q) { //Wrap tail back to 0 for (int i = 0; i < 5; i++) { UnsafeSPSCQueue.Enqueue(q, 111); } //First half for (int i = 0; i < 5; i++) { UnsafeSPSCQueue.Enqueue(q, i); } //Move head by 5 for (int i = 0; i < 5; i++) { UnsafeSPSCQueue.Dequeue <int>(q); } //Second half (head and tail are now both 5) for (int i = 5; i < 10; i++) { UnsafeSPSCQueue.Enqueue(q, i); } //Circular buffer now "ends" in the middle of the underlying array }
public void InvalidTypeTest() { var q = UnsafeSPSCQueue.Allocate <int>(10); Assert.Catch <AssertException>(() => { UnsafeSPSCQueue.Enqueue <float>(q, 162); }); UnsafeSPSCQueue.Free(q); }
public void DequeueTest() { var q = UnsafeSPSCQueue.Allocate <int>(10); for (int i = 0; i < 10; i++) { UnsafeSPSCQueue.Enqueue(q, i * i); } for (int i = 0; i < 10; i++) { int num = UnsafeSPSCQueue.Dequeue <int>(q); Assert.AreEqual(i * i, num); } UnsafeSPSCQueue.Free(q); }
public void ExpandTest() { var q = UnsafeSPSCQueue.Allocate <int>(16); SplitQueue(q); //Fill buffer to capacity. for (int i = 0; i < 6; i++) { UnsafeSPSCQueue.Enqueue(q, 999); } //Buffer is full, can no longer insert. Assert.IsFalse(UnsafeSPSCQueue.TryEnqueue(q, 10)); UnsafeSPSCQueue.Free(q); }
public void PeekTest() { var q = UnsafeSPSCQueue.Allocate <int>(10); for (int i = 0; i < 10; i++) { UnsafeSPSCQueue.Enqueue(q, (int)Math.Pow(i + 2, 2)); } for (int i = 0; i < 10; i++) { Assert.AreEqual(4, UnsafeSPSCQueue.Peek <int>(q)); } //Verify no items are dequeued Assert.AreEqual(10, UnsafeSPSCQueue.GetCount(q)); UnsafeSPSCQueue.Free(q); }
public void EnqueueTest() { var q = UnsafeSPSCQueue.Allocate <int>(10); for (int i = 0; i < 10; i++) { UnsafeSPSCQueue.Enqueue(q, i * i); } Assert.AreEqual(10, UnsafeSPSCQueue.GetCount(q)); Assert.AreEqual(10, UnsafeSPSCQueue.GetCapacity(q)); UnsafeSPSCQueue.Clear(q); Assert.AreEqual(0, UnsafeSPSCQueue.GetCount(q)); Assert.AreEqual(10, UnsafeSPSCQueue.GetCapacity(q)); UnsafeSPSCQueue.Free(q); }
// Demonstration that this queue is SPSC public void ConcurrencyTest() { var q = UnsafeSPSCQueue.Allocate <int>(16); int count = 10000; Thread reader = new Thread(() => { for (int i = 0; i < count; i++) { Assert.AreEqual(i, UnsafeSPSCQueue.Dequeue <int>(q)); } }); reader.Start(); for (int i = 0; i < count; i++) { UnsafeSPSCQueue.Enqueue(q, i); } reader.Join(); UnsafeSPSCQueue.Free(q); }
public void Enqueue(T item) { UnsafeSPSCQueue.Enqueue <T>(m_inner, item); }