public void TestRandom() { SortedTreeNodeBase <HistorianKey, HistorianValue> tree = Library.CreateTreeNode <HistorianKey, HistorianValue>(HistorianFileEncodingDefinition.TypeGuid, 0); LeafNodeTest.TestNode(tree, new RandomTest(), 2000); }
public void BenchmarkRandom() { SortedTreeNodeBase <HistorianKey, HistorianValue> tree = Library.CreateTreeNode <HistorianKey, HistorianValue>(HistorianFileEncodingDefinition.TypeGuid, 0); LeafNodeTest.TestSpeed(tree, new RandomTest(), 500, 512); }
public void TestReverseSequently() { SortedTreeNodeBase <HistorianKey, HistorianValue> tree = Library.CreateTreeNode <HistorianKey, HistorianValue>(HistorianFileEncodingDefinition.TypeGuid, 0); LeafNodeTest.TestNode(tree, new ReverseSequentialTest(), 5000); }