| Modifier and Type | Field and Description |
|---|---|
| private static final boolean | |
| pack-priv static final int | |
| pack-priv static final int | |
| pack-priv static final int | |
| pack-priv static final String | |
| pack-priv static final boolean |
| Access | Constructor and Description |
|---|---|
| private |
| Modifier and Type | Method and Description |
|---|---|
| private static void | |
| private static void | mergeSort(final int[] refX, final int[] refY, final int[] srcX, final int[] dstX, final int[] srcY, final int[] dstY, final int low, final int high)
Src is the source array that starts at index 0 Dest is the (possibly larger) array destination with a possible offset low is the index in dest to start sorting high is the end index in dest to end sorting |
| pack-priv static void | mergeSortNoCopy(final int[] x, final int[] y, final int[] auxX, final int[] auxY, final int toIndex, final int insertionSortIndex, final boolean skipISort, final DPQSSorterContext sorter, final boolean useDPQS)
Modified merge sort: Input arrays are in both auxX/auxY (sorted: 0 to insertionSortIndex) and x/y (unsorted: insertionSortIndex to toIndex) Outputs are stored in x/y arrays |
| CHECK_SORTED | back to summary |
|---|---|
| private static final boolean CHECK_SORTED | |
| DISABLE_ISORT_THRESHOLD | back to summary |
|---|---|
| pack-priv static final int DISABLE_ISORT_THRESHOLD | |
| DPQS_THRESHOLD | back to summary |
|---|---|
| pack-priv static final int DPQS_THRESHOLD | |
| INSERTION_SORT_THRESHOLD | back to summary |
|---|---|
| pack-priv static final int INSERTION_SORT_THRESHOLD | |
| SORT_TYPE | back to summary |
|---|---|
| pack-priv static final String SORT_TYPE | |
| USE_DPQS | back to summary |
|---|---|
| pack-priv static final boolean USE_DPQS | |
| MergeSort | back to summary |
|---|---|
| private MergeSort() | |
| checkRange | back to summary |
|---|---|
| private static void checkRange(int[] x, int lo, int hi) | |
| mergeSort | back to summary |
|---|---|
| private static void mergeSort(final int[] refX, final int[] refY, final int[] srcX, final int[] dstX, final int[] srcY, final int[] dstY, final int low, final int high) Src is the source array that starts at index 0 Dest is the (possibly larger) array destination with a possible offset low is the index in dest to start sorting high is the end index in dest to end sorting | |
| mergeSortNoCopy | back to summary |
|---|---|
| pack-priv static void mergeSortNoCopy(final int[] x, final int[] y, final int[] auxX, final int[] auxY, final int toIndex, final int insertionSortIndex, final boolean skipISort, final DPQSSorterContext sorter, final boolean useDPQS) Modified merge sort: Input arrays are in both auxX/auxY (sorted: 0 to insertionSortIndex) and x/y (unsorted: insertionSortIndex to toIndex) Outputs are stored in x/y arrays | |
