/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/mesa3d/src/gallium/targets/haiku-softpipe/ |
SoftwareRenderer.rdef | 10 middle = 0,
|
/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 | 55 int32_t i, pos1, pos2, middle, length; local 66 /* set into the middle */ 67 middle=length/2; 69 pos1=iter1->move(iter1, middle, UITER_ZERO); 70 if(pos1!=middle) { 71 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1); 75 pos2=iter2->move(iter2, middle, UITER_ZERO); 76 if(pos2!=middle) { [all...] |
/external/libdivsufsort/lib/ |
sssort.c | 264 saidx_t *middle; local 268 middle = first + t / 2; 272 return ss_median3(Td, PA, first, middle, last - 1); 275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); 280 middle = ss_median3(Td, PA, middle - t, middle, middle + t); 282 return ss_median3(Td, PA, first, middle, last); 461 ss_rotate(saidx_t *first, saidx_t *middle, saidx_t *last) 753 saidx_t *b, *middle, *curbuf; local [all...] |
/external/libtextclassifier/lang_id/script/ |
approx-script.cc | 57 // Due to the while loop condition, middle > start and middle < end. Hence, 61 int middle = (start + end) / 2; local 62 if (codepoint < kRangeFirst[middle]) { 63 end = middle; 65 start = middle;
|
/external/tensorflow/tensorflow/core/grappler/costs/ |
robust_stats.cc | 40 const auto middle = values.begin() + (n / 2); local 41 // Put the middle value in its place. 42 std::nth_element(values.begin(), middle, values.end()); 44 return *middle; 47 // *middle is found between begin and middle as a post-cond of 49 const auto lower_middle = std::max_element(values.begin(), middle); 50 // Preventing overflow. We know that '*lower_middle <= *middle'. 53 if (*lower_middle <= 0 && *middle >= 0) { 54 return (*lower_middle + *middle) / 2 [all...] |
/external/mesa3d/src/egl/main/ |
egldispatchstubs.c | 19 unsigned middle = (first + last) / 2; local 21 __EGL_DISPATCH_FUNC_NAMES[middle]); 24 first = middle + 1; 26 last = middle - 1; 28 return middle;
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
draw_pt.c | 51 * - middle -- fetch, shade, cliptest, viewport 62 struct draw_pt_middle_end *middle = NULL; local 99 if (draw->pt.middle.llvm) { 100 middle = draw->pt.middle.llvm; 103 middle = draw->pt.middle.fetch_emit; 105 middle = draw->pt.middle.fetch_shade_emit; 107 middle = draw->pt.middle.general [all...] |
draw_pt_fetch_shade_pipeline.c | 58 fetch_pipeline_middle_end(struct draw_pt_middle_end *middle) 60 return (struct fetch_pipeline_middle_end *) middle; 65 * Prepare/validate middle part of the vertex pipeline. 70 fetch_pipeline_prepare(struct draw_pt_middle_end *middle, 75 struct fetch_pipeline_middle_end *fpme = fetch_pipeline_middle_end(middle); 148 fetch_pipeline_bind_parameters(struct draw_pt_middle_end *middle) 230 fetch_pipeline_generic(struct draw_pt_middle_end *middle, 234 struct fetch_pipeline_middle_end *fpme = fetch_pipeline_middle_end(middle); 373 fetch_pipeline_run(struct draw_pt_middle_end *middle, 380 struct fetch_pipeline_middle_end *fpme = fetch_pipeline_middle_end(middle); [all...] |
draw_pt_vsplit.c | 45 struct draw_pt_middle_end *middle; member in struct:vsplit_frontend 79 vsplit->middle->run(vsplit->middle, 202 struct draw_pt_middle_end *middle, 228 vsplit->middle = middle; 229 middle->prepare(middle, vsplit->prim, opt, &vsplit->max_vertices); 240 vsplit->middle->finish(vsplit->middle); [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; 184 fetch_emit_bind_parameters(struct draw_pt_middle_end *middle) 190 static void fetch_emit_run( struct draw_pt_middle_end *middle, 197 struct fetch_emit_middle_end *feme = (struct fetch_emit_middle_end *)middle; 251 static void fetch_emit_run_linear( struct draw_pt_middle_end *middle, 256 struct fetch_emit_middle_end *feme = (struct fetch_emit_middle_end *)middle; 309 static boolean fetch_emit_run_linear_elts( struct draw_pt_middle_end *middle, [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; 182 fse_bind_parameters(struct draw_pt_middle_end *middle) 189 fse_run_linear(struct draw_pt_middle_end *middle, 194 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle; 251 fse_run(struct draw_pt_middle_end *middle, 258 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle; 309 fse_run_linear_elts(struct draw_pt_middle_end *middle, 316 struct fetch_shade_emit *fse = (struct fetch_shade_emit *)middle; 355 fse_finish(struct draw_pt_middle_end *middle) [all...] |
/external/flatbuffers/tests/MyGame/Example/ |
Referrable.java | 45 int middle = span / 2; local 46 int tableOffset = __indirect(vectorLocation + 4 * (start + middle), bb); 50 span = middle; 52 middle++; 53 start += middle; 54 span -= middle;
|
Referrable.cs | 46 int middle = span / 2; 47 int tableOffset = Table.__indirect(vectorLocation + 4 * (start + middle), bb); 50 span = middle; 52 middle++; 53 start += middle; 54 span -= middle;
|
/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/swiftshader/third_party/llvm-7.0/llvm/test/MC/AsmParser/ |
macro-args.s | 32 middle _$0, $1 34 .macro middle
|
/external/elfutils/tests/ |
dwfl-bug-addr-overflow.c | 54 Dwfl_Module *middle = dwfl_report_module (dwfl, "middle", local 57 assert (middle); 67 assert (mod == middle);
|
/external/cldr/tools/java/com/ibm/icu/text/ |
ListFormat.java | 22 private final String middle; field in class:ListFormat 35 * @param middle 43 public ListFormat(String two, String start, String middle, String end) { 46 this.middle = middle; 122 result = format2(middle, result, it.next());
|
/external/dng_sdk/source/ |
dng_1d_table.cpp | 70 uint32 middle = (lower + upper) >> 1; local 72 fTable [middle] = (real32) function.Evaluate (middle * (1.0 / (real64) kTableSize)); 77 SubDivide (function, lower, middle, maxDelta); 79 SubDivide (function, middle, upper, maxDelta);
|
/external/libchrome/third_party/jinja2/ |
utils.py | 22 '^(?P<lead>(?:%s)*)(?P<middle>.*?)(?P<trail>(?:%s)*)$' % ( 213 lead, middle, trail = match.groups() 214 if middle.startswith('www.') or ( 215 '@' not in middle and 216 not middle.startswith('http://') and 217 not middle.startswith('https://') and 218 len(middle) > 0 and 219 middle[0] in _letters + _digits and ( 220 middle.endswith('.org') or 221 middle.endswith('.net') o [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/stringprep/ |
NFS4StringPrep.java | 107 int left, middle, right,rc; local 113 middle = (left+right)/2; 114 rc= sortedArr[middle].compareTo(target); 117 left = middle+1; 119 right = middle -1; 121 return middle;
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/ |
NFS4StringPrep.java | 104 int left, middle, right,rc; local 110 middle = (left+right)/2; 111 rc= sortedArr[middle].compareTo(target); 114 left = middle+1; 116 right = middle -1; 118 return middle;
|
/external/tensorflow/tensorflow/contrib/constrained_optimization/python/ |
candidates.py | 209 middle = 0.5 * (lower + upper) 210 if (middle - lower <= epsilon) or (upper - middle <= epsilon): 214 objective_vector, constraints_matrix, maximum_violation=middle) 216 lower = middle 219 upper = middle
|