public static Index testInsert(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; testInsert(index, keys); return index ; }
public static void testInsertDelete(Index index, int[] buildKeys, int[] deleteKeys) { testInsert(index, buildKeys) ; testDelete(index, deleteKeys) ; }
public static void testInsertDelete(Index index, int[] buildKeys, int[] deleteKeys) { testInsert(index, buildKeys) ; testDelete(index, deleteKeys) ; }
public static Index testInsert(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; testInsert(index, keys); return index ; }
private Index test(int[] insKeys, int[] delKeys, int[] expected) { index = makeIndex(4,0) ; testInsert(index, insKeys) ; long x = index.size() ; if ( x >= 0 ) assertEquals(insKeys.length, x) ; if ( delKeys != null ) { testDelete(index, delKeys) ; } if ( expected != null ) testIndexContents(index, expected) ; return index ; }
private Index test(int[] insKeys, int[] delKeys, int[] expected) { index = makeIndex(4,0) ; testInsert(index, insKeys) ; long x = index.size() ; if ( x >= 0 ) assertEquals(insKeys.length, x) ; if ( delKeys != null ) { testDelete(index, delKeys) ; } if ( expected != null ) testIndexContents(index, expected) ; return index ; }
@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_0() { // Empty tree int[] keys = {} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertTrue(rIndex.isEmpty()) ; assertNull(rIndex.minKey()) ; assertNull(rIndex.maxKey()) ; }
@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_04() { int[] keys = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(9, r(rIndex.maxKey())) ; }
@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_04() { int[] keys = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertEquals(0, r(rIndex.minKey())) ; assertEquals(9, r(rIndex.maxKey())) ; }
@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_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_0() { // Empty tree int[] keys = {} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertTrue(rIndex.isEmpty()) ; assertNull(rIndex.minKey()) ; assertNull(rIndex.maxKey()) ; }
@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_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_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_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())) ; }