private static<X> Iterator<X> getRecordsIterator(BPTreeRecords records, Record minRecord, Record maxRecord, RecordMapper<X> mapper) { records.bpTree.startReadBlkMgr(); Iterator<X> iter = records.getRecordBuffer().iterator(minRecord, maxRecord, mapper); records.bpTree.finishReadBlkMgr(); return iter ; }
private static<X> Iterator<X> getRecordsIterator(BPTreeRecords records, Record minRecord, Record maxRecord, RecordMapper<X> mapper) { records.bpTree.startReadBlkMgr(); Iterator<X> iter = records.getRecordBuffer().iterator(minRecord, maxRecord, mapper); records.bpTree.finishReadBlkMgr(); return iter ; }
private static Iterator<Record> getRecordsIterator(BPTreeRecords records, Record minRecord, Record maxRecord) { records.bpTree.startReadBlkMgr(); Iterator<Record> iter = records.getRecordBuffer().iterator(minRecord, maxRecord) ; records.bpTree.finishReadBlkMgr(); return iter ; }
private static Iterator<Record> getRecordsIterator(BPTreeRecords records, Record minRecord, Record maxRecord) { records.bpTree.startReadBlkMgr(); Iterator<Record> iter = records.getRecordBuffer().iterator(minRecord, maxRecord) ; records.bpTree.finishReadBlkMgr(); return iter ; }
@Override public boolean isEmpty() { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; boolean b = !root.hasAnyKeys() ; releaseRootRead(root) ; finishReadBlkMgr() ; return b ; }
@Override public Record maxKey() { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; Record r = BPTreeNode.maxRecord(root) ; releaseRootRead(root) ; finishReadBlkMgr() ; return r ; }
@Override public Iterator<Record> iterator(Record fromRec, Record toRec) { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; releaseRootRead(root) ; finishReadBlkMgr() ; return BPTreeRangeIterator.create(root, fromRec, toRec) ; //return iterator(fromRec, toRec, RecordFactory.mapperRecord) ; }
private BPTreeRecords loadStack(BPTreeNode node) { AccessPath path = new AccessPath(null) ; node.bpTree.startReadBlkMgr(); if ( minRecord == null ) node.internalMinRecord(path) ; else node.internalSearch(path, minRecord) ; List<AccessStep> steps = path.getPath() ; for ( AccessStep step : steps ) { BPTreeNode n = step.node ; Iterator<BPTreePage> it = n.iterator(minRecord, maxRecord) ; if ( it == null || ! it.hasNext() ) continue ; BPTreePage p = it.next() ; stack.push(it) ; } BPTreePage p = steps.get(steps.size()-1).page ; if ( ! ( p instanceof BPTreeRecords ) ) throw new InternalErrorException("Last path step not to a records block") ; node.bpTree.finishReadBlkMgr(); return (BPTreeRecords)p ; }
private BPTreeRecords loadStack(BPTreeNode node) { AccessPath path = new AccessPath(null) ; node.bpTree.startReadBlkMgr(); if ( minRecord == null ) node.internalMinRecord(path) ; else node.internalSearch(path, minRecord) ; List<AccessStep> steps = path.getPath() ; for ( AccessStep step : steps ) { BPTreeNode n = step.node ; Iterator<BPTreePage> it = n.iterator(minRecord, maxRecord) ; if ( it == null || ! it.hasNext() ) continue ; BPTreePage p = it.next() ; stack.push(it) ; } BPTreePage p = steps.get(steps.size()-1).page ; if ( ! ( p instanceof BPTreeRecords ) ) throw new InternalErrorException("Last path step not to a records block") ; node.bpTree.finishReadBlkMgr(); return (BPTreeRecords)p ; }
@Override public Record find(Record record) { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; Record v = BPTreeNode.search(root, record) ; releaseRootRead(root) ; finishReadBlkMgr() ; return v ; }
@Override public <X> Iterator<X> iterator(Record minRec, Record maxRec, RecordMapper<X> mapper) { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; releaseRootRead(root) ; finishReadBlkMgr() ; return iterator(root, minRec, maxRec, mapper); }
@Override public boolean isEmpty() { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; boolean b = !root.hasAnyKeys() ; releaseRootRead(root) ; finishReadBlkMgr() ; return b ; }
@Override public Record find(Record record) { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; Record v = BPTreeNode.search(root, record) ; releaseRootRead(root) ; finishReadBlkMgr() ; return v ; }
@Override public Record minKey() { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; Record r = BPTreeNode.minRecord(root) ; releaseRootRead(root) ; finishReadBlkMgr() ; return r ; }
@Override public Record minKey() { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; Record r = BPTreeNode.minRecord(root) ; releaseRootRead(root) ; finishReadBlkMgr() ; return r ; }
public void dump() { // Caution - nesting via startReadBlkMgr startReadBlkMgr() ; BPTreeNode root = getRootRead() ; boolean b = BPT.Logging ; BPT.Logging = false ; try { root.dump() ; } finally { releaseRootRead(root) ; BPT.Logging = b ; } finishReadBlkMgr() ; }
@Override public Record maxKey() { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; Record r = BPTreeNode.maxRecord(root) ; releaseRootRead(root) ; finishReadBlkMgr() ; return r ; }
@Override public Iterator<Record> iterator(Record fromRec, Record toRec) { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; releaseRootRead(root) ; finishReadBlkMgr() ; return BPTreeRangeIterator.create(root, fromRec, toRec) ; //return iterator(fromRec, toRec, RecordFactory.mapperRecord) ; }
@Override public <X> Iterator<X> iterator(Record minRec, Record maxRec, RecordMapper<X> mapper) { startReadBlkMgr() ; BPTreeNode root = getRootRead() ; releaseRootRead(root) ; finishReadBlkMgr() ; return iterator(root, minRec, maxRec, mapper); }
public void dump() { // Caution - nesting via startReadBlkMgr startReadBlkMgr() ; BPTreeNode root = getRootRead() ; boolean b = BPT.Logging ; BPT.Logging = false ; try { root.dump() ; } finally { releaseRootRead(root) ; BPT.Logging = b ; } finishReadBlkMgr() ; }