Searched refs:v1 (Results 151 - 175 of 990) sorted by relevance

1234567891011>>

/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/
H A Dminus_valarray.pass.cpp27 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 Dmodulo_valarray.pass.cpp27 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 Dshift_right_valarray.pass.cpp27 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 Dand_valarray_valarray.pass.cpp27 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 Ddivide_valarray_valarray.pass.cpp27 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 Dminus_valarray_valarray.pass.cpp27 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 Dmodulo_valarray_valarray.pass.cpp27 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 Dor_valarray_valarray.pass.cpp27 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 Dplus_valarray_valarray.pass.cpp27 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 Dshift_left_valarray_valarray.pass.cpp27 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 Dshift_right_valarray_valarray.pass.cpp27 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 Dtimes_valarray_valarray.pass.cpp27 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 Dxor_valarray_valarray.pass.cpp27 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 Dand_valarray_valarray.pass.cpp29 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 Dequal_valarray_valarray.pass.cpp29 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 Dgreater_equal_valarray_valarray.pass.cpp29 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 Dgreater_valarray_valarray.pass.cpp29 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 Dless_equal_valarray_valarray.pass.cpp29 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 Dless_valarray_valarray.pass.cpp29 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 Dnot_equal_valarray_valarray.pass.cpp29 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 Dor_valarray_valarray.pass.cpp29 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 Dregress-gap.js30 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 Dindex.pass.cpp31 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 Dneon-diagnostics.s9 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 Deigen2_sparse_vector.cpp23 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...]

Completed in 406 milliseconds

1234567891011>>