/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
rotate.pass.cpp | 27 int ia[] = {0}; local 28 const int sa = static_cast<int>(sizeof(ia)/sizeof(ia[0])); 29 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia)); 30 assert(base(r) == ia); 31 assert(ia[0] == 0); 32 r = std::rotate(Iter(ia), Iter(ia), Iter(ia+sa)) 221 std::unique_ptr<int> ia[1]; local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
equal_pred.pass.cpp | 37 int ia[] = {1, 3, 6, 7}; local 43 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic) , eq) 44 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq) 64 int ia[] = {0, 1, 2, 3, 4, 5}; local 65 const unsigned s = sizeof(ia)/sizeof(ia[0]); 67 assert(std::equal(input_iterator<const int*>(ia), 68 input_iterator<const int*>(ia+s) [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ |
for_each_n.pass.cpp | 26 int ia[] = {1, 3, 6, 7}; local 30 auto it = std::for_each_n(std::begin(ia), N, [](int &a) { a += 2; }); 31 return it == (std::begin(ia) + N) 32 && std::equal(std::begin(ia), std::end(ia), std::begin(expected)) 47 int ia[] = {0, 1, 2, 3, 4, 5}; local 48 const unsigned s = sizeof(ia)/sizeof(ia[0]); 52 Iter it = std::for_each_n(Iter(ia), 0, std::ref(f)); 53 assert(it == Iter(ia)); [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
is_permutation_pred.pass.cpp | 33 int ia[] = {0, 0, 0}; local 38 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c) 39 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c) 50 const int ia[] = {0}; local 52 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 53 assert(std::is_permutation(forward_iterator<const int*>(ia), 54 forward_iterator<const int*>(ia + 0) 75 const int ia[] = {0}; local 92 const int ia[] = {0, 0}; local 113 const int ia[] = {0, 0}; local 129 const int ia[] = {0, 0}; local 145 const int ia[] = {0, 0}; local 161 const int ia[] = {0, 1}; local 177 const int ia[] = {0, 1}; local 198 const int ia[] = {0, 1}; local 219 const int ia[] = {0, 1}; local 235 const int ia[] = {1, 0}; local 251 const int ia[] = {1, 0}; local 272 const int ia[] = {1, 0}; local 293 const int ia[] = {1, 0}; local 309 const int ia[] = {1, 1}; local 325 const int ia[] = {1, 1}; local 341 const int ia[] = {1, 1}; local 357 const int ia[] = {1, 1}; local 379 const int ia[] = {0, 0, 0}; local 395 const int ia[] = {0, 0, 0}; local 411 const int ia[] = {0, 0, 0}; local 427 const int ia[] = {0, 0, 0}; local 443 const int ia[] = {0, 0, 0}; local 459 const int ia[] = {0, 0, 0}; local 475 const int ia[] = {0, 0, 0}; local 491 const int ia[] = {0, 0, 0}; local 507 const int ia[] = {0, 0, 0}; local 523 const int ia[] = {0, 0, 1}; local 544 const int ia[] = {0, 0, 1}; local 560 const int ia[] = {0, 1, 2}; local 581 const int ia[] = {0, 1, 2}; local 602 const int ia[] = {0, 1, 2}; local 623 const int ia[] = {0, 1, 2}; local 644 const int ia[] = {0, 0, 1}; local 660 const int ia[] = {0, 0, 1}; local 686 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local 726 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
search_n_pred.pass.cpp | 28 int ia[] = {0, 0, 1, 1, 2, 2}; local 29 return (std::search_n(std::begin(ia), std::end(ia), 1, 0, eq) == ia) 30 && (std::search_n(std::begin(ia), std::end(ia), 2, 1, eq) == ia+2) 31 && (std::search_n(std::begin(ia), std::end(ia), 1, 3, eq) == std::end(ia)) 51 int ia[] = {0, 1, 2, 3, 4, 5}; local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
mismatch.pass.cpp | 29 int ia[] = {1, 3, 6, 7}; local 35 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic)); 36 if (p1.first != ia+2 || p1.second != ic+2) 39 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)); 40 if (p2.first != ia+2 || p2.second != ic+2) 64 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 65 const unsigned sa = sizeof(ia)/sizeof(ia[0]) [all...] |
mismatch_pred.pass.cpp | 34 int ia[] = {1, 3, 6, 7}; local 40 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq); 41 if (p1.first != ia+2 || p1.second != ic+2) 44 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq); 45 if (p2.first != ia+2 || p2.second != ic+2) 74 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 75 const unsigned sa = sizeof(ia)/sizeof(ia[0]) [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
binary_search.pass.cpp | 28 int ia[] = {1, 3, 3, 6, 7}; local 30 return std::binary_search(std::begin(ia), std::end(ia), 1) 31 && std::binary_search(std::begin(ia), std::end(ia), 3) 32 && !std::binary_search(std::begin(ia), std::end(ia), 9)
|
binary_search_comp.pass.cpp | 29 int ia[] = {1, 3, 3, 6, 7}; local 31 return std::binary_search(std::begin(ia), std::end(ia), 1, lt) 32 && std::binary_search(std::begin(ia), std::end(ia), 3, lt) 33 && !std::binary_search(std::begin(ia), std::end(ia), 9, lt)
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
inplace_merge.pass.cpp | 54 value_type* ia = new value_type[N]; local 56 ia[i] = i; 57 std::shuffle(ia, ia+N, randomness); 58 std::sort(ia, ia+M); 59 std::sort(ia+M, ia+N); 60 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N)) [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
includes.pass.cpp | 26 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 30 return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) 31 && !std::includes(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)) 40 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 49 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))) [all...] |
includes_comp.pass.cpp | 27 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 32 return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), comp) 33 && !std::includes(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), comp) 43 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 44 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 52 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())) [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 31 const int sa = sizeof(ia)/sizeof(ia[0]); 37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), 44 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
set_difference_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 33 const int sa = sizeof(ia)/sizeof(ia[0]); 39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), 46 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
sort.pass.cpp | 73 int ia[sa]; local 76 test_sort_driver(ia, ia+sa, i);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
stable_sort.pass.cpp | 73 int ia[sa]; local 76 test_sort_driver(ia, ia+sa, i);
|
/external/libcxx/test/std/numerics/numeric.ops/adjacent.difference/ |
adjacent_difference.pass.cpp | 32 int ia[] = {15, 10, 6, 3, 1}; local 34 const unsigned s = sizeof(ia) / sizeof(ia[0]); 36 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib));
|
adjacent_difference_op.pass.cpp | 33 int ia[] = {15, 10, 6, 3, 1}; local 35 const unsigned s = sizeof(ia) / sizeof(ia[0]); 37 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib),
|
/external/libcxx/test/std/numerics/numeric.ops/inclusive.scan/ |
inclusive_scan_op.pass.cpp | 51 int ia[] = {1, 3, 5, 7, 9}; local 54 const unsigned sa = sizeof(ia) / sizeof(ia[0]); 59 test(Iter(ia), Iter(ia + i), std::plus<>(), pRes, pRes + i); 60 test(Iter(ia), Iter(ia + i), std::multiplies<>(), mRes, mRes + i);
|
inclusive_scan_op_init.pass.cpp | 50 int ia[] = {1, 3, 5, 7, 9}; local 53 const unsigned sa = sizeof(ia) / sizeof(ia[0]); 58 test(Iter(ia), Iter(ia + i), std::plus<>(), 0, pRes, pRes + i); 59 test(Iter(ia), Iter(ia + i), std::multiplies<>(), 1, mRes, mRes + i);
|
/external/libcxx/test/std/numerics/numeric.ops/transform.inclusive.scan/ |
transform_inclusive_scan_bop_uop.pass.cpp | 60 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), Iter(ia + i), std::multiplies<>(), std::negate<>(), mResN0, mResN0 + i) [all...] |
/external/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
transform_reduce_iter_iter_init_bop_uop.pass.cpp | 56 int ia[] = {1, 2, 3, 4, 5, 6}; local 57 unsigned sa = sizeof(ia) / sizeof(ia[0]); 59 test(Iter(ia), Iter(ia), 0, std::plus<>(), identity(), 0); 60 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), identity(), 1); 61 test(Iter(ia), Iter(ia+1), 0, std::multiplies<>(), identity(), 0); 62 test(Iter(ia), Iter(ia+1), 2, std::plus<>(), identity(), 3) 88 MoveOnly ia[] = {{1}, {2}, {3}}; local [all...] |
/external/slf4j/slf4j-site/src/site/pages/js/ |
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; function in function:ha 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("")}
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
reverse_copy.pass.cpp | 25 const int ia[] = {0}; local 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 28 OutIter r = std::reverse_copy(InIter(ia), InIter(ia), OutIter(ja)); 31 r = std::reverse_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
rotate.pass.cpp | 27 int ia[] = {0}; local 28 const int sa = static_cast<int>(sizeof(ia)/sizeof(ia[0])); 29 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia)); 30 assert(base(r) == ia); 31 assert(ia[0] == 0); 32 r = std::rotate(Iter(ia), Iter(ia), Iter(ia+sa)) 221 std::unique_ptr<int> ia[1]; local [all...] |