Java Code Examples for it.unimi.dsi.fastutil.ints.IntArrays#parallelQuickSort()

The following examples show how to use it.unimi.dsi.fastutil.ints.IntArrays#parallelQuickSort() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: Table.java    From tablesaw with Apache License 2.0 5 votes vote down vote up 
/** Returns a copy of this table sorted using the given comparator */
private Table sortOn(IntComparator rowComparator) {
  Table newTable = emptyCopy(rowCount());

  int[] newRows = rows();
  IntArrays.parallelQuickSort(newRows, rowComparator);

  Rows.copyRowsToTable(newRows, this, newTable);
  return newTable;
}
Example 2
Source File: TableSlice.java    From tablesaw with Apache License 2.0 5 votes vote down vote up 
/** Returns an array of integers representing the source table indexes in sorted order. */
private int[] sortOn(IntComparator rowComparator) {
  int[] newRows;
  if (hasSelection()) {
    newRows = this.selection.toArray();
  } else {
    newRows = IntStream.range(0, table.rowCount()).toArray();
  }
  IntArrays.parallelQuickSort(newRows, rowComparator);
  return newRows;
}
Example 3
Source File: Table.java    From tablesaw with Apache License 2.0 5 votes vote down vote up 
/** Returns a copy of this table sorted using the given comparator */
private Table sortOn(IntComparator rowComparator) {
  Table newTable = emptyCopy(rowCount());

  int[] newRows = rows();
  IntArrays.parallelQuickSort(newRows, rowComparator);

  Rows.copyRowsToTable(newRows, this, newTable);
  return newTable;
}
Example 4
Source File: TableSlice.java    From tablesaw with Apache License 2.0 5 votes vote down vote up 
/** Returns an array of integers representing the source table indexes in sorted order. */
private int[] sortOn(IntComparator rowComparator) {
  int[] newRows;
  if (hasSelection()) {
    newRows = this.selection.toArray();
  } else {
    newRows = IntStream.range(0, table.rowCount()).toArray();
  }
  IntArrays.parallelQuickSort(newRows, rowComparator);
  return newRows;
}
Example 5
Source File: IntDictionaryMap.java    From tablesaw with Apache License 2.0 4 votes vote down vote up 
@Override
public void sortAscending() {
  int[] elements = values.toIntArray();
  IntArrays.parallelQuickSort(elements, dictionarySortComparator);
  this.values = new IntArrayList(elements);
}
Example 6
Source File: IntDictionaryMap.java    From tablesaw with Apache License 2.0 4 votes vote down vote up 
@Override
public void sortDescending() {
  int[] elements = values.toIntArray();
  IntArrays.parallelQuickSort(elements, reverseDictionarySortComparator);
  this.values = new IntArrayList(elements);
}
Example 7
Source File: IntDictionaryMap.java    From tablesaw with Apache License 2.0 4 votes vote down vote up 
@Override
public void sortAscending() {
  int[] elements = values.toIntArray();
  IntArrays.parallelQuickSort(elements, dictionarySortComparator);
  this.values = new IntArrayList(elements);
}
Example 8
Source File: IntDictionaryMap.java    From tablesaw with Apache License 2.0 4 votes vote down vote up 
@Override
public void sortDescending() {
  int[] elements = values.toIntArray();
  IntArrays.parallelQuickSort(elements, reverseDictionarySortComparator);
  this.values = new IntArrayList(elements);
}