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

1 23 4 5 6 7 8 91011>>

  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.assign/
valarray.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.comp.assign/
addition.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
and.pass.cpp 22 int a2[] = {1, 2, 3, 4, 5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
divide.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
modulo.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
multiply.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
or.pass.cpp 22 int a2[] = {1, 2, 3, 4, 5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
shift_left.pass.cpp 22 int a2[] = {1, 2, 3, 4, 5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
shift_right.pass.cpp 22 int a2[] = {1, 2, 3, 4, 5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
subtraction.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
xor.pass.cpp 22 int a2[] = {1, 2, 3, 4, 5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.sub/
slice_non_const.pass.cpp 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/allocator.adaptor/allocator.adaptor.members/
select_on_container_copy_construction.pass.cpp 30 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); local
31 assert(a2.outer_allocator().id() == 3);
38 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); local
39 assert(a2.outer_allocator().id() == -1);
43 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>, A3<int>> A;
44 A a1(A1<int>(1), A2<int>(2), A3<int>(3));
48 A a2 = std::allocator_traits<A>::select_on_container_copy_construction(a1); local
49 assert(a2.outer_allocator().id() == 1);
50 assert(a2.inner_allocator().outer_allocator().id() == 2);
51 assert(a2.inner_allocator().inner_allocator().outer_allocator().id() == -1)
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/allocator.adaptor/scoped.adaptor.operators/
eq.pass.cpp 37 A a2 = a1; local
38 assert(a2 == a1);
39 assert(!(a2 != a1));
42 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>> A;
43 A a1(A1<int>(4), A2<int>(5));
44 A a2 = a1; local
45 assert(a2 == a1);
46 assert(!(a2 != a1));
49 typedef std::scoped_allocator_adaptor<A1<int>, A2<int>, A3<int>> A;
50 A a1(A1<int>(4), A2<int>(5), A3<int>(6))
51 A a2 = a1; local
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/default.allocator/allocator.globals/
eq.pass.cpp 28 std::allocator<int> a2; local
29 assert(a1 == a2);
30 assert(!(a1 != a2));
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/default.allocator/
allocator_types.pass.cpp 46 std::allocator<char> a2 = a; local
47 a2 = a;
48 std::allocator<int> a3 = a2;
allocator_void.pass.cpp 34 std::allocator<void> a2 = a; local
35 a2 = a;
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/
merge.pass.cpp 23 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
    [all...]
merge_comp.pass.cpp 24 int a2[] = {11, 8, 6, 5, 4, 2, 0}; local
27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
34 int a2[] = {11, 8, 6, 5, 4, 2, 0}; local
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
    [all...]
reverse.pass.cpp 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
sort.pass.cpp 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
sort_comp.pass.cpp 24 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
    [all...]
unique.pass.cpp 23 int a2[] = {2, 1, 4, 3}; local
26 assert(c == std::list<int>(a2, a2+4));
31 int a2[] = {2, 1, 4, 3}; local
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
unique_pred.pass.cpp 28 int a2[] = {2, 1, 4, 3}; local
31 assert(c == std::list<int>(a2, a2+4));
36 int a2[] = {2, 1, 4, 3}; local
39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.special/
swap.pass.cpp 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
    [all...]

Completed in 256 milliseconds

1 23 4 5 6 7 8 91011>>