/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/ |
H A D | BinarySearch.java | 36 int mid = (low + high) >> 1; 37 char target = data.charAt(mid); 39 return mid; 41 high = mid - 1; 43 low = mid + 1; 59 int low = 0, mid = -1, high = data.length() - 1; 61 mid = (low + high) >> 1; 62 value = data.charAt(mid); 64 low = mid + 1; 66 return mid; [all...] |
/dalvik/libcore/luni/src/main/native/ |
H A D | java_io_ObjectStreamClass.c | 24 jmethodID mid; local 31 mid = (*env)->GetMethodID(env, lookupClass, "getSignature", 33 if(!mid) 41 fieldClass, mid); 48 jmethodID mid; local 55 mid = (*env)->GetMethodID(env, lookupClass, "getSignature", 57 if(!mid) { 63 methodClass, mid); 72 jmethodID mid; local 79 mid 92 jmethodID mid = (*env)->GetStaticMethodID(env, targetClass, local [all...] |
H A D | java_io_ObjectInputStream.c | 187 jmethodID mid = local 190 if(mid == 0) { 195 return (jobject) (*env)->NewObject(env, instantiationClass, mid);
|
/dalvik/dx/src/junit/runner/ |
H A D | Sorter.java | 20 String mid= (String)values.elementAt((left + right) / 2); 22 while (((String)(values.elementAt(left))).compareTo(mid) < 0) 24 while (mid.compareTo((String)(values.elementAt(right))) < 0)
|
/dalvik/libcore/luni/src/test/java/junit/runner/ |
H A D | Sorter.java | 20 String mid= (String)values.elementAt((left + right) / 2); 22 while (((String)(values.elementAt(left))).compareTo(mid) < 0) 24 while (mid.compareTo((String)(values.elementAt(right))) < 0)
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | Arrays.java | 192 int mid = (lo + hi) >>> 1; 193 byte midVal = array[mid]; 196 lo = mid + 1; 198 hi = mid - 1; 200 return mid; // value found 223 int mid = (lo + hi) >>> 1; 224 char midVal = array[mid]; 227 lo = mid + 1; 229 hi = mid - 1; 231 return mid; // valu [all...] |
H A D | TreeMap.java | 540 int low = left_idx + 1, mid = 0, high = right_idx - 1; 542 mid = (low + high) >>> 1; 543 result = backingMap.cmp(object, key, keys[mid]); 545 low = mid + 1; 548 foundIndex = mid; 552 foundIndex = mid; 553 high = mid - 1; 662 int low = left_idx + 1, mid = 0, high = right_idx - 1; 664 mid = (low + high) >>> 1; 665 result = backingMap.cmp(object, key, keys[mid]); [all...] |
H A D | Collections.java | 1510 int low = 0, mid = list.size(), high = mid - 1, result = -1; 1512 mid = (low + high) >> 1; 1513 if ((result = -list.get(mid).compareTo(object)) > 0) { 1514 low = mid + 1; 1516 return mid; 1518 high = mid - 1; 1521 return -mid - (result < 0 ? 1 : 2); 1568 int low = 0, mid = list.size(), high = mid [all...] |
H A D | ComparableTimSort.java | 122 * measured to be too expensive when sorting "mid-sized" arrays (e.g., 227 int mid = (left + right) >>> 1; 228 if (pivot.compareTo(a[mid]) < 0) 229 right = mid; 231 left = mid + 1;
|
H A D | TimSort.java | 149 * measured to be too expensive when sorting "mid-sized" arrays (e.g., 260 int mid = (left + right) >>> 1; 261 if (c.compare(pivot, a[mid]) < 0) 262 right = mid; 264 left = mid + 1;
|
/dalvik/vm/ |
H A D | PointerSet.c | 206 int hi, lo, mid; local 208 lo = mid = 0; 213 mid = (lo + hi) / 2; 214 const void* listVal = pSet->list[mid]; 217 lo = mid + 1; 219 hi = mid - 1; 222 *pIndex = mid; 228 *pIndex = mid;
|
/dalvik/libcore/sql/src/main/native/ |
H A D | sqlite_jni.c | 402 jmethodID mid = (*env)->GetMethodID(env, cls, "busy", local 405 if (mid == 0) { 410 ret = (*env)->CallBooleanMethod(env, h->bh, mid, tabstr.jstr, 430 jmethodID mid = (*env)->GetMethodID(env, cls, "busy", local 433 if (mid == 0) { 437 ret = (*env)->CallBooleanMethod(env, h->bh, mid, 0, (jint) count) 454 jmethodID mid = (*env)->GetMethodID(env, cls, "progress", "()Z"); local 456 if (mid == 0) { 460 ret = (*env)->CallBooleanMethod(env, h->ph, mid) != JNI_TRUE; 475 jmethodID mid; local 1596 jmethodID mid = local 1650 jmethodID mid = (*env)->GetMethodID(env, cls, "last_step", local 1672 jmethodID mid = local 1727 jmethodID mid = (*env)->GetMethodID(env, cls, "last_step", local 2193 jmethodID mid; local 2290 jmethodID mid; local [all...] |
/dalvik/vm/interp/ |
H A D | Interp.c | 864 int mid = (lo + hi) >> 1; local 866 s4 foundVal = s4FromSwitchData(&keys[mid]); 868 hi = mid - 1; 870 lo = mid + 1; 873 testVal, mid, s4FromSwitchData(&entries[mid])); 874 return s4FromSwitchData(&entries[mid]);
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMDefaultBase.java | 360 int mid = (low + high) / 2; 361 int c = list[mid]; 364 high = mid - 1; 366 low = mid + 1; 368 return mid;
|
/dalvik/libcore/luni/src/main/java/java/lang/ |
H A D | AbstractStringBuilder.java | 475 for (int i = 0, mid = count / 2; i < mid; i++, --end) {
|
/dalvik/vm/analysis/ |
H A D | RegisterMap.c | 941 int hi, lo, mid; local 947 mid = (hi + lo) / 2; 948 data = pMap->data + lineWidth * mid; 955 lo = mid + 1; 957 hi = mid - 1;
|
/dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/lang/ |
H A D | CharacterTest.java | 812 final Character mid = new Character((char)(Character.MAX_VALUE/2)); 817 assertTrue(mid.compareTo(mid) == 0); 819 assertTrue(max.compareTo(mid) > 0); 822 assertTrue(mid.compareTo(max) < 0); 823 assertTrue(mid.compareTo(min) > 0); 825 assertTrue(min.compareTo(mid) < 0);
|
/dalvik/tools/dmtracedump/ |
H A D | TraceDump.c | 1171 int hi, lo, mid; local 1190 mid = (hi + lo) / 2; 1192 id = pKeys->methods[mid].methodId; 1195 pKeys->methodCache[hashedId] = mid; 1196 return &pKeys->methods[mid]; 1198 lo = mid + 1; 1200 hi = mid - 1; 1234 fprintf(stderr, "WARNING: hit EOF mid-record\n");
|