#region CPL License
/*
Nuclex Framework
Copyright (C) 2002-2009 Nuclex Development Labs
This library is free software; you can redistribute it and/or
modify it under the terms of the IBM Common Public License as
published by the IBM Corporation; either version 1.0 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
IBM Common Public License for more details.
You should have received a copy of the IBM Common Public
License along with this library
*/
#endregion
using System;
using System.Collections.Generic;
#if UNITTEST
using NUnit.Framework;
namespace Nuclex.Support.Collections {
/// Unit Test for the priority queue class
[TestFixture]
public class PriorityQueueTest {
#region class FloatComparer
/// Comparer for two floating point values
private class FloatComparer : IComparer {
/// The default instance of this comparer
public static readonly FloatComparer Default = new FloatComparer();
/// Compares two floating points against each other
/// First float to compare
/// Second float to compare
/// The relationship of the two floats to each other
public int Compare(float left, float right) {
return Math.Sign(left - right);
}
}
#endregion // class FloatComparer
/// Tests to ensure the count property is properly updated
[Test]
public void TestCount() {
PriorityQueue testQueue = new PriorityQueue(FloatComparer.Default);
Assert.AreEqual(0, testQueue.Count);
testQueue.Enqueue(12.34f);
Assert.AreEqual(1, testQueue.Count);
testQueue.Enqueue(56.78f);
Assert.AreEqual(2, testQueue.Count);
testQueue.Dequeue();
Assert.AreEqual(1, testQueue.Count);
testQueue.Enqueue(9.0f);
Assert.AreEqual(2, testQueue.Count);
testQueue.Clear();
Assert.AreEqual(0, testQueue.Count);
}
/// Tests to ensure that the priority collection actually sorts items
[Test]
public void TestOrdering() {
PriorityQueue testQueue = new PriorityQueue(FloatComparer.Default);
testQueue.Enqueue(1.0f);
testQueue.Enqueue(9.0f);
testQueue.Enqueue(2.0f);
testQueue.Enqueue(8.0f);
testQueue.Enqueue(3.0f);
testQueue.Enqueue(7.0f);
testQueue.Enqueue(4.0f);
testQueue.Enqueue(6.0f);
testQueue.Enqueue(5.0f);
Assert.AreEqual(9.0f, testQueue.Dequeue());
Assert.AreEqual(8.0f, testQueue.Dequeue());
Assert.AreEqual(7.0f, testQueue.Dequeue());
Assert.AreEqual(6.0f, testQueue.Dequeue());
Assert.AreEqual(5.0f, testQueue.Dequeue());
Assert.AreEqual(4.0f, testQueue.Dequeue());
Assert.AreEqual(3.0f, testQueue.Dequeue());
Assert.AreEqual(2.0f, testQueue.Dequeue());
Assert.AreEqual(1.0f, testQueue.Dequeue());
}
#if DEBUG
///
/// Tests whether the priority queue's enumerators are invalidated when the queue's
/// contents are modified
///
[Test, ExpectedException(typeof(InvalidOperationException))]
public void TestEnumeratorInvalidationOnModify() {
PriorityQueue testQueue = new PriorityQueue();
IEnumerator testQueueEnumerator = testQueue.GetEnumerator();
testQueue.Enqueue(123);
testQueueEnumerator.MoveNext();
}
#endif
///
/// Verifies that an exception is thrown when Peek() is called on an empty queue
///
[Test, ExpectedException(typeof(InvalidOperationException))]
public void TestPeekEmptyQueue() {
PriorityQueue testQueue = new PriorityQueue();
testQueue.Peek();
}
///
/// Verifies that an exception is thrown when Dequeue() is called on an empty queue
///
[Test, ExpectedException(typeof(InvalidOperationException))]
public void TestDequeueEmptyQueue() {
PriorityQueue testQueue = new PriorityQueue();
testQueue.Dequeue();
}
///
/// Verifies that the priority queue can handle large amounts of data
///
[Test]
public void TestLargeQueue() {
PriorityQueue testQueue = new PriorityQueue();
List testList = new List();
for(int index = 0; index < 1000; ++index) {
testQueue.Enqueue(index * 2);
testList.Add(index * 2);
}
CollectionAssert.AreEquivalent(testList, testQueue);
}
}
} // namespace Nuclex.Support.Collections
#endif // UNITTEST