/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() 123 for (int k = left; k < right; run[count] = k) { in sort() 125 while (++k <= right && a[k - 1] <= a[k]); in sort() 127 while (++k <= right && a[k - 1] >= a[k]); in sort() 132 for (int m = MAX_RUN_LENGTH; ++k <= right && a[k - 1] == a[k]; ) { in sort() 134 sort(a, left, right, true); in sort() 145 sort(a, left, right, true); in sort() 152 if (run[count] == right++) { // The last run contains one element in sort() [all …]
|
D | TreeMap.java | 357 p = p.right; in getEntry() 381 p = p.right; in getEntryUsingComparator() 405 if (p.right != null) { in getCeilingEntry() 406 p = p.right; in getCeilingEntry() 410 while (parent != null && ch == parent.right) { in getCeilingEntry() 432 if (p.right != null) in getFloorEntry() 433 p = p.right; in getFloorEntry() 471 if (p.right != null) { in getHigherEntry() 472 p = p.right; in getHigherEntry() 476 while (parent != null && ch == parent.right) { in getHigherEntry() [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() 148 f = rt = t.right = in compute() 233 (rt = par.right) != null) { in compute() 260 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask 297 LongCumulateTask lt = t.left, rt = t.right, f; in compute() 300 f = rt = t.right = in compute() 383 (rt = par.right) != 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 | 1806 TreeNode<K,V> right; 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() 1941 xp.right = x; in treeify() 1992 ((ch = p.right) != null && in putTreeVal() 2000 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal() 2006 xp.right = x; in putTreeVal() 2045 if (root == null || root.right == null || in removeTreeNode() 2050 TreeNode<K,V> p = this, pl = left, pr = right, replacement; in removeTreeNode() [all …]
|
D | PriorityQueue.java | 699 int right = child + 1; in siftDownComparable() local 700 if (right < size && in siftDownComparable() 701 ((Comparable<? super E>) c).compareTo((E) queue[right]) > 0) in siftDownComparable() 702 c = queue[child = right]; in siftDownComparable() 717 int right = child + 1; in siftDownUsingComparator() local 718 if (right < size && in siftDownUsingComparator() 719 comparator.compare((E) c, (E) queue[right]) > 0) in siftDownUsingComparator() 720 c = queue[child = right]; in siftDownUsingComparator()
|
D | ComparableTimSort.java | 253 int right = start; in binarySort() local 254 assert left <= right; in binarySort() 260 while (left < right) { in binarySort() 261 int mid = (left + right) >>> 1; in binarySort() 263 right = mid; in binarySort() 267 assert left == right; in binarySort() local
|
D | TimSort.java | 287 int right = start; in binarySort() local 288 assert left <= right; in binarySort() 294 while (left < right) { in binarySort() 295 int mid = (left + right) >>> 1; in binarySort() 297 right = mid; in binarySort() 301 assert left == right; in binarySort() local
|
/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() 747 protected final T_NODE right; field in Nodes.AbstractConcNode 750 AbstractConcNode(T_NODE left, T_NODE right) { in AbstractConcNode() argument 752 this.right = right; in AbstractConcNode() 757 this.size = left.count() + right.count(); in AbstractConcNode() 768 if (i == 1) return right; 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 | 715 SliceTask<P_IN, P_OUT> right = rightChild; 716 if (left == null || right == null) { 722 return (leftSize >= target) ? leftSize : leftSize + right.completedSize(target);
|
D | IntPipeline.java | 485 BinaryOperator<R> operator = (left, right) -> { 486 combiner.accept(left, right);
|
D | DoublePipeline.java | 488 BinaryOperator<R> operator = (left, right) -> { 489 combiner.accept(left, right);
|
D | LongPipeline.java | 467 BinaryOperator<R> operator = (left, right) -> { 468 combiner.accept(left, right);
|
/libcore/ojluni/src/main/java/java/util/function/ |
D | LongBinaryOperator.java | 49 long applyAsLong(long left, long right); in applyAsLong() argument
|
D | IntBinaryOperator.java | 49 int applyAsInt(int left, int right); in applyAsInt() argument
|
D | DoubleBinaryOperator.java | 48 double applyAsDouble(double left, double right); in applyAsDouble() argument
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | PriorityBlockingQueue.java | 399 int right = child + 1; in siftDownComparable() local 400 if (right < n && in siftDownComparable() 401 ((Comparable<? super T>) c).compareTo((T) array[right]) > 0) in siftDownComparable() 402 c = array[child = right]; in siftDownComparable() 420 int right = child + 1; in siftDownUsingComparator() local 421 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) in siftDownUsingComparator() 422 c = array[child = right]; in siftDownUsingComparator()
|
D | ConcurrentSkipListMap.java | 565 volatile Index<K,V> right; field in ConcurrentSkipListMap.Index 570 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { in Index() argument 573 this.right = right; in Index() 601 newSucc.right = succ; in link() 613 return node.value != null && casRight(succ, succ.right); in unlink() 636 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) { in HeadIndex() argument 637 super(node, down, right); in HeadIndex() 667 for (Index<K,V> q = head, r = q.right, d;;) { in findPredecessor() 674 r = q.right; // reread r in findPredecessor() 679 r = r.right; in findPredecessor() [all …]
|
D | ScheduledThreadPoolExecutor.java | 940 int right = child + 1; in siftDown() local 941 if (right < size && c.compareTo(queue[right]) > 0) in siftDown() 942 c = queue[child = right]; in siftDown()
|
D | ConcurrentHashMap.java | 2723 TreeNode<K,V> right; 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() 2843 xp.right = x; in TreeBin() 2954 ((ch = p.right) != null && in putTreeVal() 2962 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal() 2970 xp.right = x; in putTreeVal() 3012 if ((r = root) == null || r.right == null || // too small in removeTreeNode() 3019 TreeNode<K,V> pr = p.right; in removeTreeNode() [all …]
|
/libcore/ojluni/annotations/hiddenapi/java/util/ |
D | HashMap.java | 635 java.util.HashMap.TreeNode<K, V> right; field in HashMap.TreeNode
|
/libcore/ |
D | LICENSE | 120 right to control the distribution of derivative or collective works based on 202 other property right claims or to contest validity of any such claims; this
|
/libcore/benchmarks/src/benchmarks/regression/ |
D | R.java | 2118 public static final int right = 0; field in R
|
/libcore/ojluni/ |
D | NOTICE | 406 right to control the distribution of derivative or collective works based on 488 other property right claims or to contest validity of any such claims; this
|