HomeSort by relevance Sort by last modified time
    Searched defs:mid (Results 1 - 25 of 120) sorted by null

1 2 3 4 5

  /external/webkit/JavaScriptCore/pcre/
pcre_ucp_searchfuncs.cpp 67 int mid; local
77 mid = (bot + top) >> 1;
78 if (c == (ucp_table[mid].f0 & f0_charmask))
80 if (c < (ucp_table[mid].f0 & f0_charmask))
81 top = mid;
83 if ((ucp_table[mid].f0 & f0_rangeflag) && (c <= (ucp_table[mid].f0 & f0_charmask) + (ucp_table[mid].f1 & f1_rangemask)))
85 bot = mid + 1;
92 if (ucp_table[mid].f0 & f0_rangeflag
    [all...]
  /packages/apps/Email/src/com/android/exchange/
MailboxAlarmReceiver.java 32 long mid = intent.getLongExtra("mailbox", -1); local
33 SyncManager.log("Alarm received for: " + SyncManager.alarmOwner(mid));
34 SyncManager.alert(context, mid);
  /dalvik/dx/src/junit/runner/
Sorter.java 20 String mid= (String)values.elementAt((left + right) / 2); local
22 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
24 while (mid.compareTo((String)(values.elementAt(right))) < 0)
  /dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
BinarySearch.java 36 int mid = (low + high) >> 1; local
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; local
61 mid = (low + high) >> 1;
62 value = data.charAt(mid);
64 low = mid + 1;
66 return mid;
    [all...]
  /dalvik/libcore/luni/src/main/native/
java_io_ObjectInputStream.c 187 jmethodID mid = local
190 if(mid == 0) {
195 return (jobject) (*env)->NewObject(env, instantiationClass, mid);
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 = (*env)->GetMethodID(env, lookupClass, "getSignature"
92 jmethodID mid = (*env)->GetStaticMethodID(env, targetClass, local
    [all...]
  /dalvik/libcore/luni/src/test/java/junit/runner/
Sorter.java 20 String mid= (String)values.elementAt((left + right) / 2); local
22 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
24 while (mid.compareTo((String)(values.elementAt(right))) < 0)
  /external/e2fsprogs/e2fsck/
dx_dirinfo.c 83 int low, high, mid; local
95 mid = (low+high)/2;
96 if (mid == low || mid == high)
98 if (ino == ctx->dx_dir_info[mid].ino)
99 return &ctx->dx_dir_info[mid];
100 if (ino < ctx->dx_dir_info[mid].ino)
101 high = mid;
103 low = mid;
  /external/junit/src/junit/runner/
Sorter.java 18 String mid= (String)values.elementAt((left + right) / 2); local
20 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
22 while (mid.compareTo((String)(values.elementAt(right))) < 0)
  /external/skia/include/core/
SkTSearch.h 36 int mid = (hi + lo) >> 1; local
37 const T* elem = (const T*)((const char*)base + mid * elemSize);
40 lo = mid + 1;
42 hi = mid;
70 int mid = (hi + lo) >> 1; local
71 const T* elem = (const T*)((const char*)base + mid * elemSize);
74 lo = mid + 1;
76 hi = mid;
104 int mid = (hi + lo) >> 1; local
105 const T* elem = *(const T**)((const char*)base + mid * elemSize)
    [all...]
  /frameworks/base/test-runner/src/junit/runner/
Sorter.java 21 String mid= (String)values.elementAt((left + right) / 2); local
23 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
25 while (mid.compareTo((String)(values.elementAt(right))) < 0)
  /external/freetype/src/psnames/
pstables.h 4021 int mid = ( min + max ) >> 1; local
    [all...]
  /external/skia/src/animator/
SkGetCondensedInfo.cpp 34 int mid = (hi + lo) >> 1; local
35 if (strcmp(&strings[lengths[mid << 2]], target) < 0)
36 lo = mid + 1;
38 hi = mid;
50 int mid = (hi + lo) >> 1; local
51 if (gTypeIDs[mid] < match)
52 lo = mid + 1;
54 hi = mid;
  /dalvik/vm/
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;
  /external/bluetooth/glib/glib/
gqsort.c 149 /* Select median value from among LO, MID, and HI. Rearrange
155 char *mid = lo + size * ((hi - lo) / size >> 1); local
157 if ((*compare_func) ((void *) mid, (void *) lo, user_data) < 0)
158 SWAP (mid, lo, size);
159 if ((*compare_func) ((void *) hi, (void *) mid, user_data) < 0)
160 SWAP (mid, hi, size);
163 if ((*compare_func) ((void *) mid, (void *) lo, user_data) < 0)
164 SWAP (mid, lo, size);
175 while ((*compare_func) ((void *) left_ptr, (void *) mid, user_data) < 0)
178 while ((*compare_func) ((void *) mid, (void *) right_ptr, user_data) < 0
    [all...]
  /external/e2fsprogs/lib/blkid/
getsize.c 176 const blkid_loff_t mid = (low + high) / 2; local
178 if (valid_offset(fd, mid))
179 low = mid;
181 high = mid;
  /external/skia/src/core/
SkTSearch.cpp 40 int mid = (hi + lo) >> 1; local
41 const char* elem = index_into_base(base, mid, elemSize);
45 lo = mid + 1;
47 hi = mid;
49 return mid;
  /external/webkit/WebKit/android/jni/
WebStorage.cpp 59 jmethodID mid = env->GetMethodID(setClass, "add", "(Ljava/lang/Object;)Z"); local
66 env->CallBooleanMethod(set, mid, jUrl);
  /frameworks/base/libs/surfaceflinger/
Tokenizer.cpp 107 ssize_t mid; local
110 mid = l + (h - l)/2;
111 const run_t* const curr = a + mid;
116 err = l = mid;
119 l = mid + 1;
121 h = mid - 1;
  /frameworks/base/opengl/libagl/
Tokenizer.cpp 108 ssize_t mid; local
111 mid = l + (h - l)/2;
112 const run_t* const curr = a + mid;
117 err = l = mid;
120 l = mid + 1;
122 h = mid - 1;
  /external/e2fsprogs/lib/ext2fs/
badblocks.c 164 int low, high, mid; local
180 mid = (low+high)/2;
181 if (mid == low || mid == high)
183 if (blk == bb->list[mid])
184 return mid;
185 if (blk < bb->list[mid])
186 high = mid;
188 low = mid;
  /external/e2fsprogs/resize/
extent.c 144 int low, high, mid; local
157 mid = (low+high)/2;
160 mid = low;
173 mid = low + ((int) (range * (high-low)));
176 if ((old_loc >= extent->list[mid].old_loc) &&
177 (old_loc < extent->list[mid].old_loc + extent->list[mid].size))
178 return (extent->list[mid].new_loc +
179 (old_loc - extent->list[mid].old_loc));
180 if (old_loc < extent->list[mid].old_loc
    [all...]
  /external/freetype/src/sfnt/
ttkern.c 241 FT_UInt mid = ( min + max ) >> 1; local
242 FT_Byte* q = p + 6 * mid;
254 min = mid + 1;
256 max = mid;
  /external/libxml2/
chvalid.c 169 int low, high, mid; local
181 mid = (low + high) / 2;
182 if ((unsigned short) val < sptr[mid].low) {
183 high = mid - 1;
185 if ((unsigned short) val > sptr[mid].high) {
186 low = mid + 1;
200 mid = (low + high) / 2;
201 if (val < lptr[mid].low) {
202 high = mid - 1;
204 if (val > lptr[mid].high)
    [all...]
  /external/quake/quake/src/QW/client/
pmovetst.c 183 vec3_t mid; local
247 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
252 if (!PM_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
256 if (PM_HullPointContents (pm_hullmodel, mid, node->children[side])
259 Con_Printf ("mid PointInHullSolid\n");
264 if (PM_HullPointContents (hull, node->children[side^1], mid)
267 return PM_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
286 while (PM_HullPointContents (hull, hull->firstclipnode, mid)
293 VectorCopy (mid, trace->endpos);
299 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
    [all...]

Completed in 1156 milliseconds

1 2 3 4 5