// System.err.printf("Warning: too many keys\n") ;
int[] keys1 = rand(numKeys, 0, maxValue) ;
int[] keys2 = permute(keys1, numKeys) ;
try {
IndexMaker maker = new BPlusTreeMaker(order, order, false) ;
Index rIndex = IndexTestLib.buildIndex(maker, keys1);
IndexTestLib.delete(rIndex, keys2) ;
} catch (RuntimeException ex)
{
System.err.printf("int order=%d ;\n", order) ;