Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 26) sorted by relevance

12

/libcore/ojluni/src/test/java/lang/String/
DIndent.java84 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/main/java/sun/nio/ch/
DIOUtil.java151 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/
DStringLatin1.java566 int left = 0; in indexOfNonWhitespace() local
567 while (left < length) { in indexOfNonWhitespace()
568 char ch = (char)(value[left] & 0xff); in indexOfNonWhitespace()
572 left++; in indexOfNonWhitespace()
574 return left; in indexOfNonWhitespace()
591 int left = indexOfNonWhitespace(value); in strip() local
592 if (left == value.length) { in strip()
596 return ((left > 0) || (right < value.length)) ? newString(value, left, right - left) : null; in strip()
600 int left = indexOfNonWhitespace(value); in stripLeading() local
601 if (left == value.length) { in stripLeading()
[all …]
DStringUTF16.java925 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/
DDebug.java287 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/
DComparableTimSort.java252 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 …]
DTreeMap.java388 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 …]
DTimSort.java286 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 …]
DArrayPrefixHelpers.java110 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 …]
DHashMap.java1966 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/
DCollectors.java281 (left, right) -> { left.addAll(right); return left; },
300 (left, right) -> { left.addAll(right); return left; },
329 (left, right) -> {
330 if (left.size() < right.size()) {
331 right.addAll(left); return right;
333 left.addAll(right); return left;
358 (left, right) -> {
359 if (left.size() < right.size()) {
360 right.addAll(left); return right;
362 left.addAll(right); return left;
[all …]
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()
754 protected final T_NODE left; field in Nodes.AbstractConcNode
758 AbstractConcNode(T_NODE left, T_NODE right) { in AbstractConcNode() argument
759 this.left = left; in AbstractConcNode()
765 this.size = left.count() + right.count(); in AbstractConcNode()
775 if (i == 0) return left; in getChild()
[all …]
DSliceOps.java710 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);
DIntPipeline.java546 BinaryOperator<R> operator = (left, right) -> {
547 combiner.accept(left, right);
548 return left;
DLongPipeline.java529 BinaryOperator<R> operator = (left, right) -> {
530 combiner.accept(left, right);
531 return left;
DDoublePipeline.java554 BinaryOperator<R> operator = (left, right) -> {
555 combiner.accept(left, right);
556 return left;
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DCollectorExample.java88 (left, right) -> { left.addAll(right); return left; }); in testSnippet2()
/libcore/ojluni/src/main/java/java/util/function/
DDoubleBinaryOperator.java48 double applyAsDouble(double left, double right); in applyAsDouble() argument
DLongBinaryOperator.java49 long applyAsLong(long left, long right); in applyAsLong() argument
DIntBinaryOperator.java49 int applyAsInt(int left, int right); in applyAsInt() argument
/libcore/ojluni/src/test/java/math/BigInteger/
DPrimeTest.java130 BigInteger left = p.multiply(fourToTheC); in checkPrime() local
133 Assert.assertFalse(left.compareTo(right) < 0, in checkPrime()
/libcore/ojluni/src/test/java/security/KeyAgreement/
DKeySizeTest.java169 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/
DConcurrentHashMap.java2720 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()
2950 if (((ch = p.left) != null && in putTreeVal()
2960 if ((p = (dir <= 0) ? p.left : p.right) == null) { in putTreeVal()
2966 xp.left = x; in putTreeVal()
3011 (rl = r.left) == null || rl.left == null) in removeTreeNode()
3016 TreeNode<K,V> pl = p.left; in removeTreeNode()
[all …]
/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java627 java.util.HashMap.TreeNode<K, V> left; field in HashMap.TreeNode
/libcore/ojluni/src/test/java/util/regex/
DTestCases.txt537 // Guillemet left is initial quote punctuation

12