/// <exception cref="System.Exception"></exception>
private BTree CycleIntKeys(BTree btree)
{
AddKeys(btree);
ExpectKeys(btree, _sortedKeys);
btree.Commit(Trans());
ExpectKeys(btree, _sortedKeys);
RemoveKeys(btree);
ExpectKeys(btree, _keysOnRemoval);
btree.Rollback(Trans());
ExpectKeys(btree, _sortedKeys);
int id = btree.GetID();
Reopen();
btree = BTreeAssert.CreateIntKeyBTree(Container(), id, BtreeNodeSize);
ExpectKeys(btree, _sortedKeys);
RemoveKeys(btree);
ExpectKeys(btree, _keysOnRemoval);
btree.Commit(Trans());
ExpectKeys(btree, _keysOnRemoval);
// remove all but 1
for (int i = 1; i < _keysOnRemoval.Length; i++)
{
btree.Remove(Trans(), _keysOnRemoval[i]);
}
ExpectKeys(btree, _one);
btree.Commit(Trans());
ExpectKeys(btree, _one);
btree.Remove(Trans(), 1);
btree.Rollback(Trans());
ExpectKeys(btree, _one);
btree.Remove(Trans(), 1);
btree.Commit(Trans());
ExpectKeys(btree, _none);
return btree;
}
/// <exception cref="System.Exception"></exception>
private BTree CycleIntKeys(BTree btree, int[] values)
{
for (int i = 0; i < values.Length; i++)
{
btree.Add(Trans(), values[i]);
}
ExpectKeysSearch(Trans(), btree, values);
btree.Commit(Trans());
int id = btree.GetID();
Container().Commit(Trans());
Reopen();
btree = BTreeAssert.CreateIntKeyBTree(Container(), id, BtreeNodeSize);
ExpectKeysSearch(Trans(), btree, values);
for (int i = 0; i < values.Length; i++)
{
btree.Remove(Trans(), values[i]);
}
BTreeAssert.AssertEmpty(Trans(), btree);
btree.Commit(Trans());
BTreeAssert.AssertEmpty(Trans(), btree);
return btree;
}