| /ndk/sources/cxx-stl/llvm-libc++/libcxx/src/ |
| D | hash.cpp | 217 size_t i = 211; in __next_prime() local
220 std::size_t q = n / i; in __next_prime()
221 if (q < i) in __next_prime()
223 if (n == q * i) in __next_prime()
226 i += 10; in __next_prime()
227 q = n / i; in __next_prime()
228 if (q < i) in __next_prime()
230 if (n == q * i) in __next_prime()
233 i += 2; in __next_prime()
234 q = n / i; in __next_prime()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.iter/re.tokiter/re.tokiter.cnstr/ |
| D | vector.pass.cpp | 31 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1, in main() local
33 assert(i != std::cregex_token_iterator()); in main()
34 assert(i->str() == "start "); in main()
35 ++i; in main()
36 assert(i != std::cregex_token_iterator()); in main()
37 assert(i->str() == "start "); in main()
38 ++i; in main()
39 assert(i != std::cregex_token_iterator()); in main()
40 assert(i->str() == ", "); in main()
41 ++i; in main()
[all …]
|
| D | array.pass.cpp | 30 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1, in main() local
32 assert(i != std::cregex_token_iterator()); in main()
33 assert(i->str() == "start "); in main()
34 ++i; in main()
35 assert(i != std::cregex_token_iterator()); in main()
36 assert(i->str() == "555-1234"); in main()
37 ++i; in main()
38 assert(i != std::cregex_token_iterator()); in main()
39 assert(i->str() == "1234"); in main()
40 ++i; in main()
[all …]
|
| D | init.pass.cpp | 29 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1, in main() local
31 assert(i != std::cregex_token_iterator()); in main()
32 assert(i->str() == "start "); in main()
33 ++i; in main()
34 assert(i != std::cregex_token_iterator()); in main()
35 assert(i->str() == "555-1234"); in main()
36 ++i; in main()
37 assert(i != std::cregex_token_iterator()); in main()
38 assert(i->str() == "1234"); in main()
39 ++i; in main()
[all …]
|
| D | int.pass.cpp | 27 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1, in main() local
29 assert(i != std::cregex_token_iterator()); in main()
30 assert(i->str() == "start "); in main()
31 ++i; in main()
32 assert(i != std::cregex_token_iterator()); in main()
33 assert(i->str() == ", "); in main()
34 ++i; in main()
35 assert(i != std::cregex_token_iterator()); in main()
36 assert(i->str() == ", "); in main()
37 ++i; in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| D | partition.pass.cpp | 28 bool operator()(const int& i) const {return i & 1;} in operator ()()
40 for (int* i = ia; i < base(r); ++i) in test() local
41 assert(is_odd()(*i)); in test()
42 for (int* i = base(r); i < ia+sa; ++i) in test() local
43 assert(!is_odd()(*i)); in test()
48 for (unsigned i = 0; i < sa; ++i) in test() local
49 ia[i] = 2*i; in test()
53 for (unsigned i = 0; i < sa; ++i) in test() local
54 ia[i] = 2*i+1; in test()
58 for (unsigned i = 0; i < sa; ++i) in test() local
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| D | access.pass.cpp | 42 for (int i = 0; i < init-start; ++i) in make() local
44 for (int i = 0; i < size; ++i) in make() local
45 c.push_back(i); in make()
46 for (int i = 0; i < start; ++i) in make() local
55 for (unsigned i = 0; i < 10; ++i) in main() local
56 assert(c[i] == i); in main()
57 for (unsigned i = 0; i < 10; ++i) in main() local
58 assert(c.at(i) == i); in main()
64 for (unsigned i = 0; i < 10; ++i) in main() local
65 assert(c[i] == i); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| D | insert_iter_iter_iter.pass.cpp | 48 std::list<int>::iterator i = l1.insert(l1.begin(), a1, a1+3); in main() local
49 assert(i == l1.begin()); in main()
52 i = l1.begin(); in main()
53 assert(*i == 1); in main()
54 ++i; in main()
55 assert(*i == 2); in main()
56 ++i; in main()
57 assert(*i == 3); in main()
59 i = l1.insert(i, a2, a2+3); in main()
60 assert(*i == 4); in main()
[all …]
|
| D | insert_iter_initializer_list.pass.cpp | 24 std::list<int>::iterator i = d.insert(next(d.cbegin(), 2), {3, 4, 5, 6}); in main() local
26 assert(i == next(d.begin(), 2)); in main()
27 i = d.begin(); in main()
28 assert(*i++ == 1); in main()
29 assert(*i++ == 1); in main()
30 assert(*i++ == 3); in main()
31 assert(*i++ == 4); in main()
32 assert(*i++ == 5); in main()
33 assert(*i++ == 6); in main()
34 assert(*i++ == 1); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/template.bitset/bitset.members/ |
| D | to_string.pass.cpp | 36 for (std::size_t i = 0; i < N; ++i) in make_bitset() local
37 v[i] = static_cast<bool>(std::rand() & 1); in make_bitset()
48 for (std::size_t i = 0; i < N; ++i) in test_to_string() local
49 if (v[i]) in test_to_string()
50 assert(s[N - 1 - i] == '1'); in test_to_string()
52 assert(s[N - 1 - i] == '0'); in test_to_string()
56 for (std::size_t i = 0; i < N; ++i) in test_to_string() local
57 if (v[i]) in test_to_string()
58 assert(s[N - 1 - i] == '1'); in test_to_string()
60 assert(s[N - 1 - i] == '0'); in test_to_string()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| D | insert_iter_iter.pass.cpp | 36 for (int i = 0; i < init-start; ++i) in make() local
38 for (int i = 0; i < size; ++i) in make() local
39 c.push_back(i); in make()
40 for (int i = 0; i < start; ++i) in make() local
53 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end())); in test() local
54 assert(i == c1.begin() + P); in test()
57 i = c1.begin(); in test()
58 for (int j = 0; j < P; ++j, ++i) in test()
59 assert(*i == j); in test()
60 for (int j = 0; j < c2.size(); ++j, ++i) in test()
[all …]
|
| D | insert_size_value.pass.cpp | 32 for (int i = 0; i < init-start; ++i) in make() local
34 for (int i = 0; i < size; ++i) in make() local
35 c.push_back(i); in make()
36 for (int i = 0; i < start; ++i) in make() local
48 CI i = c1.insert(c1.begin() + P, size, x); in test() local
49 assert(i == c1.begin() + P); in test()
52 i = c1.begin(); in test()
53 for (int j = 0; j < P; ++j, ++i) in test()
54 assert(*i == j); in test()
55 for (int j = 0; j < size; ++j, ++i) in test()
[all …]
|
| D | insert_rvalue.pass.cpp | 35 for (int i = 0; i < init-start; ++i) in make() local
37 for (int i = 0; i < size; ++i) in make() local
38 c.push_back(MoveOnly(i)); in make()
39 for (int i = 0; i < start; ++i) in make() local
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x)); in test() local
52 assert(i == c1.begin() + P); in test()
55 i = c1.begin(); in test()
56 for (int j = 0; j < P; ++j, ++i) in test()
57 assert(*i == MoveOnly(j)); in test()
58 assert(*i == MoveOnly(x)); in test()
[all …]
|
| D | insert_value.pass.cpp | 32 for (int i = 0; i < init-start; ++i) in make() local
34 for (int i = 0; i < size; ++i) in make() local
35 c.push_back(i); in make()
36 for (int i = 0; i < start; ++i) in make() local
48 CI i = c1.insert(c1.begin() + P, x); in test() local
49 assert(i == c1.begin() + P); in test()
52 i = c1.begin(); in test()
53 for (int j = 0; j < P; ++j, ++i) in test()
54 assert(*i == j); in test()
55 assert(*i == x); in test()
[all …]
|
| D | emplace.pass.cpp | 35 for (int i = 0; i < init-start; ++i) in make() local
37 for (int i = 0; i < size; ++i) in make() local
39 for (int i = 0; i < start; ++i) in make() local
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5)); in test() local
52 assert(i == c1.begin() + P); in test()
55 assert(*i == Emplaceable(1, 2.5)); in test()
64 for (int i = 0; i <= 3; ++i) in testN() local
66 if (0 <= i && i <= N) in testN()
69 test(i, c1); in testN()
72 for (int i = N/2-1; i <= N/2+1; ++i) in testN() local
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| D | splice_pos_list_iter_iter.pass.cpp | 32 std::list<int>::const_iterator i = l1.begin(); in main() local
33 assert(*i == 1); in main()
34 ++i; in main()
35 assert(*i == 2); in main()
36 ++i; in main()
37 assert(*i == 3); in main()
44 std::list<int>::const_iterator i = l1.begin(); in main() local
45 assert(*i == 2); in main()
46 ++i; in main()
47 assert(*i == 1); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| D | eval.pass.cpp | 52 for (int i = 0; i < N; ++i) in main() local
66 for (int i = 0; i < areas.size(); ++i) in main() local
68 areas[i] = (p[i]+p[i+1])*(b[i+1]-b[i])/2; in main()
69 S += areas[i]; in main()
71 for (int i = 0; i < areas.size(); ++i) in main() local
72 areas[i] /= S; in main()
73 for (int i = 0; i < Np+1; ++i) in main() local
74 p[i] /= S; in main()
75 for (int i = 0; i < N; ++i) in main() local
77 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.iter/re.tokiter/re.tokiter.incr/ |
| D | post.pass.cpp | 24 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1, in main() local
26 assert(i != std::cregex_token_iterator()); in main()
27 assert(i->str() == "start "); in main()
28 i++; in main()
29 assert(i != std::cregex_token_iterator()); in main()
30 assert(i->str() == ", "); in main()
31 i++; in main()
32 assert(i != std::cregex_token_iterator()); in main()
33 assert(i->str() == ", "); in main()
34 i++; in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.iter/re.tokiter/re.tokiter.deref/ |
| D | deref.pass.cpp | 24 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1, in main() local
26 assert(i != std::cregex_token_iterator()); in main()
27 assert((*i).str() == "start "); in main()
28 ++i; in main()
29 assert(i != std::cregex_token_iterator()); in main()
30 assert((*i).str() == ", "); in main()
31 ++i; in main()
32 assert(i != std::cregex_token_iterator()); in main()
33 assert((*i).str() == ", "); in main()
34 ++i; in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| D | local_iterators.pass.cpp | 47 I i = c.begin(b); in main() local
49 assert(std::distance(i, j) == 0); in main()
52 i = c.begin(b); in main()
54 assert(std::distance(i, j) == 2); in main()
55 assert(i->first == 1); in main()
56 assert(i->second == "one"); in main()
57 ++i; in main()
58 assert(i->first == 1); in main()
59 assert(i->second == "four"); in main()
62 i = c.begin(b); in main()
[all …]
|
| D | local_iterators.fail.cpp | 45 I i = c.begin(b); in main() local
47 assert(std::distance(i, j) == 0); in main()
50 i = c.begin(b); in main()
52 assert(std::distance(i, j) == 2); in main()
53 assert(i->first == 1); in main()
54 assert(i->second == "one"); in main()
55 ++i; in main()
56 assert(i->first == 1); in main()
57 assert(i->second == "four"); in main()
58 i->first = 2; in main()
[all …]
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/ |
| D | na_spec.hpp | 38 #define BOOST_MPL_AUX_NA_PARAMS(i) \ argument
39 BOOST_MPL_PP_ENUM(i, na) \
43 # define BOOST_MPL_AUX_NA_SPEC_ARITY(i, name) \ argument
47 name< BOOST_MPL_AUX_NA_PARAMS(i) > \
56 # define BOOST_MPL_AUX_NA_SPEC_ARITY(i, name) /**/ argument
59 #define BOOST_MPL_AUX_NA_SPEC_MAIN(i, name) \ argument
61 struct name< BOOST_MPL_AUX_NA_PARAMS(i) > \
64 BOOST_MPL_PP_PARAMS(i, typename T) \
65 BOOST_MPL_PP_NESTED_DEF_PARAMS_TAIL(i, typename T, na) \
68 : name< BOOST_MPL_PP_PARAMS(i, T) > \
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/ |
| D | eval.pass.cpp | 30 for (int i = 0; i < N; ++i) in main() local
37 for (int i = 0; i <= d.max(); ++i) in main() local
38 assert((double)u[i]/N == prob[i]); in main()
48 for (int i = 0; i < N; ++i) in main() local
55 for (int i = 0; i <= d.max(); ++i) in main() local
56 assert((double)u[i]/N == prob[i]); in main()
66 for (int i = 0; i < N; ++i) in main() local
73 for (int i = 0; i <= d.max(); ++i) in main() local
74 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001); in main()
84 for (int i = 0; i < N; ++i) in main() local
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| D | local_iterators.pass.cpp | 46 I i = c.begin(b); in main() local
48 assert(std::distance(i, j) == 0); in main()
51 i = c.begin(b); in main()
53 assert(std::distance(i, j) == 2); in main()
54 assert(*i == 1); in main()
55 ++i; in main()
56 assert(*i == 1); in main()
59 i = c.begin(b); in main()
61 assert(std::distance(i, j) == 2); in main()
62 assert(*i == 2); in main()
[all …]
|
| /ndk/sources/android/support/src/ |
| D | wchar_support.c | 28 size_t i; in wcpncpy() local
29 for (i = 0; i < n; ++i) { in wcpncpy()
30 wchar_t wc = src[i]; in wcpncpy()
31 dst[i] = wc; in wcpncpy()
35 while (i < n) { in wcpncpy()
36 dst[i] = L'\0'; in wcpncpy()
37 ++i; in wcpncpy()
60 size_t i = 0; in wcscat() local
62 wchar_t wc = s2[i]; in wcscat()
63 s1[n+i] = wc; in wcscat()
[all …]
|