| /libcore/ojluni/src/main/java/java/util/ |
| D | DualPivotQuicksort.java | 107 static void sort(int[] a, int left, int right, in sort() argument
110 if (right - left < QUICKSORT_THRESHOLD) { in sort()
111 sort(a, left, right, true); in sort()
120 int count = 0; run[0] = left; in sort()
123 for (int k = left; k < right; run[count] = k) { in sort()
134 sort(a, left, right, true); in sort()
145 sort(a, left, right, true); in sort()
165 int blen = right - left; // space needed for b in sort()
171 System.arraycopy(a, left, work, workBase, blen); in sort()
175 ao = workBase - left; in sort()
[all …]
|
| D | ComparableTimSort.java | 248 int left = lo; in binarySort() local
250 assert left <= right; in binarySort() local
256 while (left < right) { in binarySort()
257 int mid = (left + right) >>> 1; in binarySort()
261 left = mid + 1; in binarySort()
263 assert left == right; in binarySort()
272 int n = start - left; // The number of elements to move in binarySort()
275 case 2: a[left + 2] = a[left + 1]; in binarySort()
276 case 1: a[left + 1] = a[left]; in binarySort()
278 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
[all …]
|
| D | TreeMap.java | 355 p = p.left; in getEntry()
379 p = p.left; in getEntryUsingComparator()
400 if (p.left != null) in getCeilingEntry()
401 p = p.left; in getCeilingEntry()
437 if (p.left != null) { in getFloorEntry()
438 p = p.left; in getFloorEntry()
442 while (parent != null && ch == parent.left) { in getFloorEntry()
466 if (p.left != null) in getHigherEntry()
467 p = p.left; in getHigherEntry()
502 if (p.left != null) { in getLowerEntry()
[all …]
|
| D | TimSort.java | 282 int left = lo; in binarySort() local
284 assert left <= right; in binarySort() local
290 while (left < right) { in binarySort()
291 int mid = (left + right) >>> 1; in binarySort()
295 left = mid + 1; in binarySort()
297 assert left == right; in binarySort()
306 int n = start - left; // The number of elements to move in binarySort()
309 case 2: a[left + 2] = a[left + 1]; in binarySort()
310 case 1: a[left + 1] = a[left]; in binarySort()
312 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
[all …]
|
| D | ArrayPrefixHelpers.java | 79 CumulateTask<T> left, right; field in ArrayPrefixHelpers.CumulateTask
116 CumulateTask<T> lt = t.left, rt = t.right, f; in compute()
121 t = lt = t.left = in compute()
203 if ((lt = par.left) != null && in compute()
231 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask
268 LongCumulateTask lt = t.left, rt = t.right, f; in compute()
273 t = lt = t.left = in compute()
353 if ((lt = par.left) != null && in compute()
381 DoubleCumulateTask left, right; field in ArrayPrefixHelpers.DoubleCumulateTask
418 DoubleCumulateTask lt = t.left, rt = t.right, f; in compute()
[all …]
|
| /libcore/luni/src/main/native/ |
| D | canonicalize_path.cpp | 62 std::string left(path + 1); in canonicalize_path() local
63 while (!left.empty()) { in canonicalize_path()
65 size_t nextSlash = left.find('/'); in canonicalize_path()
66 std::string nextPathComponent = left.substr(0, nextSlash); in canonicalize_path()
68 left.erase(0, nextSlash + 1); in canonicalize_path()
70 left.clear(); in canonicalize_path()
111 if (!left.empty()) { in canonicalize_path()
113 left = symlink + maybeSlash + left; in canonicalize_path()
115 left = symlink; in canonicalize_path()
|
| /libcore/ojluni/src/main/java/sun/security/util/ |
| D | Debug.java | 201 StringBuffer left = new StringBuffer(); in marshal() local
208 matcher.appendReplacement(left, ""); in marshal()
210 matcher.appendTail(left); in marshal()
211 source = left; in marshal()
225 left = new StringBuffer(); in marshal()
232 matcher.appendReplacement(left, ""); in marshal()
234 matcher.appendTail(left); in marshal()
235 source = left; in marshal()
|
| /libcore/ojluni/src/main/java/sun/nio/ch/ |
| D | IOUtil.java | 151 long left = bytesWritten; in write() local
153 if (left > 0) { in write()
157 int n = (left > rem) ? rem : (int)left; in write()
159 left -= n; in write()
281 long left = bytesRead; in read() local
284 if (left > 0) { in read()
287 int n = (left > rem) ? rem : (int)left; in read()
295 left -= n; in read()
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| D | Nodes.java | 113 static <T> Node<T> conc(StreamShape shape, Node<T> left, Node<T> right) { in conc() argument
116 return new ConcNode<>(left, right); in conc()
118 return (Node<T>) new ConcNode.OfInt((Node.OfInt) left, (Node.OfInt) right); in conc()
120 return (Node<T>) new ConcNode.OfLong((Node.OfLong) left, (Node.OfLong) right); in conc()
122 return (Node<T>) new ConcNode.OfDouble((Node.OfDouble) left, (Node.OfDouble) right); in conc()
746 protected final T_NODE left; field in Nodes.AbstractConcNode
750 AbstractConcNode(T_NODE left, T_NODE right) { in AbstractConcNode() argument
751 this.left = left; in AbstractConcNode()
757 this.size = left.count() + right.count(); in AbstractConcNode()
767 if (i == 0) return left; in getChild()
[all …]
|
| D | Collectors.java | 231 (left, right) -> { left.addAll(right); return left; },
252 (left, right) -> { left.addAll(right); return left; },
1141 BinaryOperator<Partition<A>> merger = (left, right) ->
1142 new Partition<>(op.apply(left.forTrue, right.forTrue),
1143 op.apply(left.forFalse, right.forFalse));
|
| D | SliceOps.java | 677 SliceTask<P_IN, P_OUT> left = parent.leftChild;
678 if (left != null) {
679 size += left.completedSize(target);
702 SliceTask<P_IN, P_OUT> left = leftChild;
704 if (left == null || right == null) {
709 long leftSize = left.completedSize(target);
|
| D | LongPipeline.java | 451 BinaryOperator<R> operator = (left, right) -> {
452 combiner.accept(left, right);
453 return left;
|
| D | DoublePipeline.java | 473 BinaryOperator<R> operator = (left, right) -> {
474 combiner.accept(left, right);
475 return left;
|
| D | IntPipeline.java | 469 BinaryOperator<R> operator = (left, right) -> {
470 combiner.accept(left, right);
471 return left;
|
| /libcore/ojluni/src/main/java/java/util/function/ |
| D | IntBinaryOperator.java | 49 int applyAsInt(int left, int right); in applyAsInt() argument
|
| D | LongBinaryOperator.java | 49 long applyAsLong(long left, long right); in applyAsLong() argument
|
| D | DoubleBinaryOperator.java | 48 double applyAsDouble(double left, double right); in applyAsDouble() argument
|
| /libcore/ojluni/src/main/java/java/text/ |
| D | DigitList.java | 531 int left = MAX_COUNT; in set() local
534 digits[--left] = (char)('0' + (source % 10)); in set()
537 decimalAt = MAX_COUNT - left; in set()
542 count = right - left + 1; in set()
543 System.arraycopy(digits, left, digits, 0, count); in set()
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 2691 TreeNode<K,V> left; field in ConcurrentHashMap.TreeNode
2715 TreeNode<K,V> pl = p.left, pr = p.right; in findTreeNode()
2785 x.left = x.right = null; in TreeBin()
2807 if ((p = (dir <= 0) ? p.left : p.right) == null) { in TreeBin()
2810 xp.left = x; in TreeBin()
2921 if (((ch = p.left) != null && in putTreeVal()
2931 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2937 xp.left = x; in putTreeVal()
2982 (rl = r.left) == null || rl.left == null) in removeTreeNode()
2987 TreeNode<K,V> pl = p.left; in removeTreeNode()
[all …]
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 1848 public static final int left = 0; field in R
|