public static Index buildIndex(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; IndexTestLib.add(index, keys) ; return index ; }
@Override public void executeOneTest() { int numKeys = RandomLib.random.nextInt(maxNumKeys)+1 ; IndexTestLib.randTest(maker.makeIndex(), maxValue, numKeys) ; } }
public static void randTest(Index index, int maxValue, int numKeys) { if ( numKeys >= 5000 ) System.err.printf("Warning: too many keys\n") ; int[] keys1 = rand(numKeys, 0, maxValue) ; int[] keys2 = permute(keys1) ; try { testInsert(index, keys1); if ( true ) { // Checking tests. testIndexContents(index, keys2); // Test iteration - quite expensive. if ( index instanceof RangeIndex ) testIteration((RangeIndex)index, keys1, 10) ; } testDelete(index, keys2) ; index.close() ; } catch (RuntimeException ex) { System.err.printf("Index : %s\n", index.getClass().getName()) ; System.err.printf("int[] keys1 = {%s} ;\n", strings(keys1)) ; System.err.printf("int[] keys2 = {%s}; \n", strings(keys2)) ; throw ex ; } }
public static void testInsert(Index index, int[] keys) { IndexTestLib.add(index, keys) ; testIndexContents(index, keys); }
public static void testInsertDelete(Index index, int[] buildKeys, int[] deleteKeys) { testInsert(index, buildKeys) ; testDelete(index, deleteKeys) ; }
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_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) ; }
public static Index testInsert(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; testInsert(index, keys); return index ; }
public static void testDelete(Index index, int[] vals) { long size1 = index.size() ; int count = 0 ; count = delete(index, vals) ; List<Record> x = intToRecord(vals, RecordLib.TestRecordLength) ; for ( Record r : x ) { boolean b = index.delete(r) ; if ( b ) count ++ ; } for ( Record r : x ) BaseTest.assertFalse(index.contains(r)) ; long size2 = index.size() ; assertEquals(size1-count, size2) ; }
@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) ; }
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 ; }
public static Index testInsert(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; testInsert(index, keys); return index ; }
public static void testInsert(Index index, int[] keys) { IndexTestLib.add(index, keys) ; testIndexContents(index, keys); }
public static void testInsertDelete(Index index, int[] buildKeys, int[] deleteKeys) { testInsert(index, buildKeys) ; testDelete(index, deleteKeys) ; }
public static void testDelete(Index index, int[] vals) { long size1 = index.size() ; int count = 0 ; count = delete(index, vals) ; List<Record> x = intToRecord(vals, RecordLib.TestRecordLength) ; for ( Record r : x ) { boolean b = index.delete(r) ; if ( b ) count ++ ; } for ( Record r : x ) BaseTest.assertFalse(index.contains(r)) ; long size2 = index.size() ; assertEquals(size1-count, size2) ; }
public static Index buildIndex(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; IndexTestLib.add(index, keys) ; return index ; }
public static void randTest(Index index, int maxValue, int numKeys) { if ( numKeys >= 5000 ) System.err.printf("Warning: too many keys\n") ; int[] keys1 = rand(numKeys, 0, maxValue) ; int[] keys2 = permute(keys1) ; try { testInsert(index, keys1); if ( true ) { // Checking tests. testIndexContents(index, keys2); // Test iteration - quite expensive. if ( index instanceof RangeIndex ) testIteration((RangeIndex)index, keys1, 10) ; } testDelete(index, keys2) ; index.close() ; } catch (RuntimeException ex) { System.err.printf("Index : %s\n", index.getClass().getName()) ; System.err.printf("int[] keys1 = {%s} ;\n", strings(keys1)) ; System.err.printf("int[] keys2 = {%s}; \n", strings(keys2)) ; throw ex ; } }
@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_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())) ; }
@Override public void executeOneTest() { int numKeys = RandomLib.random.nextInt(maxNumKeys)+1 ; IndexTestLib.randTest(maker.makeIndex(), maxValue, numKeys) ; } }