Home
last modified time | relevance | path

Searched refs:lo (Results 1 – 25 of 35) sorted by relevance

12

/libcore/ojluni/src/test/java/util/concurrent/tck/
DCountedCompleter8Test.java61 final int lo, hi; in forEach1() field in CountedCompleter8Test.Task
62 Task(Task parent, int lo, int hi) { in forEach1() argument
63 super(parent); this.lo = lo; this.hi = hi; in forEach1()
67 if (hi - lo >= 2) { in forEach1()
68 int mid = (lo + hi) >>> 1; in forEach1()
72 new Task(this, lo, mid).fork(); // left child in forEach1()
74 else if (hi > lo) in forEach1()
75 action.accept(array[lo]); in forEach1()
85 final int lo, hi; in forEach2() field in CountedCompleter8Test.Task
86 Task(Task parent, int lo, int hi) { in forEach2() argument
[all …]
DThreadLocalRandom8Test.java149 final int lo = least, hi = bound; in testBoundedInts() local
150 r.ints(size, lo, hi).parallel().forEach( in testBoundedInts()
152 if (x < lo || x >= hi) in testBoundedInts()
168 final long lo = least, hi = bound; in testBoundedLongs() local
169 r.longs(size, lo, hi).parallel().forEach( in testBoundedLongs()
171 if (x < lo || x >= hi) in testBoundedLongs()
187 final double lo = least, hi = bound; in testBoundedDoubles() local
188 r.doubles(size, lo, hi).parallel().forEach( in testBoundedDoubles()
190 if (x < lo || x >= hi) in testBoundedDoubles()
DSplittableRandomTest.java442 final int lo = least, hi = bound;
443 r.ints(size, lo, hi).parallel().forEach(
445 if (x < lo || x >= hi)
461 final long lo = least, hi = bound;
462 r.longs(size, lo, hi).parallel().forEach(
464 if (x < lo || x >= hi)
480 final double lo = least, hi = bound;
481 r.doubles(size, lo, hi).parallel().forEach(
483 if (x < lo || x >= hi)
DRecursiveActionTest.java1220 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask
1221 SortTask(long[] array, int lo, int hi) { in SortTask() argument
1222 this.array = array; this.lo = lo; this.hi = hi; in SortTask()
1226 if (hi - lo < THRESHOLD) in compute()
1227 sortSequentially(lo, hi); in compute()
1229 int mid = (lo + hi) >>> 1; in compute()
1230 invokeAll(new SortTask(array, lo, mid), in compute()
1232 merge(lo, mid, hi); in compute()
1237 void sortSequentially(int lo, int hi) { in sortSequentially() argument
1238 Arrays.sort(array, lo, hi); in sortSequentially()
[all …]
/libcore/luni/src/test/java/libcore/java/util/concurrent/
DCountedCompleterTest.java44 final int lo; in chooseOne() field in CountedCompleterTest.Task
48 Task(Task parent, int lo, int hi) { in chooseOne() argument
50 this.lo = lo; in chooseOne()
56 if (hi - lo >= 2) { in chooseOne()
57 int mid = (lo + hi) >>> 1; in chooseOne()
61 new Task(this, lo, mid).fork(); // left child in chooseOne()
62 } else if (hi > lo) { in chooseOne()
63 if (choiceIndex == lo) { in chooseOne()
65 final Integer val = Integer.valueOf(array[lo]); in chooseOne()
138 final int lo; in completeAllChildren() field in CountedCompleterTest.MainTask
[all …]
/libcore/ojluni/src/main/java/java/util/
DArrayPrefixHelpers.java110 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
115 T[] array, int lo, int hi) { in CumulateTask() argument
118 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
121 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3)) in CumulateTask()
128 int lo, int hi) { in CumulateTask() argument
133 this.lo = lo; this.hi = hi; in CumulateTask()
143 outer: while ((l = t.lo) >= 0 && (h = t.hi) <= a.length) { in compute()
239 par.lo == org) ? CUMULATE : 0); in compute()
262 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
267 long[] array, int lo, int hi) { in LongCumulateTask() argument
[all …]
DComparableTimSort.java179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort() argument
180 assert a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local
182 int nRemaining = hi - lo; in sort()
188 int initRunLen = countRunAndMakeAscending(a, lo, hi); in sort()
189 binarySort(a, lo, hi, lo + initRunLen); in sort()
202 int runLen = countRunAndMakeAscending(a, lo, hi); in sort()
207 binarySort(a, lo, lo + force, lo + runLen); in sort()
212 ts.pushRun(lo, runLen); in sort()
216 lo += runLen; in sort()
221 assert lo == hi; in sort()
[all …]
DTimSort.java210 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, in sort() argument
212 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local
214 int nRemaining = hi - lo; in sort()
220 int initRunLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
221 binarySort(a, lo, hi, lo + initRunLen, c); in sort()
234 int runLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
239 binarySort(a, lo, lo + force, lo + runLen, c); in sort()
244 ts.pushRun(lo, runLen); in sort()
248 lo += runLen; in sort()
253 assert lo == hi; in sort()
[all …]
DArraysParallelSortHelpers.java181 for (int lo = 0; lo < rh; ) { in compute()
182 int rm = (lo + rh) >>> 1; in compute()
186 lo = rm + 1; in compute()
194 for (int lo = 0; lo < lh; ) { in compute()
195 int lm = (lo + lh) >>> 1; in compute()
199 lo = lm + 1; in compute()
294 for (int lo = 0; lo < rh; ) { in compute()
295 int rm = (lo + rh) >>> 1; in compute()
299 lo = rm + 1; in compute()
307 for (int lo = 0; lo < lh; ) { in compute()
[all …]
DPriorityQueue.java848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
849 return (lo >= mid) ? null : in trySplit()
850 new PriorityQueueSpliterator<>(pq, lo, index = mid, in trySplit()
887 int hi = getFence(), lo = index; in tryAdvance() local
888 if (lo >= 0 && lo < hi) { in tryAdvance()
889 index = lo + 1; in tryAdvance()
890 @SuppressWarnings("unchecked") E e = (E)pq.queue[lo]; in tryAdvance()
DDualPivotQuicksort.java128 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in sort()
129 int t = a[lo]; a[lo] = a[hi]; a[hi] = t; in sort()
196 for (int i = right, lo = run[count - 1]; --i >= lo; in sort()
576 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in sort()
577 long t = a[lo]; a[lo] = a[hi]; a[hi] = t; in sort()
644 for (int i = right, lo = run[count - 1]; --i >= lo; in sort()
1060 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in doSort()
1061 short t = a[lo]; a[lo] = a[hi]; a[hi] = t; in doSort()
1128 for (int i = right, lo = run[count - 1]; --i >= lo; in doSort()
1544 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in doSort()
[all …]
DSpliterators.java934 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
935 return (lo >= mid) in trySplit()
937 : new ArraySpliterator<>(array, lo, index = mid, characteristics); in trySplit()
1019 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1020 return (lo >= mid) in trySplit()
1022 : new IntArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1102 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1103 return (lo >= mid) in trySplit()
1105 : new LongArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1185 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
[all …]
DWeakHashMap.java1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1107 return (lo >= mid) ? null : in trySplit()
1108 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1187 return (lo >= mid) ? null : in trySplit()
1188 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1263 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1264 return (lo >= mid) ? null : in trySplit()
1265 new EntrySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
DTreeMap.java1365 final K lo, hi; field in TreeMap.NavigableSubMap
1370 boolean fromStart, K lo, boolean loInclusive, in NavigableSubMap() argument
1373 if (m.compare(lo, hi) > 0) in NavigableSubMap()
1377 m.compare(lo, lo); in NavigableSubMap()
1384 this.lo = lo; in NavigableSubMap()
1395 int c = m.compare(key, lo); in tooLow()
1416 return (fromStart || m.compare(key, lo) >= 0) in inClosedRange()
1433 (loInclusive ? m.getCeilingEntry(lo) : in absLowest()
1434 m.getHigherEntry(lo))); in absLowest()
1484 m.getLowerEntry(lo) : in absLowFence()
[all …]
DIdentityHashMap.java1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1425 return (lo >= mid) ? null : in trySplit()
1426 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1482 return (lo >= mid) ? null : in trySplit()
1483 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1541 return (lo >= mid) ? null : in trySplit()
1542 new EntrySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
DAbstractList.java695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
696 return (lo >= mid) ? null : // divide range in half unless too small in trySplit()
697 new RandomAccessSpliterator<>(this, lo, index = mid); in trySplit()
DVector.java1393 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1394 return (lo >= mid) ? null : in trySplit()
1395 new VectorSpliterator<E>(list, array, lo, index = mid, in trySplit()
/libcore/luni/src/test/java/libcore/java/net/
DNetworkInterfaceTest.java59 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local
60 Set<InetAddress> actual = new HashSet<InetAddress>(Collections.list(lo.getInetAddresses())); in testIPv6()
125 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local
126 assertNull(lo.getHardwareAddress()); in testLoopback()
127 for (InterfaceAddress ia : lo.getInterfaceAddresses()) { in testLoopback()
175 NetworkInterface lo = NetworkInterface.getByName("lo"); in testInterfaceRemoval() local
182 nameField.set(lo, "noSuchInterface"); in testInterfaceRemoval()
185 lo.getHardwareAddress(); in testInterfaceRemoval()
190 lo.getMTU(); in testInterfaceRemoval()
195 lo.isLoopback(); in testInterfaceRemoval()
[all …]
/libcore/jsr166-tests/src/test/java/jsr166/
DThreadLocalRandom8Test.java126 final int lo = least, hi = bound; in testBoundedInts() local
127 r.ints(size, lo, hi).parallel().forEach( in testBoundedInts()
129 if (x < lo || x >= hi) in testBoundedInts()
145 final long lo = least, hi = bound; in testBoundedLongs() local
146 r.longs(size, lo, hi).parallel().forEach( in testBoundedLongs()
148 if (x < lo || x >= hi) in testBoundedLongs()
164 final double lo = least, hi = bound; in testBoundedDoubles() local
165 r.doubles(size, lo, hi).parallel().forEach( in testBoundedDoubles()
167 if (x < lo || x >= hi) in testBoundedDoubles()
DRecursiveActionTest.java1208 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask
1209 SortTask(long[] array, int lo, int hi) { in SortTask() argument
1210 this.array = array; this.lo = lo; this.hi = hi; in SortTask()
1214 if (hi - lo < THRESHOLD) in compute()
1215 sortSequentially(lo, hi); in compute()
1217 int mid = (lo + hi) >>> 1; in compute()
1218 invokeAll(new SortTask(array, lo, mid), in compute()
1220 merge(lo, mid, hi); in compute()
1225 void sortSequentially(int lo, int hi) { in sortSequentially() argument
1226 Arrays.sort(array, lo, hi); in sortSequentially()
[all …]
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java57 int lo = index, mid = (lo + limit) >>> 1; in trySplit() local
58 return (lo >= mid) in trySplit()
60 : new CharBufferSpliterator(buffer, lo, index = mid); in trySplit()
/libcore/ojluni/src/main/java/java/util/concurrent/
DCopyOnWriteArrayList.java1306 int lo = offset; in forEach() local
1311 if (lo < 0 || hi > a.length) in forEach()
1313 for (int i = lo; i < hi; ++i) { in forEach()
1322 int lo = offset; in replaceAll() local
1328 if (lo < 0 || hi > len) in replaceAll()
1331 for (int i = lo; i < hi; ++i) { in replaceAll()
1341 int lo = offset; in sort() local
1347 if (lo < 0 || hi > len) in sort()
1351 Arrays.sort(es, lo, hi, c); in sort()
1362 int lo = offset; in removeAll() local
[all …]
DPriorityBlockingQueue.java957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
958 return (lo >= mid) ? null : in trySplit()
959 new PBQSpliterator<E>(queue, array, lo, index = mid); in trySplit()
/libcore/ojluni/src/main/java/java/nio/file/attribute/
DFileTime.java427 long lo = Math.floorMod(zeroSecs, SECONDS_PER_10000_YEARS); in toString() local
428 ldt = LocalDateTime.ofEpochSecond(lo - SECONDS_0000_TO_1970, nanos, ZoneOffset.UTC); in toString()
434 long lo = zeroSecs % SECONDS_PER_10000_YEARS; in toString() local
435 ldt = LocalDateTime.ofEpochSecond(lo - SECONDS_0000_TO_1970, nanos, ZoneOffset.UTC); in toString()
/libcore/ojluni/src/main/java/java/awt/font/
DNumericShaper.java573 int lo = 0; in rangeForCodePoint() local
575 while (lo <= hi) { in rangeForCodePoint()
576 int mid = (lo + hi) / 2; in rangeForCodePoint()
581 lo = mid + 1; in rangeForCodePoint()

12