private BTreeNode<Key,Value> getRoot(Transaction tx) throws IOException { return loadNode(tx, pageId, null); }
/** * Internal (to the BTreeNode) method. Because this method is called only by * BTreeNode itself, no synchronization done inside of this method. * @throws IOException */ private BTreeNode<Key,Value> getChild(Transaction tx, int idx) throws IOException { if (isBranch() && idx >= 0 && idx < children.length) { BTreeNode<Key, Value> result = this.index.loadNode(tx, children[idx], this); return result; } else { return null; } }
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); } }
private BTreeNode<Key,Value> getRoot(Transaction tx) throws IOException { return loadNode(tx, pageId, null); }
private BTreeNode<Key,Value> getRoot(Transaction tx) throws IOException { return loadNode(tx, pageId, null); }
private BTreeNode<Key,Value> getRoot(Transaction tx) throws IOException { return loadNode(tx, pageId, null); }
/** * Internal (to the BTreeNode) method. Because this method is called only by * BTreeNode itself, no synchronization done inside of this method. * @throws IOException */ private BTreeNode<Key,Value> getChild(Transaction tx, int idx) throws IOException { if (isBranch() && idx >= 0 && idx < children.length) { BTreeNode<Key, Value> result = this.index.loadNode(tx, children[idx], this); return result; } else { return null; } }
/** * Internal (to the BTreeNode) method. Because this method is called only by * BTreeNode itself, no synchronization done inside of this method. * @throws IOException */ private BTreeNode<Key,Value> getChild(Transaction tx, int idx) throws IOException { if (isBranch() && idx >= 0 && idx < children.length) { BTreeNode<Key, Value> result = this.index.loadNode(tx, children[idx], this); return result; } else { return null; } }
/** * Internal (to the BTreeNode) method. Because this method is called only by * BTreeNode itself, no synchronization done inside of this method. * @throws IOException */ private BTreeNode<Key,Value> getChild(Transaction tx, int idx) throws IOException { if (isBranch() && idx >= 0 && idx < children.length) { BTreeNode<Key, Value> result = this.index.loadNode(tx, children[idx], this); return result; } else { return null; } }
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); } }