Home
last modified time | relevance | path

Searched refs:a (Results 1 – 25 of 1139) sorted by relevance

12345678910>>...46

/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/
Dis_sorted_until.pass.cpp27 int a[] = {0}; in test() local
28 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
29 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); in test()
30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
34 int a[] = {0, 0}; in test() local
35 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
39 int a[] = {0, 1}; in test() local
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
[all …]
Dis_sorted.pass.cpp27 int a[] = {0}; in test() local
28 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
29 assert(std::is_sorted(Iter(a), Iter(a))); in test()
30 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
34 int a[] = {0, 0}; in test() local
35 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
36 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
39 int a[] = {0, 1}; in test() local
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
41 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
Dis_sorted_until_comp.pass.cpp28 int a[] = {0}; in test() local
29 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); in test()
31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
35 int a[] = {0, 0}; in test() local
36 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
40 int a[] = {0, 1}; in test() local
41 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
[all …]
Dis_sorted_comp.pass.cpp28 int a[] = {0}; in test() local
29 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
30 assert(std::is_sorted(Iter(a), Iter(a))); in test()
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
35 int a[] = {0, 0}; in test() local
36 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
40 int a[] = {0, 1}; in test() local
41 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/
Dinput_iterator.pass.cpp24 int a[] = {0, 1, 2, 3}; in main() local
25 std::list<int> l(input_iterator<const int*>(a), in main()
26 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0]))); in main()
27 assert(l.size() == sizeof(a)/sizeof(a[0])); in main()
28 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); in main()
34 int a[] = {0, 1, 2, 3}; in main() local
35 std::list<int> l(input_iterator<const int*>(a), in main()
36 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0])), in main()
38 assert(l.size() == sizeof(a)/sizeof(a[0])); in main()
39 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/
Dsize_value_alloc.pass.cpp21 test(unsigned n, const T& x, const Allocator& a) in test() argument
25 C d(n, x, a); in test()
26 assert(d.get_allocator() == a); in test()
36 std::allocator<int> a; in main() local
37 test(0, 5, a); in main()
38 test(1, 10, a); in main()
39 test(10, 11, a); in main()
40 test(1023, -11, a); in main()
41 test(1024, 25, a); in main()
42 test(1025, 0, a); in main()
[all …]
/ndk/sources/host-tools/make-3.81/tests/scripts/features/
Dse_statpat12 foo.a foo.b: foo.%: bar.% baz.%
14 foo.a foo.b: foo.%: biz.% | buz.%
16 foo.a foo.b: foo.%: $$@.1 \
25 'bar.a
26 baz.a
27 biz.a
28 buz.a
29 foo.a.1
30 bar.a.2
31 bar.a.3
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/
Dinsert_iter_iter_iter.pass.cpp30 int a[] = {1, 2, 3, 4, 5}; in main() local
31 const int N = sizeof(a)/sizeof(a[0]); in main()
32 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a), in main()
33 input_iterator<const int*>(a+N)); in main()
41 assert(v[j] == a[k]); in main()
47 int a[] = {1, 2, 3, 4, 5}; in main() local
48 const int N = sizeof(a)/sizeof(a[0]); in main()
49 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a), in main()
50 forward_iterator<const int*>(a+N)); in main()
58 assert(v[j] == a[k]); in main()
[all …]
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/preprocessor/slot/detail/
Ddef.hpp29 # define BOOST_PP_SLOT_CC_2(a, b) BOOST_PP_SLOT_CC_2_D(a, b) argument
30 # define BOOST_PP_SLOT_CC_3(a, b, c) BOOST_PP_SLOT_CC_3_D(a, b, c) argument
31 # define BOOST_PP_SLOT_CC_4(a, b, c, d) BOOST_PP_SLOT_CC_4_D(a, b, c, d) argument
32 # define BOOST_PP_SLOT_CC_5(a, b, c, d, e) BOOST_PP_SLOT_CC_5_D(a, b, c, d, e) argument
33 # define BOOST_PP_SLOT_CC_6(a, b, c, d, e, f) BOOST_PP_SLOT_CC_6_D(a, b, c, d, e, f) argument
34 # define BOOST_PP_SLOT_CC_7(a, b, c, d, e, f, g) BOOST_PP_SLOT_CC_7_D(a, b, c, d, e, f, g) argument
35 # define BOOST_PP_SLOT_CC_8(a, b, c, d, e, f, g, h) BOOST_PP_SLOT_CC_8_D(a, b, c, d, e, f, g, h) argument
36 # define BOOST_PP_SLOT_CC_9(a, b, c, d, e, f, g, h, i) BOOST_PP_SLOT_CC_9_D(a, b, c, d, e, f, g, h,… argument
37 # define BOOST_PP_SLOT_CC_10(a, b, c, d, e, f, g, h, i, j) BOOST_PP_SLOT_CC_10_D(a, b, c, d, e, f, … argument
39 # define BOOST_PP_SLOT_CC_2_D(a, b) a ## b argument
[all …]
/ndk/tests/build/mips-fp4/jni/
Dmips-fp4-test3-6.c3 double test3 (double a, double b, double c) in test3() argument
5 return - (a + b * c); in test3()
7 double test4 (double a, double b, double c) in test4() argument
9 return - (-a + b * c); in test4()
11 double test5 (double a) in test5() argument
13 return 1/a; in test5()
15 double test6 (double a) in test6() argument
17 return 1/sqrt(a); in test6()
20 double a, b, c; variable
24 test3(a, b, c); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/
Dcatch_ptr.cpp25 B(const B& a) : id_(a.id_) {count++;} in B()
37 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1()
49 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2()
61 A(const A& a) : C1(a.id_-1), C2(a.id_-2), B(a.id_+3), id_(a.id_) {count++;} in A()
67 A a(5); variable
71 throw &a; in f1()
82 catch (const A* a) // can catch A in f2() local
84 assert(a->id_ == 5); in f2()
85 assert(static_cast<const C1*>(a)->id_ == 4); in f2()
86 assert(static_cast<const C2*>(a)->id_ == 3); in f2()
[all …]
/ndk/sources/cxx-stl/gabi++/tests/
Dcatch_ptr.cpp25 B(const B& a) : id_(a.id_) {count++;} in B()
37 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1()
49 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2()
61 A(const A& a) : C1(a.id_-1), C2(a.id_-2), B(a.id_+3), id_(a.id_) {count++;} in A()
67 A a(5); variable
71 throw &a; in f1()
82 catch (const A* a) // can catch A in f2() local
84 assert(a->id_ == 5); in f2()
85 assert(static_cast<const C1*>(a)->id_ == 4); in f2()
86 assert(static_cast<const C2*>(a)->id_ == 3); in f2()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
Dpop_front.pass.cpp22 int a[] = {1, 2, 3}; in main() local
23 std::list<int> c(a, a+3); in main()
25 assert(c == std::list<int>(a+1, a+3)); in main()
27 assert(c == std::list<int>(a+2, a+3)); in main()
33 int a[] = {1, 2, 3}; in main() local
34 std::list<int, min_allocator<int>> c(a, a+3); in main()
36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3))); in main()
38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3))); in main()
Dpop_back.pass.cpp26 int a[] = {1, 2, 3}; in main() local
27 std::list<int> c(a, a+3); in main()
29 assert(c == std::list<int>(a, a+2)); in main()
31 assert(c == std::list<int>(a, a+1)); in main()
41 int a[] = {1, 2, 3}; in main() local
42 std::list<int, min_allocator<int>> c(a, a+3); in main()
44 assert((c == std::list<int, min_allocator<int>>(a, a+2))); in main()
46 assert((c == std::list<int, min_allocator<int>>(a, a+1))); in main()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/
Dconstruct_iter_iter_alloc.pass.cpp25 test(Iterator first, Iterator last, const A& a) in test() argument
27 C c(first, last, a); in test()
49 int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0}; in main() local
50 int* an = a + sizeof(a)/sizeof(a[0]); in main()
52 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); in main()
53 … test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); in main()
54 …test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(… in main()
55 …test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(… in main()
56 test<std::vector<int> >(a, an, alloc); in main()
60 int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0}; in main() local
[all …]
Dconstruct_iter_iter.pass.cpp36 int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0}; in main() local
37 int* an = a + sizeof(a)/sizeof(a[0]); in main()
38 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an)); in main()
39 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); in main()
40 …test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(… in main()
41 …test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(… in main()
42 test<std::vector<int> >(a, an); in main()
44 …test<std::vector<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<c… in main()
45 …test<std::vector<int, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterat… in main()
46 …test<std::vector<int, stack_allocator<int, 18> > >(bidirectional_iterator<const int*>(a), bidirect… in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.cons/
Dpointer_size.pass.cpp23 T a[] = {1, 2, 3, 4, 5}; in main() local
24 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
25 std::valarray<T> v(a, N); in main()
28 assert(v[i] == a[i]); in main()
32 T a[] = {1, 2.5, 3, 4.25, 5}; in main() local
33 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
34 std::valarray<T> v(a, N); in main()
37 assert(v[i] == a[i]); in main()
41 T a[] = {T(1), T(2), T(3), T(4), T(5)}; in main() local
42 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/
Dinsert_iter_iter_iter.pass.cpp25 bool a[] = {1, 0, 0, 1, 1}; in main() local
26 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
27 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const bool*>(a), in main()
28 input_iterator<const bool*>(a+N)); in main()
35 assert(v[j] == a[k]); in main()
41 bool a[] = {1, 0, 0, 1, 1}; in main() local
42 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
43 std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a), in main()
44 forward_iterator<const bool*>(a+N)); in main()
51 assert(v[j] == a[k]); in main()
[all …]
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/preprocessor/list/
Dappend.hpp23 # define BOOST_PP_LIST_APPEND(a, b) BOOST_PP_LIST_FOLD_RIGHT(BOOST_PP_LIST_APPEND_O, b, a) argument
25 # define BOOST_PP_LIST_APPEND(a, b) BOOST_PP_LIST_APPEND_I(a, b) argument
26 # define BOOST_PP_LIST_APPEND_I(a, b) BOOST_PP_LIST_FOLD_RIGHT(BOOST_PP_LIST_APPEND_O, b, a) argument
34 # define BOOST_PP_LIST_APPEND_D(d, a, b) BOOST_PP_LIST_FOLD_RIGHT_ ## d(BOOST_PP_LIST_APPEND_O, … argument
36 # define BOOST_PP_LIST_APPEND_D(d, a, b) BOOST_PP_LIST_APPEND_D_I(d, a, b) argument
37 # define BOOST_PP_LIST_APPEND_D_I(d, a, b) BOOST_PP_LIST_FOLD_RIGHT_ ## d(BOOST_PP_LIST_APPEND_O… argument
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.assign/
Dmove_assign.pass.cpp24 T a[] = {1, 2, 3, 4, 5}; in main() local
25 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
26 std::valarray<T> v(a, N); in main()
32 assert(v2[i] == a[i]); in main()
36 T a[] = {1, 2.5, 3, 4.25, 5}; in main() local
37 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
38 std::valarray<T> v(a, N); in main()
44 assert(v2[i] == a[i]); in main()
48 T a[] = {T(1), T(2), T(3), T(4), T(5)}; in main() local
49 const unsigned N = sizeof(a)/sizeof(a[0]); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/inner.product/
Dinner_product.pass.cpp38 int a[] = {1, 2, 3, 4, 5, 6}; in test() local
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
41 test(Iter1(a), Iter1(a), Iter2(b), 0, 0); in test()
42 test(Iter1(a), Iter1(a), Iter2(b), 10, 10); in test()
43 test(Iter1(a), Iter1(a+1), Iter2(b), 0, 6); in test()
44 test(Iter1(a), Iter1(a+1), Iter2(b), 10, 16); in test()
45 test(Iter1(a), Iter1(a+2), Iter2(b), 0, 16); in test()
46 test(Iter1(a), Iter1(a+2), Iter2(b), 10, 26); in test()
47 test(Iter1(a), Iter1(a+sa), Iter2(b), 0, 56); in test()
48 test(Iter1(a), Iter1(a+sa), Iter2(b), 10, 66); in test()
Dinner_product_comp.pass.cpp41 int a[] = {1, 2, 3, 4, 5, 6}; in test() local
43 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
44 test(Iter1(a), Iter1(a), Iter2(b), 1, 1); in test()
45 test(Iter1(a), Iter1(a), Iter2(b), 10, 10); in test()
46 test(Iter1(a), Iter1(a+1), Iter2(b), 1, 7); in test()
47 test(Iter1(a), Iter1(a+1), Iter2(b), 10, 70); in test()
48 test(Iter1(a), Iter1(a+2), Iter2(b), 1, 49); in test()
49 test(Iter1(a), Iter1(a+2), Iter2(b), 10, 490); in test()
50 test(Iter1(a), Iter1(a+sa), Iter2(b), 1, 117649); in test()
51 test(Iter1(a), Iter1(a+sa), Iter2(b), 10, 1176490); in test()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.elem/
Dindex.pass.cpp30 P a[] = in main() local
39 C c(a, a + sizeof(a)/sizeof(a[0])); in main()
51 P a[] = in main() local
60 C c(a, a + sizeof(a)/sizeof(a[0])); in main()
74 P a[] = in main() local
83 C c(a, a + sizeof(a)/sizeof(a[0])); in main()
96 P a[] = in main() local
105 C c(a, a + sizeof(a)/sizeof(a[0])); in main()
Dat.pass.cpp31 P a[] = in main() local
40 C c(a, a + sizeof(a)/sizeof(a[0])); in main()
57 P a[] = in main() local
66 const C c(a, a + sizeof(a)/sizeof(a[0])); in main()
84 P a[] = in main() local
93 C c(a, a + sizeof(a)/sizeof(a[0])); in main()
111 P a[] = in main() local
120 const C c(a, a + sizeof(a)/sizeof(a[0])); in main()
/ndk/sources/third_party/googletest/googletest/test/
Dgtest-tuple_test.cc65 const tuple<int, char, bool> a(5, 'a', false); in TEST() local
67 EXPECT_TRUE(a == a); in TEST()
68 EXPECT_FALSE(a != a); in TEST()
73 const tuple<int, bool> a(5, true), b(5, true); in TEST() local
75 EXPECT_TRUE(a == b); in TEST()
76 EXPECT_FALSE(a != b); in TEST()
83 const FooTuple a(0, 'x'); in TEST() local
86 EXPECT_TRUE(a != b); in TEST()
87 EXPECT_FALSE(a == b); in TEST()
101 const FooTuple a(i, ch); in TEST() local
[all …]

12345678910>>...46