@Override final void checkNodeDeep() { if ( isRoot() ) { // if ( !isLeaf && count == 0 ) // error("Root is of size zero (one pointer) but not a leaf") ; if ( parent != BPlusTreeParams.RootParent ) BPT.error("Root parent is wrong") ; // if ( count == 0 ) // return ; } checkNodeDeep(null, null) ; }
@Override public void check() { BPTreeNode root = getRootRead() ; try { root.checkNodeDeep() ; } finally { releaseRootRead(root) ; } }
@Override final void checkNodeDeep() { if ( isRoot() ) { // if ( !isLeaf && count == 0 ) // error("Root is of size zero (one pointer) but not a leaf") ; if ( parent != BPlusTreeParams.RootParent ) BPT.error("Root parent is wrong") ; // if ( count == 0 ) // return ; } checkNodeDeep(null, null) ; }
@Override public void check() { BPTreeNode root = getRootRead() ; try { root.checkNodeDeep() ; } finally { releaseRootRead(root) ; } }
nodeManager.startRead(); BPTreeNode root = nodeManager.getRead(bpt.getRootId(), BPlusTreeParams.RootParent) ; root.checkNodeDeep() ; nodeManager.release(root) ; nodeManager.finishRead();
nodeManager.startRead(); BPTreeNode root = nodeManager.getRead(bpt.getRootId(), BPlusTreeParams.RootParent) ; root.checkNodeDeep() ; nodeManager.release(root) ; nodeManager.finishRead();
((BPTreeNode)n).checkNodeDeep(min1, max1) ; n.release() ;
((BPTreeNode)n).checkNodeDeep(min1, max1) ; n.release() ;