HomeSort by relevance Sort by last modified time
    Searched defs:v3 (Results 26 - 50 of 288) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.comparison/
greater_valarray_value.pass.cpp 29 std::valarray<bool> v3 = v1 > 2; local
30 assert(v1.size() == v3.size());
32 assert(v3[i] == a3[i]);
greater_value_valarray.pass.cpp 29 std::valarray<bool> v3 = 2 > v2; local
30 assert(v2.size() == v3.size());
31 for (int i = 0; i < v3.size(); ++i)
32 assert(v3[i] == a3[i]);
less_equal_valarray_valarray.pass.cpp 31 std::valarray<bool> v3 = v1 <= v2; local
33 assert(v1.size() == v3.size());
35 assert(v3[i] == a3[i]);
less_equal_valarray_value.pass.cpp 29 std::valarray<bool> v3 = v1 <= 2; local
30 assert(v1.size() == v3.size());
32 assert(v3[i] == a3[i]);
less_equal_value_valarray.pass.cpp 29 std::valarray<bool> v3 = 2 <= v2; local
30 assert(v2.size() == v3.size());
31 for (int i = 0; i < v3.size(); ++i)
32 assert(v3[i] == a3[i]);
not_equal_valarray_valarray.pass.cpp 31 std::valarray<bool> v3 = v1 != v2; local
33 assert(v1.size() == v3.size());
35 assert(v3[i] == a3[i]);
not_equal_valarray_value.pass.cpp 29 std::valarray<bool> v3 = v1 != 2; local
30 assert(v1.size() == v3.size());
32 assert(v3[i] == a3[i]);
not_equal_value_valarray.pass.cpp 29 std::valarray<bool> v3 = 2 != v2; local
30 assert(v2.size() == v3.size());
31 for (int i = 0; i < v3.size(); ++i)
32 assert(v3[i] == a3[i]);
or_valarray_valarray.pass.cpp 31 std::valarray<bool> v3 = v1 || v2; local
33 assert(v1.size() == v3.size());
35 assert(v3[i] == a3[i]);
or_valarray_value.pass.cpp 29 std::valarray<bool> v3 = v1 || 5; local
30 assert(v1.size() == v3.size());
32 assert(v3[i] == a3[i]);
40 std::valarray<bool> v3 = v1 || 0; local
41 assert(v1.size() == v3.size());
43 assert(v3[i] == a3[i]);
or_value_valarray.pass.cpp 29 std::valarray<bool> v3 = 5 || v2; local
30 assert(v2.size() == v3.size());
31 for (int i = 0; i < v3.size(); ++i)
32 assert(v3[i] == a3[i]);
40 std::valarray<bool> v3 = 0 || v2; local
41 assert(v2.size() == v3.size());
42 for (int i = 0; i < v3.size(); ++i)
43 assert(v3[i] == a3[i]);
  /external/libcxx/test/std/numerics/numarray/valarray.nonmembers/valarray.transcend/
abs_valarray.pass.cpp 29 std::valarray<T> v3 = abs(v1); local
30 assert(v3.size() == v1.size());
31 for (int i = 0; i < v3.size(); ++i)
32 assert(v3[i] == a3[i]);
  /external/libcxx/test/std/utilities/template.bitset/bitset.members/
op_and_eq.pass.cpp 33 std::bitset<N> v3 = v1; local
36 assert(v1[i] == (v3[i] && v2[i]));
op_or_eq.pass.cpp 33 std::bitset<N> v3 = v1; local
36 assert(v1[i] == (v3[i] || v2[i]));
op_xor_eq.pass.cpp 33 std::bitset<N> v3 = v1; local
36 assert(v1[i] == (v3[i] != v2[i]));
  /external/libcxx/test/std/utilities/template.bitset/bitset.operators/
op_and.pass.cpp 33 std::bitset<N> v3 = v1; local
34 assert((v1 & v2) == (v3 &= v2));;
op_not.pass.cpp 33 std::bitset<N> v3 = v1; local
34 assert((v1 ^ v2) == (v3 ^= v2));;
op_or.pass.cpp 33 std::bitset<N> v3 = v1; local
34 assert((v1 | v2) == (v3 |= v2));;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.binary/
and_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 & v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);
divide_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 / v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);
minus_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 - v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);
modulo_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 % v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);
or_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 | v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);
plus_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 + v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);
shift_left_valarray_valarray.pass.cpp 29 std::valarray<T> v3 = v1 << v2; local
31 assert(v1.size() == v3.size());
33 assert(v3[i] == a3[i]);

Completed in 135 milliseconds

12 3 4 5 6 7 8 91011>>