Class Sort

java.lang.Object
org.apache.datasketches.tdigest.Sort
public final class Sort extends Object
Specialized sorting algorithm that can sort one array and permute another array the same way.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Sort()
    No argument constructor.

  • Method Summary

    Modifier and Type
    Method
    Description
    static void
    reverse(double[] values, int n)
    Reverse the first n elements of the given array.
    static void
    reverse(long[] values, int n)
    Reverse the first n elements of the given array.
    static void
    stableSort(double[] keys, long[] values, int n)
    Sort two arrays so that the result is deterministic.

    Methods inherited from class Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Sort

      public Sort()
      No argument constructor.

  • Method Details

    • stableSort

      public static void stableSort(double[] keys, long[] values, int n)
      Sort two arrays so that the result is deterministic. The elements are ordered by key (ascending) and, if the keys are equal, by the paired value (ascending). The first array is sorted while the second array is permuted the same way.

      Because the pairs (key, value) are totally ordered, the output depends only on the multiset of pairs and not on the initial order of the elements nor on the choice of pivots.

      Parameters:
      keys - array to be sorted
      values - array to be permuted the same way, also used to break ties between equal keys
      n - number of elements to sort from the beginning of the arrays

    • reverse

      public static void reverse(double[] values, int n)
      Reverse the first n elements of the given array.
      Parameters:
      values - array to be reversed
      n - number of elements to reverse

    • reverse

      public static void reverse(long[] values, int n)
      Reverse the first n elements of the given array.
      Parameters:
      values - array to be reversed
      n - number of elements to reverse