Searched defs:work (Results 1 - 3 of 3) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DDualPivotQuicksort.java18 * 2 along with this work; if not, write to the Free Software Foundation,
103 * @param work a workspace array (slice)
104 * @param workBase origin of usable space in work array
105 * @param workLen usable size of work array
108 int[] work, int workBase, int workLen) {
166 if (work == null || workLen < blen || workBase + blen > work.length) {
167 work = new int[blen];
171 System.arraycopy(a, left, work, workBase, blen);
174 a = work;
107 sort(int[] a, int left, int right, int[] work, int workBase, int workLen) argument
555 sort(long[] a, int left, int right, long[] work, int workBase, int workLen) argument
1003 sort(short[] a, int left, int right, short[] work, int workBase, int workLen) argument
1039 doSort(short[] a, int left, int right, short[] work, int workBase, int workLen) argument
1487 sort(char[] a, int left, int right, char[] work, int workBase, int workLen) argument
1523 doSort(char[] a, int left, int right, char[] work, int workBase, int workLen) argument
2012 sort(float[] a, int left, int right, float[] work, int workBase, int workLen) argument
2103 doSort(float[] a, int left, int right, float[] work, int workBase, int workLen) argument
2551 sort(double[] a, int left, int right, double[] work, int workBase, int workLen) argument
2642 doSort(double[] a, int left, int right, double[] work, int workBase, int workLen) argument
[all...]
H A DComparableTimSort.java19 * 2 along with this work; if not, write to the Free Software Foundation,
49 * implementation, but 32 was empirically determined to work better in
116 * @param work a workspace array (slice)
117 * @param workBase origin of usable space in work array
118 * @param workLen usable size of work array
120 private ComparableTimSort(Object[] a, Object[] work, int workBase, int workLen) { argument
127 if (work == null || workLen < tlen || workBase + tlen > work.length) {
133 tmp = work;
170 * @param work
175 sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) argument
[all...]
H A DTimSort.java19 * 2 along with this work; if not, write to the Free Software Foundation,
69 * implementation, but 32 was empirically determined to work better in
142 * @param work a workspace array (slice)
143 * @param workBase origin of usable space in work array
144 * @param workLen usable size of work array
146 private TimSort(T[] a, Comparator<? super T> c, T[] work, int workBase, int workLen) { argument
154 if (work == null || workLen < tlen || workBase + tlen > work.length) {
163 tmp = work;
201 * @param work
206 sort(T[] a, int lo, int hi, Comparator<? super T> c, T[] work, int workBase, int workLen) argument
[all...]

Completed in 61 milliseconds