How to use

mergeSort

method

in

java.util.Arrays

/** To be removed in a future release. */
private static <T> void legacyMergeSort(T[] a, Comparator<? super T> c) {
  T[] aux = a.clone();
  if (c==null)
    mergeSort(aux, a, 0, a.length, 0);
  else
    mergeSort(aux, a, 0, a.length, 0, c);
}

/** To be removed in a future release. */
private static <T> void legacyMergeSort(T[] a, Comparator<? super T> c) {
  T[] aux = a.clone();
  if (c==null)
    mergeSort(aux, a, 0, a.length, 0);
  else
    mergeSort(aux, a, 0, a.length, 0, c);
}

/** To be removed in a future release. */
private static <T> void legacyMergeSort(T[] a, Comparator<? super T> c) {
  T[] aux = a.clone();
  if (c==null)
    mergeSort(aux, a, 0, a.length, 0);
  else
    mergeSort(aux, a, 0, a.length, 0, c);
}

java.lang.NullPointerException
 at entitybeans.jpa.MovieFacade$1.compare(MovieFacade.java:65)
 at java.util.Arrays.mergeSort(Arrays.java:1270)
 at java.util.Arrays.sort(Arrays.java:1210)
 at java.util.Collections.sort(Collections.java:159)
 at entitybeans.jpa.MovieFacade.findRange(MovieFacade.java:61)
 ...

/** To be removed in a future release. */
private static <T> void legacyMergeSort(T[] a, int fromIndex, int toIndex,
                    Comparator<? super T> c) {
  rangeCheck(a.length, fromIndex, toIndex);
  T[] aux = copyOfRange(a, fromIndex, toIndex);
  if (c==null)
    mergeSort(aux, a, fromIndex, toIndex, -fromIndex);
  else
    mergeSort(aux, a, fromIndex, toIndex, -fromIndex, c);
}

/** To be removed in a future release. */
private static <T> void legacyMergeSort(T[] a, int fromIndex, int toIndex,
                    Comparator<? super T> c) {
  rangeCheck(a.length, fromIndex, toIndex);
  T[] aux = copyOfRange(a, fromIndex, toIndex);
  if (c==null)
    mergeSort(aux, a, fromIndex, toIndex, -fromIndex);
  else
    mergeSort(aux, a, fromIndex, toIndex, -fromIndex, c);
}

/** To be removed in a future release. */
private static <T> void legacyMergeSort(T[] a, int fromIndex, int toIndex,
                    Comparator<? super T> c) {
  rangeCheck(a.length, fromIndex, toIndex);
  T[] aux = copyOfRange(a, fromIndex, toIndex);
  if (c==null)
    mergeSort(aux, a, fromIndex, toIndex, -fromIndex);
  else
    mergeSort(aux, a, fromIndex, toIndex, -fromIndex, c);
}

/** To be removed in a future release. */
private static void legacyMergeSort(Object[] a,
                  int fromIndex, int toIndex) {
  rangeCheck(a.length, fromIndex, toIndex);
  Object[] aux = copyOfRange(a, fromIndex, toIndex);
  mergeSort(aux, a, fromIndex, toIndex, -fromIndex);
}

/** To be removed in a future release. */
private static void legacyMergeSort(Object[] a) {
  Object[] aux = a.clone();
  mergeSort(aux, a, 0, a.length, 0);
}

/** To be removed in a future release. */
private static void legacyMergeSort(Object[] a) {
  Object[] aux = a.clone();
  mergeSort(aux, a, 0, a.length, 0);
}

/** To be removed in a future release. */
private static void legacyMergeSort(Object[] a,
                  int fromIndex, int toIndex) {
  rangeCheck(a.length, fromIndex, toIndex);
  Object[] aux = copyOfRange(a, fromIndex, toIndex);
  mergeSort(aux, a, fromIndex, toIndex, -fromIndex);
}

/** To be removed in a future release. */
private static void legacyMergeSort(Object[] a) {
  Object[] aux = a.clone();
  mergeSort(aux, a, 0, a.length, 0);
}

/** To be removed in a future release. */
private static void legacyMergeSort(Object[] a,
                  int fromIndex, int toIndex) {
  rangeCheck(a.length, fromIndex, toIndex);
  Object[] aux = copyOfRange(a, fromIndex, toIndex);
  mergeSort(aux, a, fromIndex, toIndex, -fromIndex);
}

high += off;
int mid = (low + high) >>> 1;
mergeSort(dest, src, low, mid, -off);
mergeSort(dest, src, mid, high, -off);

high += off;
int mid = (low + high) >>> 1;
mergeSort(dest, src, low, mid, -off);
mergeSort(dest, src, mid, high, -off);

high += off;
int mid = (low + high) >>> 1;
mergeSort(dest, src, low, mid, -off, c);
mergeSort(dest, src, mid, high, -off, c);

high += off;
int mid = (low + high) >>> 1;
mergeSort(dest, src, low, mid, -off, c);
mergeSort(dest, src, mid, high, -off, c);

high += off;
int mid = (low + high) >>> 1;
mergeSort(dest, src, low, mid, -off, c);
mergeSort(dest, src, mid, high, -off, c);

high += off;
int mid = (low + high) >>> 1;
mergeSort(dest, src, low, mid, -off);
mergeSort(dest, src, mid, high, -off);