public static void SearchTest(SequentialRBTree <long, Data> rbTree, int searchOperations, int nodesMaxKeyValue)
{
Console.WriteLine("************* Search Test ***************");
Console.WriteLine();
Console.WriteLine($"We will perform {searchOperations} search operations");
Console.WriteLine();
// search test
var watch = new Stopwatch();
watch.Start();
var rand = new Random();
for (var i = 0; i < searchOperations; i++)
{
var target = 1 + (long)(rand.NextDouble() * nodesMaxKeyValue);
_ = rbTree.GetData(target);
}
watch.Stop();
Console.WriteLine($"Total time spent in search: {watch.ElapsedMilliseconds} ms");
Console.WriteLine();
Console.WriteLine();
}
public static void InsertTest(SequentialRBTree <long, Data> rbTree, int totalNodesToInsert, int nodesMaxKeyValue, bool verbose)
{
// generate input data
var rand = new Random();
var keys = new HashSet <long>();
for (var i = 0; i < totalNodesToInsert; i++)
{
long value;
while (true)
{
value = 1 + (long)(rand.NextDouble() * nodesMaxKeyValue);
if (!keys.Contains(value))
{
break;
}
}
keys.Add(value);
}
var values = keys.Select(i => new Tuple <long, Data>(i, new Data {
Value = i.ToString()
}));
if (verbose)
{
Console.WriteLine("************* Insertion Test ***************");
Console.WriteLine();
Console.WriteLine($"Total nodes to insert: {totalNodesToInsert}");
Console.WriteLine();
}
// starting inserts
var watch = new Stopwatch();
watch.Start();
foreach (var value in values)
{
rbTree.Add(value.Item1, value.Item2);
}
watch.Stop();
if (verbose)
{
Console.WriteLine($"Total time spent in insertion: {watch.ElapsedMilliseconds} ms");
Console.WriteLine();
Console.WriteLine($"Node count after insertion: {rbTree.Count()}");
Console.WriteLine();
Console.WriteLine($"Tree depth: {rbTree.MaxDepth()}");
Console.WriteLine();
Console.WriteLine();
}
return;
}
public static void DeleteTest(SequentialRBTree <long, Data> rbTree, int totalNodesToDelete, int nodesMaxKeyValue)
{
Console.WriteLine("************* Delete Test ***************");
Console.WriteLine();
Console.WriteLine($"We will perform {totalNodesToDelete} delete operations");
Console.WriteLine();
// generate valid deletable items
var count = 0;
var deleteItems = new HashSet <long>();
var rand = new Random();
while (true)
{
long target;
while (true)
{
target = 1 + (long)(rand.NextDouble() * nodesMaxKeyValue);
if (!deleteItems.Contains(target))
{
break;
}
}
var data = rbTree.GetData(target);
if (data != null)
{
deleteItems.Add(data.Item1);
count++;
}
if (count == totalNodesToDelete)
{
break;
}
}
// delete test
var watch = new Stopwatch();
watch.Start();
foreach (var key in deleteItems)
{
rbTree.Remove(key);
}
watch.Stop();
Console.WriteLine($"Total time spent in deletion: {watch.ElapsedMilliseconds} ms");
Console.WriteLine();
Console.WriteLine($"Node count after deletion: {rbTree.Count()}");
Console.WriteLine();
Console.WriteLine();
}
static void Main(string[] args)
{
// read command line parameters
const int totalNodesToInsert = 10000;
const int totalNodesToDelete = totalNodesToInsert;
const int totalNodesInTree = totalNodesToInsert * 4;
const int nodesMaxKeyValue = totalNodesToInsert * 10;
//const int searchOperations = 1000000;
var rbTree = new SequentialRBTree <long, Data>();
//start test
Console.WriteLine("*********** Starting Test **********");
Console.WriteLine();
Console.WriteLine();
//InsertTest(rbTree, totalNodesToInsert, nodesMaxKeyValue, true);
//SearchTest(rbTree, searchOperations, nodesMaxKeyValue);
//DeleteTest(rbTree, totalNodesToDelete, nodesMaxKeyValue);
InsertDeleteTest(rbTree, totalNodesInTree, totalNodesToInsert, totalNodesToDelete, nodesMaxKeyValue);
}
public static void InsertDeleteTest(SequentialRBTree <long, Data> rbTree, int totalNodesInTree,
int totalNodesToInsert, int totalNodesToDelete, int nodesMaxKeyValue)
{
Console.WriteLine("************* Create Tree ***************");
Console.WriteLine();
InsertTest(rbTree, totalNodesInTree, nodesMaxKeyValue, false);
Console.WriteLine($"Node count of tree: {(rbTree.Count())}");
Console.WriteLine();
Console.WriteLine($"Tree depth: {rbTree.MaxDepth()}");
Console.WriteLine();
Console.WriteLine();
// generate valid deletable items
var deleteCount = 0;
var deleteItems = new HashSet <long>();
var rand = new Random();
while (true)
{
long target;
while (true)
{
target = 1 + (long)(rand.NextDouble() * nodesMaxKeyValue);
if (!deleteItems.Contains(target))
{
break;
}
}
var data = rbTree.GetData(target);
if (data != null)
{
deleteItems.Add(data.Item1);
deleteCount++;
}
if (deleteCount == totalNodesToDelete)
{
break;
}
}
var keysToDelete = deleteItems.ToArray();
// generate valid insertable items
var insertCount = 0;
var insertItems = new HashSet <long>();
while (true)
{
long target;
while (true)
{
target = 1 + (long)(rand.NextDouble() * nodesMaxKeyValue);
if (!insertItems.Contains(target))
{
break;
}
}
var data = rbTree.GetData(target);
if (data == null)
{
insertItems.Add(target);
insertCount++;
}
if (insertCount == totalNodesToInsert)
{
break;
}
}
var values = insertItems.Select(i => new Tuple <long, Data>(i, new Data {
Value = i.ToString()
})).ToArray();
Console.WriteLine("************* Insert-Delete Test ***************");
Console.WriteLine();
Console.WriteLine($"Total nodes to insert: {totalNodesToInsert}");
Console.WriteLine($"Total nodes to delete: {totalNodesToDelete}");
Console.WriteLine();
// starting inserts
var watch = new Stopwatch();
watch.Start();
foreach (var value in values)
{
rbTree.Add(value.Item1, value.Item2);
}
foreach (var key in deleteItems)
{
rbTree.Remove(key);
}
watch.Stop();
Console.WriteLine($"Total time spent in simultaneous insertion & deletion: {watch.ElapsedMilliseconds} ms");
Console.WriteLine();
Console.WriteLine($"Node count after insertion: {(rbTree.Count())}");
Console.WriteLine();
Console.WriteLine($"Tree depth: {rbTree.MaxDepth()}");
Console.WriteLine();
Console.WriteLine();
}
