Home
last modified time | relevance | path

Searched refs:workLen (Results 1 – 3 of 3) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DDualPivotQuicksort.java108 int[] work, int workBase, int workLen) { in sort() argument
166 if (work == null || workLen < blen || workBase + blen > work.length) { in sort()
556 long[] work, int workBase, int workLen) { in sort() argument
614 if (work == null || workLen < blen || workBase + blen > work.length) { in sort()
1004 short[] work, int workBase, int workLen) { in sort() argument
1022 doSort(a, left, right, work, workBase, workLen); in sort()
1040 short[] work, int workBase, int workLen) { in doSort() argument
1098 if (work == null || workLen < blen || workBase + blen > work.length) { in doSort()
1488 char[] work, int workBase, int workLen) { in sort() argument
1506 doSort(a, left, right, work, workBase, workLen); in sort()
[all …]
DComparableTimSort.java120 private ComparableTimSort(Object[] a, Object[] work, int workBase, int workLen) { in ComparableTimSort() argument
127 if (work == null || workLen < tlen || workBase + tlen > work.length) { in ComparableTimSort()
135 tmpLen = workLen; in ComparableTimSort()
179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort() argument
198 ComparableTimSort ts = new ComparableTimSort(a, work, workBase, workLen); in sort()
DTimSort.java146 private TimSort(T[] a, Comparator<? super T> c, T[] work, int workBase, int workLen) { in TimSort() argument
154 if (work == null || workLen < tlen || workBase + tlen > work.length) { in TimSort()
165 tmpLen = workLen; in TimSort()
211 T[] work, int workBase, int workLen) { in sort() argument
230 TimSort<T> ts = new TimSort<>(a, c, work, workBase, workLen); in sort()