public boolean deleteItem(int index){ // unacceptable index if(index < 0 || index >= getItemCount()) return false; childItems.remove(index); return true; // success }
} else { isLeaf = false; thisNode = new BPTreeChildNode(++nodeCount);
thisNode = new BPTreeChildNode(++nodeCount);
public boolean deleteItem(int index){ // unacceptable index if(index < 0 || index >= getItemCount()) return false; childItems.remove(index); return true; // success }
thisNode = new BPTreeChildNode(++nodeCount);
public BPTreeNodeItem getItem(int index){ int itemCount = getItemCount(); if(index >= itemCount) return null; return childItems.get(index); }
public boolean deleteItem(int index){ // unacceptable index if(index < 0 || index >= getItemCount()) return false; childItems.remove(index); return true; // success }
public BPTreeNodeItem getItem(int index){ int itemCount = getItemCount(); if(index >= itemCount) return null; return childItems.get(index); }
public BPTreeNodeItem getItem(int index){ int itemCount = getItemCount(); if(index >= itemCount) return null; return childItems.get(index); }
public void printItems(){ int itemCount = getItemCount(); log.debug("Child node " + nodeIndex + " contains " + itemCount + " child items:"); for(int item = 0; item < itemCount; ++item){ // recursively will print all node items below this node childItems.get(item).print(); } }
public void printItems(){ int itemCount = getItemCount(); log.debug("Child node " + nodeIndex + " contains " + itemCount + " child items:"); for(int item = 0; item < itemCount; ++item){ // recursively will print all node items below this node childItems.get(item).print(); } }
public void printItems(){ int itemCount = getItemCount(); log.debug("Child node " + nodeIndex + " contains " + itemCount + " child items:"); for(int item = 0; item < itemCount; ++item){ // recursively will print all node items below this node childItems.get(item).print(); } }