| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/reduce/ |
| reduce_init_op.pass.cpp | 33 int ia[] = {1, 2, 3, 4, 5, 6}; local
34 unsigned sa = sizeof(ia) / sizeof(ia[0]);
35 test(Iter(ia), Iter(ia), 0, std::plus<>(), 0);
36 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), 1);
37 test(Iter(ia), Iter(ia+1), 0, std::plus<>(), 1);
38 test(Iter(ia), Iter(ia+1), 2, std::multiplies<>(), 2)
[all...] |
| reduce.pass.cpp | 35 int ia[] = {1, 2, 3, 4, 5, 6}; local
36 unsigned sa = sizeof(ia) / sizeof(ia[0]);
37 test(Iter(ia), Iter(ia), 0);
38 test(Iter(ia), Iter(ia+1), 1);
39 test(Iter(ia), Iter(ia+2), 3);
40 test(Iter(ia), Iter(ia+sa), 21)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 25 int ia[] = {0, 1, 2}; local
32 return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+15))
34 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+15))
36 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == RI(ic+15))
46 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
47 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/transform.reduce/ |
| transform_reduce_iter_iter_init_bop_uop.pass.cpp | 70 int ia[] = {1, 2, 3, 4, 5, 6}; local
71 unsigned sa = sizeof(ia) / sizeof(ia[0]);
73 test(Iter(ia), Iter(ia), 0, std::plus<>(), identity<>(), 0);
74 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), identity<>(), 1);
75 test(Iter(ia), Iter(ia+1), 0, std::multiplies<>(), identity<>(), 0);
76 test(Iter(ia), Iter(ia+1), 2, std::plus<>(), identity<>(), 3)
[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.modifying.operations/alg.partitions/ |
| is_partitioned.pass.cpp | 31 int ia[] = {1, 3, 5, 2, 4, 6}; local
33 return std::is_partitioned(std::begin(ia), std::end(ia), is_odd())
41 const int ia[] = {1, 2, 3, 4, 5, 6}; local
43 assert(!std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
44 input_iterator<const int *>(std::end(ia)),
47 std::distance(std::begin(ia), std::end(ia)));
50 const int ia[] = {1, 3, 5, 2, 4, 6}; local
52 assert(std::is_partitioned(input_iterator<const int *>(std::begin(ia)),
59 const int ia[] = {2, 4, 6, 1, 3, 5}; local
68 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
77 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
86 const int ia[] = {1, 3, 5, 7, 9, 11, 2}; 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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.merge/ |
| inplace_merge_comp.pass.cpp | 70 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+M), Iter(ia+N), std::ref(pred))
133 std::unique_ptr<int>* ia = new std::unique_ptr<int>[N]; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 25 int ia[] = {1, 2, 3}; local
32 return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+1))
34 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+1))
36 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == RI(ic+1))
44 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
45 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 26 int ia[] = {0, 0, 1, 1, 2, 2}; local
27 return (std::search_n(std::begin(ia), std::end(ia), 1, 0) == ia)
28 && (std::search_n(std::begin(ia), std::end(ia), 2, 1) == ia+2)
29 && (std::search_n(std::begin(ia), std::end(ia), 1, 3) == std::end(ia))
38 int ia[] = {0, 1, 2, 3, 4, 5}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4}; local
27 std::fill(std::begin(ia), std::end(ia), 5);
29 return std::all_of(std::begin(ia), std::end(ia), [](int a) {return a == 5; })
52 int ia[n] = {0};
53 std::fill(Iter(ia), Iter(ia+n), 1);
54 assert(ia[0] == 1);
55 assert(ia[1] == 1)
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate_copy.pass.cpp | 24 // int ia[] = {1, 3, 5, 2, 5, 6};
25 // int ib[std::size(ia)] = {0};
28 // const auto middle = std::begin(ia) + N;
29 // auto it = std::rotate_copy(std::begin(ia), middle, std::end(ia), std::begin(ib));
31 // return std::distance(std::begin(ib), it) == std::size(ia)
32 // && std::equal (std::begin(ia), middle, std::begin(ib) + std::size(ia) - N)
33 // && std::equal (middle, std::end(ia), std::begin(ib))
42 int ia[] = {0, 1, 2, 3} local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate_copy.pass.cpp | 25 int ia[] = {0, 1, 2, 3}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 43 int ia[n] = {0}; local
44 assert(std::fill_n(Iter(ia), UDI(n), 1) == std::next(Iter(ia), n));
45 assert(ia[0] == 1);
46 assert(ia[1] == 1);
47 assert(ia[2] == 1);
48 assert(ia[3] == 1);
55 int ia[n] = {0}; local
56 assert(std::fill_n(ia, UDI(n), static_cast<char>(1)) == std::next(ia, n))
74 int ia[n] = {0}; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 37 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18));
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 27 int ia[] = {1, 2, 3, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)));
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3)));
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa)))
[all...] |
| lexicographical_compare_comp.pass.cpp | 29 int ia[] = {1, 2, 3, 4}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c));
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c));
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 27 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)));
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib)));
39 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)))
[all...] |
| includes_comp.pass.cpp | 28 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
40 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), std::less<int>()))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 26 int ia[] = {1, 2, 3}; local
29 return std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib))
30 && !std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia))
39 int ia[] = {1, 2, 3, 4}; local
40 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
42 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)))
[all...] |
| lexicographical_compare_comp.pass.cpp | 28 int ia[] = {1, 2, 3}; local
32 return !std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), pred)
33 && std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia), pred)
42 int ia[] = {1, 2, 3, 4}; local
43 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
47 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c))
[all...] |
| /external/libcxx/test/std/numerics/numeric.ops/reduce/ |
| reduce.pass.cpp | 35 int ia[] = {1, 2, 3, 4, 5, 6}; local
36 unsigned sa = sizeof(ia) / sizeof(ia[0]);
37 test(Iter(ia), Iter(ia), 0);
38 test(Iter(ia), Iter(ia+1), 1);
39 test(Iter(ia), Iter(ia+2), 3);
40 test(Iter(ia), Iter(ia+sa), 21)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.foreach/ |
| for_each_n.pass.cpp | 32 int ia[] = {0, 1, 2, 3, 4, 5}; local
33 const unsigned s = sizeof(ia)/sizeof(ia[0]);
37 Iter it = std::for_each_n(Iter(ia), 0, std::ref(f));
38 assert(it == Iter(ia));
44 Iter it = std::for_each_n(Iter(ia), s, std::ref(f));
46 assert(it == Iter(ia+s));
49 assert(ia[i] == static_cast<int>(i+1));
54 Iter it = std::for_each_n(Iter(ia), 1, std::ref(f));
56 assert(it == Iter(ia+1))
[all...] |
| /external/v8/src/js/ |
| harmony-atomics.js | 27 function CheckSharedIntegerTypedArray(ia) {
28 if (!%IsSharedIntegerTypedArray(ia)) {
29 throw %make_type_error(kNotIntegerSharedTypedArray, ia);
33 function CheckSharedInteger32TypedArray(ia) {
34 CheckSharedIntegerTypedArray(ia);
35 if (!%IsSharedInteger32TypedArray(ia)) {
36 throw %make_type_error(kNotInt32SharedTypedArray, ia);
63 function AtomicsAddJS(ia, index, value) {
64 CheckSharedIntegerTypedArray(ia);
65 index = ValidateIndex(index, %_TypedArrayGetLength(ia));
[all...] |
