node.java~2~

B＋树实现源码

package bplustree;

import java.util.*;

public class Node {

  public Node(int size) {
    this.keys   = new long[size];
    this.pointer= new Object[size+1];
    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 int add(long key,Object pointer)
  {
    if(keyAmount == keys.length)
      return 0;
    else{
      keys[keyAmount] = key;
      this.pointer[keyAmount] = pointer;
      keyAmount++;
    }
    return 1;
  }
  //父结点
  Node parent;
  //本层的所有节点
  long[] keys;
  //节点所含指针
  Object[] pointer;
  //该节点的键值数量
  int keyAmount;
}