HomeSort by relevance Sort by last modified time
    Searched refs:middle (Results 1 - 25 of 200) sorted by null

1 2 3 4 5 6 7 8

  /external/clang/test/CXX/expr/expr.prim/expr.prim.general/
p8-0x.cpp 8 struct middle { struct in struct:PR10127::outer
23 operator decltype(outer::middle::inner()) ();
24 operator decltype(outer::middle())::inner2 ();
25 operator decltype(outer())::middle::inner3 ();
26 str(int (decltype(outer::middle::inner())::*n)(),
27 int (decltype(outer::middle())::inner::*o)(),
28 int (decltype(outer())::middle::inner::*p)());
31 decltype(outer::middle::inner()) a;
33 a.decltype(outer::middle())::mfunc(); // expected-error{{'PR10127::outer::middle::mfunc' is not a member of class 'decltype(outer::middle::inner())'}
    [all...]
  /external/chromium/chrome/browser/autofill/
contact_info_unittest.cc 18 EXPECT_EQ(name.middle(), ASCIIToUTF16(""));
24 EXPECT_EQ(name.middle(), ASCIIToUTF16(""));
30 EXPECT_EQ(name.middle(), ASCIIToUTF16("Yevgrafovich"));
37 EXPECT_EQ(name.middle(), ASCIIToUTF16("Ignatius Conan"));
  /external/webkit/Source/WebCore/platform/graphics/cairo/
DrawErrorUnderline.h 72 double middle = x + (i + 1) * unitWidth; local
75 cairo_line_to(cr, middle, bottom); // B
86 double middle = x + (i + 1) * unitWidth; local
90 cairo_line_to(cr, middle + halfSquare, bottom - halfSquare); // G
95 cairo_line_to(cr, middle, bottom - halfSquare); // F
  /external/icu4c/samples/uciter8/
uciter8.c 47 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) {
    [all...]
  /external/chromium/chrome/browser/resources/options/
clear_browser_data_overlay.css 22 vertical-align: middle;
  /external/chromium/third_party/libjingle/source/talk/base/
time.cc 76 bool TimeIsBetween(uint32 earlier, uint32 middle, uint32 later) {
78 return ((earlier <= middle) && (middle <= later));
80 return !((later < middle) && (middle < earlier));
  /external/guava/guava/src/com/google/common/collect/
SortedLists.java 73 int middle = (lower + upper + 1) >>> 1; local
74 int c = comparator.compare(list.get(middle), key);
76 upper = middle - 1;
78 lower = middle;
98 int middle = (lower + upper) >>> 1; local
99 int c = comparator.compare(list.get(middle), key);
101 lower = middle + 1;
103 upper = middle;
271 int middle = (lower + upper) >>> 1; local
272 int c = comparator.compare(key, list.get(middle));
    [all...]
  /external/llvm/test/MC/AsmParser/
macro-args.s 32 middle _$0, $1
34 .macro middle
  /dalvik/vm/mterp/armv5te/
OP_CONST_WIDE.S 4 FETCH(r1, 2) @ r1<- BBBB (low middle)
5 FETCH(r2, 3) @ r2<- hhhh (high middle)
  /dalvik/vm/mterp/mips/
OP_CONST_WIDE.S 4 FETCH(a1, 2) # a1 <- BBBB (low middle)
5 FETCH(a2, 3) # a2 <- hhhh (high middle)
  /frameworks/base/tools/preload/
LoadedClass.java 96 int middle = size / 2; local
99 return times[middle];
102 return (times[middle - 1] + times[middle]) / 2;
  /external/elfutils/tests/
dwfl-bug-addr-overflow.c 63 Dwfl_Module *middle = dwfl_report_module (dwfl, "middle", local
66 assert (middle);
76 assert (mod == middle);
  /external/icu4c/common/unicode/
listformatter.h 36 ListFormatData(const UnicodeString& two, const UnicodeString& start, const UnicodeString& middle, const UnicodeString& end) :
37 twoPattern(two), startPattern(start), middlePattern(middle), endPattern(end) {}
118 static void addDataToHash(const char* locale, const char* two, const char* start, const char* middle, const char* end, UErrorCode& errorCode);
  /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Regress/
regress-159334.js 98 var middle = beginLine + (count >>> 1);
99 return buildEval_r(beginLine, middle) + buildEval_r(middle, endLine);
  /packages/apps/Contacts/src/com/android/contacts/editor/
PhoneticNameEditorView.java 72 String middle = mValues.getPhoneticMiddleName(); local
74 mPhoneticName = PhoneticNameEditorView.buildPhoneticName(family, middle, given);
89 * Parses phonetic name and returns parsed data (family, middle, given) as ContentValues.
103 String middle = null; local
118 middle = strings[1];
128 item.setPhoneticMiddleName(middle);
136 public static String buildPhoneticName(String family, String middle, String given) {
137 if (!TextUtils.isEmpty(family) || !TextUtils.isEmpty(middle)
143 if (!TextUtils.isEmpty(middle)) {
144 sb.append(middle.trim()).append(' ')
215 String middle = entry.getPhoneticMiddleName(); local
    [all...]
  /cts/suite/audio_quality/lib/src/audio/
AudioSignalFactory.cpp 54 int middle = RAND_MAX / 2; local
55 double multiplier = (double)maxPositive / middle;
58 val = (int16_t)((val - middle) * maxPositive / middle);
  /external/webkit/LayoutTests/fast/dom/HTMLAnchorElement/script-tests/
set-href-attribute-hash.js 6 a.href = "https://www.mydomain.com:8080/path/testurl.html#middle";
11 a.href = "file:///path/testurl.html#middle";
16 a.href = "http://www.mydomain.com/path/testurl.html#middle";
23 a.href = "https://www.my\"d(){}|~om?ain#com/path/testurl.html#middle";
25 shouldBe("a.href", "'https://www.my\"d(){}|~om?ain#com/path/testurl.html#middle'");
31 a.href = "https://www.mydomain.com/path/testurl.html#middle";
38 a.href = "https://www.mydomain.com/path/testurl.html#middle";
56 a.href = "http://mydomain.com#middle";
  /external/srec/srec/clib/
voc_read.c 168 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/harfbuzz/src/
harfbuzz-open.c 816 HB_UShort min, max, new_min, new_max, middle; local
837 middle = max - ( ( max - min ) >> 1 );
839 if ( glyphID == array[middle] )
841 *index = middle;
844 else if ( glyphID < array[middle] )
846 if ( middle == min )
848 new_max = middle - 1;
852 if ( middle == max )
854 new_min = middle + 1;
866 HB_UShort min, max, new_min, new_max, middle; local
1197 HB_UShort min, max, new_min, new_max, middle; local
    [all...]
  /external/harfbuzz_ng/src/hb-old/
harfbuzz-open.c 816 HB_UShort min, max, new_min, new_max, middle; local
837 middle = max - ( ( max - min ) >> 1 );
839 if ( glyphID == array[middle] )
841 *index = middle;
844 else if ( glyphID < array[middle] )
846 if ( middle == min )
848 new_max = middle - 1;
852 if ( middle == max )
854 new_min = middle + 1;
866 HB_UShort min, max, new_min, new_max, middle; local
1197 HB_UShort min, max, new_min, new_max, middle; local
    [all...]
  /external/grub/lib/
getopt.c 315 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...]
  /ndk/sources/host-tools/make-3.81/
getopt.c 305 int middle = last_nonopt;
336 while (top > middle && middle > bottom)
338 if (top - middle > middle - bottom)
341 int len = middle - bottom;
348 argv[bottom + i] = argv[top - (middle - bottom) + i];
349 argv[top - (middle - bottom) + i] = tem;
350 SWAP_FLAGS (bottom + i, top - (middle - bottom) + i);
358 int len = top - middle;
303 int middle = last_nonopt; local
    [all...]
  /external/icu4c/i18n/
ucol_wgt.cpp 159 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local
194 uprv_memset(&middle, 0, sizeof(middle));
203 * middle 1
222 middle.start=incWeightTrail(weight, 1);
235 middle.end=decWeightTrail(weight, 1);
237 /* set the middle range */
238 middle.length=1;
239 if(middle.end>=middle.start)
    [all...]
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
SortUtil.java 204 // the middle element in the array is our partitioning element
261 // the middle element in the array is our partitioning element
327 int low, int middle, int high, Comparator comp) {
328 int leftEnd = middle - 1;
332 while (low <= leftEnd && middle <= high) {
333 if (comp.compare(src[low], src[middle]) <= 0) {
336 dest[pos++] = src[middle++];
344 while (middle <= high) {
345 dest[pos++] = src[middle++];
  /packages/apps/Mms/src/com/android/mms/ui/
QuickContactDivot.java 135 final int middle = right / 2; local
160 (int)(middle - halfWidth),
162 (int)(middle + halfWidth),

Completed in 1685 milliseconds

1 2 3 4 5 6 7 8