@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_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_del_2_04() { int[] keys1 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ; int[] keys2 = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1} ; 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_02() { int[] keys1 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 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_07() { int[] keys1 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} ; 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_12() { int[] keys1 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9} ; int[] keys2 = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1} ; 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_0_2() { int[] keys1 = {0, 1, 2} ; int[] keys2 = {2, 1, 0} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_del_2_05() { int[] keys1 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} ; 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_06() { int[] keys1 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} ; 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_08() { int[] keys1 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} ; int[] keys2 = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1} ; rIndex = makeRangeIndex(2) ; testInsertDelete(rIndex, keys1, keys2) ; }
@Test public void tree_del_2_02() { int[] keys1 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 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_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) ; }