/mcs/class/corlib/Test/System.Collections.Concurrent/ConcurrentQueueTests.cs
C# | 196 lines | 104 code | 16 blank | 76 comment | 1 complexity | 17bce6f5895f33c1ef0a26105f1d6c6b MD5 | raw file
Possible License(s): LGPL-2.0, MPL-2.0-no-copyleft-exception, CC-BY-SA-3.0, GPL-2.0, LGPL-2.1
- #if NET_4_0
- // ConcurrentQueueTest.cs
- //
- // Copyright (c) 2008 Jérémie "Garuma" Laval
- //
- // Permission is hereby granted, free of charge, to any person obtaining a copy
- // of this software and associated documentation files (the "Software"), to deal
- // in the Software without restriction, including without limitation the rights
- // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- // copies of the Software, and to permit persons to whom the Software is
- // furnished to do so, subject to the following conditions:
- //
- // The above copyright notice and this permission notice shall be included in
- // all copies or substantial portions of the Software.
- //
- // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
- // THE SOFTWARE.
- //
- //
- using System;
- using System.Linq;
- using System.Threading;
- using System.Collections.Generic;
- using System.Collections.Concurrent;
- using NUnit.Framework;
- namespace ParallelFxTests
- {
-
-
- [TestFixture()]
- public class ConcurrentQueueTests
- {
- ConcurrentQueue<int> queue;
-
- [SetUpAttribute]
- public void Setup()
- {
- queue = new ConcurrentQueue<int>();
- for (int i = 0; i < 10; i++) {
- queue.Enqueue(i);
- }
- }
-
- [Test]
- public void StressEnqueueTestCase ()
- {
- /*ParallelTestHelper.Repeat (delegate {
- queue = new ConcurrentQueue<int> ();
- int amount = -1;
- const int count = 10;
- const int threads = 5;
-
- ParallelTestHelper.ParallelStressTest (queue, (q) => {
- int t = Interlocked.Increment (ref amount);
- for (int i = 0; i < count; i++)
- queue.Enqueue (t);
- }, threads);
-
- Assert.AreEqual (threads * count, queue.Count, "#-1");
- int[] values = new int[threads];
- int temp;
- while (queue.TryDequeue (out temp)) {
- values[temp]++;
- }
-
- for (int i = 0; i < threads; i++)
- Assert.AreEqual (count, values[i], "#" + i);
- });*/
-
- CollectionStressTestHelper.AddStressTest (new ConcurrentQueue<int> ());
- }
-
- [Test]
- public void StressDequeueTestCase ()
- {
- /*ParallelTestHelper.Repeat (delegate {
- queue = new ConcurrentQueue<int> ();
- const int count = 10;
- const int threads = 5;
- const int delta = 5;
-
- for (int i = 0; i < (count + delta) * threads; i++)
- queue.Enqueue (i);
-
- bool state = true;
-
- ParallelTestHelper.ParallelStressTest (queue, (q) => {
- int t;
- for (int i = 0; i < count; i++)
- state &= queue.TryDequeue (out t);
- }, threads);
-
- Assert.IsTrue (state, "#1");
- Assert.AreEqual (delta * threads, queue.Count, "#2");
-
- string actual = string.Empty;
- int temp;
- while (queue.TryDequeue (out temp)) {
- actual += temp;
- }
- string expected = Enumerable.Range (count * threads, delta * threads)
- .Aggregate (string.Empty, (acc, v) => acc + v);
-
- Assert.AreEqual (expected, actual, "#3");
- });*/
-
- CollectionStressTestHelper.RemoveStressTest (new ConcurrentQueue<int> (), CheckOrderingType.InOrder);
- }
-
- [Test]
- public void CountTestCase()
- {
- Assert.AreEqual(10, queue.Count, "#1");
- int value;
- queue.TryPeek(out value);
- queue.TryDequeue(out value);
- queue.TryDequeue(out value);
- Assert.AreEqual(8, queue.Count, "#2");
- }
-
- //[Ignore]
- [Test]
- public void EnumerateTestCase()
- {
- string s = string.Empty;
- foreach (int i in queue) {
- s += i;
- }
- Assert.AreEqual("0123456789", s, "#1 : " + s);
- }
-
- [Test()]
- public void TryPeekTestCase()
- {
- int value;
- queue.TryPeek(out value);
- Assert.AreEqual(0, value, "#1 : " + value);
- queue.TryDequeue(out value);
- Assert.AreEqual(0, value, "#2 : " + value);
- queue.TryDequeue(out value);
- Assert.AreEqual(1, value, "#3 : " + value);
- queue.TryPeek(out value);
- Assert.AreEqual(2, value, "#4 : " + value);
- queue.TryPeek(out value);
- Assert.AreEqual(2, value, "#5 : " + value);
- }
-
- [Test()]
- public void TryDequeueTestCase()
- {
- int value;
- queue.TryPeek(out value);
- Assert.AreEqual(0, value, "#1");
- Assert.IsTrue(queue.TryDequeue(out value), "#2");
- Assert.IsTrue(queue.TryDequeue(out value), "#3");
- Assert.AreEqual(1, value, "#4");
- }
-
- [Test()]
- public void TryDequeueEmptyTestCase()
- {
- int value;
- queue = new ConcurrentQueue<int> ();
- queue.Enqueue(1);
- Assert.IsTrue(queue.TryDequeue(out value), "#1");
- Assert.IsFalse(queue.TryDequeue(out value), "#2");
- Assert.IsTrue(queue.IsEmpty, "#3");
- }
-
- [Test]
- public void ToArrayTest()
- {
- int[] array = queue.ToArray();
- string s = string.Empty;
- foreach (int i in array) {
- s += i;
- }
- Assert.AreEqual("0123456789", s, "#1 : " + s);
- queue.CopyTo(array, 0);
- s = string.Empty;
- foreach (int i in array) {
- s += i;
- }
- Assert.AreEqual("0123456789", s, "#2 : " + s);
- }
- }
- }
- #endif