@Override public Block toBlock(BPTreeNode node) { // It's manipulated in-place so no conversion needed, // Just the count needs to be fixed up. // ByteBuffer bb = node.getBackingByteBuffer() ; // BlockType bType = (node.isLeaf ? BPTREE_LEAF : BPTREE_BRANCH ) ; Block block = node.getBackingBlock() ; BlockType bType = (node.isLeaf() ? BPTREE_LEAF : BPTREE_BRANCH ) ; int c = encodeCount(bType, node.getCount()) ; block.getByteBuffer().putInt(0, c) ; return block ; } }
@Override public Block toBlock(BPTreeNode node) { // It's manipulated in-place so no conversion needed, // Just the count needs to be fixed up. // ByteBuffer bb = node.getBackingByteBuffer() ; // BlockType bType = (node.isLeaf ? BPTREE_LEAF : BPTREE_BRANCH ) ; Block block = node.getBackingBlock() ; BlockType bType = (node.isLeaf() ? BPTREE_LEAF : BPTREE_BRANCH ) ; int c = encodeCount(bType, node.getCount()) ; block.getByteBuffer().putInt(0, c) ; return block ; } }
int x2 = this.getCount() ; // Highest place to look. Inclusive. if ( maxRec != null ) {
int x2 = this.getCount() ; // Highest place to look. Inclusive. if ( maxRec != null ) {
static Iterator<Pair<Integer, Record>> summarizeIndexBlocks(Iterator<Pair<Integer, Record>> iter2, BPTreeNodeMgr bptNodeMgr) { divider() ; List<Pair<Integer, Record>> pairs = Iter.toList(iter2) ; for ( Pair<Integer, Record> pair : pairs ) { BPTreeNode bpNode = bptNodeMgr.getRead(pair.car(), BPlusTreeParams.RootParent) ; String hr = "null" ; if ( !bpNode.getRecordBuffer().isEmpty() ) hr = bpNode.getRecordBuffer().getHigh().toString() ; System.out.printf("%s -- BPTreeNode: %d (%d) -> [%s]\n", pair, bpNode.getId(), bpNode.getCount(), hr) ; bptNodeMgr.release(bpNode) ; } return pairs.iterator() ; }
static Iterator<Pair<Integer, Record>> summarizeIndexBlocks(Iterator<Pair<Integer, Record>> iter2, BPTreeNodeMgr bptNodeMgr) { divider() ; List<Pair<Integer, Record>> pairs = Iter.toList(iter2) ; for ( Pair<Integer, Record> pair : pairs ) { BPTreeNode bpNode = bptNodeMgr.getRead(pair.car(), BPlusTreeParams.RootParent) ; String hr = "null" ; if ( !bpNode.getRecordBuffer().isEmpty() ) hr = bpNode.getRecordBuffer().getHigh().toString() ; System.out.printf("%s -- BPTreeNode: %d (%d) -> [%s]\n", pair, bpNode.getId(), bpNode.getCount(), hr) ; bptNodeMgr.release(bpNode) ; } return pairs.iterator() ; }
private static void copyBPTreeNode(BPTreeNode nodeSrc, BPTreeNode nodeDst, BPlusTree bpt2) { PtrBuffer pBuff = nodeSrc.getPtrBuffer() ; pBuff.copy(0, nodeDst.getPtrBuffer(), 0, pBuff.getSize()) ; RecordBuffer rBuff = nodeSrc.getRecordBuffer() ; rBuff.copy(0, nodeDst.getRecordBuffer(), 0, rBuff.getSize()) ; nodeDst.setCount(nodeSrc.getCount()) ; nodeDst.setIsLeaf(nodeSrc.isLeaf()) ; bpt2.getNodeManager().put(nodeDst) ; } }
private static void copyBPTreeNode(BPTreeNode nodeSrc, BPTreeNode nodeDst, BPlusTree bpt2) { PtrBuffer pBuff = nodeSrc.getPtrBuffer() ; pBuff.copy(0, nodeDst.getPtrBuffer(), 0, pBuff.getSize()) ; RecordBuffer rBuff = nodeSrc.getRecordBuffer() ; rBuff.copy(0, nodeDst.getRecordBuffer(), 0, rBuff.getSize()) ; nodeDst.setCount(nodeSrc.getCount()) ; nodeDst.setIsLeaf(nodeSrc.isLeaf()) ; bpt2.getNodeManager().put(nodeDst) ; } }