/libcore/ojluni/src/test/java/lang/String/ |
D | Indent.java | 84 int left = 0; in indexOfNonWhitespace() local 85 while (left < s.length()) { in indexOfNonWhitespace() 86 char ch = s.charAt(left); in indexOfNonWhitespace() 90 left++; in indexOfNonWhitespace() 92 return left; in indexOfNonWhitespace()
|
/libcore/ojluni/src/test/jdk/internal/math/FloatingDecimal/ |
D | TestFDBigInteger.java | 350 …private static void testLeftInplaceSub(FDBigInteger left, FDBigInteger right, boolean isImmutable)… in testLeftInplaceSub() argument 351 BigInteger biLeft = left.toBigInteger(); in testLeftInplaceSub() 353 FDBigInteger diff = left.leftInplaceSub(right); in testLeftInplaceSub() 354 if (!isImmutable && diff != left) { in testLeftInplaceSub() 358 check(biLeft, left, "leftInplaceSub corrupts its left immutable argument"); in testLeftInplaceSub() 372 FDBigInteger left = FDBigInteger.valueOfPow52(0, 0).multByPow52(p5, p2); in testLeftInplaceSub() local 374 testLeftInplaceSub(left, right, false); in testLeftInplaceSub() 375 left = FDBigInteger.valueOfPow52(0, 0).multByPow52(p5, p2); in testLeftInplaceSub() 376 left.makeImmutable(); in testLeftInplaceSub() 377 testLeftInplaceSub(left, right, true); in testLeftInplaceSub() [all …]
|
/libcore/ojluni/src/main/java/sun/nio/ch/ |
D | IOUtil.java | 151 long left = bytesWritten; in write() local 153 if (left > 0) { in write() 157 int n = (left > rem) ? rem : (int)left; in write() 159 left -= n; in write() 281 long left = bytesRead; in read() local 284 if (left > 0) { in read() 287 int n = (left > rem) ? rem : (int)left; in read() 295 left -= n; in read()
|
/libcore/ojluni/src/main/java/java/lang/ |
D | StringLatin1.java | 598 int left = 0; in indexOfNonWhitespace() local 599 while (left < length) { in indexOfNonWhitespace() 600 char ch = (char)(value[left] & 0xff); in indexOfNonWhitespace() 604 left++; in indexOfNonWhitespace() 606 return left; in indexOfNonWhitespace() 623 int left = indexOfNonWhitespace(value); in strip() local 624 if (left == value.length) { in strip() 628 return ((left > 0) || (right < value.length)) ? newString(value, left, right - left) : null; in strip() 632 int left = indexOfNonWhitespace(value); in stripLeading() local 633 if (left == value.length) { in stripLeading() [all …]
|
D | StringUTF16.java | 925 int left = 0; 926 while (left < length) { 930 int codepoint = value.codePointAt(left); 935 left += Character.charCount(codepoint); 937 return left; 970 int left = indexOfNonWhitespace(value); 971 if (left == length) { 975 return ((left > 0) || (right < length)) ? newString(value, left, right - left) : null; 986 int left = indexOfNonWhitespace(value); 987 if (left == length) { [all …]
|
/libcore/ojluni/src/main/java/sun/security/util/ |
D | Debug.java | 287 StringBuffer left = new StringBuffer(); in marshal() local 294 matcher.appendReplacement(left, ""); in marshal() 296 matcher.appendTail(left); in marshal() 297 source = left; in marshal() 311 left = new StringBuffer(); in marshal() 318 matcher.appendReplacement(left, ""); in marshal() 320 matcher.appendTail(left); in marshal() 321 source = left; in marshal()
|
/libcore/ojluni/src/main/java/java/util/ |
D | TreeMap.java | 388 p = p.left; in getEntry() 412 p = p.left; in getEntryUsingComparator() 433 if (p.left != null) in getCeilingEntry() 434 p = p.left; in getCeilingEntry() 471 if (p.left != null) { in getFloorEntry() 472 p = p.left; in getFloorEntry() 476 while (parent != null && ch == parent.left) { in getFloorEntry() 499 if (p.left != null) in getHigherEntry() 500 p = p.left; in getHigherEntry() 535 if (p.left != null) { in getLowerEntry() [all …]
|
D | ComparableTimSort.java | 252 int left = lo; in binarySort() local 254 assert left <= right; in binarySort() local 260 while (left < right) { in binarySort() 261 int mid = (left + right) >>> 1; in binarySort() 265 left = mid + 1; in binarySort() 267 assert left == right; in binarySort() 276 int n = start - left; // The number of elements to move in binarySort() 279 case 2: a[left + 2] = a[left + 1]; in binarySort() 280 case 1: a[left + 1] = a[left]; in binarySort() 282 default: System.arraycopy(a, left, a, left + 1, n); in binarySort() [all …]
|
D | TimSort.java | 286 int left = lo; in binarySort() local 288 assert left <= right; in binarySort() local 294 while (left < right) { in binarySort() 295 int mid = (left + right) >>> 1; in binarySort() 299 left = mid + 1; in binarySort() 301 assert left == right; in binarySort() 310 int n = start - left; // The number of elements to move in binarySort() 313 case 2: a[left + 2] = a[left + 1]; in binarySort() 314 case 1: a[left + 1] = a[left]; in binarySort() 316 default: System.arraycopy(a, left, a, left + 1, n); in binarySort() [all …]
|
D | ArrayPrefixHelpers.java | 110 CumulateTask<T> left, right; field in ArrayPrefixHelpers.CumulateTask 150 CumulateTask<T> lt = t.left, rt = t.right, f; in compute() 155 t = lt = t.left = in compute() 237 if ((lt = par.left) != null && in compute() 267 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask 304 LongCumulateTask lt = t.left, rt = t.right, f; in compute() 309 t = lt = t.left = in compute() 389 if ((lt = par.left) != null && in compute() 419 DoubleCumulateTask left, right; field in ArrayPrefixHelpers.DoubleCumulateTask 456 DoubleCumulateTask lt = t.left, rt = t.right, f; in compute() [all …]
|
D | HashMap.java | 1966 TreeNode<K,V> left; field in HashMap.TreeNode 2019 TreeNode<K,V> pl = p.left, pr = p.right, q; in find() 2073 x.left = x.right = null; in treeify() 2096 if ((p = (dir <= 0) ? p.left : p.right) == null) { in treeify() 2099 xp.left = x; in treeify() 2150 if (((ch = p.left) != null && in putTreeVal() 2160 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal() 2164 xp.left = x; in putTreeVal() 2208 || (rl = root.left) == null in removeTreeNode() 2209 || rl.left == null))) { in removeTreeNode() [all …]
|
/libcore/ojluni/src/main/java/java/util/stream/ |
D | Collectors.java | 301 (left, right) -> { left.addAll(right); return left; }, 320 (left, right) -> { 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; 378 (left, right) -> { 379 if (left.size() < right.size()) { 380 right.addAll(left); return right; 382 left.addAll(right); return left; [all …]
|
D | Nodes.java | 121 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() 757 protected final T_NODE left; field in Nodes.AbstractConcNode 761 AbstractConcNode(T_NODE left, T_NODE right) { in AbstractConcNode() argument 762 this.left = left; in AbstractConcNode() 768 this.size = left.count() + right.count(); in AbstractConcNode() 778 if (i == 0) return left; in getChild() [all …]
|
D | SliceOps.java | 710 SliceTask<P_IN, P_OUT> left = parent.leftChild; 711 if (left != null) { 712 size += left.completedSize(target); 735 SliceTask<P_IN, P_OUT> left = leftChild; 737 if (left == null || right == null) { 742 long leftSize = left.completedSize(target);
|
D | DoublePipeline.java | 554 BinaryOperator<R> operator = (left, right) -> { 555 combiner.accept(left, right); 556 return left;
|
D | IntPipeline.java | 546 BinaryOperator<R> operator = (left, right) -> { 547 combiner.accept(left, right); 548 return left;
|
D | LongPipeline.java | 529 BinaryOperator<R> operator = (left, right) -> { 530 combiner.accept(left, right); 531 return left;
|
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
D | CollectorExample.java | 88 (left, right) -> { left.addAll(right); return left; }); in testSnippet2()
|
/libcore/ojluni/src/main/java/java/util/function/ |
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
|
D | LongBinaryOperator.java | 49 long applyAsLong(long left, long right); in applyAsLong() argument
|
/libcore/ojluni/src/test/java/math/BigInteger/ |
D | PrimeTest.java | 130 BigInteger left = p.multiply(fourToTheC); in checkPrime() local 133 Assert.assertFalse(left.compareTo(right) < 0, in checkPrime()
|
/libcore/ojluni/src/test/java/security/KeyAgreement/ |
D | KeySizeTest.java | 169 BigInteger left = BigInteger.ONE; in testKeyAttributes() local 172 if ((x.compareTo(left) <= 0) || (x.compareTo(right) >= 0)) { in testKeyAttributes() 177 if ((y.compareTo(left) <= 0) || (y.compareTo(right) >= 0)) { in testKeyAttributes()
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | ConcurrentHashMap.java | 2720 TreeNode<K,V> left; 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() 2839 xp.left = x; in TreeBin() 2948 if (((ch = p.left) != null && in putTreeVal() 2958 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal() 2964 xp.left = x; in putTreeVal() 3009 (rl = r.left) == null || rl.left == null) in removeTreeNode() 3014 TreeNode<K,V> pl = p.left; in removeTreeNode() [all …]
|
/libcore/ojluni/src/test/resources/data/unicodedata/emoji/ |
D | emoji-data.txt | 33 2194..2199 ; Emoji # E0.6 [6] (↔️..↙️) left-right arrow..down-left arrow 34 21A9..21AA ; Emoji # E0.6 [2] (↩️..↪️) right arrow curving left..left arrow … 130 2B05..2B07 ; Emoji # E0.6 [3] (⬅️..⬇️) left arrow..down arrow 265 1F5E8 ; Emoji # E2.0 [1] (️) left speech bubble 335 1F6C1..1F6C5 ; Emoji # E1.0 [5] (..) bathtub..left luggage 630 1F6C1..1F6C5 ; Emoji_Presentation # E1.0 [5] (..) bathtub..left luggage 812 2194..2199 ; Extended_Pictographic# E0.6 [6] (↔️..↙️) left-right arrow..down-left arrow 813 21A9..21AA ; Extended_Pictographic# E0.6 [2] (↩️..↪️) right arrow curving left..left arrow … 954 2B05..2B07 ; Extended_Pictographic# E0.6 [3] (⬅️..⬇️) left arrow..down arrow 1125 1F5E8 ; Extended_Pictographic# E2.0 [1] (️) left speech bubble [all …]
|