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

1 2 3 4 5 6 7 8 91011>>

  /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...]
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/detail/
binary_search.hpp 44 ForwardIter middle; local
48 middle = first;
49 std::advance(middle, half);
50 if (*middle < val) {
51 first = middle;
69 ForwardIter middle; local
73 middle = first;
74 std::advance(middle, half);
75 if (comp(*middle, val)) {
76 first = middle;
94 ForwardIter middle; local
119 ForwardIter middle; local
144 ForwardIter middle, left, right; local
176 ForwardIter middle, left, right; local
    [all...]
  /external/google-breakpad/src/processor/
static_map-inl.h 65 int middle; local
68 middle = begin + (end - begin) / 2;
69 compare_result = compare_(key, GetKeyAtIndex(middle));
71 return IteratorAtIndex(middle);
73 end = middle;
75 begin = middle + 1;
86 int middle; local
89 middle = begin + (end - begin) / 2;
90 comp_result = compare_(key, GetKeyAtIndex(middle));
92 return IteratorAtIndex(middle);
107 int middle; local
    [all...]
  /external/icu/icu4c/source/samples/uciter8/
uciter8.c 45 int32_t i, pos1, pos2, middle, length; local
56 /* set into the middle */
57 middle=length/2;
59 pos1=iter1->move(iter1, middle, UITER_ZERO);
60 if(pos1!=middle) {
61 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
65 pos2=iter2->move(iter2, middle, UITER_ZERO);
66 if(pos2!=middle) {
    [all...]
  /external/mesa3d/src/gallium/auxiliary/draw/
draw_pt.c 50 * - middle -- fetch, shade, cliptest, viewport
61 struct draw_pt_middle_end *middle = NULL; local
98 if (draw->pt.middle.llvm) {
99 middle = draw->pt.middle.llvm;
102 middle = draw->pt.middle.fetch_emit;
104 middle = draw->pt.middle.fetch_shade_emit;
106 middle = draw->pt.middle.general
    [all...]
draw_pt_vsplit.c 43 struct draw_pt_middle_end *middle; member in struct:vsplit_frontend
77 vsplit->middle->run(vsplit->middle,
148 struct draw_pt_middle_end *middle,
174 vsplit->middle = middle;
175 middle->prepare(middle, vsplit->prim, opt, &vsplit->max_vertices);
186 vsplit->middle->finish(vsplit->middle);
    [all...]
draw_pt_fetch_shade_pipeline.c 54 static void fetch_pipeline_prepare( struct draw_pt_middle_end *middle,
59 struct fetch_pipeline_middle_end *fpme = (struct fetch_pipeline_middle_end *)middle;
200 static void fetch_pipeline_generic( struct draw_pt_middle_end *middle,
204 struct fetch_pipeline_middle_end *fpme = (struct fetch_pipeline_middle_end *)middle;
294 static void fetch_pipeline_run( struct draw_pt_middle_end *middle,
301 struct fetch_pipeline_middle_end *fpme = (struct fetch_pipeline_middle_end *)middle;
319 fetch_pipeline_generic( middle, &fetch_info, &prim_info );
323 static void fetch_pipeline_linear_run( struct draw_pt_middle_end *middle,
328 struct fetch_pipeline_middle_end *fpme = (struct fetch_pipeline_middle_end *)middle;
346 fetch_pipeline_generic( middle, &fetch_info, &prim_info )
    [all...]
draw_pt_fetch_shade_pipeline_llvm.c 61 llvm_middle_end_prepare( struct draw_pt_middle_end *middle,
66 struct llvm_middle_end *fpme = (struct llvm_middle_end *)middle;
214 llvm_pipeline_generic( struct draw_pt_middle_end *middle,
218 struct llvm_middle_end *fpme = (struct llvm_middle_end *)middle;
306 static void llvm_middle_end_run( struct draw_pt_middle_end *middle,
313 struct llvm_middle_end *fpme = (struct llvm_middle_end *)middle;
331 llvm_pipeline_generic( middle, &fetch_info, &prim_info );
335 static void llvm_middle_end_linear_run( struct draw_pt_middle_end *middle,
340 struct llvm_middle_end *fpme = (struct llvm_middle_end *)middle;
358 llvm_pipeline_generic( middle, &fetch_info, &prim_info )
    [all...]
draw_pt_fetch_emit.c 43 /* The simplest 'middle end' in the new vertex code.
45 * The responsibilities of a middle end are to:
90 static void fetch_emit_prepare( struct draw_pt_middle_end *middle,
95 struct fetch_emit_middle_end *feme = (struct fetch_emit_middle_end *)middle;
183 static void fetch_emit_run( struct draw_pt_middle_end *middle,
190 struct fetch_emit_middle_end *feme = (struct fetch_emit_middle_end *)middle;
243 static void fetch_emit_run_linear( struct draw_pt_middle_end *middle,
248 struct fetch_emit_middle_end *feme = (struct fetch_emit_middle_end *)middle;
300 static boolean fetch_emit_run_linear_elts( struct draw_pt_middle_end *middle,
307 struct fetch_emit_middle_end *feme = (struct fetch_emit_middle_end *)middle;
    [all...]
draw_pt_vsplit_tmp.h 111 return vsplit->middle->run_linear_elts(vsplit->middle,
235 vsplit->middle->run_linear(vsplit->middle, istart, icount, flags);
252 vsplit->middle->run(vsplit->middle, vsplit->fetch_elts, nr,
256 vsplit->middle->run_linear(vsplit->middle, istart, icount, flags);
275 vsplit->middle->run(vsplit->middle, vsplit->fetch_elts, nr
    [all...]
draw_pt_fetch_shade_emit.c 69 fse_prepare(struct draw_pt_middle_end *middle,
74 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle;
183 fse_run_linear(struct draw_pt_middle_end *middle,
188 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle;
245 fse_run(struct draw_pt_middle_end *middle,
252 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle;
303 fse_run_linear_elts(struct draw_pt_middle_end *middle,
310 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle;
349 fse_finish(struct draw_pt_middle_end *middle)
355 fse_destroy(struct draw_pt_middle_end *middle)
    [all...]
  /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
  /external/toybox/
main.c 32 int top, bottom, middle; local
48 middle = (top+bottom)/2;
49 if (middle<bottom || middle>top) return NULL;
50 result = strcmp(name,toy_list[middle].name);
51 if (!result) return toy_list+middle;
52 if (result<0) top=--middle;
53 else bottom = ++middle;
  /frameworks/base/tools/preload/
LoadedClass.java 
  /external/elfutils/src/tests/
dwfl-bug-addr-overflow.c 55 Dwfl_Module *middle = dwfl_report_module (dwfl, "middle", local
58 assert (middle);
68 assert (mod == middle);
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
BreakCTDictionary.java 219 // go on to the next node. Note that a word cannot end in the middle
227 int middle; local
230 middle = (high + low) >>> 1;
231 if (uc == hnode[middle].ch) {
233 node = getCompactTrieNode(hnode[middle].equal);
238 } else if (uc < hnode[middle].ch) {
239 high = middle - 1;
241 low = middle + 1;
ListFormatter.java 34 private final SimplePatternFormatter middle; field in class:ListFormatter
100 * @param middle
110 public ListFormatter(String two, String start, String middle, String end) {
114 SimplePatternFormatter.compile(middle),
120 private ListFormatter(SimplePatternFormatter two, SimplePatternFormatter start, SimplePatternFormatter middle, SimplePatternFormatter end, ULocale locale) {
123 this.middle = middle;
218 builder.append(middle, it.next(), index == idx);
335 SimplePatternFormatter.compile(r.getWithFallback("listPattern/" + style + "/middle").getString()),
  /external/icu/icu4c/source/i18n/
collationweights.cpp 242 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local
244 uprv_memset(&middle, 0, sizeof(middle));
253 * middle 1
273 middle.start=incWeightTrail(weight, middleLength);
276 // which would yield a middle range starting at 0.
277 middle.start=0xffffffff; // no middle range
291 middle.end=decWeightTrail(weight, middleLength);
293 /* set the middle range *
    [all...]
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/
NFS4StringPrep.java 102 int left, middle, right,rc; local
108 middle = (left+right)/2;
109 rc= sortedArr[middle].compareTo(target);
112 left = middle+1;
114 right = middle -1;
116 return middle;
  /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/icu/icu4c/source/common/unicode/
listformatter.h 41 ListFormatData(const UnicodeString& two, const UnicodeString& start, const UnicodeString& middle, const UnicodeString& end) :
42 twoPattern(two), startPattern(start), middlePattern(middle), endPattern(end) {}
  /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/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/ContactsCommon/src/com/android/contacts/common/util/
NameConverter.java 174 * Parses phonetic name and returns parsed data (family, middle, given) as ContentValues.
188 String middle = null; local
203 middle = strings[1];
213 item.setPhoneticMiddleName(middle);
221 public static String buildPhoneticName(String family, String middle, String given) {
222 if (!TextUtils.isEmpty(family) || !TextUtils.isEmpty(middle)
228 if (!TextUtils.isEmpty(middle)) {
229 sb.append(middle.trim()).append(' ');

Completed in 2654 milliseconds

1 2 3 4 5 6 7 8 91011>>