public virtual void TestInsertWithOverflow()
{
// Tests that InsertWithOverflow discards the correct value,
// and the resulting PQ preserves its structure
int size = 4;
PriorityQueue <int?> pq = new IntegerQueue(size);
int?i1 = 2;
int?i2 = 3;
int?i3 = 1;
int?i4 = 5;
int?i5 = 7;
int?i6 = 1;
Assert.IsNull(pq.InsertWithOverflow(i1));
Assert.IsNull(pq.InsertWithOverflow(i2));
Assert.IsNull(pq.InsertWithOverflow(i3));
Assert.IsNull(pq.InsertWithOverflow(i4));
Assert.IsTrue(pq.InsertWithOverflow(i5) == i3); // i3 should have been dropped
Assert.IsTrue(pq.InsertWithOverflow(i6) == i6); // i6 should not have been inserted
Assert.AreEqual(size, pq.Count);
Assert.AreEqual((int?)2, pq.Top);
// LUCENENET SPECIFIC
pq.Pop();
Assert.AreEqual((int?)3, pq.Top);
pq.Pop();
Assert.AreEqual((int?)5, pq.Top);
pq.Pop();
Assert.AreEqual((int?)7, pq.Top);
}
public static void TestIntegrityAfterResize()
{
// Tests that after a resize, the queue keeps working fine
PriorityQueue <int?> pq = new IntegerQueue();
pq.Add(3);
pq.Add(-2);
pq.Add(1);
pq.Add(7);
pq.Add(5);
pq.Add(10);
pq.Add(1);
pq.Add(-10);
pq.Add(-100);
Assert.AreEqual(pq.Top(), -100);
pq.Add(-1000);
Assert.AreEqual(pq.Top(), -1000);
pq.Pop();
pq.Pop();
pq.Pop();
Assert.AreEqual(pq.Top(), -2);
pq.Add(0);
Assert.AreEqual(pq.Top(), -2);
for (int i = 0; i < 100; i++)
{
pq.Add(5);
}
Assert.AreEqual(pq.Top(), -2);
}
public static void TestPQ(int count, System.Random gen)
{
PriorityQueue pq = new IntegerQueue(count);
int sum = 0, sum2 = 0;
for (int i = 0; i < count; i++)
{
int next = gen.Next();
sum += next;
pq.Put((System.Object)next);
}
// Date end = new Date();
// System.out.print(((float)(end.getTime()-start.getTime()) / count) * 1000);
// System.out.println(" microseconds/put");
// start = new Date();
int last = System.Int32.MinValue;
for (int i = 0; i < count; i++)
{
System.Int32 next = (System.Int32)pq.Pop();
Assert.IsTrue(next >= last);
last = next;
sum2 += last;
}
Assert.AreEqual(sum, sum2);
// end = new Date();
// System.out.print(((float)(end.getTime()-start.getTime()) / count) * 1000);
// System.out.println(" microseconds/pop");
}
public static void TestPQ(int count, Random gen)
{
PriorityQueue <int?> pq = new IntegerQueue(count);
int sum = 0, sum2 = 0;
for (int i = 0; i < count; i++)
{
int next = gen.Next();
sum += next;
pq.Add(next);
}
// Date end = new Date();
// System.out.print(((float)(end.getTime()-start.getTime()) / count) * 1000);
// System.out.println(" microseconds/put");
// start = new Date();
int last = int.MinValue;
for (int i = 0; i < count; i++)
{
var next = pq.Pop();
assertTrue(next.Value >= last);
last = next.Value;
sum2 += last;
}
assertEquals(sum, sum2);
// end = new Date();
// System.out.print(((float)(end.getTime()-start.getTime()) / count) * 1000);
// System.out.println(" microseconds/pop");
}
public static void TestPQ(int count)
{
PriorityQueue pq = new IntegerQueue(count);
System.Random gen = new System.Random();
int sum = 0, sum2 = 0;
for (int i = 0; i < count; i++)
{
int next = gen.Next();
sum += next;
pq.Put((System.Object) next);
}
// Date end = new Date();
// System.out.print(((float)(end.getTime()-start.getTime()) / count) * 1000);
// System.out.println(" microseconds/put");
// start = new Date();
int last = System.Int32.MinValue;
for (int i = 0; i < count; i++)
{
System.Int32 next = (System.Int32) pq.Pop();
Assert.IsTrue(next >= last);
last = next;
sum2 += last;
}
Assert.AreEqual(sum, sum2);
// end = new Date();
// System.out.print(((float)(end.getTime()-start.getTime()) / count) * 1000);
// System.out.println(" microseconds/pop");
}
public static void TestStress()
{
int atLeast = 1000000;
int maxSize = AtLeast(atLeast);
PriorityQueue <int?> pq = new IntegerQueue(maxSize);
// Add a lot of elements
for (int i = 0; i < maxSize; i++)
{
pq.Add(Random.Next());
}
// Pop some of them
while (pq.Count > atLeast / 2)
{
pq.Pop();
}
// Add some more
while (pq.Count < (atLeast * 3) / 4)
{
pq.Add(Random.Next());
}
PopAndTestElements(pq);
Assert.AreEqual(pq.Count, 0);
// We fill it again
for (int i = 0; 2 * i < maxSize; i++)
{
pq.Add(Random.Next());
}
Assert.AreEqual(pq.Count, (maxSize + 1) / 2);
pq.Clear();
Assert.AreEqual(pq.Count, 0);
// One last time
for (int i = 0; 2 * i < maxSize; i++)
{
pq.Add(Random.Next());
}
PopAndTestElements(pq);
Assert.AreEqual(pq.Count, 0);
}
public static void TestPop()
{
int maxSize = 10;
PriorityQueue <int?> pq = new IntegerQueue(maxSize);
// Add one element and pop it
pq.Add(7);
pq.Pop();
Assert.AreEqual(pq.Count, 0);
// Add a bunch of elements, pop them all
pq.Add(1);
pq.Add(20);
pq.Add(1);
pq.Add(15);
pq.Add(4);
pq.Add(12);
pq.Add(1000);
pq.Add(-3);
pq.Pop();
Assert.AreEqual(pq.Count, 7);
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
Assert.AreEqual(pq.Count, 0);
// Interleaved adds and pops
pq.Add(1);
pq.Add(20);
pq.Pop();
Assert.AreEqual(pq.Count, 1);
pq.Add(1);
pq.Add(15);
pq.Add(4);
pq.Pop();
pq.Pop();
Assert.AreEqual(pq.Count, 2);
pq.Add(12);
pq.Add(1000);
pq.Add(-3);
pq.Pop();
pq.Pop();
Assert.AreEqual(pq.Count, 3);
// Pop an empty PQ
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
pq.Pop();
}