Home
last modified time | relevance | path

Searched refs:right (Results 1 – 25 of 31) sorted by relevance

12

/libcore/ojluni/src/main/java/java/util/
DTreeMap.java355 p = p.right; in getEntry()
379 p = p.right; in getEntryUsingComparator()
403 if (p.right != null) { in getCeilingEntry()
404 p = p.right; in getCeilingEntry()
408 while (parent != null && ch == parent.right) { in getCeilingEntry()
430 if (p.right != null) in getFloorEntry()
431 p = p.right; in getFloorEntry()
469 if (p.right != null) { in getHigherEntry()
470 p = p.right; in getHigherEntry()
474 while (parent != null && ch == parent.right) { in getHigherEntry()
[all …]
DArrayPrefixHelpers.java110 CumulateTask<T> left, right; field in ArrayPrefixHelpers.CumulateTask
150 CumulateTask<T> lt = t.left, rt = t.right, f; in compute()
153 f = rt = t.right = in compute()
238 (rt = par.right) != null) { in compute()
267 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask
304 LongCumulateTask lt = t.left, rt = t.right, f; in compute()
307 f = rt = t.right = in compute()
390 (rt = par.right) != null) { in compute()
419 DoubleCumulateTask left, right; field in ArrayPrefixHelpers.DoubleCumulateTask
456 DoubleCumulateTask lt = t.left, rt = t.right, f; in compute()
[all …]
DHashMap.java1938 TreeNode<K,V> right; field in HashMap.TreeNode
1990 TreeNode<K,V> pl = p.left, pr = p.right, q; in find()
2044 x.left = x.right = null; in treeify()
2067 if ((p = (dir <= 0) ? p.left : p.right) == null) { in treeify()
2072 xp.right = x; in treeify()
2123 ((ch = p.right) != null && in putTreeVal()
2131 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2137 xp.right = x; in putTreeVal()
2178 && (root.right == null in removeTreeNode()
2184 TreeNode<K,V> p = this, pl = left, pr = right, replacement; in removeTreeNode()
[all …]
DPriorityQueue.java708 int right = child + 1; in siftDownComparable() local
709 if (right < n && in siftDownComparable()
710 ((Comparable<? super T>) c).compareTo((T) es[right]) > 0) in siftDownComparable()
711 c = es[child = right]; in siftDownComparable()
727 int right = child + 1; in siftDownUsingComparator() local
728 if (right < n && cmp.compare((T) c, (T) es[right]) > 0) in siftDownUsingComparator()
729 c = es[child = right]; in siftDownUsingComparator()
DComparableTimSort.java253 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
DTimSort.java287 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/lang/
DStringLatin1.java579 int right = length; in lastIndexOfNonWhitespace() local
580 while (0 < right) { in lastIndexOfNonWhitespace()
581 char ch = (char)(value[right - 1] & 0xff); in lastIndexOfNonWhitespace()
585 right--; in lastIndexOfNonWhitespace()
587 return right; in lastIndexOfNonWhitespace()
595 int right = lastIndexOfNonWhitespace(value); in strip() local
596 return ((left > 0) || (right < value.length)) ? newString(value, left, right - left) : null; in strip()
608 int right = lastIndexOfNonWhitespace(value); in stripTrailing() local
609 if (right == 0) { in stripTrailing()
612 return (right != value.length) ? newString(value, 0, right) : null; in stripTrailing()
DStringUTF16.java947 int right = value.length();
948 while (0 < right) {
952 int codepoint = value.codePointBefore(right);
957 right -= Character.charCount(codepoint);
959 return right;
974 int right = lastIndexOfNonWhitespace(value);
975 return ((left > 0) || (right < length)) ? newString(value, left, right - left) : null;
1001 int right = lastIndexOfNonWhitespace(value);
1002 if (right == 0) {
1005 return (right != length) ? newString(value, 0, right) : null;
/libcore/ojluni/src/main/java/java/util/stream/
DNodes.java121 static <T> Node<T> conc(StreamShape shape, Node<T> left, Node<T> right) { in conc() argument
124 return new ConcNode<>(left, right); in conc()
126 return (Node<T>) new ConcNode.OfInt((Node.OfInt) left, (Node.OfInt) right); in conc()
128 return (Node<T>) new ConcNode.OfLong((Node.OfLong) left, (Node.OfLong) right); in conc()
130 return (Node<T>) new ConcNode.OfDouble((Node.OfDouble) left, (Node.OfDouble) right); in conc()
755 protected final T_NODE right; field in Nodes.AbstractConcNode
758 AbstractConcNode(T_NODE left, T_NODE right) { in AbstractConcNode() argument
760 this.right = right; in AbstractConcNode()
765 this.size = left.count() + right.count(); in AbstractConcNode()
776 if (i == 1) return right; in getChild()
[all …]
DCollectors.java279 (left, right) -> { left.addAll(right); return left; },
298 (left, right) -> { left.addAll(right); return left; },
320 (left, right) -> {
321 if (left.size() < right.size()) {
322 right.addAll(left); return right;
324 left.addAll(right); return left;
349 (left, right) -> {
350 if (left.size() < right.size()) {
351 right.addAll(left); return right;
353 left.addAll(right); return left;
[all …]
DSliceOps.java715 SliceTask<P_IN, P_OUT> right = rightChild;
716 if (left == null || right == null) {
722 return (leftSize >= target) ? leftSize : leftSize + right.completedSize(target);
DDoublePipeline.java490 BinaryOperator<R> operator = (left, right) -> {
491 combiner.accept(left, right);
DLongPipeline.java469 BinaryOperator<R> operator = (left, right) -> {
470 combiner.accept(left, right);
DIntPipeline.java487 BinaryOperator<R> operator = (left, right) -> {
488 combiner.accept(left, right);
/libcore/ojluni/src/main/java/java/util/function/
DIntBinaryOperator.java49 int applyAsInt(int left, int right); in applyAsInt() argument
DDoubleBinaryOperator.java48 double applyAsDouble(double left, double right); in applyAsDouble() argument
DLongBinaryOperator.java49 long applyAsLong(long left, long right); in applyAsLong() argument
/libcore/ojluni/src/main/java/java/util/concurrent/
DPriorityBlockingQueue.java394 int right = child + 1; in siftDownComparable() local
395 if (right < n && in siftDownComparable()
396 ((Comparable<? super T>) c).compareTo((T) es[right]) > 0) in siftDownComparable()
397 c = es[child = right]; in siftDownComparable()
413 int right = child + 1; in siftDownUsingComparator() local
414 if (right < n && cmp.compare((T) c, (T) es[right]) > 0) in siftDownUsingComparator()
415 c = es[child = right]; in siftDownUsingComparator()
DConcurrentSkipListMap.java377 Index<K,V> right; field in ConcurrentSkipListMap.Index
378 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { in Index() argument
381 this.right = right; in Index()
472 while ((r = q.right) != null) { in findPredecessor()
476 RIGHT.compareAndSet(q, r, r.right); in findPredecessor()
546 while ((r = q.right) != null) { in doGet()
550 RIGHT.compareAndSet(q, r, r.right); in doGet()
611 while ((r = q.right) != null) { in doPut()
615 RIGHT.compareAndSet(q, r, r.right); in doPut()
710 if ((r = q.right) != null) { in addIndices()
[all …]
DScheduledThreadPoolExecutor.java996 int right = child + 1; in siftDown() local
997 if (right < size && c.compareTo(queue[right]) > 0) in siftDown()
998 c = queue[child = right]; in siftDown()
DConcurrentHashMap.java2721 TreeNode<K,V> right; field in ConcurrentHashMap.TreeNode
2744 TreeNode<K,V> pl = p.left, pr = p.right; in findTreeNode()
2814 x.left = x.right = null; in TreeBin()
2836 if ((p = (dir <= 0) ? p.left : p.right) == null) { in TreeBin()
2841 xp.right = x; in TreeBin()
2952 ((ch = p.right) != null && in putTreeVal()
2960 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2968 xp.right = x; in putTreeVal()
3010 if ((r = root) == null || r.right == null || // too small in removeTreeNode()
3017 TreeNode<K,V> pr = p.right; in removeTreeNode()
[all …]
/libcore/ojluni/src/test/java/math/BigInteger/
DPrimeTest.java130 BigInteger right = t.multiply(fourToTheCMinusOne); in checkPrime() local
132 Assert.assertFalse(left.compareTo(right) < 0, in checkPrime()
/libcore/ojluni/src/test/java/security/KeyAgreement/
DKeySizeTest.java167 BigInteger right = p.subtract(BigInteger.ONE); in testKeyAttributes() local
169 if ((x.compareTo(left) <= 0) || (x.compareTo(right) >= 0)) { in testKeyAttributes()
174 if ((y.compareTo(left) <= 0) || (y.compareTo(right) >= 0)) { in testKeyAttributes()
/libcore/tools/expected_upstream/
DREADME.md2 the right documentation.
109 * You are reading the right document! This documentation tells you how to
/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java635 java.util.HashMap.TreeNode<K, V> right; field in HashMap.TreeNode

12