internal BTreeBranch(long transactionId, IBTreeNode node1, IBTreeNode node2)
{
TransactionId = transactionId;
_children = new[] { node1, node2 };
_keys = new[] { node2.GetLeftMostKey() };
var leftCount = node1.CalcKeyCount();
var rightCount = node2.CalcKeyCount();
_pairCounts = new[] { leftCount, leftCount + rightCount };
}
internal BTreeBranch(long transactionId, IBTreeNode node1, IBTreeNode node2)
{
TransactionId = transactionId;
_children = new[] { node1, node2 };
_keys = new[] { node2.GetLeftMostKey() };
var leftCount = node1.CalcKeyCount();
var rightCount = node2.CalcKeyCount();
_pairCounts = new[] { leftCount, leftCount + rightCount };
}