/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/ |
H A D | minus_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 31 assert(v1.size() == v2.size()); 32 assert(v1.size() == v3.size()); 33 for (int i = 0; i < v1.size(); ++i) 34 assert(v1[i] == v3[i]);
|
H A D | modulo_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 30 v2 %= v1; 31 assert(v1.size() == v2.size()); 32 assert(v1.size() == v3.size()); 33 for (int i = 0; i < v1.size(); ++i)
|
H A D | shift_right_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 31 assert(v1.size() == v2.size()); 32 assert(v1.size() == v3.size()); 33 for (int i = 0; i < v1.size(); ++i) 34 assert(v1[i] == v3[i]);
|
/external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/ |
H A D | and_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 & v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | divide_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 / v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | minus_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 - v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | modulo_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 % v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | or_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 | v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | plus_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 + v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | shift_left_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 << v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | shift_right_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 >> v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | times_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 * v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
H A D | xor_valarray_valarray.pass.cpp | 27 std::valarray<T> v1(a1, N); 29 std::valarray<T> v3 = v1 ^ v2; 30 assert(v1.size() == v2.size()); 31 assert(v1.size() == v3.size()); 32 for (int i = 0; i < v1.size(); ++i)
|
/external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/ |
H A D | and_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 && v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | equal_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 == v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | greater_equal_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 >= v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | greater_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 > v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | less_equal_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 <= v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | less_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 < v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | not_equal_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 != v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
H A D | or_valarray_valarray.pass.cpp | 29 std::valarray<T> v1(a1, N); 31 std::valarray<bool> v3 = v1 || v2; 32 assert(v1.size() == v2.size()); 33 assert(v1.size() == v3.size()); 34 for (int i = 0; i < v1.size(); ++i)
|
/external/v8/test/mjsunit/compiler/ |
H A D | regress-gap.js | 30 function small_select(n, v1, v2) { 32 var tmp = v1; 33 v1 = v2; 36 return v1; 39 function select(n, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) { 41 var tmp = v1; 42 v1 = v2; 53 return v1; 56 function select_while(n, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) { 59 var tmp = v1; [all...] |
/external/libcxx/test/std/utilities/template.bitset/bitset.members/ |
H A D | index.pass.cpp | 31 std::bitset<N> v1 = make_bitset<N>(); local 34 assert(v1[N/2] == v1.test(N/2)); 35 typename std::bitset<N>::reference r = v1[N/2]; 36 assert(r == v1.test(N/2)); 37 typename std::bitset<N>::reference r2 = v1[N/2]; 39 assert(r == v1.test(N/2)); 42 assert(v1.test(N/2) == false); 45 assert(v1.test(N/2) == true); 48 assert(v1 [all...] |
/external/llvm/test/MC/AArch64/ |
H A D | neon-diagnostics.s | 9 add v0.16b, v1.8b, v2.8b 10 sub v0.2d, v1.2d, v2.2s 13 // CHECK-ERROR: add v0.16b, v1.8b, v2.8b 16 // CHECK-ERROR: sub v0.2d, v1.2d, v2.2s 24 fadd v0.2d, v1.2s, v2.2s 25 fsub v0.4s, v1.2s, v2.4s 26 fsub v0.8b, v1.8b, v2.8b 29 // CHECK-ERROR: fadd v0.2d, v1.2s, v2.2s 32 // CHECK-ERROR: fsub v0.4s, v1.2s, v2.4s 35 // CHECK-ERROR: fsub v0.8b, v1 [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_sparse_vector.cpp | 23 SparseVectorType v1(rows), v2(rows), v3(rows); 30 initSparse<Scalar>(densityVec, refV1, v1, &zerocoords, &nonzerocoords); 41 VERIFY_IS_MUCH_SMALLER_THAN( v1.coeff(zerocoords[i]), eps ); 42 //VERIFY_RAISES_ASSERT( v1.coeffRef(zerocoords[i]) = 5 ); 45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros()); 47 for (typename SparseVectorType::InnerIterator it(v1); it; ++it,++j) 50 VERIFY(it.value()==v1.coeff(it.index())); 54 VERIFY_IS_APPROX(v1, refV1); 56 v1.coeffRef(nonzerocoords[0]) = Scalar(5); 58 VERIFY_IS_APPROX(v1, refV [all...] |