OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:v2
(Results
151 - 175
of
1310
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numarray/valarray.nonmembers/valarray.binary/
modulo_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 % 3;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
modulo_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 3 % v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
or_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 | 3;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
or_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 3 | v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
plus_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 + 3;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
plus_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 3 + v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
shift_left_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 << 3;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
shift_left_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 3 << v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
shift_right_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 >> 3;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
shift_right_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 40 >> v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
times_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 * 6;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
times_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 6 * v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
xor_valarray_value.pass.cpp
28
std::valarray<T>
v2
= v1 ^ 3;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
xor_value_valarray.pass.cpp
28
std::valarray<T>
v2
= 3 ^ v1;
local
29
assert(v1.size() ==
v2
.size());
30
for (std::size_t i = 0; i <
v2
.size(); ++i)
31
assert(
v2
[i] == a2[i]);
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/template.bitset/bitset.members/
flip_all.pass.cpp
38
std::bitset<N>
v2
= v1;
local
39
v2
.flip();
41
assert(
v2
[i] == ~v1[i]);
left_shift.pass.cpp
40
std::bitset<N>
v2
= v1;
local
41
assert((v1 <<= s) == (
v2
<< s));
left_shift_eq.pass.cpp
40
std::bitset<N>
v2
= v1;
local
46
assert(v1[i] ==
v2
[i-s]);
not_all.pass.cpp
38
std::bitset<N>
v2
= ~v1;
local
40
assert(
v2
[i] == ~v1[i]);
op_and_eq.pass.cpp
38
std::bitset<N>
v2
= make_bitset<N>();
local
40
v1 &=
v2
;
42
assert(v1[i] == (v3[i] &&
v2
[i]));
op_eq_eq.pass.cpp
42
std::bitset<N>
v2
= v1;
local
43
assert(v1 ==
v2
);
47
v2
[N/2].flip();
48
assert(v1 !=
v2
);
op_or_eq.pass.cpp
38
std::bitset<N>
v2
= make_bitset<N>();
local
40
v1 |=
v2
;
42
assert(v1[i] == (v3[i] ||
v2
[i]));
op_xor_eq.pass.cpp
38
std::bitset<N>
v2
= make_bitset<N>();
local
40
v1 ^=
v2
;
42
assert(v1[i] == (v3[i] !=
v2
[i]));
right_shift.pass.cpp
40
std::bitset<N>
v2
= v1;
local
41
assert((v1 >>= s) == (
v2
>> s));
right_shift_eq.pass.cpp
40
std::bitset<N>
v2
= v1;
local
44
assert(v1[i] ==
v2
[i + s]);
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/template.bitset/bitset.operators/
op_and.pass.cpp
38
std::bitset<N>
v2
= make_bitset<N>();
local
40
assert((v1 &
v2
) == (v3 &=
v2
));
Completed in 113 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>