Searched defs:ia (Results 126 - 150 of 224) sorted by relevance

123456789

/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/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
H A Dfind_end_pred.pass.cpp34 int ia[] = {0, 1, 2}; local
41 return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)), eq) == FI(ic+15))
43 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+15))
45 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) == RI(ic+15))
57 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
58 const unsigned sa = sizeof(ia)/sizeof(ia[
[all...]
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp38 int ia[] = {0, 1, 2, 3}; local
41 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia)) == ic+3)
64 int ia[] = {0, 1, 2, 3, 4, 5}; local
65 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
66 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia))
[all...]
H A Dsearch_pred.pass.cpp27 int ia[] = {0, 1, 2, 3}; local
30 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia), eq) == ic+3)
50 int ia[] = {0, 1, 2, 3, 4, 5}; local
51 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
53 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equa
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dinplace_merge_comp.pass.cpp70 value_type* ia = new value_type[N]; local
72 ia[i] = i;
73 std::shuffle(ia, ia+N, randomness);
74 std::sort(ia, ia+M, std::greater<value_type>());
75 std::sort(ia+M, ia+N, std::greater<value_type>());
77 std::inplace_merge(Iter(ia), Iter(ia
153 std::unique_ptr<int>* ia = new std::unique_ptr<int>[N]; local
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Ddefault.pass.cpp51 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
90 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dhash.pass.cpp57 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 Dhash.pred.pass.cpp70 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
107 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dpred.pass.cpp64 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
100 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
H A Ddefault.pass.cpp51 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
90 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dhash.pass.cpp56 int ia[] = {0, 1, 2, 3, 4, 5}; local
57 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
59 do_search(Iter1(ia), Iter1(ia
90 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dhash.pred.pass.cpp69 int ia[] = {0, 1, 2, 3, 4, 5}; local
70 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
72 do_search(Iter1(ia), Iter1(ia
103 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dpred.pass.cpp63 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
97 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp51 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 Ddefault.pred.pass.cpp63 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/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/
H A Dmake_default_searcher.pass.cpp36 int ia[] = {0, 1, 2, 3, 4, 5}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
39 do_search(Iter1(ia), Iter1(ia
[all...]
H A Dmake_default_searcher.pred.pass.cpp48 int ia[] = {0, 1, 2, 3, 4, 5}; local
49 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
51 do_search(Iter1(ia), Iter1(ia
[all...]
/external/libcxx/test/std/numerics/numeric.ops/transform.exclusive.scan/
H A Dtransform_exclusive_scan_init_bop_uop.pass.cpp59 int ia[] = { 1, 3, 5, 7, 9 }; local
68 const unsigned sa = sizeof(ia) / sizeof(ia[0]);
79 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, 0, pResI0, pResI0 + i);
80 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, 0, mResI0, mResI0 + i);
81 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), 0, pResN0, pResN0 + i);
82 test(Iter(ia), Ite
[all...]
/external/libcxx/test/std/numerics/numeric.ops/transform.inclusive.scan/
H A Dtransform_inclusive_scan_bop_uop.pass.cpp60 int ia[] = { 1, 3, 5, 7, 9 }; local
65 const unsigned sa = sizeof(ia) / sizeof(ia[0] );
72 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, pResI0, pResI0 + i);
73 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, mResI0, mResI0 + i);
74 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), pResN0, pResN0 + i);
75 test(Iter(ia), Ite
[all...]
H A Dtransform_inclusive_scan_bop_uop_init.pass.cpp59 int ia[] = { 1, 3, 5, 7, 9 }; local
68 const unsigned sa = sizeof(ia) / sizeof(ia[0]);
79 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, 0, pResI0, pResI0 + i);
80 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, 0, mResI0, mResI0 + i);
81 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), 0, pResN0, pResN0 + i);
82 test(Iter(ia), Ite
[all...]
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/
H A Ddefault.pass.cpp52 int ia[] = {0, 1, 2, 3, 4, 5}; local
53 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
55 do_search(Iter1(ia), Iter1(ia
91 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dhash.pass.cpp58 int ia[] = {0, 1, 2, 3, 4, 5}; local
59 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
61 do_search(Iter1(ia), Iter1(ia
92 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dhash.pred.pass.cpp71 int ia[] = {0, 1, 2, 3, 4, 5}; local
72 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
74 do_search(Iter1(ia), Iter1(ia
108 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
H A Dpred.pass.cpp65 int ia[] = {0, 1, 2, 3, 4, 5}; local
66 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
68 do_search(Iter1(ia), Iter1(ia
101 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/
H A Ddefault.pass.cpp52 int ia[] = {0, 1, 2, 3, 4, 5}; local
53 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
55 do_search(Iter1(ia), Iter1(ia
91 char ia[] = {0, 1, 2, 3, 4, 5}; local
[all...]

Completed in 369 milliseconds

123456789