@Test public void tree_ins_2_01() { int[] keys = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(9, r(rIndex.maxKey())) ; }
@Test public void tree_ins_0_1() { int[] keys = {0, 1, 2} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertFalse(rIndex.isEmpty()) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(2, r(rIndex.maxKey())) ; }
@Test public void tree_ins_0_0() { // Empty tree int[] keys = {} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertTrue(rIndex.isEmpty()) ; assertNull(rIndex.minKey()) ; assertNull(rIndex.maxKey()) ; }
void testClear(int N) { int[] keys = new int[N] ; // Slice is 1000. for ( int i = 0 ; i < keys.length ; i++ ) keys[i] = i ; rIndex = makeRangeIndex(3) ; add(rIndex, keys) ; if ( N > 0 ) assertFalse(rIndex.isEmpty()) ; rIndex.clear() ; assertTrue(rIndex.isEmpty()) ; } }
protected abstract RangeIndex makeRangeIndex(int order, int minRecords) ;
@Test public void tree_clear_02() { testClear(998) ; }
@Test public void tree_ret_2() { int[] keys = {1, 2, 3, 4, 5} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; boolean b = rIndex.delete(RecordLib.intToRecord(9)) ; assertFalse(b) ; b = rIndex.add(RecordLib.intToRecord(1)) ; assertFalse(b) ; }
void testClear(int N) { int[] keys = new int[N] ; // Slice is 1000. for ( int i = 0 ; i < keys.length ; i++ ) keys[i] = i ; rIndex = makeRangeIndex(3) ; add(rIndex, keys) ; if ( N > 0 ) assertFalse(rIndex.isEmpty()) ; rIndex.clear() ; assertTrue(rIndex.isEmpty()) ; } }
protected abstract RangeIndex makeRangeIndex(int order, int minRecords) ;
@Test public void tree_clear_01() { testClear(5) ; }
@Test public void tree_ret_2() { int[] keys = {1, 2, 3, 4, 5} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; boolean b = rIndex.delete(RecordLib.intToRecord(9)) ; assertFalse(b) ; b = rIndex.add(RecordLib.intToRecord(1)) ; assertFalse(b) ; }
@Test public void tree_ins_2_02() { int[] keys = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(9, r(rIndex.maxKey())) ; }
@Test public void tree_ins_0_1() { int[] keys = {0, 1, 2} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertFalse(rIndex.isEmpty()) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(2, r(rIndex.maxKey())) ; }
@Test public void tree_ret_1() { int[] keys = {1, 2, 3, 4, 5} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; boolean b = rIndex.add(RecordLib.intToRecord(3)) ; assertFalse(b) ; b = rIndex.add(RecordLib.intToRecord(9)) ; assertTrue(b) ; }
@Test public void tree_del_2_10() { int[] keys1 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; int[] keys2 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_ins_0_0() { // Empty tree int[] keys = {} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertTrue(rIndex.isEmpty()) ; assertNull(rIndex.minKey()) ; assertNull(rIndex.maxKey()) ; }
@Test public void tree_clear_03() { testClear(999) ; }
@Test public void tree_ins_2_03() { int[] keys = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(9, r(rIndex.maxKey())) ; }
@Test public void tree_ins_2_05() { int[] keys = {0, 18, 4, 14, 8, 10, 12, 6, 16, 2} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertFalse(rIndex.contains(r(1))) ; assertFalse(rIndex.contains(r(999))) ; assertFalse(rIndex.contains(r(-9))) ; assertFalse(rIndex.contains(r(7))) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(18, r(rIndex.maxKey())) ; }
@Test public void tree_ret_1() { int[] keys = {1, 2, 3, 4, 5} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; boolean b = rIndex.add(RecordLib.intToRecord(3)) ; assertFalse(b) ; b = rIndex.add(RecordLib.intToRecord(9)) ; assertTrue(b) ; }