Home
last modified time | relevance | path

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

/libcore/ojluni/src/main/java/java/util/
DDualPivotQuicksort.java107 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 …]
DTreeMap.java357 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 …]
DArrayPrefixHelpers.java79 CumulateTask<T> left, right; field in ArrayPrefixHelpers.CumulateTask
116 CumulateTask<T> lt = t.left, rt = t.right, f; in compute()
119 f = rt = t.right = in compute()
204 (rt = par.right) != null) { in compute()
231 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask
268 LongCumulateTask lt = t.left, rt = t.right, f; in compute()
271 f = rt = t.right = in compute()
354 (rt = par.right) != null) { in compute()
381 DoubleCumulateTask left, right; field in ArrayPrefixHelpers.DoubleCumulateTask
418 DoubleCumulateTask lt = t.left, rt = t.right, f; in compute()
[all …]
DPriorityQueue.java699 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()
DComparableTimSort.java249 int right = start; in binarySort() local
250 assert left <= right; in binarySort()
256 while (left < right) { in binarySort()
257 int mid = (left + right) >>> 1; in binarySort()
259 right = mid; in binarySort()
263 assert left == right; in binarySort() local
DTimSort.java283 int right = start; in binarySort() local
284 assert left <= right; in binarySort()
290 while (left < right) { in binarySort()
291 int mid = (left + right) >>> 1; in binarySort()
293 right = mid; in binarySort()
297 assert left == right; in binarySort() local
/libcore/ojluni/src/main/java/java/text/
DDigitList.java532 int right; in set() local
540 for (right = MAX_COUNT - 1; digits[right] == '0'; --right) in set()
542 count = right - left + 1; in set()
581 int right; in set() local
582 for (right = len - 1; right >= 0 && digits[right] == '0'; --right) in set()
584 count = right + 1; in set()
/libcore/ojluni/src/main/java/java/util/stream/
DNodes.java113 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 …]
DCollectors.java231 (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));
DSliceOps.java703 SliceTask<P_IN, P_OUT> right = rightChild;
704 if (left == null || right == null) {
710 return (leftSize >= target) ? leftSize : leftSize + right.completedSize(target);
DLongPipeline.java451 BinaryOperator<R> operator = (left, right) -> {
452 combiner.accept(left, right);
DDoublePipeline.java473 BinaryOperator<R> operator = (left, right) -> {
474 combiner.accept(left, right);
DIntPipeline.java469 BinaryOperator<R> operator = (left, right) -> {
470 combiner.accept(left, right);
/libcore/ojluni/src/main/java/java/util/function/
DIntBinaryOperator.java49 int applyAsInt(int left, int right); in applyAsInt() argument
DLongBinaryOperator.java49 long applyAsLong(long left, long right); in applyAsLong() argument
DDoubleBinaryOperator.java48 double applyAsDouble(double left, double right); in applyAsDouble() argument
/libcore/luni/src/main/java/java/util/concurrent/
DPriorityBlockingQueue.java370 int right = child + 1; in siftDownComparable() local
371 if (right < n && in siftDownComparable()
372 ((Comparable<? super T>) c).compareTo((T) array[right]) > 0) in siftDownComparable()
373 c = array[child = right]; in siftDownComparable()
391 int right = child + 1; in siftDownUsingComparator() local
392 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) in siftDownUsingComparator()
393 c = array[child = right]; in siftDownUsingComparator()
DConcurrentSkipListMap.java536 volatile Index<K,V> right; field in ConcurrentSkipListMap.Index
541 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { in Index() argument
544 this.right = right; in Index()
572 newSucc.right = succ; in link()
584 return node.value != null && casRight(succ, succ.right); in unlink()
607 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) { in HeadIndex() argument
608 super(node, down, right); in HeadIndex()
638 for (Index<K,V> q = head, r = q.right, d;;) { in findPredecessor()
645 r = q.right; // reread r in findPredecessor()
650 r = r.right; in findPredecessor()
[all …]
DScheduledThreadPoolExecutor.java911 int right = child + 1; in siftDown() local
912 if (right < size && c.compareTo(queue[right]) > 0) in siftDown()
913 c = queue[child = right]; in siftDown()
DConcurrentHashMap.java2692 TreeNode<K,V> right; field in ConcurrentHashMap.TreeNode
2715 TreeNode<K,V> pl = p.left, pr = p.right; in findTreeNode()
2785 x.left = x.right = null; in TreeBin()
2807 if ((p = (dir <= 0) ? p.left : p.right) == null) { in TreeBin()
2812 xp.right = x; in TreeBin()
2923 ((ch = p.right) != null && in putTreeVal()
2931 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2939 xp.right = x; in putTreeVal()
2981 if ((r = root) == null || r.right == null || // too small in removeTreeNode()
2988 TreeNode<K,V> pr = p.right; in removeTreeNode()
[all …]
/libcore/
DLICENSE120 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/
DR.java2118 public static final int right = 0; field in R
/libcore/ojluni/
DNOTICE406 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