public static void Run(int range, bool trace)
{
BinaryTable table = new BinaryTable(null, null);
bool[,] bitMap = new bool[range, range];
CheckTable(table, bitMap, range);
// Random random = new Random(0);
// Inserting until the table is full
for (int i = 0; i < range * range; i++)
{
uint surr1 = (uint)random.Next(range);
uint surr2 = (uint)random.Next(range);
while (bitMap[surr1, surr2])
{
surr2 = (surr2 + 1) % (uint)range;
if (surr2 == 0)
{
surr1 = (surr1 + 1) % (uint)range;
}
}
if (trace)
{
Console.WriteLine("Inserting: ({0,2}, {1,2})", surr1, surr2);
}
table.Insert(surr1, surr2);
bitMap[surr1, surr2] = true;
CheckTable(table, bitMap, range);
}
// Deleting until the table is empty
for (int i = 0; i < range * range; i++)
{
uint surr1 = (uint)random.Next(range);
uint surr2 = (uint)random.Next(range);
while (!bitMap[surr1, surr2])
{
surr2 = (surr2 + 1) % (uint)range;
if (surr2 == 0)
{
surr1 = (surr1 + 1) % (uint)range;
}
}
if (trace)
{
Console.WriteLine("Deleting: ({0}, {1})", surr1, surr2);
}
table.Delete(surr1, surr2);
bitMap[surr1, surr2] = false;
CheckTable(table, bitMap, range);
}
}
static void CheckTable(BinaryTable table, bool[,] bitMap, int size)
{
table.Check();
for (int i = 0; i < size; i++)
{
for (int j = 0; j < size; j++)
{
if (table.Contains(i, j) != bitMap[i, j])
{
Console.Error.WriteLine("ERROR (1)!\n");
PrintDiffs(table, bitMap, size);
//throw new Exception();
Environment.Exit(1);
}
}
}
for (uint i = 0; i < size; i++)
{
List <uint> list = new List <uint>();
for (uint j = 0; j < size; j++)
{
if (bitMap[i, j])
{
list.Add(j);
}
}
uint[] expValues = list.ToArray();
if (table.ContainsField1(i) != (expValues.Length > 0))
{
Console.Error.WriteLine("ERROR (2)!\n");
for (int k = 0; k < expValues.Length; k++)
{
Console.Error.Write("{0} ", expValues[k]);
}
Console.Error.WriteLine();
Console.Error.WriteLine("{0}", table.ContainsField1(i));
Environment.Exit(1);
}
uint[] actualValues = table.LookupByCol1(i);
Array.Sort(actualValues);
if (!Eq(actualValues, expValues))
{
Console.Error.WriteLine("ERROR (3)!\n");
Environment.Exit(1);
}
list = new List <uint>();
BinaryTable.Iter it = table.GetIter1(i);
while (!it.Done())
{
list.Add(it.GetField2());
it.Next();
}
actualValues = list.ToArray();
Array.Sort(actualValues);
if (!Eq(actualValues, expValues))
{
Console.Error.WriteLine("ERROR (4)!\n");
Environment.Exit(1);
}
}
for (uint j = 0; j < size; j++)
{
List <uint> list = new List <uint>();
for (uint i = 0; i < size; i++)
{
if (bitMap[i, j])
{
list.Add(i);
}
}
uint[] expValues = list.ToArray();
if (table.ContainsField2(j) != (expValues.Length > 0))
{
Console.Error.WriteLine("ERROR (5)!\n");
Environment.Exit(1);
}
uint[] actualValues = table.LookupByCol2(j);
Array.Sort(actualValues);
if (!Eq(actualValues, expValues))
{
Console.Error.WriteLine("ERROR (6)!\n");
Environment.Exit(1);
}
list = new List <uint>();
BinaryTable.Iter it = table.GetIter2(j);
while (!it.Done())
{
list.Add(it.GetField1());
it.Next();
}
actualValues = list.ToArray();
Array.Sort(actualValues);
if (!Eq(actualValues, expValues))
{
Console.Error.WriteLine("ERROR (4)!\n");
Environment.Exit(1);
}
}
}
public BinaryTableUpdater(BinaryTable table, ValueStoreUpdater store1, ValueStoreUpdater store2)
{
this.table = table;
this.store1 = store1;
this.store2 = store2;
}