HomeSort by relevance Sort by last modified time
    Searched defs:a1 (Results 101 - 125 of 1031) sorted by null

1 2 3 45 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/
erase_iter.pass.cpp 22 bool a1[] = {1, 0, 1}; local
24 std::vector<bool> l1(a1, a1+3);
45 std::vector<bool, min_allocator<bool>> l1(a1, a1+3);
erase_iter_iter.pass.cpp 22 bool a1[] = {1, 0, 1}; local
24 std::vector<bool> l1(a1, a1+3);
31 std::vector<bool> l1(a1, a1+3);
36 assert(l1 == std::vector<bool>(a1+1, a1+3));
39 std::vector<bool> l1(a1, a1+3);
44 assert(l1 == std::vector<bool>(a1+2, a1+3))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/
erase_iter_db1.pass.cpp 24 int a1[] = {1, 2, 3}; local
25 std::unordered_multiset<int> l1(a1, a1+3);
erase_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);
erase_iter_iter_db1.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);
erase_iter_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);
erase_iter_iter_db3.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);
erase_iter_iter_db4.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/
erase_iter_db1.pass.cpp 24 int a1[] = {1, 2, 3}; local
25 std::unordered_set<int> l1(a1, a1+3);
erase_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db1.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db3.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db4.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/class.gslice/gslice.cons/
start_size_stride.pass.cpp 22 std::size_t a1[] = {1, 2, 3}; local
24 std::valarray<std::size_t> size(a1, sizeof(a1)/sizeof(a1[0]));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.mask.array/mask.array.fill/
assign_value.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
25 std::valarray<int> v1(a1, N1);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.assign/
slice_array.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
valarray.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.comp.assign/
addition.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
and.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
divide.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
modulo.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
multiply.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
or.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
shift_left.pass.cpp 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));

Completed in 1532 milliseconds

1 2 3 45 6 7 8 91011>>