Home
last modified time | relevance | path

Searched refs:lo (Results 1 – 25 of 38) 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.java115 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
120 T[] array, int lo, int hi) { in CumulateTask() argument
123 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
126 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3)) in CumulateTask()
133 int lo, int hi) { in CumulateTask() argument
138 this.lo = lo; this.hi = hi; in CumulateTask()
148 outer: while ((l = t.lo) >= 0 && (h = t.hi) <= a.length) { in compute()
244 par.lo == org) ? CUMULATE : 0); in compute()
269 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
274 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.java189 for (int lo = 0; lo < rh; ) { in compute()
190 int rm = (lo + rh) >>> 1; in compute()
194 lo = rm + 1; in compute()
202 for (int lo = 0; lo < lh; ) { in compute()
203 int lm = (lo + lh) >>> 1; in compute()
207 lo = lm + 1; in compute()
DDualPivotQuicksort.java756 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns() argument
758 if (hi - lo == 1) { in mergeRuns()
762 for (int i = run[hi], j = i - offset, low = run[lo]; i > low; in mergeRuns()
771 int mi = lo, rmi = (run[lo] + run[hi]) >>> 1; in mergeRuns()
779 if (parallel && hi - lo > MIN_RUN_COUNT) { in mergeRuns()
781 a1 = mergeRuns(a, b, offset, -aim, true, run, lo, mi); in mergeRuns()
784 a1 = mergeRuns(a, b, offset, -aim, false, run, lo, mi); in mergeRuns()
790 int k = a1 == a ? run[lo] - offset : run[lo]; in mergeRuns()
791 int lo1 = a1 == b ? run[lo] - offset : run[lo]; in mergeRuns()
828 int lo = lo1; lo1 = lo2; lo2 = lo; in mergeParts() local
[all …]
DSpliterators.java978 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
979 return (lo >= mid) in trySplit()
981 : new ArraySpliterator<>(array, lo, index = mid, characteristics); in trySplit()
1063 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1064 return (lo >= mid) in trySplit()
1066 : new IntArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1146 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1147 return (lo >= mid) in trySplit()
1149 : new LongArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1229 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
[all …]
DWeakHashMap.java1107 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1108 return (lo >= mid) ? null : in trySplit()
1109 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1187 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1188 return (lo >= mid) ? null : in trySplit()
1189 new ValueSpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1264 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1265 return (lo >= mid) ? null : in trySplit()
1266 new EntrySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
DTreeMap.java1362 final K lo, hi; field in TreeMap.NavigableSubMap
1367 boolean fromStart, K lo, boolean loInclusive, in NavigableSubMap() argument
1370 if (m.compare(lo, hi) > 0) in NavigableSubMap()
1374 m.compare(lo, lo); in NavigableSubMap()
1381 this.lo = lo; in NavigableSubMap()
1392 int c = m.compare(key, lo); in tooLow()
1413 return (fromStart || m.compare(key, lo) >= 0) in inClosedRange()
1430 (loInclusive ? m.getCeilingEntry(lo) : in absLowest()
1431 m.getHigherEntry(lo))); in absLowest()
1481 m.getLowerEntry(lo) : in absLowFence()
[all …]
DIdentityHashMap.java1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1428 return (lo >= mid) ? null : in trySplit()
1429 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1484 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1485 return (lo >= mid) ? null : in trySplit()
1486 new ValueSpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1543 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1544 return (lo >= mid) ? null : in trySplit()
1545 new EntrySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
DVector.java1146 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap() argument
1147 System.arraycopy(es, hi, es, lo, elementCount - hi); in shiftTailOverGap()
1148 for (int to = elementCount, i = (elementCount -= hi - lo); i < to; i++) in shiftTailOverGap()
1470 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1471 return (lo >= mid) ? null : in trySplit()
1472 new VectorSpliterator(array, lo, index = mid, expectedModCount); in trySplit()
DArrayList.java752 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap() argument
753 System.arraycopy(es, hi, es, lo, size - hi); in shiftTailOverGap()
754 for (int to = size, i = (size -= hi - lo); i < to; i++) in shiftTailOverGap()
1463 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in spliterator() local
1465 return (lo >= mid) ? null : // divide range in half unless too small in spliterator()
1466 root.new ArrayListSpliterator(lo, index = mid, expectedModCount); in spliterator()
1607 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1608 return (lo >= mid) ? null : // divide range in half unless too small
1609 new ArrayListSpliterator(lo, index = mid, expectedModCount);
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()
/libcore/luni/src/test/java/libcore/java/net/
DNetworkInterfaceTest.java60 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local
61 Set<InetAddress> actual = new HashSet<InetAddress>(Collections.list(lo.getInetAddresses())); in testIPv6()
129 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local
130 assertNull(lo.getHardwareAddress()); in testLoopback()
131 for (InterfaceAddress ia : lo.getInterfaceAddresses()) { in testLoopback()
179 NetworkInterface lo = NetworkInterface.getByName("lo"); in testInterfaceRemoval() local
186 nameField.set(lo, "noSuchInterface"); in testInterfaceRemoval()
189 lo.getHardwareAddress(); in testInterfaceRemoval()
194 lo.getMTU(); in testInterfaceRemoval()
199 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/lang/
DStringUTF16.java532 final char lo = Character.lowSurrogate(ch);
535 if (getChar(value, i) == hi && getChar(value, i + 1 ) == lo) {
607 char lo = Character.lowSurrogate(ch);
610 if (getChar(value, i) == hi && getChar(value, i + 1) == lo) {
1186 int lo = index, mid = (lo + fence) >>> 1;
1187 return (lo >= mid)
1189 : new CharsSpliterator(array, lo, index = mid, cs);
1246 int lo = index, mid = (lo + fence) >>> 1;
1247 if (lo >= mid)
1255 if (lo >= midOneLess)
[all …]
/libcore/ojluni/src/test/java/lang/StrictMath/
DFdlibmTranslit.java308 double y, hi = 0, lo = 0, c, t; in compute() local
338 lo = LN_2_LO[xsb]; in compute()
344 lo = t * LN_2_LO[0]; in compute()
346 x = hi - lo; in compute()
361 y = ONE - ((lo - (x * c) / (2.0 - c)) - hi); in compute()
/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/util/concurrent/
DPriorityBlockingQueue.java958 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
959 return (lo >= mid) ? null : in trySplit()
960 new PBQSpliterator(array, lo, index = mid); in trySplit()
965 final int hi = getFence(), lo = index; in forEachRemaining() local
968 for (int i = lo; i < hi; i++) in forEachRemaining()

12