private void Initialize()
{
Indexer = new SparseIndex <TKey>();
LeafStorage = Library.CreateTreeNode <TKey, TValue>(m_header.TreeNodeType, 0);
Indexer.RootHasChanged += IndexerOnRootHasChanged;
Indexer.Initialize(Stream, m_header.BlockSize, GetNextNewNodeIndex, m_header.RootNodeLevel, m_header.RootNodeIndexAddress);
LeafStorage.Initialize(Stream, m_header.BlockSize, GetNextNewNodeIndex, Indexer);
}
public static void TestNode <TKey, TValue>(SortedTreeNodeBase <TKey, TValue> node, TreeNodeRandomizerBase <TKey, TValue> randomizer, int count)
where TKey : SnapTypeBase <TKey>, new()
where TValue : SnapTypeBase <TValue>, new()
{
int Max = count;
uint rootKey = 0;
byte rootLevel = 0;
uint nextKeyIndex = 2;
bool hasChanged = false;
Func <uint> getNextKey = () =>
{
nextKeyIndex++;
return(nextKeyIndex - 1);
};
StringBuilder sb = new StringBuilder();
using (BinaryStream bs = new BinaryStream())
{
const int pageSize = 512;
SparseIndex <TKey> sparse = new SparseIndex <TKey>();
sparse.Initialize(bs, pageSize, getNextKey, 0, 1);
node.Initialize(bs, pageSize, getNextKey, sparse);
node.CreateEmptyNode(1);
TKey key = new TKey();
TKey key2 = new TKey();
TValue value = new TValue();
TValue value2 = new TValue();
randomizer.Reset(Max);
for (int x = 0; x < Max; x++)
{
randomizer.Next();
//Add the next point
randomizer.GetRandom(x, key, value);
//node.WriteNodeData(sb);
if (!node.TryInsert(key, value))
{
throw new Exception();
}
//node.WriteNodeData(sb);
//File.WriteAllText("c:\\temp\\temp.log", sb.ToString());
//Check if all points exist
for (int y = 0; y <= x; y++)
{
randomizer.GetRandom(y, key, value);
if (!node.TryGet(key, value2))
{
throw new Exception();
}
if (!value.IsEqualTo(value2))
{
throw new Exception();
}
}
//Check if scanner works.
SortedTreeScannerBase <TKey, TValue> scanner = node.CreateTreeScanner();
scanner.SeekToStart();
for (int y = 0; y <= x; y++)
{
randomizer.GetInSequence(y, key, value);
if (!scanner.Read(key2, value2))
{
throw new Exception();
}
if (!key.IsEqualTo(key2))
{
throw new Exception();
}
if (!value.IsEqualTo(value2))
{
throw new Exception();
}
}
if (scanner.Read(key2, value2))
{
throw new Exception();
}
}
node = node;
}
}
internal static void TestSpeed <TKey, TValue>(SortedTreeNodeBase <TKey, TValue> nodeInitializer, TreeNodeRandomizerBase <TKey, TValue> randomizer, int count, int pageSize)
where TKey : SnapTypeBase <TKey>, new()
where TValue : SnapTypeBase <TValue>, new()
{
int Max = count;
uint nextKeyIndex = 2;
Func <uint> getNextKey = () =>
{
nextKeyIndex++;
return(nextKeyIndex - 1);
};
using (BinaryStream bs = new BinaryStream())
{
randomizer.Reset(Max);
for (int x = 0; x < Max; x++)
{
randomizer.Next();
}
TKey key = new TKey();
TValue value = new TValue();
SortedTreeNodeBase <TKey, TValue> node = null;
System.Console.WriteLine(StepTimer.Time(count, (sw) =>
{
nextKeyIndex = 2;
node = nodeInitializer.Clone(0);
SparseIndex <TKey> sparse = new SparseIndex <TKey>();
sparse.Initialize(bs, pageSize, getNextKey, 0, 1);
node.Initialize(bs, pageSize, getNextKey, sparse);
node.CreateEmptyNode(1);
sw.Start();
for (int x = 0; x < Max; x++)
{
//Add the next point
randomizer.GetRandom(x, key, value);
if (!node.TryInsert(key, value))
{
throw new Exception();
}
}
sw.Stop();
}));
System.Console.WriteLine(StepTimer.Time(count, () =>
{
for (int x = 0; x < Max; x++)
{
//Add the next point
randomizer.GetRandom(x, key, value);
if (!node.TryGet(key, value))
{
throw new Exception();
}
}
}));
System.Console.WriteLine(StepTimer.Time(count, () =>
{
SortedTreeScannerBase <TKey, TValue> scanner = node.CreateTreeScanner();
scanner.SeekToStart();
while (scanner.Read(key, value))
{
;
}
}));
node = node;
}
}