@Override public final void checkNode() { if ( !CheckingNode ) return ; if ( rBuff.size() < 0 || rBuff.size() > rBuff.maxSize() ) error("Misized: %s", this) ; for ( int i = 1 ; i < getCount() ; i++ ) { Record r1 = rBuff.get(i - 1) ; Record r2 = rBuff.get(i) ; if ( Record.keyGT(r1, r2) ) error("Not sorted: %s", this) ; } }
@Override public final void checkNode() { if ( !CheckingNode ) return ; if ( rBuff.size() < 0 || rBuff.size() > rBuff.maxSize() ) error("Misized: %s", this) ; for ( int i = 1 ; i < getCount() ; i++ ) { Record r1 = rBuff.get(i - 1) ; Record r2 = rBuff.get(i) ; if ( Record.keyGT(r1, r2) ) error("Not sorted: %s", this) ; } }
protected static void check(BPTreeRecords bpr) { assertTrue(bpr.getCount() >= 0) ; assertTrue(bpr.getCount() <= bpr.getMaxSize()) ; assertEquals(bpr.getRecordBuffer().getLow(), bpr.getLowRecord()) ; assertEquals(bpr.getRecordBuffer().getHigh(), bpr.getHighRecord()) ; for ( int i = 1 ; i < bpr.getCount() ; i++ ) { Record r1 = bpr.getRecordBuffer().get(i - 1) ; Record r2 = bpr.getRecordBuffer().get(i) ; assertTrue(Record.keyLE(r1, r2)) ; } }
protected static void check(BPTreeRecords bpr) { assertTrue(bpr.getCount() >= 0) ; assertTrue(bpr.getCount() <= bpr.getMaxSize()) ; assertEquals(bpr.getRecordBuffer().getLow(), bpr.getLowRecord()) ; assertEquals(bpr.getRecordBuffer().getHigh(), bpr.getHighRecord()) ; for ( int i = 1 ; i < bpr.getCount() ; i++ ) { Record r1 = bpr.getRecordBuffer().get(i - 1) ; Record r2 = bpr.getRecordBuffer().get(i) ; assertTrue(Record.keyLE(r1, r2)) ; } }
private static void contains(BPTreeRecords bpr, int... values) { assertEquals(values.length, bpr.getCount()) ; for ( int i = 1 ; i < values.length ; i++ ) assertTrue(Record.compareByKeyValue(RecordLib.intToRecord(values[i]), bpr.getRecordBuffer().get(i)) == 0) ; }
private static void contains(BPTreeRecords bpr, int... values) { assertEquals(values.length, bpr.getCount()) ; for ( int i = 1 ; i < values.length ; i++ ) assertTrue(Record.compareByKeyValue(RecordLib.intToRecord(values[i]), bpr.getRecordBuffer().get(i)) == 0) ; }
@Test public void bpt_records_3() { BPTreeRecords bpr = make() ; for ( int i = 0 ; bpr.getCount() < bpr.getMaxSize() ; i++ ) insert(bpr, (i + 0x20)) ; check(bpr) ; bpr.release() ; }
@Test public void bpt_records_5() { BPTreeRecords bpr = make() ; int N = bpr.getMaxSize() ; for ( int i = bpr.getMaxSize() - 1 ; i >= 0 ; i-- ) insert(bpr, (i + 0x20)) ; delete(bpr, (1 + 0x20)) ; assertEquals(N - 1, bpr.getCount()) ; check(bpr) ; delete(bpr, (2 + 0x20)) ; assertEquals(N - 2, bpr.getCount()) ; check(bpr) ; delete(bpr, bpr.getLowRecord()) ; assertEquals(N - 3, bpr.getCount()) ; check(bpr) ; delete(bpr, bpr.getHighRecord()) ; assertEquals(N - 4, bpr.getCount()) ; check(bpr) ; bpr.release() ; }
@Test public void bpt_records_3() { BPTreeRecords bpr = make() ; for ( int i = 0 ; bpr.getCount() < bpr.getMaxSize() ; i++ ) insert(bpr, (i + 0x20)) ; check(bpr) ; bpr.release() ; }
@Test public void bpt_records_5() { BPTreeRecords bpr = make() ; int N = bpr.getMaxSize() ; for ( int i = bpr.getMaxSize() - 1 ; i >= 0 ; i-- ) insert(bpr, (i + 0x20)) ; delete(bpr, (1 + 0x20)) ; assertEquals(N - 1, bpr.getCount()) ; check(bpr) ; delete(bpr, (2 + 0x20)) ; assertEquals(N - 2, bpr.getCount()) ; check(bpr) ; delete(bpr, bpr.getLowRecord()) ; assertEquals(N - 3, bpr.getCount()) ; check(bpr) ; delete(bpr, bpr.getHighRecord()) ; assertEquals(N - 4, bpr.getCount()) ; check(bpr) ; bpr.release() ; }
@Test public void bpt_records_2() { BPTreeRecords bpr = make() ; fill(bpr) ; int s = bpr.getCount() ; assertTrue(bpr.isFull()) ; BPTreePage z = bpr.split() ; assertTrue(z instanceof BPTreeRecords) ; assertEquals(s, z.getCount() + bpr.getCount()) ; check(bpr) ; check((BPTreeRecords)z) ; bpr.release() ; z.release() ; }
@Test public void bpt_records_2() { BPTreeRecords bpr = make() ; fill(bpr) ; int s = bpr.getCount() ; assertTrue(bpr.isFull()) ; BPTreePage z = bpr.split() ; assertTrue(z instanceof BPTreeRecords) ; assertEquals(s, z.getCount() + bpr.getCount()) ; check(bpr) ; check((BPTreeRecords)z) ; bpr.release() ; z.release() ; }