@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) ; } }
@Test public void record3() { Record r1 = intToRecord(1000, RecLen) ; Record r2 = intToRecord(0, RecLen) ; assertFalse(Record.keyEQ(r1,r2)) ; assertTrue(Record.keyGE(r1,r2)) ; assertFalse(Record.keyLE(r1,r2)) ; assertFalse(Record.keyLT(r1,r2)) ; assertTrue(Record.keyGT(r1,r2)) ; } }
@Test public void record1() { Record r1 = intToRecord(1, RecLen) ; Record r2 = intToRecord(1, RecLen) ; assertTrue(Record.keyEQ(r1,r2)) ; assertTrue(Record.keyGE(r1,r2)) ; assertTrue(Record.keyLE(r1,r2)) ; assertFalse(Record.keyLT(r1,r2)) ; assertFalse(Record.keyGT(r1,r2)) ; }
@Test public void record2() { Record r1 = intToRecord(1000, RecLen) ; Record r2 = intToRecord(2222, RecLen) ; assertFalse(Record.keyEQ(r1,r2)) ; assertFalse(Record.keyGE(r1,r2)) ; assertTrue(Record.keyLE(r1,r2)) ; assertTrue(Record.keyLT(r1,r2)) ; assertFalse(Record.keyGT(r1,r2)) ; }
BPT.error("Node: %d: Record key is null", id) ; if ( keyGT(keySubTree, keyHere) ) BPT.error("Node: %d: Child key %s is greater than this key %s", id, keySubTree, keyHere) ; BPT.error("Node: %d: Key %s is not the max [%s] of the sub-tree idx=%d", id, keyHere, keyMax, i) ; if ( min != null && keyGT(min, keyMin) ) BPT.error("Node: %d: Minimun for this node should be %s but it's %s", id, min, keyMin) ; if ( max != null && keyLT(max, keyMax) ) BPT.error("Node: %d: Maximum for this node should be %s but it's %s", id, max, keyMax) ; if ( min != null && keyGT(min, keyHere) ) BPT.error("Node: %d: Key too small: %s - min should be %s", id, keyHere, min) ;
if ( Record.keyGT(record, records.get(idx)) ) { page.release() ;