| /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 | 252 int left = lo; in binarySort() local
254 assert left <= right; in binarySort() local
260 while (left < right) { in binarySort()
261 int mid = (left + right) >>> 1; in binarySort()
265 left = mid + 1; in binarySort()
267 assert left == right; in binarySort()
276 int n = start - left; // The number of elements to move in binarySort()
279 case 2: a[left + 2] = a[left + 1]; in binarySort()
280 case 1: a[left + 1] = a[left]; in binarySort()
282 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 | 286 int left = lo; in binarySort() local
288 assert left <= right; in binarySort() local
294 while (left < right) { in binarySort()
295 int mid = (left + right) >>> 1; in binarySort()
299 left = mid + 1; in binarySort()
301 assert left == right; in binarySort()
310 int n = start - left; // The number of elements to move in binarySort()
313 case 2: a[left + 2] = a[left + 1]; in binarySort()
314 case 1: a[left + 1] = a[left]; in binarySort()
316 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
[all …]
|
| D | ArrayPrefixHelpers.java | 108 CumulateTask<T> left, right; field in ArrayPrefixHelpers.CumulateTask
145 CumulateTask<T> lt = t.left, rt = t.right, f; in compute()
150 t = lt = t.left = in compute()
232 if ((lt = par.left) != null && in compute()
260 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask
297 LongCumulateTask lt = t.left, rt = t.right, f; in compute()
302 t = lt = t.left = in compute()
382 if ((lt = par.left) != null && in compute()
410 DoubleCumulateTask left, right; field in ArrayPrefixHelpers.DoubleCumulateTask
447 DoubleCumulateTask lt = t.left, rt = t.right, f; in compute()
[all …]
|
| D | HashMap.java | 1805 TreeNode<K,V> left; field in HashMap.TreeNode
1858 TreeNode<K,V> pl = p.left, pr = p.right, q; in find()
1913 x.left = x.right = null; in treeify()
1936 if ((p = (dir <= 0) ? p.left : p.right) == null) { in treeify()
1939 xp.left = x; in treeify()
1990 if (((ch = p.left) != null && in putTreeVal()
2000 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2004 xp.left = x; in putTreeVal()
2046 (rl = root.left) == null || rl.left == null) { in removeTreeNode()
2050 TreeNode<K,V> p = this, pl = left, pr = right, replacement; in removeTreeNode()
[all …]
|
| /libcore/ojluni/src/main/java/sun/security/util/ |
| D | Debug.java | 253 StringBuffer left = new StringBuffer(); in marshal() local
260 matcher.appendReplacement(left, ""); in marshal()
262 matcher.appendTail(left); in marshal()
263 source = left; in marshal()
277 left = new StringBuffer(); in marshal()
284 matcher.appendReplacement(left, ""); in marshal()
286 matcher.appendTail(left); in marshal()
287 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 | 689 SliceTask<P_IN, P_OUT> left = parent.leftChild;
690 if (left != null) {
691 size += left.completedSize(target);
714 SliceTask<P_IN, P_OUT> left = leftChild;
716 if (left == null || right == null) {
721 long leftSize = left.completedSize(target);
|
| D | DoublePipeline.java | 488 BinaryOperator<R> operator = (left, right) -> {
489 combiner.accept(left, right);
490 return left;
|
| D | IntPipeline.java | 485 BinaryOperator<R> operator = (left, right) -> {
486 combiner.accept(left, right);
487 return left;
|
| D | LongPipeline.java | 467 BinaryOperator<R> operator = (left, right) -> {
468 combiner.accept(left, right);
469 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/util/concurrent/ |
| D | ConcurrentHashMap.java | 2722 TreeNode<K,V> left; field in ConcurrentHashMap.TreeNode
2746 TreeNode<K,V> pl = p.left, pr = p.right; in findTreeNode()
2816 x.left = x.right = null; in TreeBin()
2838 if ((p = (dir <= 0) ? p.left : p.right) == null) { in TreeBin()
2841 xp.left = x; in TreeBin()
2952 if (((ch = p.left) != null && in putTreeVal()
2962 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2968 xp.left = x; in putTreeVal()
3013 (rl = r.left) == null || rl.left == null) in removeTreeNode()
3018 TreeNode<K,V> pl = p.left; in removeTreeNode()
[all …]
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | HashMap.java | 627 java.util.HashMap.TreeNode<K, V> left; field in HashMap.TreeNode
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 1848 public static final int left = 0; field in R
|
| /libcore/luni/src/main/java/libcore/net/ |
| D | mime.types | 5 # The format of this file is a media type on the left and zero or more
|