@Test public void tree_del_2_03() { int[] keys1 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; int[] keys2 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_del_2_09() { int[] keys1 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; int[] keys2 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@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_del_2_11() { int[] keys1 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; int[] keys2 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_del_0_1() { int[] keys1 = {0, 1, 2} ; int[] keys2 = {0, 1, 2} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_del_0_3() { int[] keys1 = {0, 1, 2} ; int[] keys2 = {1, 0, 2} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_del_2_01() { int[] keys1 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; int[] keys2 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_2_N() { for ( int i = 0 ; i < 10 ; i++ ) randTest(makeRangeIndex(2), 999, 20) ; }
@Test public void tree_iter_0_02() { int[] keys = {1, 2, 3, 4, 5} ; rIndex = makeRangeIndex(5) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(null, null)) ; List<Integer> expected = toIntList(keys) ; assertEquals(expected, x) ; }
@Test public void tree_iter_2_04() { int[] keys = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(null, null)) ; List<Integer> expected = toIntList(keys) ; assertEquals(expected, x) ; }
@Test public void tree_iter_0_02() { int[] keys = {1, 2, 3, 4, 5} ; rIndex = makeRangeIndex(5) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(null, null)) ; List<Integer> expected = toIntList(keys) ; assertEquals(expected, x) ; }
@Test public void tree_iter_2_05() { int[] keys = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(null, r(4))) ; List<Integer> expected = toIntList(0, 1, 2, 3) ; assertEquals(expected, x) ; }
@Test public void tree_iter_2_07() { int[] keys = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(null, r(99))) ; List<Integer> expected = toIntList(keys) ; assertEquals(expected, x) ; }
@Test public void tree_iter_2_03() { int[] keys = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(r(4), null)) ; List<Integer> expected = toIntList(4, 5, 6, 7, 8, 9) ; assertEquals(expected, x) ; }
@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_iter_2_01() { int[] keys = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(r(4), r(6))) ; List<Integer> expected = toIntList(4, 5) ; assertEquals(expected, x) ; }
@Test public void tree_iter_2_08() { int[] keys = {1, 2, 3, 4, 5, 6, 7, 8, 9} ; rIndex = makeRangeIndex(2) ; add(rIndex, keys) ; List<Integer> x = RecordLib.toIntList(rIndex.iterator(r(0), r(99))) ; List<Integer> expected = toIntList(keys) ; assertEquals(expected, x) ; }
@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_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_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())) ; }