Searched refs:middle (Results 1 - 25 of 46) sorted by relevance

12

/external/icu4c/samples/uciter8/
H A Duciter8.c47 int32_t i, pos1, pos2, middle, length; local
58 /* set into the middle */
59 middle=length/2;
61 pos1=iter1->move(iter1, middle, UITER_ZERO);
62 if(pos1!=middle) {
63 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
67 pos2=iter2->move(iter2, middle, UITER_ZERO);
68 if(pos2!=middle) {
216 testIteratorState(UCharIterator *iter1, UCharIterator *iter2, const char *n, int32_t middle) argument
[all...]
/external/webkit/JavaScriptCore/tests/mozilla/js1_5/Regress/
H A Dregress-159334.js98 var middle = beginLine + (count >>> 1);
99 return buildEval_r(beginLine, middle) + buildEval_r(middle, endLine);
/external/srec/srec/clib/
H A Dvoc_read.c168 const char* middle; local
180 /* pick a point in the middle and align to next entry */
181 middle = low + ((high - low) >> 1) - 1;
182 while (*middle++ != '\n') ;
184 /* compare 'label' to 'middle' */
185 int diff = kompare(label, middle);
191 /* 'middle' aligned to 'high', so move 'high' down */
192 if (middle == high) {
199 if (diff > 0) low = middle;
200 else high = middle;
[all...]
/external/skia/src/core/
H A DSkAntiRun.h66 int middle = x1 - x0;
69 if (middle == 0)
90 middle += 1;
96 middle += sk_make_nonzero_neg_one(aa);
99 fMiddleCount = middle;
/external/v8/test/mjsunit/
H A Dcyrillic.js38 middle: "\u0447", // che
53 middle: sigma, // sigma
70 var middle = lc ? chars.middle : chars.MIDDLE;
73 var middle_other_case = lc ? chars.MIDDLE : chars.middle;
77 assertTrue(Range(first, last).test(middle), 2);
85 assertTrue(Range(first, last, "i").test(middle), 8);
115 assertTrue(Range(greek.first, cyrillic.LAST, flag).test(greek.middle), 20);
129 assertEquals(ignore_case, Range(greek.first, cyrillic.LAST, flag).test(cyrillic.middle), 29);
196 assertEquals(ignore_case || full, re.test(cyrillic.middle), 6
[all...]
/external/grub/lib/
H A Dgetopt.c315 int middle = last_nonopt;
346 while (top > middle && middle > bottom)
348 if (top - middle > middle - bottom)
351 int len = middle - bottom;
358 argv[bottom + i] = argv[top - (middle - bottom) + i];
359 argv[top - (middle - bottom) + i] = tem;
360 SWAP_FLAGS (bottom + i, top - (middle - bottom) + i);
368 int len = top - middle;
312 int middle = last_nonopt; local
[all...]
/external/chromium/third_party/icu/source/i18n/
H A Ducol_wgt.c146 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local
181 uprv_memset(&middle, 0, sizeof(middle));
190 * middle 1
209 middle.start=incWeightTrail(weight, 1);
222 middle.end=decWeightTrail(weight, 1);
224 /* set the middle range */
225 middle.length=1;
226 if(middle.end>=middle
[all...]
/external/icu4c/i18n/
H A Ducol_wgt.cpp146 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local
181 uprv_memset(&middle, 0, sizeof(middle));
190 * middle 1
209 middle.start=incWeightTrail(weight, 1);
222 middle.end=decWeightTrail(weight, 1);
224 /* set the middle range */
225 middle.length=1;
226 if(middle.end>=middle
[all...]
/external/chromium/third_party/icu/source/test/cintltst/
H A Dnfsprep.c153 int left, middle, right,rc; local
159 middle = (left+right)/2;
160 rc=strncmp(sortedArr[middle],target, targetLen);
163 left = middle+1;
165 right = middle -1;
167 return middle;
H A Dcustrtst.c1194 int32_t i, pos1, pos2, middle, length; local
1205 /* set into the middle */
1206 middle=length/2;
1208 pos1=iter1->move(iter1, middle, UITER_ZERO);
1209 if(pos1!=middle) {
1210 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
1214 pos2=iter2->move(iter2, middle, UITER_ZERO);
1215 if(pos2!=middle) {
1363 testIteratorState(UCharIterator *iter1, UCharIterator *iter2, const char *n, int32_t middle) argument
1544 compareIterNoIndexes(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2, int32_t middle) argument
1700 testUNormIteratorWithText(const UChar *text, int32_t textLength, int32_t middle, const char *name1, const char *n2) argument
1763 int32_t i, middle, length; local
[all...]
/external/icu4c/test/cintltst/
H A Dnfsprep.c153 int left, middle, right,rc; local
159 middle = (left+right)/2;
160 rc=strncmp(sortedArr[middle],target, targetLen);
163 left = middle+1;
165 right = middle -1;
167 return middle;
H A Dcustrtst.c1194 int32_t i, pos1, pos2, middle, length; local
1205 /* set into the middle */
1206 middle=length/2;
1208 pos1=iter1->move(iter1, middle, UITER_ZERO);
1209 if(pos1!=middle) {
1210 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
1214 pos2=iter2->move(iter2, middle, UITER_ZERO);
1215 if(pos2!=middle) {
1363 testIteratorState(UCharIterator *iter1, UCharIterator *iter2, const char *n, int32_t middle) argument
1544 compareIterNoIndexes(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2, int32_t middle) argument
1700 testUNormIteratorWithText(const UChar *text, int32_t textLength, int32_t middle, const char *name1, const char *n2) argument
1763 int32_t i, middle, length; local
[all...]
/external/guava/src/com/google/common/collect/
H A DRegularImmutableSortedSet.java135 int middle = lower + (upper - lower) / 2;
136 int c = unsafeCompare(key, elements[middle]);
138 upper = middle - 1;
140 lower = middle + 1;
142 return middle;
H A DImmutableSortedMap.java417 int middle = lower + (upper - lower) / 2;
419 comparator, key, entries[middle].getKey());
421 upper = middle - 1;
423 lower = middle + 1;
425 return middle;
/external/bison/src/
H A Dlalr.c148 goto_number middle; local
157 middle = (low + high) / 2;
158 s = from_state[middle];
160 return middle;
162 low = middle + 1;
164 high = middle - 1;
/external/icu4c/common/
H A Dfilterednormalizer2.cpp131 UnicodeString middle(first, suffixStart, INT32_MAX);
133 norm2.normalizeSecondAndAppend(middle, prefix, errorCode);
135 norm2.append(middle, prefix, errorCode);
137 first.replace(suffixStart, INT32_MAX, middle);
H A Dtriedict.cpp508 // go on to the next node. Note that a word cannot end in the middle
517 int middle; local
520 middle = (high+low)/2;
521 if (uc == hnode->entries[middle].ch) {
523 node = getCompactNode(fData, hnode->entries[middle].equal);
529 else if (uc < hnode->entries[middle].ch) {
530 high = middle-1;
533 low = middle+1;
1193 int middle = (low+high)/2; local
1194 TernaryNode *result = new TernaryNode(array[middle]
[all...]
H A Dnormalizer2impl.cpp1223 UnicodeString middle(lastStarterInDest,
1226 middle.append(src, (int32_t)(firstStarterInSrc-src));
1227 const UChar *middleStart=middle.getBuffer();
1228 compose(middleStart, middleStart+middle.length(), onlyContiguous,
1593 UnicodeString middle(lastBoundaryInDest,
1596 middle.append(src, (int32_t)(firstBoundaryInSrc-src));
1597 const UChar *middleStart=middle.getBuffer();
1598 makeFCD(middleStart, middleStart+middle.length(), &buffer, errorCode);
/external/bison/lib/
H A Dgetopt.c158 int middle = d->__last_nonopt;
189 while (top > middle && middle > bottom)
191 if (top - middle > middle - bottom)
194 int len = middle - bottom;
201 argv[bottom + i] = argv[top - (middle - bottom) + i];
202 argv[top - (middle - bottom) + i] = tem;
203 SWAP_FLAGS (bottom + i, top - (middle - bottom) + i);
211 int len = top - middle;
155 int middle = d->__last_nonopt; local
[all...]
/external/chromium/base/
H A Dpe_image.cc185 PDWORD middle = lower + (upper - lower) / 2; local
186 LPCSTR name = reinterpret_cast<LPCSTR>(RVAToAddr(*middle));
191 lower = middle;
196 lower = middle + 1;
198 upper = middle;
/external/webkit/WebCore/inspector/front-end/
H A DResourcesPanel.js791 var middle = ((resource.responseReceivedTime - this.minimumBoundary) / this.boundarySpan) * 100;
793 var middle = (this.startAtZero ? start : 100);
798 var end = (this.startAtZero ? middle : 100);
802 middle -= start;
806 return {start: start, middle: middle, end: end};
1210 this._labelLeftElement.style.setProperty("right", (100 - this._percentages.middle) + "%");
1219 this._labelRightElement.style.setProperty("left", this._percentages.middle + "%");
1241 this._barRightElement.style.setProperty("left", percentages.middle + "%");
/external/chromium/third_party/icu/source/common/
H A Dtriedict.cpp659 int middle; local
661 middle = (high+low)/2;
662 if (uc == entries[middle].ch) {
663 return middle;
665 else if (uc < entries[middle].ch) {
666 high = middle-1;
669 low = middle+1;
741 // go on to the next node. Note that a word cannot end in the middle
1681 int middle = (low+high)/2; local
1682 TernaryNode *result = new TernaryNode(hnode->entries[middle]
[all...]
/external/chromium/third_party/icu/source/test/intltest/
H A Dtzfmttst.cpp369 UBool middle = TRUE; local
440 if (middle) {
441 // Test the date in the middle of two transitions.
443 middle = FALSE;
/external/libxml2/
H A DparserInternals.c725 * splitting a character in the middle. In that case do not raise
838 * splitting a character in the middle. In that case do not raise
1886 unsigned long upper, lower, middle; local
1895 middle = 0;
1897 middle = lower + (upper - lower) / 2;
1898 if (node == seq->buffer[middle - 1].node)
1900 else if (node < seq->buffer[middle - 1].node)
1901 upper = middle - 1;
1903 lower = middle + 1;
1907 if (middle
[all...]
/external/webkit/WebCore/css/
H A Dhtml.css178 vertical-align: middle;
184 vertical-align: middle;
190 vertical-align: middle;
196 vertical-align: middle;

Completed in 1426 milliseconds

12