bpfind.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 14 行

// B+-tree pseudocode: find
// function binaryle(A, n, K) returns the greatest value less than
//   or equal to K in array A of length n.

Record* BP::findhelp(BPNode* root, const KEY K) {
  int currec = binaryle(root->recarray, root->numrec, K);
  if (root->isLeaf())
    if (root->recarray[currec].key == K)
      return root->recarray[currec].pointer;
    else return NULL;
  else findhelp(root->recarray[currec].pointer, K);
}