/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
H A D | hash.pass.cpp | 57 int ia[] = {0, 1, 2, 3, 4, 5}; local 58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 60 do_search(Iter1(ia), Iter1(ia 91 char ia[] = {0, 1, 2, 3, 4, 5}; local [all...] |
H A D | hash.pred.pass.cpp | 70 int ia[] = {0, 1, 2, 3, 4, 5}; local 71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 73 do_search(Iter1(ia), Iter1(ia 104 char ia[] = {0, 1, 2, 3, 4, 5}; local [all...] |
H A D | pred.pass.cpp | 64 int ia[] = {0, 1, 2, 3, 4, 5}; local 65 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 67 do_search(Iter1(ia), Iter1(ia 98 char ia[] = {0, 1, 2, 3, 4, 5}; local [all...] |
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
H A D | default.pass.cpp | 51 int ia[] = {0, 1, 2, 3, 4, 5}; local 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia [all...] |
H A D | default.pred.pass.cpp | 63 int ia[] = {0, 1, 2, 3, 4, 5}; local 64 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 66 do_search(Iter1(ia), Iter1(ia [all...] |
/external/slf4j/slf4j-site/src/site/pages/js/ |
H A D | prettify.js | 8 a.appendChild(document.createTextNode('<!DOCTYPE foo PUBLIC "foo bar">\n<foo />'));F=!/</.test(a.innerHTML)}if(F){var c=b.innerHTML;if(S(b))c=E(c);return c}var d=[];for(var g=b.firstChild;g;g=g.nextSibling)z(g,d);return d.join("")}function ia(b){var a=0;return function(c){var d=null,g=0;for(var e=0,h=c.length;e<h;++e){var f=c.charAt(e);switch(f){case "\t":if(!d)d=[];d.push(c.substring(g,e));var i=b-a%b;a+=i;for(;i>=0;i-=" ".length)d.push(" ".substring(0,i));g=e+1;break; 18 a,c){var d=[],g=0,e=null,h=null,f=0,i=0,j=ia(8);function o(k){if(k>g){if(e&&e!==h){d.push("</span>");e=null}if(!e&&h){e=h;d.push('<span class="',e,'">')}var l=E(j(b.substring(g,k))).replace(/(\r\n?|\n| ) /g,"$1 ").replace(/\r\n?|\n/g,"<br />");d.push(l);g=k}}while(true){var m;m=f<a.length?(i<c.length?a[f]<=c[i]:true):false;if(m){o(a[f]);if(e){d.push("</span>");e=null}d.push(a[f+1]);f+=2}else if(i<c.length){o(c[i]);h=c[i+1];i+=2}else break}o(b.length);if(e)d.push("</span>");return d.join("")}
|
/external/sqlite/android/ |
H A D | OldPhoneNumberUtils.cpp | 170 int ia, ib; local 179 ia = strlen(a); 181 if (ia == 0 || ib == 0) { 186 ia--; 191 while (ia >= 0 && ib >=0) { 195 ca = a[ia]; 198 ia--; 215 ia--; ib--; matched++; 233 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) { 246 if (matchIntlPrefix(a, ia [all...] |
/external/valgrind/coregrind/ |
H A D | pub_core_debuginfo.h | 127 struct { Addr ia; Addr sp; Addr fp; Addr lr;} member in struct:__anon29209
|
/external/clang/test/CodeGenCXX/ |
H A D | microsoft-abi-vtables-single-inheritance.cpp | 19 int ia; member in struct:A
|
/external/doclava/res/assets/templates/assets/ |
H A D | prettify.js | 20 m;++v){var w=b[v].match(Qa);if(w&&w[2]===n)if(w[1]===ra){if(--q===0)break a}else++q}if(v<m){g.push(d,b.slice(i,v+1).join(P));i=v}else g.push(d,l)}else g.push(d,l)}else{var j=Sd(l);c.push(j);d+=j.length}}return{source:c.join(P),tags:g}}function $d(a){return!!a.replace(/\s(\w+)\s*=\s*(?:\"([^\"]*)\"|'([^\']*)'|(\S+))/g,mc).match(/[cC][lL][aA][sS][sS]=\"[^\"]*\bnocode\b/)}function ia(a,b,c,d){if(b){var g={source:b,b:a};c(g);d.push.apply(d,g.c)}}function K(a,b){var c={},d;(function(){for(var m=a.concat(b), function 22 h.substring(0,5))&&!(e&&e[1])){p=z;h=oc}p||(j[k]=h)}var x=v;v+=k.length;if(p){var B=e[1],E=k.indexOf(B),A=E+B.length,D=h.substring(5);ia(n+x,k.substring(0,E),i,q);ia(n+x+E,B,Ra(D,B),q);ia(n+x+A,k.substring(A),i,q)}else q.push(n+x,h)}m.c=q};return i}function C(a){var b=[],c=[];if(a.tripleQuotedStrings)b.push([U,/^(?:\'\'\'(?:[^\'\\]|\\[\s\S]|\'{1,2}(?=[^\']))*(?:\'\'\'|$)|\"\"\"(?:[^\"\\]|\\[\s\S]|\"{1,2}(?=[^\"]))*(?:\"\"\"|$)|\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$))/,r,pc]);
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
H A D | unique.pass.cpp | 27 int ia[] = {0, 1, 1, 3, 4}; local 31 auto it = std::unique(std::begin(ia), std::end(ia)); 32 return it == (std::begin(ia) + N) 33 && std::equal(std::begin(ia), it, std::begin(expected), std::end(expected)) 42 int ia[] = {0}; local 43 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 44 Iter r = std::unique(Iter(ia), Iter(ia 114 Ptr ia[1]; local [all...] |
H A D | unique_copy.pass.cpp | 28 int ia[] = {0, 1, 2, 2, 4}; local 32 auto it = std::unique_copy(std::begin(ia), std::end(ia), std::begin(ib)); 44 const int ia[] = {0}; local 45 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 47 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
H A D | unique_copy_pred.pass.cpp | 29 int ia[] = {0, 1, 2, 2, 4}; local 33 auto it = std::unique_copy(std::begin(ia), std::end(ia), std::begin(ib), 56 const int ia[] = {0}; local 57 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 60 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja), count_equal());
|
H A D | unique_pred.pass.cpp | 27 int ia[] = {0, 1, 1, 3, 4}; local 31 auto it = std::unique(std::begin(ia), std::end(ia), [](int a, int b) {return a == b; }); 32 return it == (std::begin(ia) + N) 33 && std::equal(std::begin(ia), it, std::begin(expected), std::end(expected)) 52 int ia[] = {0}; local 53 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 55 Iter r = std::unique(Iter(ia), Iter(ia 140 Ptr ia[1]; local [all...] |
/external/clang/test/OpenMP/ |
H A D | for_simd_codegen.cpp | 456 void iter_simple(IterDouble ia, IterDouble ib, IterDouble ic) { argument 488 for (IterDouble i = ia; i < ib; ++i) {
|
H A D | parallel_for_simd_codegen.cpp | 413 void iter_simple(IterDouble ia, IterDouble ib, IterDouble ic) { argument 445 for (IterDouble i = ia; i < ib; ++i) {
|
H A D | simd_codegen.cpp | 325 void iter_simple(IterDouble ia, IterDouble ib, IterDouble ic) { argument 342 for (IterDouble i = ia; i < ib; ++i) {
|
/external/deqp/external/openglcts/modules/glesext/draw_buffers_indexed/ |
H A D | esextcDrawBuffersIndexedBase.cpp | 136 glw::GLint ia[4]; local 140 gl.getIntegeri_v(GL_COLOR_WRITEMASK, idx, ia); 143 if ((ia[0] != state[idx].mask_r) || (static_cast<int>(lia[0]) != state[idx].mask_r) || 144 (static_cast<int>(ba[0]) != state[idx].mask_r) || (ia[1] != state[idx].mask_g) || 146 (ia[2] != state[idx].mask_b) || (static_cast<int>(lia[2]) != state[idx].mask_b) || 147 (static_cast<int>(ba[2]) != state[idx].mask_b) || (ia[3] != state[idx].mask_a) || 154 << "int: " << ia[0] << ", " << ia[1] << ", " << ia[2] << ", " << ia[ [all...] |
/external/eigen/Eigen/src/PardisoSupport/ |
H A D | PardisoSupport.h | 47 IndexType *ia, IndexType *ja, IndexType *perm, IndexType nrhs, IndexType *iparm, IndexType msglvl, void *b, void *x) 50 ::pardiso(pt, &maxfct, &mnum, &type, &phase, &n, a, ia, ja, perm, &nrhs, iparm, &msglvl, b, x, &error); 59 IndexType *ia, IndexType *ja, IndexType *perm, IndexType nrhs, IndexType *iparm, IndexType msglvl, void *b, void *x) 62 ::pardiso_64(pt, &maxfct, &mnum, &type, &phase, &n, a, ia, ja, perm, &nrhs, iparm, &msglvl, b, x, &error); 46 run( _MKL_DSS_HANDLE_t pt, IndexType maxfct, IndexType mnum, IndexType type, IndexType phase, IndexType n, void *a, IndexType *ia, IndexType *ja, IndexType *perm, IndexType nrhs, IndexType *iparm, IndexType msglvl, void *b, void *x) argument 58 run( _MKL_DSS_HANDLE_t pt, IndexType maxfct, IndexType mnum, IndexType type, IndexType phase, IndexType n, void *a, IndexType *ia, IndexType *ja, IndexType *perm, IndexType nrhs, IndexType *iparm, IndexType msglvl, void *b, void *x) argument
|
/external/libedit/src/ |
H A D | unvis.c | 197 unsigned char st, ia, is, lc; local 436 ia = *cp; /* index in the array */ 438 lc = is == 0 ? 0 : nv[ia].name[is - 1]; /* last character */ 443 for (; ia < __arraycount(nv); ia++) { 444 if (is != 0 && nv[ia].name[is - 1] != lc) 446 if (nv[ia].name[is] == uc) 450 if (ia == __arraycount(nv)) 454 *cp = ia; 459 *cp = nv[ia] [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_prim_assembler.c | 183 draw_prim_assembler_prepare_outputs(struct draw_assembler *ia) argument 185 struct draw_context *draw = ia->draw; 187 ia->primid_slot = draw_alloc_extra_vertex_attrib( 188 ia->draw, TGSI_SEMANTIC_PRIMID, 0); 190 ia->primid_slot = -1; 223 struct draw_assembler *asmblr = draw->ia; 273 struct draw_assembler *ia = CALLOC_STRUCT( draw_assembler ); local 275 ia->draw = draw; 277 return ia; 281 draw_prim_assembler_destroy(struct draw_assembler *ia) argument [all...] |
/external/swiftshader/third_party/LLVM/lib/Target/ARM/MCTargetDesc/ |
H A D | ARMAddressingModes.h | 67 ia, enumerator in enum:llvm::ARM_AM::AMSubMode 76 case ARM_AM::ia: return "ia";
|
/external/valgrind/memcheck/tests/amd64/ |
H A D | more_x87_fp.c | 101 int ia; local 119 asm volatile ("fistl %0" : "=m" (ia) : "t" (a)); 124 printf("(int)a = %d\n", ia);
|
/external/valgrind/memcheck/tests/x86/ |
H A D | more_x86_fp.c | 91 int ia; local 109 asm volatile ("fistl %0" : "=m" (ia) : "t" (a)); 114 printf("(int)a = %d\n", ia);
|
/external/clang/test/Sema/ |
H A D | ms_class_layout.cpp | 103 virtual void ia() = 0; 109 virtual void ia(){} function in class:ICh
|