Home
last modified time | relevance | path

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

/libcore/ojluni/src/main/native/
Djni_util.c198 jmethodID mid; in JNU_CallStaticMethodByName() local
216 mid = (*env)->GetStaticMethodID(env, clazz, name, signature); in JNU_CallStaticMethodByName()
217 if (mid == 0) in JNU_CallStaticMethodByName()
222 (*env)->CallStaticVoidMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
226 result.l = (*env)->CallStaticObjectMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
229 result.z = (*env)->CallStaticBooleanMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
232 result.b = (*env)->CallStaticByteMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
235 result.c = (*env)->CallStaticCharMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
238 result.s = (*env)->CallStaticShortMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
241 result.i = (*env)->CallStaticIntMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
[all …]
Dnet_util_md.c203 int mid = a + (b-a)/2; in findMaxBuf() local
204 if (setsockopt(fd, SOL_SOCKET, opt, &mid, sizeof(int)) == 0) { in findMaxBuf()
205 limit = mid; in findMaxBuf()
206 a = mid + 1; in findMaxBuf()
209 b = mid - 1; in findMaxBuf()
728 jmethodID mid; in parseExclusiveBindProperty() local
734 mid = (*env)->GetStaticMethodID(env, iCls, "getProperty", in parseExclusiveBindProperty()
736 CHECK_NULL(mid); in parseExclusiveBindProperty()
737 flagSet = (*env)->CallStaticObjectMethod(env, iCls, mid, s); in parseExclusiveBindProperty()
/libcore/ojluni/src/main/java/java/util/
DArrays.java1352 int mid = (low + high) >>> 1; in mergeSort() local
1353 mergeSort(dest, src, low, mid, -off); in mergeSort()
1354 mergeSort(dest, src, mid, high, -off); in mergeSort()
1358 if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) { in mergeSort()
1364 for(int i = destLow, p = low, q = mid; i < destHigh; i++) { in mergeSort()
1365 if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0) in mergeSort()
1759 int mid = (low + high) >>> 1; in binarySearch0() local
1760 long midVal = a[mid]; in binarySearch0()
1763 low = mid + 1; in binarySearch0()
1765 high = mid - 1; in binarySearch0()
[all …]
DArrayPrefixHelpers.java147 int mid = (l + h) >>> 1; in compute() local
149 new CumulateTask<T>(t, fn, a, org, fnc, th, mid, h); in compute()
151 new CumulateTask<T>(t, fn, a, org, fnc, th, l, mid); in compute()
299 int mid = (l + h) >>> 1; in compute() local
301 new LongCumulateTask(t, fn, a, org, fnc, th, mid, h); in compute()
303 new LongCumulateTask(t, fn, a, org, fnc, th, l, mid); in compute()
449 int mid = (l + h) >>> 1; in compute() local
451 new DoubleCumulateTask(t, fn, a, org, fnc, th, mid, h); in compute()
453 new DoubleCumulateTask(t, fn, a, org, fnc, th, l, mid); in compute()
599 int mid = (l + h) >>> 1; in compute() local
[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()
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()
DCollections.java266 int mid = (low + high) >>> 1; in indexedBinarySearch() local
267 Comparable<? super T> midVal = list.get(mid); in indexedBinarySearch()
271 low = mid + 1; in indexedBinarySearch()
273 high = mid - 1; in indexedBinarySearch()
275 return mid; // key found in indexedBinarySearch()
288 int mid = (low + high) >>> 1; in iteratorBinarySearch() local
289 Comparable<? super T> midVal = get(i, mid); in iteratorBinarySearch()
293 low = mid + 1; in iteratorBinarySearch()
295 high = mid - 1; in iteratorBinarySearch()
297 return mid; // key found in iteratorBinarySearch()
[all …]
DComparableTimSort.java261 int mid = (left + right) >>> 1; in binarySort() local
262 if (pivot.compareTo(a[mid]) < 0) in binarySort()
263 right = mid; in binarySort()
265 left = mid + 1; in binarySort()
DTimSort.java295 int mid = (left + right) >>> 1; in binarySort() local
296 if (c.compare(pivot, a[mid]) < 0) in binarySort()
297 right = mid; in binarySort()
299 left = mid + 1; in binarySort()
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()
DVector.java1385 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1386 return (lo >= mid) ? null : in trySplit()
1387 new VectorSpliterator<E>(list, array, lo, index = mid, in trySplit()
DHashMap.java1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1527 return (lo >= mid || current != null) ? null : in trySplit()
1528 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1599 return (lo >= mid || current != null) ? null : in trySplit()
1600 new ValueSpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1670 return (lo >= mid || current != null) ? null : in trySplit()
1671 new EntrySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
DArrayList.java1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1355 return (lo >= mid) ? null : // divide range in half unless too small in trySplit()
1356 new ArrayListSpliterator<E>(list, lo, index = mid, in trySplit()
DTreeMap.java2603 int mid = (lo + hi) >>> 1; in buildFromSorted() local
2606 if (lo < mid) in buildFromSorted()
2607 left = buildFromSorted(level+1, lo, mid - 1, redLevel, in buildFromSorted()
2638 if (mid < hi) { in buildFromSorted()
2639 TreeMapEntry<K,V> right = buildFromSorted(level+1, mid+1, hi, redLevel, in buildFromSorted()
/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/awt/font/
DNumericShaper.java576 int mid = (lo + hi) / 2; in rangeForCodePoint() local
577 Range range = ranges[mid]; in rangeForCodePoint()
579 hi = mid - 1; in rangeForCodePoint()
581 lo = mid + 1; in rangeForCodePoint()
/libcore/jsr166-tests/src/test/java/jsr166/
DRecursiveActionTest.java1217 int mid = (lo + hi) >>> 1; in compute() local
1218 invokeAll(new SortTask(array, lo, mid), in compute()
1219 new SortTask(array, mid, hi)); in compute()
1220 merge(lo, mid, hi); in compute()
1228 void merge(int lo, int mid, int hi) { in merge() argument
1229 long[] buf = Arrays.copyOfRange(array, lo, mid); in merge()
1230 for (int i = 0, j = lo, k = mid; i < buf.length; j++) in merge()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/
DCharacterTest.java533 final Character mid = new Character((char) (Character.MAX_VALUE / 2)); in test_compareToLjava_lang_Byte() local
538 assertTrue(mid.compareTo(mid) == 0); in test_compareToLjava_lang_Byte()
540 assertTrue(max.compareTo(mid) > 0); in test_compareToLjava_lang_Byte()
543 assertTrue(mid.compareTo(max) < 0); in test_compareToLjava_lang_Byte()
544 assertTrue(mid.compareTo(min) > 0); in test_compareToLjava_lang_Byte()
546 assertTrue(min.compareTo(mid) < 0); in test_compareToLjava_lang_Byte()
/libcore/ojluni/src/main/java/java/util/concurrent/
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()
DCompletableFuture.java1336 int mid = (lo + hi) >>> 1; in andTree() local
1337 if ((a = (lo == mid ? cfs[lo] : in andTree()
1338 andTree(cfs, lo, mid))) == null || in andTree()
1339 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] : in andTree()
1340 andTree(cfs, mid+1, hi))) == null) in andTree()
1590 int mid = (lo + hi) >>> 1; in orTree() local
1591 if ((a = (lo == mid ? cfs[lo] : in orTree()
1592 orTree(cfs, lo, mid))) == null || in orTree()
1593 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] : in orTree()
1594 orTree(cfs, mid+1, hi))) == null) in orTree()
/libcore/benchmarks/src/benchmarks/regression/
DR.java453 public final int mid = 0; field in R