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 leafItems.add((BPTreeLeafNodeItem)item ); // Note: assumes rank order insertions if(leafItems.size() == 1 ){ lowestChromKey = item.getChromKey(); lowestChromID = ((BPTreeLeafNodeItem)item).getChromID(); } else { highestChromKey = item.getChromKey(); highestChromID = ((BPTreeLeafNodeItem)item).getChromID(); } // success return true; }
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 leafItems.add((BPTreeLeafNodeItem)item ); // Note: assumes rank order insertions if(leafItems.size() == 1 ){ lowestChromKey = item.getChromKey(); lowestChromID = ((BPTreeLeafNodeItem)item).getChromID(); } else { highestChromKey = item.getChromKey(); highestChromID = ((BPTreeLeafNodeItem)item).getChromID(); } // success return true; }
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 leafItems.add((BPTreeLeafNodeItem)item ); // Note: assumes rank order insertions if(leafItems.size() == 1 ){ lowestChromKey = item.getChromKey(); lowestChromID = ((BPTreeLeafNodeItem)item).getChromID(); } else { highestChromKey = item.getChromKey(); highestChromID = ((BPTreeLeafNodeItem)item).getChromID(); } // success return true; }
chromID = leaf.getChromID(); break;
chromID = leaf.getChromID(); break;
chromID = leaf.getChromID();
chromID = leaf.getChromID();
BPTreeLeafNodeItem leaf = (BPTreeLeafNodeItem)thisNode.getItem(index); if(leaf.getChromID() == chromID){ // mChromosome key match chromKey = leaf.getChromKey(); break;
BPTreeLeafNodeItem leaf = (BPTreeLeafNodeItem)thisNode.getItem(index); if(leaf.getChromID() == chromID){ // mChromosome key match chromKey = leaf.getChromKey(); break;