Searched refs:mid (Results 1 - 22 of 22) sorted by relevance

/libcore/ojluni/src/main/java/java/nio/
H A DCharBufferSpliterator.java57 int lo = index, mid = (lo + limit) >>> 1;
58 return (lo >= mid)
60 : new CharBufferSpliterator(buffer, lo, index = mid);
/libcore/ojluni/src/main/native/
H A Djni_util.c198 jmethodID mid; local
216 mid = (*env)->GetStaticMethodID(env, clazz, name, signature);
217 if (mid == 0)
222 (*env)->CallStaticVoidMethodV(env, clazz, mid, args);
226 result.l = (*env)->CallStaticObjectMethodV(env, clazz, mid, args);
229 result.z = (*env)->CallStaticBooleanMethodV(env, clazz, mid, args);
232 result.b = (*env)->CallStaticByteMethodV(env, clazz, mid, args);
235 result.c = (*env)->CallStaticCharMethodV(env, clazz, mid, args);
238 result.s = (*env)->CallStaticShortMethodV(env, clazz, mid, args);
241 result.i = (*env)->CallStaticIntMethodV(env, clazz, mid, arg
295 jmethodID mid; local
952 static jmethodID mid = NULL; local
[all...]
H A Dnet_util_md.c210 int mid = a + (b-a)/2; local
211 if (setsockopt(fd, SOL_SOCKET, opt, &mid, sizeof(int)) == 0) {
212 limit = mid;
213 a = mid + 1;
216 b = mid - 1;
734 jmethodID mid; local
740 mid = (*env)->GetStaticMethodID(env, iCls, "getProperty",
742 CHECK_NULL(mid);
743 flagSet = (*env)->CallStaticObjectMethod(env, iCls, mid, s);
/libcore/ojluni/src/main/java/java/util/
H A DArrays.java1352 int mid = (low + high) >>> 1;
1353 mergeSort(dest, src, low, mid, -off);
1354 mergeSort(dest, src, mid, high, -off);
1358 if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) {
1364 for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
1365 if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)
1759 int mid = (low + high) >>> 1;
1760 long midVal = a[mid];
1763 low = mid
[all...]
H A DArrayPrefixHelpers.java147 int mid = (l + h) >>> 1;
149 new CumulateTask<T>(t, fn, a, org, fnc, th, mid, h);
151 new CumulateTask<T>(t, fn, a, org, fnc, th, l, mid);
299 int mid = (l + h) >>> 1;
301 new LongCumulateTask(t, fn, a, org, fnc, th, mid, h);
303 new LongCumulateTask(t, fn, a, org, fnc, th, l, mid);
449 int mid = (l + h) >>> 1;
451 new DoubleCumulateTask(t, fn, a, org, fnc, th, mid, h);
453 new DoubleCumulateTask(t, fn, a, org, fnc, th, l, mid);
599 int mid
[all...]
H A DSpliterators.java934 int lo = index, mid = (lo + fence) >>> 1;
935 return (lo >= mid)
937 : new ArraySpliterator<>(array, lo, index = mid, characteristics);
1019 int lo = index, mid = (lo + fence) >>> 1;
1020 return (lo >= mid)
1022 : new IntArraySpliterator(array, lo, index = mid, characteristics);
1102 int lo = index, mid = (lo + fence) >>> 1;
1103 return (lo >= mid)
1105 : new LongArraySpliterator(array, lo, index = mid, characteristics);
1185 int lo = index, mid
[all...]
H A DIdentityHashMap.java1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1425 return (lo >= mid) ? null :
1426 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1482 return (lo >= mid) ? null :
1483 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1541 return (lo >= mid) ? null :
1542 new EntrySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
H A DWeakHashMap.java1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1107 return (lo >= mid) ? null :
1108 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1187 return (lo >= mid) ? null :
1188 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1263 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1264 return (lo >= mid) ? null :
1265 new EntrySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
H A DCollections.java266 int mid = (low + high) >>> 1;
267 Comparable<? super T> midVal = list.get(mid);
271 low = mid + 1;
273 high = mid - 1;
275 return mid; // key found
288 int mid = (low + high) >>> 1;
289 Comparable<? super T> midVal = get(i, mid);
293 low = mid + 1;
295 high = mid - 1;
297 return mid; // ke
[all...]
H A DPriorityQueue.java848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
849 return (lo >= mid) ? null :
850 new PriorityQueueSpliterator<>(pq, lo, index = mid,
H A DComparableTimSort.java142 * measured to be too expensive when sorting "mid-sized" arrays (e.g.,
261 int mid = (left + right) >>> 1;
262 if (pivot.compareTo(a[mid]) < 0)
263 right = mid;
265 left = mid + 1;
H A DTimSort.java172 * measured to be too expensive when sorting "mid-sized" arrays (e.g.,
295 int mid = (left + right) >>> 1;
296 if (c.compare(pivot, a[mid]) < 0)
297 right = mid;
299 left = mid + 1;
H A DVector.java1385 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1386 return (lo >= mid) ? null :
1387 new VectorSpliterator<E>(list, array, lo, index = mid,
H A DHashMap.java1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1527 return (lo >= mid || current != null) ? null :
1528 new KeySpliterator<>(map, lo, index = mid, est >>>= 1,
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1599 return (lo >= mid || current != null) ? null :
1600 new ValueSpliterator<>(map, lo, index = mid, est >>>= 1,
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1670 return (lo >= mid || current != null) ? null :
1671 new EntrySpliterator<>(map, lo, index = mid, est >>>= 1,
H A DArrayList.java1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1355 return (lo >= mid) ? null : // divide range in half unless too small
1356 new ArrayListSpliterator<E>(list, lo, index = mid,
H A DTreeMap.java2577 int mid = (lo + hi) >>> 1;
2580 if (lo < mid)
2581 left = buildFromSorted(level+1, lo, mid - 1, redLevel,
2612 if (mid < hi) {
2613 TreeMapEntry<K,V> right = buildFromSorted(level+1, mid+1, hi, redLevel,
/libcore/jsr166-tests/src/test/java/jsr166/
H A DRecursiveActionTest.java1217 int mid = (lo + hi) >>> 1;
1218 invokeAll(new SortTask(array, lo, mid),
1219 new SortTask(array, mid, hi));
1220 merge(lo, mid, hi);
1228 void merge(int lo, int mid, int hi) { argument
1229 long[] buf = Arrays.copyOfRange(array, lo, mid);
1230 for (int i = 0, j = lo, k = mid; i < buf.length; j++)
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DPriorityBlockingQueue.java957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
958 return (lo >= mid) ? null :
959 new PBQSpliterator<E>(queue, array, lo, index = mid);
H A DCompletableFuture.java1336 int mid = (lo + hi) >>> 1;
1337 if ((a = (lo == mid ? cfs[lo] :
1338 andTree(cfs, lo, mid))) == null ||
1339 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] :
1340 andTree(cfs, mid+1, hi))) == null)
1590 int mid = (lo + hi) >>> 1;
1591 if ((a = (lo == mid ? cfs[lo] :
1592 orTree(cfs, lo, mid))) == null ||
1593 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] :
1594 orTree(cfs, mid
[all...]
/libcore/ojluni/src/main/java/java/awt/font/
H A DNumericShaper.java576 int mid = (lo + hi) / 2;
577 Range range = ranges[mid];
579 hi = mid - 1;
581 lo = mid + 1;
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/
H A DCharacterTest.java533 final Character mid = new Character((char) (Character.MAX_VALUE / 2));
538 assertTrue(mid.compareTo(mid) == 0);
540 assertTrue(max.compareTo(mid) > 0);
543 assertTrue(mid.compareTo(max) < 0);
544 assertTrue(mid.compareTo(min) > 0);
546 assertTrue(min.compareTo(mid) < 0);
/libcore/benchmarks/src/benchmarks/regression/
H A DR.java453 public final int mid = 0; field in class:R

Completed in 1114 milliseconds