| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/preprocessor/repetition/ |
| D | repeat.hpp | 34 # define BOOST_PP_REPEAT_CHECK_BOOST_PP_REPEAT_1(c, m, d) 0 argument
35 # define BOOST_PP_REPEAT_CHECK_BOOST_PP_REPEAT_2(c, m, d) 0 argument
36 # define BOOST_PP_REPEAT_CHECK_BOOST_PP_REPEAT_3(c, m, d) 0 argument
38 # define BOOST_PP_REPEAT_1(c, m, d) BOOST_PP_REPEAT_1_I(c, m, d) argument
39 # define BOOST_PP_REPEAT_2(c, m, d) BOOST_PP_REPEAT_2_I(c, m, d) argument
40 # define BOOST_PP_REPEAT_3(c, m, d) BOOST_PP_REPEAT_3_I(c, m, d) argument
41 # define BOOST_PP_REPEAT_4(c, m, d) BOOST_PP_ERROR(0x0003) argument
43 # define BOOST_PP_REPEAT_1_I(c, m, d) BOOST_PP_REPEAT_1_ ## c(m, d) argument
44 # define BOOST_PP_REPEAT_2_I(c, m, d) BOOST_PP_REPEAT_2_ ## c(m, d) argument
45 # define BOOST_PP_REPEAT_3_I(c, m, d) BOOST_PP_REPEAT_3_ ## c(m, d) argument
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.match/ |
| D | ecma.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_match(s, m, std::regex("a"))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | extended.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::extended))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | basic.pass.cpp | 27 std::cmatch m; in main() local
28 assert(!std::regex_match("a", m, std::regex())); in main()
29 assert(m.size() == 0); in main()
30 assert(m.empty()); in main()
33 std::cmatch m; in main() local
35 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::basic))); in main()
36 assert(m.size() == 1); in main()
37 assert(!m.empty()); in main()
38 assert(!m.prefix().matched); in main()
39 assert(m.prefix().first == s); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.search/ |
| D | basic.pass.cpp | 27 std::cmatch m; in main() local
28 assert(!std::regex_search("a", m, std::regex())); in main()
29 assert(m.size() == 0); in main()
30 assert(m.empty()); in main()
33 std::cmatch m; in main() local
35 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::basic))); in main()
36 assert(m.size() == 1); in main()
37 assert(!m.empty()); in main()
38 assert(!m.prefix().matched); in main()
39 assert(m.prefix().first == s); in main()
[all …]
|
| D | ecma.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a"))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | awk.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::awk))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | extended.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::extended))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| D | erase_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 3)); in main()
41 assert(m.size() == 7); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 5); in main()
47 assert(*next(m.begin(), 4) == 6); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
41 assert(m.size() == 8); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
[all …]
|
| D | upper_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.upper_bound(5); in main()
43 assert(r == next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
49 assert(r == next(m.begin(), 4)); in main()
50 r = m.upper_bound(13); in main()
[all …]
|
| D | lower_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.lower_bound(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.lower_bound(13); in main()
[all …]
|
| D | erase_key.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(9); in main()
41 assert(m.size() == 8); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
48 assert(*next(m.begin(), 5) == 6); in main()
[all …]
|
| D | find.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.find(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.find(9); in main()
[all …]
|
| D | equal_range.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.equal_range(5); in main()
43 assert(r.first == next(m.begin(), 0)); in main()
44 assert(r.second == next(m.begin(), 1)); in main()
45 r = m.equal_range(7); in main()
46 assert(r.first == next(m.begin(), 1)); in main()
47 assert(r.second == next(m.begin(), 2)); in main()
48 r = m.equal_range(9); in main()
49 assert(r.first == next(m.begin(), 2)); in main()
50 assert(r.second == next(m.begin(), 3)); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| D | erase_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 3)); in main()
41 assert(m.size() == 7); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 5); in main()
47 assert(*next(m.begin(), 4) == 6); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
41 assert(m.size() == 8); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
[all …]
|
| D | find.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.find(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.find(9); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| D | upper_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.upper_bound(5); in main()
43 assert(r == next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
49 assert(r == next(m.begin(), 4)); in main()
50 r = m.upper_bound(13); in main()
[all …]
|
| D | lower_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.lower_bound(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.lower_bound(13); in main()
[all …]
|
| D | find.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.find(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.find(9); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| D | is_many.pass.cpp | 33 std::vector<F::mask> m(in.size()); in main() local
34 const wchar_t* h = f.is(in.data(), in.data() + in.size(), m.data()); in main()
38 assert(!(m[0] & F::space)); in main()
39 assert( (m[0] & F::print)); in main()
40 assert(!(m[0] & F::cntrl)); in main()
41 assert( (m[0] & F::upper)); in main()
42 assert(!(m[0] & F::lower)); in main()
43 assert( (m[0] & F::alpha)); in main()
44 assert(!(m[0] & F::digit)); in main()
45 assert(!(m[0] & F::punct)); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| D | erase_iter.pass.cpp | 39 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
40 assert(m.size() == 9); in main()
41 I i = m.erase(next(m.cbegin(), 3)); in main()
42 assert(m.size() == 8); in main()
43 assert(i == next(m.begin(), 3)); in main()
44 assert(m.begin()->first == 1); in main()
45 assert(m.begin()->second == 1); in main()
46 assert(next(m.begin())->first == 1); in main()
47 assert(next(m.begin())->second == 1.5); in main()
48 assert(next(m.begin(), 2)->first == 1); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| D | erase_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 3)); in main()
41 assert(m.size() == 7); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(m.begin()->first == 1); in main()
44 assert(m.begin()->second == 1.5); in main()
45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
[all …]
|
| D | erase_key.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 R s = m.erase(9); in main()
42 assert(m.size() == 8); in main()
43 assert(m.begin()->first == 1); in main()
44 assert(m.begin()->second == 1.5); in main()
45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
48 assert(next(m.begin(), 2)->second == 3.5); in main()
[all …]
|