public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
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); } }
leftKeys = createKeyArray(pivot); leftChildren = new long[leftKeys.length + 1]; rightKeys = createKeyArray(vc - (pivot + 1)); rightChildren = new long[rightKeys.length + 1]; leftKeys = createKeyArray(pivot); leftValues = createValueArray(leftKeys.length); rightKeys = createKeyArray(vc - pivot); rightValues = createValueArray(rightKeys.length); Key[] v = createKeyArray(1); v[0]=separator; setBranchData(v, new long[] { lNode.getPageId(), rNode.getPageId() });
public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
public void setEmpty() { setLeafData(createKeyArray(0), createValueArray(0)); }
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); } }
leftKeys = createKeyArray(pivot); leftChildren = new long[leftKeys.length + 1]; rightKeys = createKeyArray(vc - (pivot + 1)); rightChildren = new long[rightKeys.length + 1]; leftKeys = createKeyArray(pivot); leftValues = createValueArray(leftKeys.length); rightKeys = createKeyArray(vc - pivot); rightValues = createValueArray(rightKeys.length); Key[] v = createKeyArray(1); v[0]=separator; setBranchData(v, new long[] { lNode.getPageId(), rNode.getPageId() });
leftKeys = createKeyArray(pivot); leftChildren = new long[leftKeys.length + 1]; rightKeys = createKeyArray(vc - (pivot + 1)); rightChildren = new long[rightKeys.length + 1]; leftKeys = createKeyArray(pivot); leftValues = createValueArray(leftKeys.length); rightKeys = createKeyArray(vc - pivot); rightValues = createValueArray(rightKeys.length); Key[] v = createKeyArray(1); v[0]=separator; setBranchData(v, new long[] { lNode.getPageId(), rNode.getPageId() });
leftKeys = createKeyArray(pivot); leftChildren = new long[leftKeys.length + 1]; rightKeys = createKeyArray(vc - (pivot + 1)); rightChildren = new long[rightKeys.length + 1]; leftKeys = createKeyArray(pivot); leftValues = createValueArray(leftKeys.length); rightKeys = createKeyArray(vc - pivot); rightValues = createValueArray(rightKeys.length); Key[] v = createKeyArray(1); v[0]=separator; setBranchData(v, new long[] { lNode.getPageId(), rNode.getPageId() });
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); } }