本文整理了Java中java.util.Arrays.parallelSort()
方法的一些代码示例,展示了Arrays.parallelSort()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Arrays.parallelSort()
方法的具体详情如下:
包路径:java.util.Arrays
类名称:Arrays
方法名:parallelSort
暂无
代码示例来源:origin: jtablesaw/tablesaw
@Override
public void sortAscending() {
Arrays.parallelSort(data.elements());
}
代码示例来源:origin: jtablesaw/tablesaw
@Override
public void sortAscending() {
Arrays.parallelSort(data.elements());
}
代码示例来源:origin: jtablesaw/tablesaw
@Override
public void sortAscending() {
int[] sorted = data.toIntArray();
Arrays.parallelSort(sorted);
this.data = new IntArrayList(sorted);
}
代码示例来源:origin: apache/ignite
/** {@inheritDoc} */
@Override public Vector sort() {
if (isArrayBased())
Arrays.parallelSort(sto.data());
else
throw new UnsupportedOperationException();
return this;
}
代码示例来源:origin: apache/kylin
public void init(KylinConfig config, String project) {
this.project = project;
this.config = config;
if (name != null)
name = name.toUpperCase(Locale.ROOT);
if (getDatabase() != null)
setDatabase(getDatabase().toUpperCase(Locale.ROOT));
if (columns != null) {
Arrays.parallelSort(columns, new Comparator<ColumnDesc>() {
@Override
public int compare(ColumnDesc col1, ColumnDesc col2) {
Integer id1 = Integer.parseInt(col1.getId());
Integer id2 = Integer.parseInt(col2.getId());
return id1.compareTo(id2);
}
});
for (ColumnDesc col : columns) {
col.init(this);
}
}
}
代码示例来源:origin: apache/ignite
FullPageId[] objects = cpPagesList.toArray(new FullPageId[cpPagesList.size()]);
Arrays.parallelSort(objects, new Comparator<FullPageId>() {
@Override public int compare(FullPageId o1, FullPageId o2) {
int cmp = Long.compare(o1.groupId(), o2.groupId());
代码示例来源:origin: apache/kylin
@Test
public void testRandom() {
Random rand = new Random();
int n = 1000;
double[] nums = new double[n];
for (int i = 0; i < n; i++) {
nums[i] = rand.nextDouble() * 1000000;
}
Arrays.parallelSort(nums);
buf.clear();
dds.serialize(nums, buf);
buf.flip();
double[] r = dds.deserialize(buf);
assertArrayEquals(nums, r);
System.out.println("doubles size of " + (n * 8) + " bytes serialized to " + buf.limit() + " bytes");
}
代码示例来源:origin: apache/kylin
@Test
public void testRandom2() {
Random rand = new Random();
int n = 1000;
double[] nums = new double[n];
for (int i = 0; i < n; i++) {
nums[i] = rand.nextInt();
}
Arrays.parallelSort(nums);
buf.clear();
dds.serialize(nums, buf);
buf.flip();
double[] r = dds.deserialize(buf);
assertArrayEquals(nums, r);
System.out.println("doubles size of " + (n * 8) + " bytes serialized to " + buf.limit() + " bytes");
}
代码示例来源:origin: apache/kylin
private void testSpanningAndGetParent(CuboidScheduler scheduler, CubeDesc cube, long[] cuboidIds, long[] expectChildren) {
Set<Long> totalSpanning = Sets.newHashSet();
for (long cuboidId : cuboidIds) {
List<Long> spannings = scheduler.getSpanningCuboid(cuboidId);
totalSpanning.addAll(spannings);
System.out.println("Spanning result for " + cuboidId + "(" + Long.toBinaryString(cuboidId) + "): " + toString(spannings));
for (long child : spannings) {
assertTrue(scheduler.isValid(child));
}
}
long[] spanningsArray = Longs.toArray(totalSpanning);
Arrays.parallelSort(spanningsArray);
Arrays.parallelSort(expectChildren);
assertArrayEquals(expectChildren, spanningsArray);
}
代码示例来源:origin: apache/kylin
Arrays.parallelSort(timeRanges);
代码示例来源:origin: biezhi/learn-java8
public static void main(String[] args) {
long[] arrayOfLong = new long[20000];
Arrays.parallelSetAll(arrayOfLong,
index -> ThreadLocalRandom.current().nextInt(1000000));
Arrays.stream(arrayOfLong).limit(10).forEach(
i -> System.out.print(i + " "));
System.out.println();
Arrays.parallelSort(arrayOfLong);
Arrays.stream(arrayOfLong).limit(10).forEach(
i -> System.out.print(i + " "));
System.out.println();
}
}
代码示例来源:origin: torakiki/pdfsam
@Override
public <T> SelectionAndFocus move(Integer[] selected, ObservableList<T> items, int focused) {
if (isSubselection(selected, items)) {
MultipleSelectionAndFocus newSelection = new MultipleSelectionAndFocus(focused);
Arrays.parallelSort(selected, Collections.reverseOrder(Integer::compare));
if (isNotLast(selected, items)) {
Arrays.stream(selected).forEach(i -> {
Collections.swap(items, i, i + 1);
newSelection.moveDown(i);
});
return newSelection;
}
}
return SelectionAndFocus.NULL;
}
},
代码示例来源:origin: torakiki/pdfsam
@Override
public <T> SelectionAndFocus move(Integer[] selected, ObservableList<T> items, int focused) {
if (isSubselection(selected, items)) {
MultipleSelectionAndFocus newSelection = new MultipleSelectionAndFocus(focused);
Arrays.parallelSort(selected);
if (isNotFirst(selected)) {
Arrays.stream(selected).forEach(i -> {
Collections.swap(items, i, i - 1);
newSelection.moveUp(i);
});
return newSelection;
}
}
return SelectionAndFocus.NULL;
}
},
代码示例来源:origin: optimatika/ojAlgo
@Override
public final void sortAscending() {
Arrays.parallelSort(data);
}
代码示例来源:origin: stackoverflow.com
public static void main(String[] args) {
String[] strings = { "x", "a", "c", "b", "y" };
Arrays.parallelSort(strings);
System.out.println(Arrays.toString(strings)); // [a, b, c, x, y]
}
代码示例来源:origin: blueconic/browscap-java
static Rule[] getOrderedRules(final Rule[] rules) {
final Comparator<Rule> c = Comparator.comparing(Rule::getSize).reversed().thenComparing(Rule::getPattern);
final Rule[] result = Arrays.copyOf(rules, rules.length);
parallelSort(result, c);
return result;
}
代码示例来源:origin: BruceEckel/OnJava8-Examples
@Benchmark
public void parallelSort() {
Arrays.parallelSort(la);
}
}
代码示例来源:origin: optimatika/ojAlgo
@Override
public void sortDescending() {
Primitive64Array.negate(data, 0, data.length, 1, data);
Arrays.parallelSort(data);
Primitive64Array.negate(data, 0, data.length, 1, data);
}
代码示例来源:origin: optimatika/ojAlgo
@Override
public void sortDescending() {
Primitive32Array.negate(data, 0, data.length, 1, data);
Arrays.parallelSort(data);
Primitive32Array.negate(data, 0, data.length, 1, data);
}
代码示例来源:origin: org.ojalgo/ojalgo
@Override
public void sortDescending() {
Primitive32Array.negate(data, 0, data.length, 1, data);
Arrays.parallelSort(data);
Primitive32Array.negate(data, 0, data.length, 1, data);
}
内容来源于网络,如有侵权,请联系作者删除!