/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/benchmarks/src/benchmarks/ |
H A D | GetInstancesOfClassesBenchmark.java | 24 ObjectTree right; field in class:GetInstancesOfClassesBenchmark.ObjectTree 29 right = new ObjectTree(depth - 1);
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | ArrayPrefixHelpers.java | 64 * even if some right-hand side first passes are still executing. 108 CumulateTask<T> left, right; field in class:ArrayPrefixHelpers.CumulateTask 145 CumulateTask<T> lt = t.left, rt = t.right, f; 148 f = rt = t.right = 233 (rt = par.right) != null) { 260 LongCumulateTask left, right; field in class:ArrayPrefixHelpers.LongCumulateTask 297 LongCumulateTask lt = t.left, rt = t.right, f; 300 f = rt = t.right = 383 (rt = par.right) != null) { 410 DoubleCumulateTask left, right; field in class:ArrayPrefixHelpers.DoubleCumulateTask 560 IntCumulateTask left, right; field in class:ArrayPrefixHelpers.IntCumulateTask [all...] |
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 | HashMap.java | 1806 TreeNode<K,V> right; field in class:HashMap.TreeNode 1858 TreeNode<K,V> pl = p.left, pr = p.right, q; 1913 x.left = x.right = null; 1936 if ((p = (dir <= 0) ? p.left : p.right) == null) { 1941 xp.right = x; 1992 ((ch = p.right) != null && 2000 if ((p = (dir <= 0) ? p.left : p.right) == null) { 2006 xp.right = x; 2045 if (root == null || root.right == null || 2050 TreeNode<K,V> p = this, pl = left, pr = right, replacemen [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) { 2087 TreeMapEntry<K,V> right; field in class:TreeMap.TreeMapEntry [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...] |
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 129 * +-+ right +-+ +-+ 348 * Index: q, r, d for index node, right, down. 565 volatile Index<K,V> right; field in class:ConcurrentSkipListMap.Index 570 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { argument 573 this.right = right; 577 * compareAndSet right field. 601 newSucc.right = succ; 606 * Tries to CAS right field to skip over apparent successor 613 return node.value != null && casRight(succ, succ.right); 636 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) argument [all...] |
H A D | ConcurrentHashMap.java | 451 * and right children may need to be searched in the case of tied 2721 TreeNode<K,V> right; field in class:ConcurrentHashMap.TreeNode 2744 TreeNode<K,V> pl = p.left, pr = p.right; 2814 x.left = x.right = null; 2836 if ((p = (dir <= 0) ? p.left : p.right) == null) { 2841 xp.right = x; 2952 ((ch = p.right) != null && 2960 if ((p = (dir <= 0) ? p.left : p.right) == null) { 2968 xp.right = x; 3010 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
|