public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
setLeafData(keys, values); } else { setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
public void clear(Transaction tx) throws IOException { if( isBranch() ) { for (int i = 0; i < children.length; i++) { BTreeNode<Key, Value> node = index.loadNode(tx, children[i], this); node.clear(tx); tx.free(node.getPage()); } } // Reset the root node to be a leaf. if( parent == null ) { setLeafData(createKeyArray(0), createValueArray(0)); next=-1; index.storeNode(tx, this, true); } }
lNode.setBranchData(leftKeys, leftChildren); } else { rNode.setLeafData(rightKeys, rightValues); lNode.setLeafData(leftKeys, leftValues); lNode.setNext(rNode.getPageId()); rNode.setNext(next); next = rNode.getPageId(); setLeafData(leftKeys, leftValues); rNode.setLeafData(rightKeys, rightValues);
} else { Value oldValue = values[idx]; setLeafData(arrayDelete(keys, idx), arrayDelete(values, idx));
public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
setLeafData(keys, values); } else { setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
setLeafData(keys, values); } else { setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
setLeafData(keys, values); } else { setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
public void clear(Transaction tx) throws IOException { if( isBranch() ) { for (int i = 0; i < children.length; i++) { BTreeNode<Key, Value> node = index.loadNode(tx, children[i], this); node.clear(tx); tx.free(node.getPage()); } } // Reset the root node to be a leaf. if( parent == null ) { setLeafData(createKeyArray(0), createValueArray(0)); next=-1; index.storeNode(tx, this, true); } }
public void clear(Transaction tx) throws IOException { if( isBranch() ) { for (int i = 0; i < children.length; i++) { BTreeNode<Key, Value> node = index.loadNode(tx, children[i], this); node.clear(tx); tx.free(node.getPage()); } } // Reset the root node to be a leaf. if( parent == null ) { setLeafData(createKeyArray(0), createValueArray(0)); next=-1; index.storeNode(tx, this, true); } }
public void clear(Transaction tx) throws IOException { if( isBranch() ) { for (int i = 0; i < children.length; i++) { BTreeNode<Key, Value> node = index.loadNode(tx, children[i], this); node.clear(tx); tx.free(node.getPage()); } } // Reset the root node to be a leaf. if( parent == null ) { setLeafData(createKeyArray(0), createValueArray(0)); next=-1; index.storeNode(tx, this, true); } }
lNode.setBranchData(leftKeys, leftChildren); } else { rNode.setLeafData(rightKeys, rightValues); lNode.setLeafData(leftKeys, leftValues); lNode.setNext(rNode.getPageId()); rNode.setNext(next); next = rNode.getPageId(); setLeafData(leftKeys, leftValues); rNode.setLeafData(rightKeys, rightValues);
lNode.setBranchData(leftKeys, leftChildren); } else { rNode.setLeafData(rightKeys, rightValues); lNode.setLeafData(leftKeys, leftValues); lNode.setNext(rNode.getPageId()); rNode.setNext(next); next = rNode.getPageId(); setLeafData(leftKeys, leftValues); rNode.setLeafData(rightKeys, rightValues);
lNode.setBranchData(leftKeys, leftChildren); } else { rNode.setLeafData(rightKeys, rightValues); lNode.setLeafData(leftKeys, leftValues); lNode.setNext(rNode.getPageId()); rNode.setNext(next); next = rNode.getPageId(); setLeafData(leftKeys, leftValues); rNode.setLeafData(rightKeys, rightValues);
} else { Value oldValue = values[idx]; setLeafData(arrayDelete(keys, idx), arrayDelete(values, idx));
} else { Value oldValue = values[idx]; setLeafData(arrayDelete(keys, idx), arrayDelete(values, idx));
} else { Value oldValue = values[idx]; setLeafData(arrayDelete(keys, idx), arrayDelete(values, idx));