/libcore/ojluni/src/main/java/java/util/function/ |
H A D | DoubleBinaryOperator.java | 45 * @param right the second operand 48 double applyAsDouble(double left, double right); argument
|
H A D | IntBinaryOperator.java | 46 * @param right the second operand 49 int applyAsInt(int left, int right); argument
|
H A D | LongBinaryOperator.java | 46 * @param right the second operand 49 long applyAsLong(long left, long right); argument
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | DualPivotQuicksort.java | 102 * @param right the index of the last element, inclusive, to be sorted 107 static void sort(int[] a, int left, int right, argument 110 if (right - left < QUICKSORT_THRESHOLD) { 111 sort(a, left, right, true); 123 for (int k = left; k < right; run[count] = k) { 125 while (++k <= right && a[k - 1] <= a[k]); 127 while (++k <= right && a[k - 1] >= a[k]); 132 for (int m = MAX_RUN_LENGTH; ++k <= right && a[k - 1] == a[k]; ) { 134 sort(a, left, right, true); 145 sort(a, left, right, tru 214 sort(int[] a, int left, int right, boolean leftmost) argument 555 sort(long[] a, int left, int right, long[] work, int workBase, int workLen) argument 662 sort(long[] a, int left, int right, boolean leftmost) 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 1146 sort(short[] a, int left, int right, boolean leftmost) 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 1630 sort(char[] a, int left, int right, boolean leftmost) argument 1970 sort(byte[] a, int left, int right) 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 2210 sort(float[] a, int left, int right, boolean leftmost) 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 2749 sort(double[] a, int left, int right, boolean leftmost) argument [all...] |
H A D | TreeMap.java | 357 p = p.right; 381 p = p.right; 405 if (p.right != null) { 406 p = p.right; 410 while (parent != null && ch == parent.right) { 432 if (p.right != null) 433 p = p.right; 471 if (p.right != null) { 472 p = p.right; 476 while (parent != null && ch == parent.right) { 2103 TreeMapEntry<K,V> right = null; field in class:TreeMap.TreeMapEntry [all...] |
H A D | PriorityQueue.java | 699 int right = child + 1; 700 if (right < size && 701 ((Comparable<? super E>) c).compareTo((E) queue[right]) > 0) 702 c = queue[child = right]; 717 int right = child + 1; 718 if (right < size && 719 comparator.compare((E) c, (E) queue[right]) > 0) 720 c = queue[child = right];
|
H A D | ArrayPrefixHelpers.java | 35 * even if some right-hand side first passes are still executing. 79 CumulateTask<T> left, right; field in class:ArrayPrefixHelpers.CumulateTask 116 CumulateTask<T> lt = t.left, rt = t.right, f; 119 f = rt = t.right = 204 (rt = par.right) != null) { 231 LongCumulateTask left, right; field in class:ArrayPrefixHelpers.LongCumulateTask 268 LongCumulateTask lt = t.left, rt = t.right, f; 271 f = rt = t.right = 354 (rt = par.right) != null) { 381 DoubleCumulateTask left, right; field in class:ArrayPrefixHelpers.DoubleCumulateTask 531 IntCumulateTask left, right; field in class:ArrayPrefixHelpers.IntCumulateTask [all...] |
H A D | ComparableTimSort.java | 190 * March over the array once, left to right, finding natural runs, 247 // Set left (and right) to the index where a[start] (pivot) belongs 249 int right = start; 250 assert left <= right; 254 * pivot < all in [right, start). 256 while (left < right) { 257 int mid = (left + right) >>> 1; 259 right = mid; 263 assert left == right; 506 // Gallop right unti [all...] |
H A D | TimSort.java | 222 * March over the array once, left to right, finding natural runs, 281 // Set left (and right) to the index where a[start] (pivot) belongs 283 int right = start; 284 assert left <= right; 288 * pivot < all in [right, start). 290 while (left < right) { 291 int mid = (left + right) >>> 1; 293 right = mid; 297 assert left == right; 539 // Gallop right unti [all...] |
/libcore/ojluni/src/main/java/java/text/ |
H A D | DigitList.java | 62 * derived by placing all the digits of the list to the right of the 92 * the right of the decimal. 532 int right; 540 for (right = MAX_COUNT - 1; digits[right] == '0'; --right) 542 count = right - left + 1; 581 int right; 582 for (right = len - 1; right > [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | Nodes.java | 107 * @param right the right input node 113 static <T> Node<T> conc(StreamShape shape, Node<T> left, Node<T> right) { argument 116 return new ConcNode<>(left, right); 118 return (Node<T>) new ConcNode.OfInt((Node.OfInt) left, (Node.OfInt) right); 120 return (Node<T>) new ConcNode.OfLong((Node.OfLong) left, (Node.OfLong) right); 122 return (Node<T>) new ConcNode.OfDouble((Node.OfDouble) left, (Node.OfDouble) right); 747 protected final T_NODE right; field in class:Nodes.AbstractConcNode 750 AbstractConcNode(T_NODE left, T_NODE right) { argument 752 this.right 782 ConcNode(Node<T> left, Node<T> right) argument 846 OfPrimitive(T_NODE left, T_NODE right) argument 887 OfInt(Node.OfInt left, Node.OfInt right) argument 901 OfLong(Node.OfLong left, Node.OfLong right) argument 915 OfDouble(Node.OfDouble left, Node.OfDouble right) argument [all...] |
H A D | Collectors.java | 231 (left, right) -> { left.addAll(right); return left; }, 252 (left, right) -> { left.addAll(right); return left; }, 305 * {@code BinaryOperator<Map>} that merges the contents of its right 1141 BinaryOperator<Partition<A>> merger = (left, right) -> 1142 new Partition<>(op.apply(left.forTrue, right.forTrue), 1143 op.apply(left.forFalse, right.forFalse));
|
H A D | SliceOps.java | 703 SliceTask<P_IN, P_OUT> right = rightChild; 704 if (left == null || right == null) { 710 return (leftSize >= target) ? leftSize : leftSize + right.completedSize(target);
|
H A D | DoublePipeline.java | 473 BinaryOperator<R> operator = (left, right) -> { 474 combiner.accept(left, right);
|
H A D | LongPipeline.java | 451 BinaryOperator<R> operator = (left, right) -> { 452 combiner.accept(left, right);
|
H A D | IntPipeline.java | 469 BinaryOperator<R> operator = (left, right) -> { 470 combiner.accept(left, right);
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | PriorityBlockingQueue.java | 370 int right = child + 1; 371 if (right < n && 372 ((Comparable<? super T>) c).compareTo((T) array[right]) > 0) 373 c = array[child = right]; 391 int right = child + 1; 392 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) 393 c = array[child = right];
|
H A D | ConcurrentSkipListMap.java | 100 * +-+ right +-+ +-+ 319 * Index: q, r, d for index node, right, down. 536 volatile Index<K,V> right; field in class:ConcurrentSkipListMap.Index 541 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { argument 544 this.right = right; 548 * compareAndSet right field. 572 newSucc.right = succ; 577 * Tries to CAS right field to skip over apparent successor 584 return node.value != null && casRight(succ, succ.right); 607 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) argument [all...] |
H A D | ScheduledThreadPoolExecutor.java | 911 int right = child + 1; 912 if (right < size && c.compareTo(queue[right]) > 0) 913 c = queue[child = right];
|
H A D | ConcurrentHashMap.java | 422 * and right children may need to be searched in the case of tied 2692 TreeNode<K,V> right; field in class:ConcurrentHashMap.TreeNode 2715 TreeNode<K,V> pl = p.left, pr = p.right; 2785 x.left = x.right = null; 2807 if ((p = (dir <= 0) ? p.left : p.right) == null) { 2812 xp.right = x; 2923 ((ch = p.right) != null && 2931 if ((p = (dir <= 0) ? p.left : p.right) == null) { 2939 xp.right = x; 2981 if ((r = root) == null || r.right [all...] |
/libcore/benchmarks/src/benchmarks/regression/ |
H A D | R.java | 2118 public static final int right = 0; field in class:R
|