public static void testInsert(Index index, int[] keys) { IndexTestLib.add(index, keys) ; testIndexContents(index, keys); }
public static void testInsert(Index index, int[] keys) { IndexTestLib.add(index, keys) ; testIndexContents(index, keys); }
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 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 ; } }
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 ; }