protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a,fromIndex,toIndex,c); } protected void runSort(int fromIndex, int toIndex, IntComparator c, cern.colt.Swapper swapper) {
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a,fromIndex,toIndex,c); } protected void runSort(int fromIndex, int toIndex, IntComparator c, cern.colt.Swapper swapper) {
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a,fromIndex,toIndex,c); } protected void runSort(int fromIndex, int toIndex, IntComparator c, cern.colt.Swapper swapper) {
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a,fromIndex,toIndex,c); } protected void runSort(int fromIndex, int toIndex, IntComparator c, cern.colt.Swapper swapper) {
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
protected void runSort(int[] a, int fromIndex, int toIndex, IntComparator c) { cern.colt.Sorting.mergeSort(a, fromIndex, toIndex, c); }
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is a modified mergesort (in which the merge is * omitted if the highest element in the low sublist is less than the * lowest element in the high sublist). This algorithm offers guaranteed * n*log(n) performance, and can approach linear performance on nearly * sorted lists. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException index is out of range (<tt>size()>0 && (from<0 || from>to || to>=size())</tt>). */ public void mergeSortFromTo(int from, int to) { int mySize = size(); checkRangeFromTo(from, to, mySize); double[] myElements = elements(); cern.colt.Sorting.mergeSort(myElements, from, to+1); elements(myElements); setSizeRaw(mySize); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is a modified mergesort (in which the merge is * omitted if the highest element in the low sublist is less than the * lowest element in the high sublist). This algorithm offers guaranteed * n*log(n) performance, and can approach linear performance on nearly * sorted lists. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException index is out of range (<tt>size()>0 && (from<0 || from>to || to>=size())</tt>). */ public void mergeSortFromTo(int from, int to) { int mySize = size(); checkRangeFromTo(from, to, mySize); int[] myElements = elements(); cern.colt.Sorting.mergeSort(myElements, from, to+1); elements(myElements); setSizeRaw(mySize); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is a modified mergesort (in which the merge is * omitted if the highest element in the low sublist is less than the * lowest element in the high sublist). This algorithm offers guaranteed * n*log(n) performance, and can approach linear performance on nearly * sorted lists. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException index is out of range (<tt>size()>0 && (from<0 || from>to || to>=size())</tt>). */ public void mergeSortFromTo(int from, int to) { int mySize = size(); checkRangeFromTo(from, to, mySize); char[] myElements = elements(); cern.colt.Sorting.mergeSort(myElements, from, to+1); elements(myElements); setSizeRaw(mySize); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is a modified mergesort (in which the merge is * omitted if the highest element in the low sublist is less than the * lowest element in the high sublist). This algorithm offers guaranteed * n*log(n) performance, and can approach linear performance on nearly * sorted lists. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException index is out of range (<tt>size()>0 && (from<0 || from>to || to>=size())</tt>). */ public void mergeSortFromTo(int from, int to) { int mySize = size(); checkRangeFromTo(from, to, mySize); long[] myElements = elements(); cern.colt.Sorting.mergeSort(myElements, from, to+1); elements(myElements); setSizeRaw(mySize); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is a modified mergesort (in which the merge is * omitted if the highest element in the low sublist is less than the * lowest element in the high sublist). This algorithm offers guaranteed * n*log(n) performance, and can approach linear performance on nearly * sorted lists. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException index is out of range (<tt>size()>0 && (from<0 || from>to || to>=size())</tt>). */ public void mergeSortFromTo(int from, int to) { int mySize = size(); checkRangeFromTo(from, to, mySize); short[] myElements = elements(); cern.colt.Sorting.mergeSort(myElements, from, to+1); elements(myElements); setSizeRaw(mySize); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is a modified mergesort (in which the merge is * omitted if the highest element in the low sublist is less than the * lowest element in the high sublist). This algorithm offers guaranteed * n*log(n) performance, and can approach linear performance on nearly * sorted lists. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException index is out of range (<tt>size()>0 && (from<0 || from>to || to>=size())</tt>). */ public void mergeSortFromTo(int from, int to) { int mySize = size(); checkRangeFromTo(from, to, mySize); double[] myElements = elements(); cern.colt.Sorting.mergeSort(myElements, from, to+1); elements(myElements); setSizeRaw(mySize); } /**