HomeSort by relevance Sort by last modified time
    Searched defs:a2 (Results 251 - 275 of 1529) sorted by null

<<11121314151617181920>>

  /external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/
less_equal_valarray_valarray.pass.cpp 27 T a2[] = {6, 7, 0, 2, 1}; local
31 std::valarray<T> v2(a2, N);
less_equal_value_valarray.pass.cpp 26 T a2[] = {1, 2, 3, 4, 0}; local
28 const unsigned N = sizeof(a2)/sizeof(a2[0]);
29 std::valarray<T> v2(a2, N);
less_valarray_valarray.pass.cpp 27 T a2[] = {6, 7, 0, 2, 1}; local
31 std::valarray<T> v2(a2, N);
not_equal_valarray_valarray.pass.cpp 27 T a2[] = {6, 7, 0, 9, 10}; local
31 std::valarray<T> v2(a2, N);
not_equal_value_valarray.pass.cpp 26 T a2[] = {1, 2, 3, 4, 0}; local
28 const unsigned N = sizeof(a2)/sizeof(a2[0]);
29 std::valarray<T> v2(a2, N);
or_valarray_valarray.pass.cpp 27 T a2[] = {6, 7, 0, 9, 10}; local
31 std::valarray<T> v2(a2, N);
or_value_valarray.pass.cpp 26 T a2[] = {1, 2, 3, 4, 0}; local
28 const unsigned N = sizeof(a2)/sizeof(a2[0]);
29 std::valarray<T> v2(a2, N);
37 T a2[] = {1, 2, 3, 4, 0}; local
39 const unsigned N = sizeof(a2)/sizeof(a2[0]);
40 std::valarray<T> v2(a2, N);
  /external/libcxx/test/std/utilities/allocator.adaptor/allocator.adaptor.cnstr/
converting_copy.pass.cpp 34 A a2 = a1; local
36 assert(a2 == a1);
39 typedef std::scoped_allocator_adaptor<A1<double>, A2<int>> B;
40 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
41 B a1(A1<int>(4), A2<int>(5));
44 A2<int>::copy_called = false;
45 A2<int>::move_called = false;
46 A a2 = a1; local
48 assert(A2<int>::copy_called == true);
49 assert(a2 == a1)
61 A a2 = a1; local
    [all...]
converting_move.pass.cpp 34 A a2 = std::move(a1); local
37 assert(a2 == a1);
40 typedef std::scoped_allocator_adaptor<A1<double>, A2<int>> B;
41 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
42 B a1(A1<int>(4), A2<int>(5));
45 A2<int>::copy_called = false;
46 A2<int>::move_called = false;
47 A a2 = std::move(a1); local
50 assert(A2<int>::copy_called == false);
51 assert(A2<int>::move_called == true)
64 A a2 = std::move(a1); local
    [all...]
  /external/libcxx/test/std/utilities/any/any.class/any.assign/
move.pass.cpp 35 any a2(s2);
40 a = std::move(a2);
43 assert(RHS::count == 2 + a2.has_value());
47 if (a2.has_value())
48 assertContains<RHS>(a2, 0);
49 LIBCPP_ASSERT(!a2.has_value());
60 any a2((LHS(1)));
64 a = std::move(a2);
66 assert(LHS::count == 1 + a2.has_value());
70 if (a2.has_value()
77 any a2; local
93 any a2; local
    [all...]
  /external/testng/src/test/java/test/preserveorder/
AAA.java 15 public void a2() { method in class:AAA
16 log("AAA.a2");
  /prebuilts/go/darwin-x86/test/
sliceopt.go 16 func a2(x []int, y int) []int { func
  /prebuilts/go/linux-x86/test/
sliceopt.go 16 func a2(x []int, y int) []int { func
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
splice_pos_list.pass.cpp 26 int a2[] = {4, 5, 6}; local
38 std::list<int> l2(a2, a2+1);
49 std::list<int> l2(a2, a2+2);
62 std::list<int> l2(a2, a2+3);
99 std::list<int> l2(a2, a2+1);
112 std::list<int> l2(a2, a2+1)
    [all...]
splice_pos_list_iter.pass.cpp 26 int a2[] = {4, 5, 6}; local
29 std::list<int> l2(a2, a2+1);
40 std::list<int> l2(a2, a2+2);
53 std::list<int> l2(a2, a2+2);
66 std::list<int> l2(a2, a2+3);
81 std::list<int> l2(a2, a2+3)
    [all...]
splice_pos_list_iter_iter.pass.cpp 26 int a2[] = {4, 5, 6}; local
65 std::list<int> l2(a2, a2+3);
85 std::list<int> l2(a2, a2+3);
105 std::list<int> l2(a2, a2+3);
170 std::list<int, min_allocator<int>> l2(a2, a2+3);
190 std::list<int, min_allocator<int>> l2(a2, a2+3)
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/
db_swap_1.pass.cpp 30 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
32 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
45 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
47 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/
db_swap_1.pass.cpp 29 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
31 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
45 std::vector<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/
db_swap_1.pass.cpp 30 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
32 std::unordered_multiset<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/
db_swap_1.pass.cpp 30 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/depr/depr.function.objects/depr.adaptors/depr.member.pointer.adaptors/
const_mem_fun.pass.cpp 22 short a2(int i) {return short(i+1);} function in struct:A
const_mem_fun1.pass.cpp 22 short a2(int i) {return short(i+1);} function in struct:A
const_mem_fun_ref.pass.cpp 22 short a2(int i) {return short(i+1);} function in struct:A
const_mem_fun_ref1.pass.cpp 22 short a2(int i) {return short(i+1);} function in struct:A
mem_fun.pass.cpp 22 short a2(int i) {return short(i+1);} function in struct:A

Completed in 385 milliseconds

<<11121314151617181920>>