private IBTreeRange FieldIndexKeySearch(Transaction trans, BTree btree, object key
)
{
// SearchTarget should not make a difference, HIGHEST is faster
BTreeNodeSearchResult start = btree.SearchLeaf(trans, FieldIndexKey(0, key), SearchTarget
.Lowest);
BTreeNodeSearchResult end = btree.SearchLeaf(trans, FieldIndexKey(int.MaxValue, key
), SearchTarget.Lowest);
return start.CreateIncludingRange(end);
}
private BTreePointer SearchBTree(BTree bTree, Slot slot, SearchTarget target)
{
BTreeNodeSearchResult searchResult = bTree.SearchLeaf(Transaction(), slot, target
);
return searchResult.FirstValidPointer();
}
