public void DeleteLotsOfMinsTest()
{
const int size = 1000;
var random = new Random(3456);
var heap = ScheduledBinomialHeap <int> .Empty;
for (var i = 0; i < size; i++)
{
heap = ScheduledBinomialHeap <int> .Insert(random.Next(size), heap);
}
var last = 0;
var count = 0;
while (!ScheduledBinomialHeap <int> .IsEmpty(heap))
{
var next = ScheduledBinomialHeap <int> .FindMin(heap);
heap = ScheduledBinomialHeap <int> .DeleteMin(heap);
Assert.IsTrue(last <= next);
last = next;
count++;
}
Assert.AreEqual(size, count);
}
public void Test0()
{
var t = ScheduledBinomialHeap <string> .Empty;
var x1 = ScheduledBinomialHeap <string> .Insert("C", t);
Assert.AreEqual("[[C]]", DumpHeap(x1));
}
public void Test1()
{
var t = ScheduledBinomialHeap <string> .Empty;
var x1 = ScheduledBinomialHeap <string> .Insert("C", t);
var x2 = ScheduledBinomialHeap <string> .Insert("B", x1);
Assert.AreEqual("[[B: [C]]]", DumpHeap(x2));
}
public void EmptyTest()
{
var t = ScheduledBinomialHeap <string> .Empty;
Assert.IsTrue(ScheduledBinomialHeap <string> .IsEmpty(t));
var t1 = ScheduledBinomialHeap <string> .Insert("C", t);
Assert.IsFalse(ScheduledBinomialHeap <string> .IsEmpty(t1));
}
public void Test2()
{
const string words = "What's in a name? That which we call a rose by any other name would smell as sweet.";
var t = words.Split().Aggregate(ScheduledBinomialHeap <string> .Empty, (current, word) => ScheduledBinomialHeap <string> .Insert(word, current));
Assert.AreEqual("[[as: [sweet.]] -$- ]", DumpHeap(t));
var x = ScheduledBinomialHeap <string> .Merge(t, ScheduledBinomialHeap <string> .Empty);
Assert.AreEqual("[[as: [sweet.]][a: [a: [call: [That: [which]], [we]], [in: [What's]], [name?]], [name: [smell: [would]], [other]], [any: [by]], [rose]]]", DumpHeap(x));
}
public void MergeTest()
{
const string data1 = "What's in a name?";
var ts1 = data1.Split().Aggregate(ScheduledBinomialHeap <string> .Empty, (current, word) => ScheduledBinomialHeap <string> .Insert(word, current));
const string data2 = "That which we call a rose by any other name would smell as sweet";
var ts2 = data2.Split().Aggregate(ScheduledBinomialHeap <string> .Empty, (current, word) => ScheduledBinomialHeap <string> .Insert(word, current));
var t = ScheduledBinomialHeap <string> .Merge(ts1, ts2);
Assert.AreEqual("[[as: [sweet]][a: [a: [call: [That: [which]], [we]], [any: [by]], [rose]], [name: [smell: [would]], [other]], [in: [What's]], [name?]]]", DumpHeap(t));
}
private static string DumpHeap <T>(ScheduledBinomialHeap <T> .Heap heap) where T : IComparable <T>
{
var result = new StringBuilder();
result.Append("[");
if (heap.DigitStream != Stream <ScheduledBinomialHeap <T> .Digit> .DollarNil)
{
result.Append(DumpDigitStream(heap.DigitStream));
result.Append(", ");
result.Remove(result.Length - 2, 2);
}
result.Append("]");
return(result.ToString());
}
public void DeleteMinTest()
{
var t = ScheduledBinomialHeap <int> .Empty;
var t1 = ScheduledBinomialHeap <int> .Insert(5, t);
var t2 = ScheduledBinomialHeap <int> .Insert(3, t1);
var t3 = ScheduledBinomialHeap <int> .Insert(6, t2);
var t4 = ScheduledBinomialHeap <int> .DeleteMin(t3);
Assert.AreEqual("[[5: [6]]]", DumpHeap(t4));
Assert.AreEqual(5, ScheduledBinomialHeap <int> .FindMin(t4));
Assert.AreEqual(3, ScheduledBinomialHeap <int> .FindMin(t3));
}
public void DeleteLotsOfMinsTest2()
{
const int size = 1000;
var random = new Random(6435);
var heap = ScheduledBinomialHeap <int> .Empty;
var min = size;
for (var i = 0; i < size; i++)
{
var j = random.Next(size);
min = Math.Min(j, min);
heap = ScheduledBinomialHeap <int> .Insert(j, heap);
j = random.Next(size);
min = Math.Min(j, min);
heap = ScheduledBinomialHeap <int> .Insert(j, heap);
var k = ScheduledBinomialHeap <int> .FindMin(heap);
heap = ScheduledBinomialHeap <int> .DeleteMin(heap);
Assert.IsTrue(min <= k);
min = k;
}
for (var i = 0; i < size; i++)
{
var j = ScheduledBinomialHeap <int> .FindMin(heap);
heap = ScheduledBinomialHeap <int> .DeleteMin(heap);
Assert.IsTrue(min <= j);
min = j;
}
Assert.IsTrue(ScheduledBinomialHeap <int> .IsEmpty(heap));
}
private static string DumpTree <T>(ScheduledBinomialHeap <T> .Tree tree) where T : IComparable <T>
{
if (tree == null)
{
return(string.Empty);
}
var result = new StringBuilder();
result.Append("[");
result.Append(tree.Node);
if (tree.TreeList != List <ScheduledBinomialHeap <T> .Tree> .Empty)
{
result.Append(": ");
foreach (var node1 in tree.TreeList)
{
result.Append(DumpTree(node1));
result.Append(", ");
}
result.Remove(result.Length - 2, 2);
}
result.Append("]");
return(result.ToString());
}
