public boolean insertItem(BPTreeNodeItem item){ // Quick implementation: assumes all keys are inserted in rank order // todo: verify if need to compare key and insert at rank location childItems.add((BPTreeChildNodeItem)item ); BPTreeNode childNode = ((BPTreeChildNodeItem)item).getChildNode(); // Note: assumes rank order insertions if(childItems.size() == 1 ){ lowestChromKey = childNode.getLowestChromKey(); lowestChromID = childNode.getLowestChromID(); } else { highestChromKey = childNode.getHighestChromKey(); highestChromID = childNode.getHighestChromID(); } return true; // success }
public boolean insertItem(BPTreeNodeItem item){ // Quick implementation: assumes all keys are inserted in rank order // todo: verify if need to compare key and insert at rank location childItems.add((BPTreeChildNodeItem)item ); BPTreeNode childNode = ((BPTreeChildNodeItem)item).getChildNode(); // Note: assumes rank order insertions if(childItems.size() == 1 ){ lowestChromKey = childNode.getLowestChromKey(); lowestChromID = childNode.getLowestChromID(); } else { highestChromKey = childNode.getHighestChromKey(); highestChromID = childNode.getHighestChromID(); } return true; // success }
public boolean insertItem(BPTreeNodeItem item){ // Quick implementation: assumes all keys are inserted in rank order // todo: verify if need to compare key and insert at rank location childItems.add((BPTreeChildNodeItem)item ); BPTreeNode childNode = ((BPTreeChildNodeItem)item).getChildNode(); // Note: assumes rank order insertions if(childItems.size() == 1 ){ lowestChromKey = childNode.getLowestChromKey(); lowestChromID = childNode.getLowestChromID(); } else { highestChromKey = childNode.getHighestChromKey(); highestChromID = childNode.getHighestChromID(); } return true; // success }
String lowestKey = childNode.getLowestChromKey(); String highestKey = childNode.getHighestChromKey();
String lowestKey = childNode.getLowestChromKey(); String highestKey = childNode.getHighestChromKey();