public virtual void TestDeleteInsert100000()
{
NeoDatis.Btree.IBTree btree = GetBTree(3);
int size = 200000;
for (int i = 0; i < size; i++)
{
btree.Insert(i, "key " + i);
}
AssertEquals(size, btree.GetSize());
for (int i = 0; i < size; i++)
{
AssertEquals("key " + i, btree.Delete(i, "key " + i));
}
AssertEquals(0, btree.GetSize());
AssertEquals(1, btree.GetHeight());
AssertEquals(0, btree.GetRoot().GetNbKeys());
AssertEquals(0, btree.GetRoot().GetNbChildren());
for (int i = 0; i < size; i++)
{
btree.Insert(size + i, "key " + (i + size));
}
for (int i = 0; i < size; i++)
{
AssertEquals("key " + (i + size), btree.Delete(i + size, "key " + (i + size)));
}
AssertEquals(0, btree.GetSize());
AssertEquals(1, btree.GetHeight());
AssertEquals(0, btree.GetRoot().GetNbKeys());
AssertEquals(0, btree.GetRoot().GetNbChildren());
}
public virtual void TestDeleteStringKey()
{
NeoDatis.Btree.IBTree btree = GetBTree(3);
btree.Insert("key70", "70");
btree.Insert("key71", "71");
// println(new BTreeDisplay().build(btree));
AssertEquals("70", btree.GetRoot().GetKeyAndValueAt(0).GetValue());
AssertEquals("71", btree.GetRoot().GetKeyAndValueAt(1).GetValue());
}
public virtual void TestgetBiggestSmallest1()
{
NeoDatis.Btree.IBTree btree = GetBTree(3);
btree.Insert(1, "key 1");
btree.Insert(2, "key 2");
btree.Insert(3, "key 3");
btree.Insert(4, "key 4");
btree.Insert(5, "key 5");
AssertEquals(5, btree.GetSize());
AssertEquals("key 5", btree.GetBiggest(btree.GetRoot(), false).GetValue());
AssertEquals("key 1", btree.GetSmallest(btree.GetRoot(), false).GetValue());
}
public virtual void TestSplit()
{
NeoDatis.Btree.IBTree tree = GetBTree(2);
tree.Insert(10, "Key 10");
tree.Insert(100, "Key 100");
NeoDatis.Btree.IBTreeNodeOneValuePerKey c1 = GetBTreeNode(tree, "child 1");
NeoDatis.Btree.IBTreeNodeOneValuePerKey c2 = GetBTreeNode(tree, "child 2");
NeoDatis.Btree.IBTreeNodeOneValuePerKey node1 = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)tree.GetRoot();
node1.SetChildAt(c1, 0);
node1.SetChildAt(c2, 1);
node1.SetNbKeys(2);
node1.SetNbChildren(2);
c1.SetKeyAndValueAt(1, "Key 1", 0);
c1.SetKeyAndValueAt(2, "Key 2", 1);
c1.SetKeyAndValueAt(3, "Key 3", 2);
c1.SetNbKeys(3);
AssertEquals(0, c1.GetNbChildren());
tree.Split(node1, c1, 0);
AssertEquals(3, node1.GetNbKeys());
AssertEquals(3, node1.GetNbChildren());
AssertEquals(2, node1.GetKeyAndValueAt(0).GetKey());
AssertEquals(10, node1.GetKeyAndValueAt(1).GetKey());
AssertEquals(100, node1.GetKeyAndValueAt(2).GetKey());
NeoDatis.Btree.IBTreeNodeOneValuePerKey c1New = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)node1.GetChildAt(0, false);
AssertEquals(1, c1New.GetNbKeys());
AssertEquals(0, c1New.GetNbChildren());
AssertEquals(1, c1New.GetKeyAt(0));
AssertEquals(null, c1New.GetKeyAt(1));
AssertEquals(null, c1New.GetKeyAt(2));
AssertEquals(node1, c1New.GetParent());
NeoDatis.Btree.IBTreeNodeOneValuePerKey c1bis = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)node1.GetChildAt(1, false);
AssertEquals(1, c1bis.GetNbKeys());
AssertEquals(0, c1bis.GetNbChildren());
AssertEquals(3, c1bis.GetKeyAt(0));
AssertEquals(node1, c1bis.GetParent());
AssertEquals(null, c1bis.GetKeyAt(1));
AssertEquals(null, c1bis.GetKeyAt(2));
NeoDatis.Btree.IBTreeNodeOneValuePerKey c2New = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)node1.GetChildAt(2, false);
AssertEquals(c2, c2New);
}
public virtual void TestDeleteStringKey2()
{
NeoDatis.Btree.IBTree btree = GetBTree(3);
btree.Insert("key700", "700");
btree.Insert("key710", "710");
btree.Insert("key720", "720");
btree.Insert("key730", "730");
btree.Insert("key740", "740");
btree.Insert("key715", "715");
}
public virtual void TestDelete1()
{
NeoDatis.Btree.IBTree btree = GetBTree(10);
int size = 500000;
long t0 = NeoDatis.Tool.Wrappers.OdbTime.GetCurrentTimeInMs();
for (int i = 0; i < size; i++)
{
btree.Insert(i, "key " + i);
}
long t1 = NeoDatis.Tool.Wrappers.OdbTime.GetCurrentTimeInMs();
// println("insert time=" + (t1-t0));
AssertEquals(size, btree.GetSize());
AssertEquals("key 499999", btree.Delete(499999, "key 499999"));
}
public virtual void TestDelete3()
{
NeoDatis.Btree.IBTree btree = GetBTree(3);
int size = 10;
for (int i = 0; i < size; i++)
{
btree.Insert(i, "key " + i);
}
AssertEquals(size, btree.GetSize());
for (int i = 0; i < size; i++)
{
AssertEquals("key " + i, btree.Delete(i, "key " + i));
}
AssertEquals(0, btree.GetSize());
}
/// <exception cref="System.Exception"></exception>
private void TestDelete(int[] numbers)
{
NeoDatis.Btree.IBTree btree = GetBTree(2);
for (int i = 0; i < numbers.Length; i++)
{
btree.Insert(numbers[i], "v " + numbers[i]);
}
AssertEquals(numbers.Length, btree.GetSize());
for (int i = 0; i < numbers.Length; i++)
{
AssertEquals("v " + (i + 1), btree.Delete(i + 1, "v " + (i + 1)));
}
AssertEquals(0, btree.GetSize());
AssertEquals(1, btree.GetHeight());
AssertEquals(0, btree.GetRoot().GetNbKeys());
AssertEquals(0, btree.GetRoot().GetNbChildren());
}
public virtual void TestDelete1000_3()
{
NeoDatis.Btree.IBTree btree = GetBTree(3);
int size = 1000;
for (int i = 0; i < size; i++)
{
btree.Insert(i, "value " + i);
}
AssertEquals(size, btree.GetSize());
for (int i = size - 1; i >= 0; i--)
{
AssertEquals("value " + i, btree.Delete(i, "value " + i));
}
AssertEquals(0, btree.GetSize());
AssertEquals(1, btree.GetHeight());
AssertEquals(0, btree.GetRoot().GetNbKeys());
AssertEquals(0, btree.GetRoot().GetNbChildren());
}
public virtual void TestDelete26()
{
NeoDatis.Btree.IBTree tree = GetBTree(3);
tree.Insert("Z", "Z");
tree.Insert("Y", "Y");
tree.Insert("X", "X");
tree.Insert("V", "V");
tree.Insert("U", "U");
tree.Insert("T", "T");
tree.Insert("S", "S");
tree.Insert("R", "R");
tree.Insert("Q", "Q");
tree.Insert("P", "P");
tree.Insert("O", "O");
tree.Insert("N", "N");
tree.Insert("M", "M");
tree.Insert("L", "L");
tree.Insert("K", "K");
tree.Insert("J", "J");
tree.Insert("G", "G");
tree.Insert("F", "F");
tree.Insert("E", "E");
tree.Insert("D", "D");
tree.Insert("C", "C");
tree.Insert("B", "B");
tree.Insert("A", "A");
AssertEquals(23, tree.GetSize());
NeoDatis.Btree.IBTreeNodeOneValuePerKey child1 = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)tree.GetRoot().GetChildAt(0, false);
NeoDatis.Btree.IBTreeNodeOneValuePerKey child14 = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)child1.GetChildAt(3, false);
AssertNotNull(child14);
}
public virtual void TestDelete25()
{
NeoDatis.Btree.IBTree tree = GetBTree(3);
tree.Insert("A", "A");
tree.Insert("B", "B");
tree.Insert("C", "C");
tree.Insert("D", "D");
tree.Insert("E", "E");
tree.Insert("F", "F");
tree.Insert("G", "G");
tree.Insert("J", "J");
tree.Insert("K", "K");
tree.Insert("L", "L");
tree.Insert("M", "M");
tree.Insert("N", "N");
tree.Insert("O", "O");
tree.Insert("P", "P");
tree.Insert("Q", "Q");
tree.Insert("R", "R");
tree.Insert("S", "S");
tree.Insert("T", "T");
tree.Insert("U", "U");
tree.Insert("V", "V");
tree.Insert("X", "X");
tree.Insert("Y", "Y");
tree.Insert("Z", "Z");
}
public virtual void TestDelete27()
{
NeoDatis.Btree.IBTree tree = GetBTree(3);
tree.Insert("P", "P");
NeoDatis.Btree.IBTreeNodeOneValuePerKey PNode = (NeoDatis.Btree.IBTreeNodeOneValuePerKey
)tree.GetRoot();
NeoDatis.Btree.IBTreeNodeOneValuePerKey CGMNode = GetBTreeNode(tree, "cgm");
CGMNode.InsertKeyAndValue("C", "C");
CGMNode.InsertKeyAndValue("G", "G");
CGMNode.InsertKeyAndValue("M", "M");
NeoDatis.Btree.IBTreeNodeOneValuePerKey TXNode = GetBTreeNode(tree, "tx");
TXNode.InsertKeyAndValue("T", "T");
TXNode.InsertKeyAndValue("X", "X");
PNode.SetChildAt(CGMNode, 0);
PNode.SetChildAt(TXNode, 1);
PNode.SetNbChildren(2);
NeoDatis.Btree.IBTreeNodeOneValuePerKey ABNode = GetBTreeNode(tree, "ab");
ABNode.InsertKeyAndValue("A", "A");
ABNode.InsertKeyAndValue("B", "B");
NeoDatis.Btree.IBTreeNodeOneValuePerKey DEFode = GetBTreeNode(tree, "def");
DEFode.InsertKeyAndValue("D", "D");
DEFode.InsertKeyAndValue("E", "E");
DEFode.InsertKeyAndValue("F", "F");
NeoDatis.Btree.IBTreeNodeOneValuePerKey JKLNode = GetBTreeNode(tree, "jkl");
JKLNode.InsertKeyAndValue("J", "J");
JKLNode.InsertKeyAndValue("K", "K");
JKLNode.InsertKeyAndValue("L", "L");
NeoDatis.Btree.IBTreeNodeOneValuePerKey NONode = GetBTreeNode(tree, "no");
NONode.InsertKeyAndValue("N", "N");
NONode.InsertKeyAndValue("O", "O");
CGMNode.SetChildAt(ABNode, 0);
CGMNode.SetChildAt(DEFode, 1);
CGMNode.SetChildAt(JKLNode, 2);
CGMNode.SetChildAt(NONode, 3);
CGMNode.SetNbChildren(4);
NeoDatis.Btree.IBTreeNodeOneValuePerKey QRSNode = GetBTreeNode(tree, "qrs");
QRSNode.InsertKeyAndValue("Q", "Q");
QRSNode.InsertKeyAndValue("R", "R");
QRSNode.InsertKeyAndValue("S", "S");
NeoDatis.Btree.IBTreeNodeOneValuePerKey UVNode = GetBTreeNode(tree, "uv");
UVNode.InsertKeyAndValue("U", "U");
UVNode.InsertKeyAndValue("V", "V");
NeoDatis.Btree.IBTreeNodeOneValuePerKey YZNode = GetBTreeNode(tree, "yz");
YZNode.InsertKeyAndValue("Y", "Y");
YZNode.InsertKeyAndValue("Z", "Z");
TXNode.SetChildAt(QRSNode, 0);
TXNode.SetChildAt(UVNode, 1);
TXNode.SetChildAt(YZNode, 2);
TXNode.SetNbChildren(3);
string s1 = "h=1:[P]" + "h=2:[C,G,M][T,X]" + "h=3:[A,B][D,E,F][J,K,L][N,O][Q,R,S][U,V][Y,Z]";
// case 1
string s2AfterDeleteingF = "h=1:[P]" + "h=2:[C,G,M][T,X]" + "h=3:[A,B][D,E][J,K,L][N,O][Q,R,S][U,V][Y,Z]";
object F = tree.Delete("F", "F");
AssertEquals("F", F);
string s = new NeoDatis.Btree.Tool.BTreeDisplay().Build(tree.GetRoot(), 3, false)
.ToString();
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, " ", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "\n", string.Empty);
AssertEquals(s2AfterDeleteingF, s);
// case 2a
string s2AfterDeleteingM = "h=1:[P]" + "h=2:[C,G,L][T,X]" + "h=3:[A,B][D,E][J,K][N,O][Q,R,S][U,V][Y,Z]";
object M = tree.Delete("M", "M");
AssertEquals("M", M);
s = new NeoDatis.Btree.Tool.BTreeDisplay().Build(tree.GetRoot(), 3, false).ToString
();
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, " ", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "\n", string.Empty);
AssertEquals(s2AfterDeleteingM, s);
// case 2c
string s2AfterDeleteingG = "h=1:[P]" + "h=2:[C,L][T,X]" + "h=3:[A,B][D,E,J,K][N,O][Q,R,S][U,V][Y,Z]";
object G = tree.Delete("G", "G");
AssertEquals("G", G);
s = new NeoDatis.Btree.Tool.BTreeDisplay().Build(tree.GetRoot(), 3, false).ToString
();
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, " ", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "\n", string.Empty);
AssertEquals(s2AfterDeleteingG, s);
// case 3b
string s2AfterDeleteingD = "h=1:[C,L,P,T,X]" + "h=2:[A,B][E,J,K][N,O][Q,R,S][U,V][Y,Z]";
object D = tree.Delete("D", "D");
// assertEquals(2, tree.getHeight());
AssertEquals("D", D);
s = new NeoDatis.Btree.Tool.BTreeDisplay().Build(tree.GetRoot(), 3, false).ToString
();
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, " ", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "\n", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "h=3:", string.Empty);
AssertEquals(s2AfterDeleteingD, s);
// case 3a
string s2AfterDeleteingB = "h=1:[E,L,P,T,X]" + "h=2:[A,C][J,K][N,O][Q,R,S][U,V][Y,Z]";
object B = tree.Delete("B", "B");
AssertEquals("B", B);
s = new NeoDatis.Btree.Tool.BTreeDisplay().Build(tree.GetRoot(), 3, false).ToString
();
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, " ", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "\n", string.Empty);
s = NeoDatis.Tool.Wrappers.OdbString.ReplaceToken(s, "h=3:", string.Empty);
AssertEquals(s2AfterDeleteingB, s);
}
public virtual bool Add(object @object)
{
tree.Insert(size, @object);
size++;
return(true);
}
public void Add(E o)
{
tree.Insert(size, o);
size++;
}