node.java

B＋树实现源码

package bplustree;

import java.util.*;

public class Node {

  public Node(int size) {
    //键和指针对的数量都是n+1对于分裂时有帮助
    this.keys   = new long[size+1];
    this.pointer= new Object[size+2];
    this.keyAmount = 0;
    this.parent = null;
  }

  public Node(long[] newKey,Object[] newPointers)
  {
    this.keys = newKey;
    this.pointer = newPointers;
    this.keyAmount = newKey.length;
    this.parent = null;
  }

  //向节点中添加数据--返回添加的数据的数量--不进行越界检查
  //将检查交给外围函数处理
  public void add(long key,Object pointer)
  {
      keys[keyAmount] = key;
      this.pointer[keyAmount] = pointer;
      keyAmount++;
  }
  //父结点
  Node parent;
  //本层的所有节点
  long[] keys;
  //节点所含指针
  Object[] pointer;
  //该节点的键值数量
  int keyAmount;
}