Searched refs:v1 (Results 51 - 75 of 1357) sorted by relevance

1234567891011>>

/external/libcxx/test/numerics/numarray/template.mask.array/mask.array.comp.assign/
H A Dor.pass.cpp27 std::valarray<int> v1(a1, N1);
31 v1[vb] |= v2;
32 assert(v1.size() == 16);
33 assert(v1[ 0] == 1);
34 assert(v1[ 1] == 1);
35 assert(v1[ 2] == 2);
36 assert(v1[ 3] == 3);
37 assert(v1[ 4] == 7);
38 assert(v1[ 5] == 5);
39 assert(v1[
[all...]
H A Dshift_left.pass.cpp27 std::valarray<int> v1(a1, N1);
31 v1[vb] <<= v2;
32 assert(v1.size() == 16);
33 assert(v1[ 0] == 0);
34 assert(v1[ 1] == 1);
35 assert(v1[ 2] == 2);
36 assert(v1[ 3] == 12);
37 assert(v1[ 4] == 32);
38 assert(v1[ 5] == 5);
39 assert(v1[
[all...]
H A Dshift_right.pass.cpp27 std::valarray<int> v1(a1, N1);
31 v1[vb] >>= v2;
32 assert(v1.size() == 16);
33 assert(v1[ 0] == 0);
34 assert(v1[ 1] == 1);
35 assert(v1[ 2] == 2);
36 assert(v1[ 3] == 0);
37 assert(v1[ 4] == 0);
38 assert(v1[ 5] == 5);
39 assert(v1[
[all...]
H A Dsubtraction.pass.cpp27 std::valarray<int> v1(a1, N1);
31 v1[vb] -= v2;
32 assert(v1.size() == 16);
33 assert(v1[ 0] == -1);
34 assert(v1[ 1] == 1);
35 assert(v1[ 2] == 2);
36 assert(v1[ 3] == 1);
37 assert(v1[ 4] == 1);
38 assert(v1[ 5] == 5);
39 assert(v1[
[all...]
H A Dxor.pass.cpp27 std::valarray<int> v1(a1, N1);
31 v1[vb] ^= v2;
32 assert(v1.size() == 16);
33 assert(v1[ 0] == 1);
34 assert(v1[ 1] == 1);
35 assert(v1[ 2] == 2);
36 assert(v1[ 3] == 1);
37 assert(v1[ 4] == 7);
38 assert(v1[ 5] == 5);
39 assert(v1[
[all...]
/external/libcxx/test/numerics/numarray/template.mask.array/mask.array.fill/
H A Dassign_value.pass.cpp25 std::valarray<int> v1(a1, N1);
27 v1[vb] = -5;
28 assert(v1.size() == 16);
29 assert(v1[ 0] == -5);
30 assert(v1[ 1] == 1);
31 assert(v1[ 2] == 2);
32 assert(v1[ 3] == -5);
33 assert(v1[ 4] == -5);
34 assert(v1[ 5] == 5);
35 assert(v1[
[all...]
/external/libcxx/test/numerics/numarray/template.slice.array/slice.arr.assign/
H A Dslice_array.pass.cpp23 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
25 v1[std::slice(1, 5, 3)] = v2[std::slice(2, 5, 2)];
26 assert(v1.size() == 16);
27 assert(v1[ 0] == 0);
28 assert(v1[ 1] == -3);
29 assert(v1[ 2] == 2);
30 assert(v1[ 3] == 3);
31 assert(v1[ 4] == -5);
32 assert(v1[ 5] == 5);
33 assert(v1[
[all...]
/external/stlport/test/unit/
H A Drotate_test.cpp50 vector <int> v1(10);
51 __iota(v1.begin(), v1.end(), 0);
53 rotate(v1.begin(), v1.begin()+1, v1.end());
54 CPPUNIT_ASSERT(v1[0]==1);
55 CPPUNIT_ASSERT(v1[1]==2);
56 CPPUNIT_ASSERT(v1[2]==3);
57 CPPUNIT_ASSERT(v1[
[all...]
H A Dgenerator_test.cpp51 vector <int> v1(10);
53 generate(v1.begin(), v1.end(), generator);
55 CPPUNIT_ASSERT(v1[0]==1);
56 CPPUNIT_ASSERT(v1[1]==1);
57 CPPUNIT_ASSERT(v1[2]==2);
58 CPPUNIT_ASSERT(v1[3]==3);
59 CPPUNIT_ASSERT(v1[4]==5);
60 CPPUNIT_ASSERT(v1[5]==8);
61 CPPUNIT_ASSERT(v1[
[all...]
H A Dfib.h6 Fibonacci() : v1(0), v2(1) {}
9 int v1; member in class:Fibonacci
16 int r = v1 + v2;
17 v1 = v2;
19 return v1;
H A Drndshf_test.cpp55 vector <int> v1(10);
56 __iota(v1.begin(), v1.end(), 0);
61 random_shuffle(v1.begin(), v1.end(), r);
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1);
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1);
64 CPPUNIT_ASSERT(count(v1
[all...]
/external/valgrind/main/none/tests/s390x/
H A Dspechelper-icm-1.c27 unsigned v1; local
31 v1 = 0xFFFFFFFF;
34 if (branch(0, 0, v1)) ++wrong; else ++ok;
35 if (branch(1, 0, v1)) ++wrong; else ++ok;
36 if (branch(2, 0, v1)) ++wrong; else ++ok;
37 if (branch(3, 0, v1)) ++wrong; else ++ok;
38 if (branch(4, 0, v1)) ++wrong; else ++ok;
39 if (branch(5, 0, v1)) ++wrong; else ++ok;
40 if (branch(6, 0, v1)) ++wrong; else ++ok;
41 if (branch(7, 0, v1))
61 unsigned v1; local
96 unsigned v1; local
182 unsigned v1; local
302 unsigned v1; local
388 unsigned v1; local
422 int wrong, ok, v1; local
508 unsigned v1; local
629 unsigned v1; local
715 unsigned v1; local
[all...]
H A Dspechelper-icm-2.c27 unsigned v1; local
31 v1 = 0xFFFFFFFF;
34 if (branch(0, 0, v1)) ++wrong; else ++ok;
35 if (branch(1, 0, v1)) ++wrong; else ++ok;
36 if (branch(2, 0, v1)) ++wrong; else ++ok;
37 if (branch(3, 0, v1)) ++wrong; else ++ok;
38 if (branch(4, 0, v1)) ++wrong; else ++ok;
39 if (branch(5, 0, v1)) ++wrong; else ++ok;
40 if (branch(6, 0, v1)) ++wrong; else ++ok;
41 if (branch(7, 0, v1))
61 unsigned v1; local
96 unsigned v1; local
182 unsigned v1; local
302 unsigned v1; local
388 unsigned v1; local
422 int wrong, ok, v1; local
508 unsigned v1; local
629 unsigned v1; local
715 unsigned v1; local
[all...]
H A Dspechelper-clr.c22 int wrong, ok, v1, v2; local
26 v1 = v2 = 42;
29 if (branch(0, v1, v2)) ++wrong; else ++ok;
30 if (branch(1, v1, v2)) ++wrong; else ++ok;
31 if (branch(2, v1, v2)) ++wrong; else ++ok;
32 if (branch(3, v1, v2)) ++wrong; else ++ok;
33 if (branch(4, v1, v2)) ++wrong; else ++ok;
34 if (branch(5, v1, v2)) ++wrong; else ++ok;
35 if (branch(6, v1, v2)) ++wrong; else ++ok;
36 if (branch(7, v1, v
55 int wrong, ok, v1, v2; local
88 int wrong, ok, v1, v2; local
[all...]
H A Dspechelper-cr.c22 int wrong, ok, v1, v2; local
26 v1 = v2 = 42;
29 if (branch(0, v1, v2)) ++wrong; else ++ok;
30 if (branch(1, v1, v2)) ++wrong; else ++ok;
31 if (branch(2, v1, v2)) ++wrong; else ++ok;
32 if (branch(3, v1, v2)) ++wrong; else ++ok;
33 if (branch(4, v1, v2)) ++wrong; else ++ok;
34 if (branch(5, v1, v2)) ++wrong; else ++ok;
35 if (branch(6, v1, v2)) ++wrong; else ++ok;
36 if (branch(7, v1, v
55 int wrong, ok, v1, v2; local
88 int wrong, ok, v1, v2; local
[all...]
H A Dspechelper-ltr.c22 int wrong, ok, v1; local
26 v1 = 0;
28 if (branch(0, v1)) ++wrong; else ++ok;
29 if (branch(1, v1)) ++wrong; else ++ok;
30 if (branch(2, v1)) ++wrong; else ++ok;
31 if (branch(3, v1)) ++wrong; else ++ok;
32 if (branch(4, v1)) ++wrong; else ++ok;
33 if (branch(5, v1)) ++wrong; else ++ok;
34 if (branch(6, v1)) ++wrong; else ++ok;
35 if (branch(7, v1))
54 int wrong, ok, v1; local
85 int wrong, ok, v1; local
[all...]
H A Dspechelper-slgr.c28 unsigned long v1, v2; local
33 v1 = v2 = 42;
36 if (branch(0, v1, v2)) ++wrong; else ++ok;
37 if (branch(1, v1, v2)) ++wrong; else ++ok;
38 if (branch(2, v1, v2)) ++ok; else ++wrong;
39 if (branch(3, v1, v2)) ++ok; else ++wrong;
40 if (branch(4, v1, v2)) ++wrong; else ++ok;
41 if (branch(5, v1, v2)) ++wrong; else ++ok;
42 if (branch(6, v1, v2)) ++ok; else ++wrong;
43 if (branch(7, v1, v
62 unsigned long v1, v2; local
98 unsigned long v1, v2; local
[all...]
H A Dspechelper-slr.c26 unsigned int v1, v2; local
31 v1 = v2 = 0xffffffff;
34 if (branch(0, v1, v2)) ++wrong; else ++ok;
35 if (branch(1, v1, v2)) ++wrong; else ++ok;
36 if (branch(2, v1, v2)) ++ok; else ++wrong;
37 if (branch(3, v1, v2)) ++ok; else ++wrong;
38 if (branch(4, v1, v2)) ++wrong; else ++ok;
39 if (branch(5, v1, v2)) ++wrong; else ++ok;
40 if (branch(6, v1, v2)) ++ok; else ++wrong;
41 if (branch(7, v1, v
60 unsigned int v1, v2; local
96 unsigned int v1, v2; local
[all...]
H A Dspechelper-or.c22 int wrong, ok, v1, v2; local
26 v1 = v2 = 0;
28 if (branch(0, v1, v2)) ++wrong; else ++ok;
29 if (branch(1, v1, v2)) ++wrong; else ++ok;
30 if (branch(2, v1, v2)) ++wrong; else ++ok;
31 if (branch(3, v1, v2)) ++wrong; else ++ok;
32 if (branch(4, v1, v2)) ++wrong; else ++ok;
33 if (branch(5, v1, v2)) ++wrong; else ++ok;
34 if (branch(6, v1, v2)) ++wrong; else ++ok;
35 if (branch(7, v1, v
54 int wrong, ok, v1, v2; local
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-crbug-350864.js29 var v1 = {};
30 v0.set(v1, 1);
32 v1[sym] = 1;
33 var symbols = Object.getOwnPropertySymbols(v1);
/external/llvm/test/MC/AArch64/
H A Dneon-scalar-reduce-pairwise.s6 addp d0, v1.2d
8 // CHECK: addp d0, v1.2d // encoding: [0x20,0xb8,0xf1,0x5e]
13 faddp d20, v1.2d
15 // CHECK: faddp d20, v1.2d // encoding: [0x34,0xd8,0x70,0x7e]
H A Dneon-shift-left-long.s8 sshll v0.8h, v1.8b, #3
9 sshll v0.4s, v1.4h, #3
10 sshll v0.2d, v1.2s, #3
11 sshll2 v0.8h, v1.16b, #3
12 sshll2 v0.4s, v1.8h, #3
13 sshll2 v0.2d, v1.4s, #3
15 // CHECK: sshll v0.8h, v1.8b, #3 // encoding: [0x20,0xa4,0x0b,0x0f]
16 // CHECK: sshll v0.4s, v1.4h, #3 // encoding: [0x20,0xa4,0x13,0x0f]
17 // CHECK: sshll v0.2d, v1.2s, #3 // encoding: [0x20,0xa4,0x23,0x0f]
18 // CHECK: sshll2 v0.8h, v1
[all...]
/external/chromium_org/v8/test/webkit/
H A Dsort-non-numbers.js27 test.sort(function (v1, v2) {
28 return v1 - v2;
/external/libcxx/test/numerics/numarray/template.valarray/valarray.members/
H A Dresize.pass.cpp25 std::valarray<T> v1(a1, N1);
26 v1.resize(8);
27 assert(v1.size() == 8);
28 for (int i = 0; i < v1.size(); ++i)
29 assert(v1[i] == 0);
30 v1.resize(0);
31 assert(v1.size() == 0);
32 v1.resize(80);
33 assert(v1.size() == 80);
34 for (int i = 0; i < v1
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPathOpsDVectorTest.cpp25 SkDVector v1 = tests[index + 1] - tests[index]; local
26 SkASSERT(ValidVector(v1));
29 v1 += v2;
30 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0);
35 v1 = tests[index + 1] - tests[index];
36 v1 /= 2;
37 v1 *= 2;
38 v1 -= tests[index + 1] - tests[index];
39 REPORTER_ASSERT(reporter, v1
[all...]

Completed in 333 milliseconds

1234567891011>>