@Override public Iterator<Record> iterator() { return iterator(noMin, noMax) ; }
@Override public Iterator<Record> iterator() { return iterator(noMin, noMax) ; }
@Override public long size() { Iterator<Record> iter = iterator() ; return Iter.count(iter) ; }
@Override public long size() { Iterator<Record> iter = iterator() ; return Iter.count(iter) ; }
@Override public void clear() { Record[] records = new Record[SLICE] ; while(true) { Iterator<Record> iter = iterator() ; int i = 0 ; for ( i = 0 ; i < SLICE ; i++ ) { if ( ! iter.hasNext() ) break ; Record r = iter.next() ; records[i] = r ; } if ( i == 0 ) break ; for ( int j = 0 ; j < i ; j++ ) { delete(records[j]) ; records[j] = null ; } } }
@Override public void clear() { Record[] records = new Record[SLICE] ; while(true) { Iterator<Record> iter = iterator() ; int i = 0 ; for ( i = 0 ; i < SLICE ; i++ ) { if ( ! iter.hasNext() ) break ; Record r = iter.next() ; records[i] = r ; } if ( i == 0 ) break ; for ( int j = 0 ; j < i ; j++ ) { delete(records[j]) ; records[j] = null ; } } }
@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 <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 static void scanComparision(List<Record> originaldata, BPlusTree bpt2) { // ** Scan comparisonSetupIndex Iterator<Record> iter1 = originaldata.iterator() ; Iterator<Record> iter2 = bpt2.iterator() ; long count = 0 ; for ( ; iter1.hasNext() ; ) { count++ ; Record r1 = iter1.next(); if ( ! iter2.hasNext() ) error("Deviation: new B+Tree is smaller") ; Record r2 = iter2.next(); if ( ! Record.equals(r1, r2) ) error("Deviation in iteration record %d: %s : %s", count, r1, r2) ; } if ( iter2.hasNext() ) error("New B+Tree larger than original") ; }
public static void scanComparision(List<Record> originaldata, BPlusTree bpt2) { // ** Scan comparisonSetupIndex Iterator<Record> iter1 = originaldata.iterator() ; Iterator<Record> iter2 = bpt2.iterator() ; long count = 0 ; for ( ; iter1.hasNext() ; ) { count++ ; Record r1 = iter1.next(); if ( ! iter2.hasNext() ) error("Deviation: new B+Tree is smaller") ; Record r2 = iter2.next(); if ( ! Record.equals(r1, r2) ) error("Deviation in iteration record %d: %s : %s", count, r1, r2) ; } if ( iter2.hasNext() ) error("New B+Tree larger than original") ; }