alt.sort(s, p, r, rep); return;
public void sortSorted(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; Random r = new Random(); long seed = r.nextLong(); r.setSeed(seed); System.out.println("testSorted seed: " + seed + "(" + sorter.getClass().getName() + ")"); for (int i = 0; i < SAMPLE; ++i) { values[i] = r.nextInt(100); } Arrays.sort(values); SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortSequential(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; for (int i = 0; i < SAMPLE; ++i) { values[i] = i; } SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortWritable(IndexedSorter sorter) throws Exception { final int SAMPLE = 1000; WritableSortable s = new WritableSortable(SAMPLE); long seed = s.getSeed(); System.out.println("sortWritable seed: " + seed + "(" + sorter.getClass().getName() + ")"); String[] values = s.getValues(); Arrays.sort(values); sorter.sort(s, 0, SAMPLE); String[] check = s.getSorted(); assertTrue("seed: " + seed + "\ndoesn't match", Arrays.equals(values, check)); }
public void sortSingleRecord(IndexedSorter sorter) throws Exception { final int SAMPLE = 1; SampleSortable s = new SampleSortable(SAMPLE); int[] values = s.getValues(); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortRandom(IndexedSorter sorter) throws Exception { final int SAMPLE = 256 * 1024; SampleSortable s = new SampleSortable(SAMPLE); long seed = s.getSeed(); System.out.println("sortRandom seed: " + seed + "(" + sorter.getClass().getName() + ")"); int[] values = s.getValues(); Arrays.sort(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue("seed: " + seed + "\ndoesn't match\n", Arrays.equals(values, check)); }
public SpanIterator sort(IndexedSorter sorter) { long start = System.currentTimeMillis(); if(length() > 1) { sorter.sort(this, 0, length(), progressable); } LOG.info(outputContext.getDestinationVertexName() + ": " + "done sorting span=" + index + ", length=" + length() + ", " + "time=" + (System.currentTimeMillis() - start)); return new SpanIterator((SortSpan)this); }
public void sortAllEqual(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; Arrays.fill(values, 10); SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); // Set random min/max, re-sort. Random r = new Random(); int min = r.nextInt(SAMPLE); int max = (min + 1 + r.nextInt(SAMPLE - 2)) % SAMPLE; values[min] = 9; values[max] = 11; System.out.println("testAllEqual setting min/max at " + min + "/" + max + "(" + sorter.getClass().getName() + ")"); s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); check = s.getSorted(); Arrays.sort(values); assertTrue(check[0] == 9); assertTrue(check[SAMPLE - 1] == 11); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
protected void sortAndSpill(long sameKeyCount, long totalKeysCount) throws IOException, InterruptedException { final int mstart = getMetaStart(); final int mend = getMetaEnd(); sorter.sort(this, mstart, mend, progressable); spill(mstart, mend, sameKeyCount, totalKeysCount); }
sort.sort(xSortable, 0, points.length);
SORTER.sort(this, 0, size);
public void sortSorted(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; Random r = new Random(); long seed = r.nextLong(); r.setSeed(seed); System.out.println("testSorted seed: " + seed + "(" + sorter.getClass().getName() + ")"); for (int i = 0; i < SAMPLE; ++i) { values[i] = r.nextInt(100); } Arrays.sort(values); SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortSequential(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; for (int i = 0; i < SAMPLE; ++i) { values[i] = i; } SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortSequential(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; for (int i = 0; i < SAMPLE; ++i) { values[i] = i; } SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortSorted(IndexedSorter sorter) throws Exception { final int SAMPLE = 500; int[] values = new int[SAMPLE]; Random r = new Random(); long seed = r.nextLong(); r.setSeed(seed); System.out.println("testSorted seed: " + seed + "(" + sorter.getClass().getName() + ")"); for (int i = 0; i < SAMPLE; ++i) { values[i] = r.nextInt(100); } Arrays.sort(values); SampleSortable s = new SampleSortable(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
sorter.sort(s, 0, shapes.size()); if (distances.elementAt(k - 1) > query_radius) { result_correct = false;
public void sortRandom(IndexedSorter sorter) throws Exception { final int SAMPLE = 256 * 1024; SampleSortable s = new SampleSortable(SAMPLE); long seed = s.getSeed(); System.out.println("sortRandom seed: " + seed + "(" + sorter.getClass().getName() + ")"); int[] values = s.getValues(); Arrays.sort(values); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue("seed: " + seed + "\ndoesn't match\n", Arrays.equals(values, check)); }
public void sortWritable(IndexedSorter sorter) throws Exception { final int SAMPLE = 1000; WritableSortable s = new WritableSortable(SAMPLE); long seed = s.getSeed(); System.out.println("sortWritable seed: " + seed + "(" + sorter.getClass().getName() + ")"); String[] values = s.getValues(); Arrays.sort(values); sorter.sort(s, 0, SAMPLE); String[] check = s.getSorted(); assertTrue("seed: " + seed + "\ndoesn't match", Arrays.equals(values, check)); }
public void sortSingleRecord(IndexedSorter sorter) throws Exception { final int SAMPLE = 1; SampleSortable s = new SampleSortable(SAMPLE); int[] values = s.getValues(); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }
public void sortSingleRecord(IndexedSorter sorter) throws Exception { final int SAMPLE = 1; SampleSortable s = new SampleSortable(SAMPLE); int[] values = s.getValues(); sorter.sort(s, 0, SAMPLE); int[] check = s.getSorted(); assertTrue(Arrays.toString(values) + "\ndoesn't match\n" + Arrays.toString(check), Arrays.equals(values, check)); }