Searched defs:v2 (Results 51 - 75 of 507) sorted by relevance

1234567891011>>

/external/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.binary/
H A D	divide_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 / v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	minus_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 - 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	minus_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 - v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	modulo_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 % 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	modulo_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 % v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	or_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 | 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	or_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 | v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	plus_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 + 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	plus_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 + v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	shift_left_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 << 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	shift_left_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 << v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	shift_right_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 >> 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	shift_right_value_valarray.pass.cpp	27 std::valarray<T> v2 = 40 >> v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	times_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 * 6; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	times_value_valarray.pass.cpp	27 std::valarray<T> v2 = 6 * v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	xor_valarray_value.pass.cpp	27 std::valarray<T> v2 = v1 ^ 3; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
H A D	xor_value_valarray.pass.cpp	27 std::valarray<T> v2 = 3 ^ v1; local 28 assert(v1.size() == v2.size()); 29 for (int i = 0; i < v2.size(); ++i) 30 assert(v2[i] == a2[i]);
/external/libcxx/test/utilities/template.bitset/bitset.members/
H A D	flip_all.pass.cpp	32 std::bitset<N> v2 = v1; local 33 v2.flip(); 35 assert(v2[i] == ~v1[i]);
H A D	left_shift.pass.cpp	34 std::bitset<N> v2 = v1; local 35 assert((v1 <<= s) == (v2 << s));
H A D	left_shift_eq.pass.cpp	34 std::bitset<N> v2 = v1; local 40 assert(v1[i] == v2[i-s]);
H A D	not_all.pass.cpp	32 std::bitset<N> v2 = ~v1; local 34 assert(v2[i] == ~v1[i]);
H A D	op_and_eq.pass.cpp	32 std::bitset<N> v2 = make_bitset<N>(); local 34 v1 &= v2; 36 assert(v1[i] == (v3[i] && v2[i]));
H A D	op_eq_eq.pass.cpp	35 std::bitset<N> v2 = v1; local 36 assert(v1 == v2); 39 v2[N/2].flip(); 40 assert(v1 != v2);
H A D	op_or_eq.pass.cpp	32 std::bitset<N> v2 = make_bitset<N>(); local 34 v1 |= v2; 36 assert(v1[i] == (v3[i] || v2[i]));
H A D	op_xor_eq.pass.cpp	32 std::bitset<N> v2 = make_bitset<N>(); local 34 v1 ^= v2; 36 assert(v1[i] == (v3[i] != v2[i]));

Completed in 165 milliseconds

1234567891011>>

Indexes created Fri Mar 13 02:32:08 CET 2015