HomeSort by relevance Sort by last modified time
    Searched refs:middle (Results 26 - 50 of 285) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
CollationWeights.java 313 WeightRange middle = new WeightRange(); local
322 * middle 1
343 middle.start=incWeightTrail(weight, middleLength);
346 // which would yield a middle range starting at 0.
347 middle.start=0xffffffffL; // no middle range
362 middle.end=decWeightTrail(weight, middleLength);
364 /* set the middle range */
365 middle.length=middleLength;
366 if(middle.end>=middle.start)
    [all...]
  /external/clang/test/CXX/basic/basic.link/
p7.cpp 9 void middle() { function in namespace:X
  /packages/apps/Contacts/src/com/android/contacts/editor/
PhoneticNameEditorView.java 72 String middle = mValues.getPhoneticMiddleName(); local
74 mPhoneticName = NameConverter.buildPhoneticName(family, middle, given);
148 String middle = entry.getPhoneticMiddleName(); local
151 return !TextUtils.isEmpty(family) || !TextUtils.isEmpty(middle)
  /system/netd/server/
UidRanges.cpp 75 auto middle = mRanges.insert(mRanges.end(), other.mRanges.begin(), other.mRanges.end()); local
76 std::inplace_merge(mRanges.begin(), middle, mRanges.end());
  /external/icu/icu4c/source/test/cintltst/
nfsprep.c 153 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;
custrtst.c 1189 int32_t i, pos1, pos2, middle, length; local
    [all...]
  /external/vixl/src/vixl/
invalset.h 445 // Avoid overflow when computing the middle index.
446 size_t middle = low / 2 + high / 2 + (low & high & 1);
447 if ((middle == low) || (middle == high)) {
450 while (!IsValid(elements[middle]) && (middle < high - 1)) ++middle;
451 while (!IsValid(elements[middle]) && (low + 1 < middle)) --middle;
    [all...]
  /external/marisa-trie/lib/marisa/
bitvector.cc 402 UInt32 middle = (begin + end) / 2; local
403 if (i < (middle * 512) - ranks_[middle].abs()) {
404 end = middle;
406 begin = middle;
486 UInt32 middle = (begin + end) / 2; local
487 if (i < ranks_[middle].abs()) {
488 end = middle;
490 begin = middle;
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
bitvector.cc 403 UInt32 middle = (begin + end) / 2; local
404 if (i < (middle * 512) - ranks_[middle].abs()) {
405 end = middle;
407 begin = middle;
488 UInt32 middle = (begin + end) / 2; local
489 if (i < ranks_[middle].abs()) {
490 end = middle;
492 begin = middle;
  /external/v8/test/mjsunit/
cyrillic.js 37 MIDDLE: "\u0427", // CHE
38 middle: "\u0447", // che
52 MIDDLE: SIGMA, // SIGMA
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)
    [all...]
big-array-literal.js 65 assertEquals(42.2, x[0]), "x array in middle";
68 assertEquals(42.2, x.a, "x object in middle");
78 assertEquals(42.2, y[0], "y array in middle");
81 assertEquals(42.2, y.a, "y object in middle");
big-object-literal.js 65 assertEquals(42.2, x[0]), "x array in middle";
68 assertEquals(42.2, x.a, "x object in middle");
78 assertEquals(42.2, y[0], "y array in middle");
81 assertEquals(42.2, y.a, "y object in middle");
debug-stepout-scope-part8.js 88 with ({x: 'middle'}) {
99 with ({x: 'middle'}) {
120 with ({x: 'middle' + i}) {
154 with ({x: 'middle'}) {
  /cts/suite/cts/deviceTests/opengl/jni/primitive/fullpipeline/
FullPipelineRenderer.cpp 151 float middle = count / 2.0f; local
160 transformMatrix->translate(i - middle, j - middle, 0.0f);
  /external/owasp/sanitizer/src/tests/org/owasp/html/
HtmlSanitizerTest.java 257 int middle = n * "<div>".length(); local
258 assertEquals(sanitized.substring(0, middle),
260 assertEquals(sanitized.substring(middle),
  /external/zxing/qr_scanner/src/com/google/zxing/client/android/
PlanarYUVLuminanceSource.java 133 int middle = rowStart + width / 2; local
134 for (int x1 = rowStart, x2 = rowStart + width - 1; x1 < middle; x1++, x2--) {
  /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/
Percentile.java 357 * first, the middle and the last element of the array slice
362 final int middle = begin + (inclusiveEnd - begin) / 2; local
364 final double wMiddle = work[middle];
369 return middle;
377 return (wMiddle < wEnd) ? inclusiveEnd : middle;
  /external/icu/icu4c/source/common/
filterednormalizer2.cpp 133 UnicodeString middle(first, suffixStart, INT32_MAX);
135 norm2.normalizeSecondAndAppend(middle, prefix, errorCode);
137 norm2.append(middle, prefix, errorCode);
139 first.replace(suffixStart, INT32_MAX, middle);
listformatter.cpp 38 const UnicodeString& middle,
42 middlePattern(middle),
185 UnicodeString two, start, middle, end; local
188 getStringByKey(rb, "middle", middle, errorCode);
194 ListFormatInternal* result = new ListFormatInternal(two, start, middle, end);
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
FilteredNormalizer2.java 279 StringBuilder middle=new StringBuilder( local
282 norm2.normalizeSecondAndAppend(middle, prefix);
284 norm2.append(middle, prefix);
286 first.delete(suffixStart, 0x7fffffff).append(middle);
  /frameworks/support/v7/recyclerview/src/android/support/v7/util/
SortedList.java 594 final int middle = (left + right) / 2; local
595 T myItem = mData[middle];
598 left = middle + 1;
601 return middle;
603 int exact = linearEqualitySearch(item, middle, left, right);
605 return exact == INVALID_POSITION ? middle : exact;
611 right = middle;
617 private int linearEqualitySearch(T item, int middle, int left, int right) {
619 for (int next = middle - 1; next >= left; next--) {
629 for (int next = middle + 1; next < right; next++)
    [all...]
  /external/v8/test/webkit/
regexp-zero-length-alternatives.js 44 // Non-capturing empty middle alternative greedy '*'
65 // Capturing empty middle alternative greedy '*'
86 // Non-capturing empty middle alternative fixed-count
107 // Non-capturing empty middle alternative non-greedy '*'
128 // Capturing empty middle alternative non-greedy '*'
149 // Non-capturing empty middle alternative greedy '?'
170 // Capturing empty middle alternative greedy '?'
191 // Non-capturing empty middle alternative non-greedy '?'
212 // Capturing empty middle alternative non-greedy '?'
233 // Non-capturing empty middle alternative greedy '*' non-termina
    [all...]
  /external/bison/src/
lalr.c 137 goto_number middle; local
146 middle = (low + high) / 2;
147 s = from_state[middle];
149 return middle;
151 low = middle + 1;
153 high = middle - 1;
  /external/llvm/docs/_static/
llvm.css 21 text-align: center; vertical-align: middle; }
32 vertical-align: middle;
103 text-align: center; vertical-align: middle; }
  /external/opencv/cv/src/
_cvkdtree.hpp 145 __instype *middle = std::partition(first, last - 1, local
148 std::swap(*middle, last[-1]);
150 if (middle < k)
151 median_partition(middle + 1, last, k, dim, ctor);
152 else if (middle > k)
153 median_partition(first, middle, k, dim, ctor);

Completed in 774 milliseconds

12 3 4 5 6 7 8 91011>>