Home
last modified time | relevance | path

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

12

/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.c210 int mid = a + (b-a)/2; in findMaxBuf() local
211 if (setsockopt(fd, SOL_SOCKET, opt, &mid, sizeof(int)) == 0) { in findMaxBuf()
212 limit = mid; in findMaxBuf()
213 a = mid + 1; in findMaxBuf()
216 b = mid - 1; in findMaxBuf()
734 jmethodID mid; in parseExclusiveBindProperty() local
740 mid = (*env)->GetStaticMethodID(env, iCls, "getProperty", in parseExclusiveBindProperty()
742 CHECK_NULL(mid); in parseExclusiveBindProperty()
743 flagSet = (*env)->CallStaticObjectMethod(env, iCls, mid, s); in parseExclusiveBindProperty()
/libcore/ojluni/src/test/java/util/concurrent/tck/
DCountedCompleter8Test.java68 int mid = (lo + hi) >>> 1; in forEach1() local
71 new Task(this, mid, hi).fork(); // right child in forEach1()
72 new Task(this, lo, mid).fork(); // left child in forEach1()
92 int mid = (lo + hi) >>> 1; in forEach2() local
94 new Task(this, mid, hi).fork(); // right child in forEach2()
95 new Task(this, lo, mid).compute(); // direct invoke in forEach2()
DRecursiveActionTest.java1229 int mid = (lo + hi) >>> 1; in compute() local
1230 invokeAll(new SortTask(array, lo, mid), in compute()
1231 new SortTask(array, mid, hi)); in compute()
1232 merge(lo, mid, hi); in compute()
1240 void merge(int lo, int mid, int hi) { in merge() argument
1241 long[] buf = Arrays.copyOfRange(array, lo, mid); in merge()
1242 for (int i = 0, j = lo, k = mid; i < buf.length; j++) in merge()
/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/test/java/nio/Buffer/
DChars.java55 int mid = cb.capacity() >>> 1; in randomizeRange() local
56 int start = RAND.nextInt(mid + 1); // from 0 to mid in randomizeRange()
57 int end = mid + RAND.nextInt(cb.capacity() - mid + 1); // from mid to capacity in randomizeRange()
/libcore/ojluni/src/main/java/java/util/
DArrays.java1180 int mid = (low + high) >>> 1; in mergeSort() local
1181 mergeSort(dest, src, low, mid, -off); in mergeSort()
1182 mergeSort(dest, src, mid, high, -off); in mergeSort()
1186 if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) { in mergeSort()
1192 for(int i = destLow, p = low, q = mid; i < destHigh; i++) { in mergeSort()
1193 if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0) in mergeSort()
1667 int mid = (low + high) >>> 1; in binarySearch0() local
1668 long midVal = a[mid]; in binarySearch0()
1671 low = mid + 1; in binarySearch0()
1673 high = mid - 1; in binarySearch0()
[all …]
DArrayPrefixHelpers.java152 int mid = (l + h) >>> 1; in compute() local
154 new CumulateTask<T>(t, fn, a, org, fnc, th, mid, h); in compute()
156 new CumulateTask<T>(t, fn, a, org, fnc, th, l, mid); in compute()
306 int mid = (l + h) >>> 1; in compute() local
308 new LongCumulateTask(t, fn, a, org, fnc, th, mid, h); in compute()
310 new LongCumulateTask(t, fn, a, org, fnc, th, l, mid); in compute()
458 int mid = (l + h) >>> 1; in compute() local
460 new DoubleCumulateTask(t, fn, a, org, fnc, th, mid, h); in compute()
462 new DoubleCumulateTask(t, fn, a, org, fnc, th, l, mid); in compute()
610 int mid = (l + h) >>> 1; in compute() 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()
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()
DCollections.java275 int mid = (low + high) >>> 1; in indexedBinarySearch() local
276 Comparable<? super T> midVal = list.get(mid); in indexedBinarySearch()
280 low = mid + 1; in indexedBinarySearch()
282 high = mid - 1; in indexedBinarySearch()
284 return mid; // key found in indexedBinarySearch()
297 int mid = (low + high) >>> 1; in iteratorBinarySearch() local
298 Comparable<? super T> midVal = get(i, mid); in iteratorBinarySearch()
302 low = mid + 1; in iteratorBinarySearch()
304 high = mid - 1; in iteratorBinarySearch()
306 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()
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()
DBitSet.java1336 int mid = (lo + hi) >>> 1; in stream() local
1337 if (lo >= mid) { in stream()
1343 index = nextSetBit(mid, wordIndex(hi - 1)); in stream()
1348 return new BitSetSpliterator(lo, mid, est >>>= 1, false); in stream()
DArrayList.java1463 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);
DPriorityQueue.java862 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
863 return (lo >= mid) ? null : in trySplit()
864 new PriorityQueueSpliterator(lo, index = mid, expectedModCount); in trySplit()
DVector.java1470 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()
/libcore/ojluni/src/main/java/java/lang/
DStringUTF16.java1094 int mid = skipLineSeparator(indexOfLineSeparator(half));
1095 if (mid < fence) {
1097 index = mid;
1098 return new LinesSpliterator(value, start, mid - start);
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)
1252 if (Character.isLowSurrogate(charAt(array, mid)) &&
[all …]
DStringLatin1.java685 int mid = skipLineSeparator(indexOfLineSeparator(half)); in trySplit() local
686 if (mid < fence) { in trySplit()
688 index = mid; in trySplit()
689 return new LinesSpliterator(value, start, mid - start); in trySplit()
779 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
780 return (lo >= mid) in trySplit()
782 : new CharsSpliterator(array, lo, index = mid, cs); in trySplit()
/libcore/luni/src/test/java/libcore/java/util/concurrent/
DCountedCompleterTest.java57 int mid = (lo + hi) >>> 1; in chooseOne() local
60 new Task(this, mid, hi).fork(); // right child in chooseOne()
61 new Task(this, lo, mid).fork(); // left child in chooseOne()
/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.java534 final Character mid = new Character((char) (Character.MAX_VALUE / 2)); in test_compareToLjava_lang_Byte() local
539 assertTrue(mid.compareTo(mid) == 0); in test_compareToLjava_lang_Byte()
541 assertTrue(max.compareTo(mid) > 0); in test_compareToLjava_lang_Byte()
544 assertTrue(mid.compareTo(max) < 0); in test_compareToLjava_lang_Byte()
545 assertTrue(mid.compareTo(min) > 0); in test_compareToLjava_lang_Byte()
547 assertTrue(min.compareTo(mid) < 0); in test_compareToLjava_lang_Byte()

12