public void CheckIfNodeIsInvalidatedAfterClearingAndAfterRemoval()
{
var tree = new SplayTreeMap <int, int>();
tree.Add(3, 3);
tree.Add(1, 1);
tree.Add(2, 2);
// Tree looks like this:
// 2
// / \
// 1 3
var node1 = tree.Root.Left;
var node2 = tree.Root;
var node3 = tree.Root.Right;
tree.Remove(2);
if (node2.Left != null || node2.Right != null)
{
Assert.Fail("2");
}
tree.Remove(3);
if (node3.Left != null || node3.Right != null)
{
Assert.Fail("3");
}
tree.Remove(1);
if (node1.Left != null || node1.Right != null)
{
Assert.Fail("1");
}
tree.Add(3, 3);
tree.Add(1, 1);
tree.Add(2, 2);
node1 = tree.Root.Left;
node2 = tree.Root;
node3 = tree.Root.Right;
tree.Clear();
Assert.IsTrue(node1.Left == null && node1.Right == null &&
node2.Left == null && node2.Right == null &&
node3.Left == null && node3.Right == null &&
tree.Root == null &&
tree.Count == 0);
}
public void RemoveAllExceptOne()
{
var tree = new SplayTreeMap <int, int>();
int elementsCount = 10000;
//To make it more balanced
tree.Add(50, 50);
tree.Add(75, 75);
tree.Add(25, 25);
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
bool removedEverything = true;
for (int i = 0; i < elementsCount - 1; i++)
{
if (!tree.Remove(i))
{
removedEverything = false;
}
}
Assert.IsTrue(tree.Count == 1 &&
removedEverything &&
tree.Root.Value == elementsCount - 1);
}
public void UpdatingElementsWithIndexerUsingTryGetValueMethodToGetValue()
{
BinarySearchTreeMap <int, int> tree = new SplayTreeMap <int, int>();
int elementsCount = 10000;
//To make it more balanced
tree[50] = 50;
tree[75] = 75;
tree[25] = 25;
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
bool removedEverything = true;
//Removing every second number
for (int i = 0; i < elementsCount; i += 2)
{
if (!tree.Remove(i))
{
removedEverything = false;
}
}
// Make all values negative
for (int i = 0; i < elementsCount; i++)
{
int value;
if (tree.TryGetValue(i, out value))
{
if (tree.Root.Key != i)
{
Assert.Fail();
}
if (tree.Root.Value != value)
{
Assert.Fail();
}
tree[value] = -value;
if (tree.Root.Key != i)
{
Assert.Fail();
}
if (tree.Root.Value != -value)
{
Assert.Fail();
}
}
}
int last = -1;
int count = 0;
bool elementsAreSorted = true;
foreach (var item in tree)
{
if (item.Value > 0)
{
Assert.Fail();
}
if (last > item.Key)
{
elementsAreSorted = false;
}
last = item.Key;
count++;
}
Trace.WriteLine(tree.Count);
Assert.IsTrue(tree.Count == count &&
elementsAreSorted &&
removedEverything);
}
public void SortedElementsAfterAddingAndRemoving()
{
var tree = new SplayTreeMap <int, int>();
int elementsCount = 10000;
//To make it more balanced
tree.Add(50, 50);
tree.Add(75, 75);
tree.Add(25, 25);
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
bool removedEverything = true;
//Removing every second number
for (int i = 0; i < elementsCount; i += 2)
{
if (!tree.Remove(i))
{
removedEverything = false;
}
}
int last = -1;
int count = 0;
bool elementsAreSorted = true;
foreach (var item in tree)
{
if (last > item.Key)
{
elementsAreSorted = false;
}
last = item.Key;
count++;
}
Trace.WriteLine(tree.Count);
Trace.WriteLine(count);
Trace.WriteLine(removedEverything);
Trace.WriteLine(elementsAreSorted);
Assert.IsTrue(tree.Count == count &&
elementsAreSorted &&
removedEverything);
}
public void AddingAfterRemovingAllElements()
{
var tree = new SplayTreeMap <int, int>();
int elementsCount = 10000;
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
if (tree.Count != elementsCount)
{
Assert.Fail();
}
//Removing every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
tree.Remove(el);
el += i;
}
}
if (tree.Count != 0)
{
Assert.Fail();
}
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
int last = -1;
int count = 0;
bool elementsAreSorted = true;
foreach (var item in tree)
{
if (last > item.Key)
{
elementsAreSorted = false;
}
last = item.Key;
count++;
}
Assert.IsTrue(tree.Count == elementsCount &&
elementsAreSorted &&
count == elementsCount);
}
public void CheckIfTreeIsSplayedAfterRemoval()
{
var tree = new SplayTreeMap <int, int>();
int elementsCount = 10000;
//To make it more balanced
tree.Add(50, 50);
tree.Add(75, 75);
tree.Add(25, 25);
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
bool removedEverything = true;
for (int i = 0; i < elementsCount - 1; i++)
{
// Get parent of node for removal. That node have to be splayed
SplayTreeMapNode <int, int> curNode = tree.Root;
SplayTreeMapNode <int, int> lastNode = null;
while (curNode.Value != i)
{
var cmp = i.CompareTo(curNode.Value);
if (cmp == 0)
{
break;
}
lastNode = curNode;
if (cmp > 0)
{
curNode = curNode.Right;
}
else
{
curNode = curNode.Left;
}
}
if (!tree.Remove(i))
{
removedEverything = false;
}
else if (lastNode != null)
{
Assert.IsTrue(tree.Root.Key == lastNode.Key &&
tree.Root.Value == lastNode.Value);
}
}
Assert.IsTrue(tree.Count == 1 &&
removedEverything &&
tree.Root.Value == elementsCount - 1);
}
public void RemoveRootEveryTimeUntilTreeElementsAreHalfed()
{
var tree = new SplayTreeMap <int, int>();
int elementsCount = 10000;
//To make it more balanced
tree.Add(50, 50);
tree.Add(75, 75);
tree.Add(25, 25);
//Adding every seventh number, then every fifth number,
//every third and at last all numbers
for (int i = 7; i > 0; i -= 2)
{
int el = 0;
while (el < elementsCount)
{
if (!tree.ContainsKey(el))
{
tree.Add(el, el);
if (tree.Root.Key != el)
{
Assert.Fail();
}
}
else if (tree.Root.Key != el)
{
Assert.Fail();
}
el += i;
}
}
bool removedEverything = true;
while (tree.Count > elementsCount / 2)
{
if (!tree.Remove(tree.Root.Value))
{
removedEverything = false;
}
}
int last = -1;
int count = 0;
bool elementsAreSorted = true;
foreach (var item in tree)
{
if (last > item.Key)
{
elementsAreSorted = false;
}
last = item.Key;
count++;
}
Assert.IsTrue(tree.Count == count &&
elementsAreSorted &&
count == elementsCount / 2 &&
removedEverything);
}