Searched defs:ia (Results 101 - 125 of 149) sorted by relevance

123456

/external/libcxx/test/algorithms/alg.sorting/alg.sort/sort/
H A Dsort.pass.cpp67 int ia[sa]; local
70 test_sort_driver(ia, ia+sa, i);
/external/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/
H A Dstable_sort.pass.cpp67 int ia[sa]; local
70 test_sort_driver(ia, ia+sa, i);
/external/valgrind/main/coregrind/
H A Dpub_core_debuginfo.h125 struct { Addr ia; Addr sp; Addr fp; Addr lr;} member in struct:__anon31825
/external/clang/test/CodeGenCXX/
H A Dvtable-layout-abi-examples.cpp32 int ia; member in struct:Test1::A
H A Dmicrosoft-abi-vtables-single-inheritance.cpp19 int ia; member in struct:A
/external/deqp/framework/delibs/coding_guidelines/
H A Dprettify.js8 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&nbsp;").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/icu/icu4c/source/layout/
H A DIndicRearrangementProcessor.cpp73 le_int32 ia, ib, ic, id, ix, x; local
83 ia = glyphStorage.getCharIndex(firstGlyph, success);
94 glyphStorage.setCharIndex(lastGlyph, ia, success);
115 ia = glyphStorage.getCharIndex(firstGlyph, success);
122 glyphStorage.setCharIndex(lastGlyph, ia, success);
128 ia = glyphStorage.getCharIndex(firstGlyph, success);
142 glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
149 ia = glyphStorage.getCharIndex(firstGlyph, success);
164 glyphStorage.setCharIndex(lastGlyph, ia, success);
213 ia
[all...]
H A DIndicRearrangementProcessor2.cpp70 le_int32 ia, ib, ic, id, ix, x; local
80 ia = glyphStorage.getCharIndex(firstGlyph, success);
91 glyphStorage.setCharIndex(lastGlyph, ia, success);
112 ia = glyphStorage.getCharIndex(firstGlyph, success);
119 glyphStorage.setCharIndex(lastGlyph, ia, success);
125 ia = glyphStorage.getCharIndex(firstGlyph, success);
139 glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
146 ia = glyphStorage.getCharIndex(firstGlyph, success);
161 glyphStorage.setCharIndex(lastGlyph, ia, success);
210 ia
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.unique/
H A Dunique.pass.cpp30 int ia[] = {0}; local
31 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
32 Iter r = std::unique(Iter(ia), Iter(ia+sa));
33 assert(base(r) == ia + sa);
34 assert(ia[0] == 0);
102 Ptr ia[1]; local
103 const unsigned sa = sizeof(ia)/sizeof(ia[
[all...]
H A Dunique_copy.pass.cpp29 const int ia[] = {0}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
32 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
H A Dunique_copy_pred.pass.cpp40 const int ia[] = {0}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
44 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja), count_equal());
H A Dunique_pred.pass.cpp40 int ia[] = {0}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
43 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal());
44 assert(base(r) == ia + sa);
45 assert(ia[0] == 0);
128 Ptr ia[1]; local
129 const unsigned sa = sizeof(ia)/sizeof(ia[
[all...]
/external/chromium_org/google_apis/gaia/
H A Doauth2_mint_token_flow_unittest.cc112 IssueAdviceInfo ia; local
116 ia.push_back(e1);
121 ia.push_back(e2);
122 return ia;
255 IssueAdviceInfo ia; local
257 json.get(), &ia));
258 EXPECT_TRUE(ia.empty());
263 IssueAdviceInfo ia; local
265 json.get(), &ia));
266 EXPECT_TRUE(ia
271 IssueAdviceInfo ia; local
[all...]
/external/chromium_org/net/ssl/
H A Dssl_cipher_suite_names.cc262 static int CipherSuiteCmp(const void* ia, const void* ib) { argument
263 const CipherSuite* a = static_cast<const CipherSuite*>(ia);
/external/doclava/res/assets/templates/assets/
H A Dprettify.js20 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/algorithms/alg.modifying.operations/alg.fill/
H A Dfill_n.pass.cpp40 int ia[n] = {0}; local
41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
42 assert(ia[0] == 1);
43 assert(ia[1] == 1);
44 assert(ia[2] == 1);
45 assert(ia[3] == 1);
52 int ia[n] = {0}; local
53 assert(std::fill_n(ia, n, static_cast<char>(1)) == std::next(ia,
71 int ia[n] = {0}; local
[all...]
/external/qemu/util/
H A Doslib-win32.c153 int inet_aton(const char *cp, struct in_addr *ia) argument
159 ia->s_addr = addr;
/external/sqlite/android/
H A DOldPhoneNumberUtils.cpp197 int ia, ib; local
206 ia = strlen(a);
208 if (ia == 0 || ib == 0) {
213 ia--;
218 while (ia >= 0 && ib >=0) {
222 ca = a[ia];
225 ia--;
242 ia--; ib--; matched++;
260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
273 if (matchIntlPrefix(a, ia
[all...]
/external/chromium_org/native_client_sdk/src/libraries/xray/
H A Dreport.c91 struct XRayTotal* ia = (struct XRayTotal*)a; local
93 if (ib->ticks > ia->ticks)
95 else if (ib->ticks < ia->ticks)
/external/chromium_org/third_party/smhasher/src/
H A DBitvec.cpp577 int ia = (i + d + 1) % len; local
580 uint32_t a = k[ia];
612 int ia = (d + 1) % ndwords; local
615 uint32_t a = k[ia];
/external/eigen/Eigen/src/PardisoSupport/
H A DPardisoSupport.h47 Index *ia, Index *ja, Index *perm, Index nrhs, Index *iparm, Index msglvl, void *b, void *x)
50 ::pardiso(pt, &maxfct, &mnum, &type, &phase, &n, a, ia, ja, perm, &nrhs, iparm, &msglvl, b, x, &error);
59 Index *ia, Index *ja, Index *perm, Index nrhs, Index *iparm, Index 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, Index maxfct, Index mnum, Index type, Index phase, Index n, void *a, Index *ia, Index *ja, Index *perm, Index nrhs, Index *iparm, Index msglvl, void *b, void *x) argument
58 run( _MKL_DSS_HANDLE_t pt, Index maxfct, Index mnum, Index type, Index phase, Index n, void *a, Index *ia, Index *ja, Index *perm, Index nrhs, Index *iparm, Index msglvl, void *b, void *x) argument
/external/libedit/src/
H A Dunvis.c197 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/llvm/lib/Target/ARM/MCTargetDesc/
H A DARMAddressingModes.h68 ia, enumerator in enum:llvm::ARM_AM::AMSubMode
77 case ARM_AM::ia: return "ia";
/external/qemu/slirp/
H A Dip_input.c506 register struct in_ifaddr *ia; local
550 ia = (struct in_ifaddr *)
552 if (ia == 0) {
580 if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr)) == 0)
581 ia = (INA)ifa_ifwithnet((SA)&ipaddr);
583 ia = ip_rtaddr(ipaddr.sin_addr);
584 if (ia == 0) {
590 bcopy((caddr_t)&(IA_SIN(ia)->sin_addr),
616 if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == 0 &&
617 (ia
[all...]
/external/qemu/slirp-android/
H A Dip_input.c506 register struct in_ifaddr *ia; local
550 ia = (struct in_ifaddr *)
552 if (ia == 0) {
580 if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr)) == 0)
581 ia = (INA)ifa_ifwithnet((SA)&ipaddr);
583 ia = ip_rtaddr(ipaddr.sin_addr);
584 if (ia == 0) {
590 bcopy((caddr_t)&(IA_SIN(ia)->sin_addr),
616 if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == 0 &&
617 (ia
[all...]

Completed in 844 milliseconds

123456