Home
last modified time | relevance | path

Searched refs:v1 (Results 1 – 25 of 227) sorted by relevance

12345678910

/external/stlport/test/unit/
Dperm_test.cpp44 int v1[3] = { 0, 1, 2 }; in prevprm0() local
45 prev_permutation(v1, v1 + 3); in prevprm0()
47 CPPUNIT_ASSERT(v1[0]==2); in prevprm0()
48 CPPUNIT_ASSERT(v1[1]==1); in prevprm0()
49 CPPUNIT_ASSERT(v1[2]==0); in prevprm0()
53 vector <int> v1(3); in prevprm1() local
54 __iota(v1.begin(), v1.end(), 0); in prevprm1()
56 prev_permutation(v1.begin(), v1.end()); in prevprm1()
57 CPPUNIT_ASSERT(v1[0]==2); in prevprm1()
58 CPPUNIT_ASSERT(v1[1]==1); in prevprm1()
[all …]
Drotate_test.cpp50 vector <int> v1(10); in rotate1() local
51 __iota(v1.begin(), v1.end(), 0); in rotate1()
53 rotate(v1.begin(), v1.begin()+1, v1.end()); in rotate1()
54 CPPUNIT_ASSERT(v1[0]==1); in rotate1()
55 CPPUNIT_ASSERT(v1[1]==2); in rotate1()
56 CPPUNIT_ASSERT(v1[2]==3); in rotate1()
57 CPPUNIT_ASSERT(v1[3]==4); in rotate1()
58 CPPUNIT_ASSERT(v1[4]==5); in rotate1()
59 CPPUNIT_ASSERT(v1[5]==6); in rotate1()
60 CPPUNIT_ASSERT(v1[6]==7); in rotate1()
[all …]
Dpartial_test.cpp82 vector <int> v1(numbers, numbers+10); in parsrt1() local
83 partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end()); in parsrt1()
85 CPPUNIT_ASSERT(v1[0]==2); in parsrt1()
86 CPPUNIT_ASSERT(v1[1]==3); in parsrt1()
87 CPPUNIT_ASSERT(v1[2]==3); in parsrt1()
88 CPPUNIT_ASSERT(v1[3]==4); in parsrt1()
89 CPPUNIT_ASSERT(v1[4]==5); in parsrt1()
90 CPPUNIT_ASSERT(v1[5]==8); in parsrt1()
91 CPPUNIT_ASSERT(v1[6]==8); in parsrt1()
92 CPPUNIT_ASSERT(v1[7]==7); in parsrt1()
[all …]
Drm_cp_test.cpp84 vector <int> v1(10); in replif1() local
85 for (int i = 0; (size_t)i < v1.size(); ++i) in replif1()
86 v1[i] = i % 5; in replif1()
88 replace_if(v1.begin(), v1.end(), odd, 42); in replif1()
91 CPPUNIT_ASSERT(v1[0]==0); in replif1()
92 CPPUNIT_ASSERT(v1[1]==42); in replif1()
93 CPPUNIT_ASSERT(v1[2]==2); in replif1()
94 CPPUNIT_ASSERT(v1[3]==42); in replif1()
95 CPPUNIT_ASSERT(v1[4]==4); in replif1()
96 CPPUNIT_ASSERT(v1[5]==0); in replif1()
[all …]
Dnthelm_test.cpp51 vector <int> v1(numbers, numbers+10); in nthelem1() local
52 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end()); in nthelem1()
54 CPPUNIT_ASSERT(v1[0]==1); in nthelem1()
55 CPPUNIT_ASSERT(v1[1]==1); in nthelem1()
56 CPPUNIT_ASSERT(v1[2]==4); in nthelem1()
57 CPPUNIT_ASSERT(v1[3]==2); in nthelem1()
58 CPPUNIT_ASSERT(v1[4]==5); in nthelem1()
59 CPPUNIT_ASSERT(v1[5]==5); in nthelem1()
60 CPPUNIT_ASSERT(v1[6]==6); in nthelem1()
61 CPPUNIT_ASSERT(v1[7]==7); in nthelem1()
[all …]
Dgenerator_test.cpp51 vector <int> v1(10); in gener2() local
53 generate(v1.begin(), v1.end(), generator); in gener2()
55 CPPUNIT_ASSERT(v1[0]==1); in gener2()
56 CPPUNIT_ASSERT(v1[1]==1); in gener2()
57 CPPUNIT_ASSERT(v1[2]==2); in gener2()
58 CPPUNIT_ASSERT(v1[3]==3); in gener2()
59 CPPUNIT_ASSERT(v1[4]==5); in gener2()
60 CPPUNIT_ASSERT(v1[5]==8); in gener2()
61 CPPUNIT_ASSERT(v1[6]==13); in gener2()
62 CPPUNIT_ASSERT(v1[7]==21); in gener2()
[all …]
Dpartition_test.cpp76 vector <int> v1(numbers, numbers+10); in stblptn1() local
79 stable_partition(v1.begin(), v1.end(), less_n(11, nb_pred_calls)); in stblptn1()
81 CPPUNIT_ASSERT(v1[0]==5); in stblptn1()
82 CPPUNIT_ASSERT(v1[1]==5); in stblptn1()
83 CPPUNIT_ASSERT(v1[2]==2); in stblptn1()
84 CPPUNIT_ASSERT(v1[3]==10); in stblptn1()
85 CPPUNIT_ASSERT(v1[4]==0); in stblptn1()
86 CPPUNIT_ASSERT(v1[5]==5); in stblptn1()
87 CPPUNIT_ASSERT(v1[6]==0); in stblptn1()
88 CPPUNIT_ASSERT(v1[7]==0); in stblptn1()
[all …]
Drndshf_test.cpp55 vector <int> v1(10); in rndshuf2() local
56 __iota(v1.begin(), v1.end(), 0); in rndshuf2()
61 random_shuffle(v1.begin(), v1.end(), r); in rndshuf2()
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1); in rndshuf2()
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1); in rndshuf2()
64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1); in rndshuf2()
65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1); in rndshuf2()
66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1); in rndshuf2()
67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1); in rndshuf2()
68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1); in rndshuf2()
[all …]
Dswap_test.cpp90 queue<Obj> v1; in swap_container_non_spec() local
93 v1.push( Obj() ); in swap_container_non_spec()
94 v1.back().v = -1; in swap_container_non_spec()
95 v1.push( Obj() ); in swap_container_non_spec()
96 v1.back().v = -2; in swap_container_non_spec()
105 CPPUNIT_CHECK( v1.size() == 2 ); in swap_container_non_spec()
108 swap( v1, v2 ); // this shouldn't try make it as v1.swap( v2 ), no queue::swap method! in swap_container_non_spec()
110 CPPUNIT_CHECK( v1.size() == 3 ); in swap_container_non_spec()
114 CPPUNIT_CHECK( v1.front().v == 1 || v1.front().v == 2 ); in swap_container_non_spec()
115 CPPUNIT_CHECK( v1.back().v == 1 || v1.back().v == 2 ); in swap_container_non_spec()
[all …]
Dinplace_test.cpp45 vector<size_t> v1(10); in inplmrg2() local
46 for(size_t i = 0; i < v1.size(); ++i) in inplmrg2()
47 v1[i] =(v1.size() - i - 1) % 5; in inplmrg2()
49 inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater<size_t>()); in inplmrg2()
51 CPPUNIT_ASSERT(v1[0]==4); in inplmrg2()
52 CPPUNIT_ASSERT(v1[1]==4); in inplmrg2()
53 CPPUNIT_ASSERT(v1[2]==3); in inplmrg2()
54 CPPUNIT_ASSERT(v1[3]==3); in inplmrg2()
55 CPPUNIT_ASSERT(v1[4]==2); in inplmrg2()
56 CPPUNIT_ASSERT(v1[5]==2); in inplmrg2()
[all …]
Dcopy_test.cpp86 vector<int> v1(10); in copy_vector() local
87 for (int i = 0; (size_t)i < v1.size(); ++i) in copy_vector()
88 v1[i] = i; in copy_vector()
90 vector<int> v2(v1.size()); in copy_vector()
91 copy(v1.begin(), v1.end(), v2.begin()); in copy_vector()
93 CPPUNIT_ASSERT( v2 == v1 ); in copy_vector()
97 vector<int> v1(10); in copy_insert() local
98 for (int loc = 0; (size_t)loc < v1.size(); ++loc) in copy_insert()
99 v1[loc] = loc; in copy_insert()
102 copy(v1.begin(), v1.end(), i); in copy_insert()
[all …]
Dforeach_test.cpp58 vector<int> v1(10); in foreach1() local
59 for (int i = 0; (size_t)i < v1.size(); ++i) in foreach1()
60 v1[i] = i; in foreach1()
61 for_each(v1.begin(), v1.end(), ptr_fun(sqr) ); in foreach1()
63 CPPUNIT_ASSERT(v1[0]==0); in foreach1()
64 CPPUNIT_ASSERT(v1[1]==1); in foreach1()
65 CPPUNIT_ASSERT(v1[2]==4); in foreach1()
66 CPPUNIT_ASSERT(v1[3]==9); in foreach1()
67 CPPUNIT_ASSERT(v1[4]==16); in foreach1()
68 CPPUNIT_ASSERT(v1[5]==25); in foreach1()
[all …]
Dincludes_test.cpp48 vector<int> v1(10); in incl1() local
51 for (i = 0; (size_t)i < v1.size(); ++i) { in incl1()
52 v1[i] = i; in incl1()
55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); in incl1()
61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); in incl1()
69 vector <char const*> v1(nameSize); in incl2() local
70 for (int i = 0; (size_t)i < v1.size(); ++i) { in incl2()
71 v1[i] = names[i]; in incl2()
77 sort(v1.begin(), v1.end(), compare_strings); in incl2()
80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); in incl2()
[all …]
Dsetdiff_test.cpp45 int v1[3] = { 13, 18, 23 }; in setsymd0() local
49 set_symmetric_difference((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); in setsymd0()
58 vector<int> v1(10); in setsymd1() local
59 __iota(v1.begin(), v1.end(), 0); in setsymd1()
64 set_symmetric_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff)); in setsymd1()
89 int v1[3] = { 13, 18, 23 }; in setdiff0() local
95 set_difference((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); in setdiff0()
101 set_difference((int*)v2, (int*)v2 + 4, (int*)v1, (int*)v1 + 2, (int*)result); in setdiff0()
110 vector<int> v1(10); in setdiff1() local
111 __iota(v1.begin(), v1.end(), 0); in setdiff1()
[all …]
Dvector_test.cpp71 vector<int> v1; // Empty vector of integers. in vec_test_1() local
73 CPPUNIT_ASSERT( v1.empty() == true ); in vec_test_1()
74 CPPUNIT_ASSERT( v1.size() == 0 ); in vec_test_1()
78 v1.push_back(42); // Add an integer to the vector. in vec_test_1()
80 CPPUNIT_ASSERT( v1.size() == 1 ); in vec_test_1()
82 CPPUNIT_ASSERT( v1[0] == 42 ); in vec_test_1()
98 vector<double> v1; // Empty vector of doubles. in vec_test_2() local
99 v1.push_back(32.1); in vec_test_2()
100 v1.push_back(40.5); in vec_test_2()
104 CPPUNIT_ASSERT( v1.size() == 2 ); in vec_test_2()
[all …]
Dinnerprod_test.cpp52 vector<size_t> v1(3); in inprod1() local
53 vector<size_t> v2(v1.size()); in inprod1()
54 for (size_t i = 0; i < v1.size(); ++i) { in inprod1()
55 v1[i] = i + 1; in inprod1()
56 v2[i] = v1.size() - i; in inprod1()
58 size_t result = inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)0); in inprod1()
63 vector<size_t> v1(3); in inprod2() local
64 vector<size_t> v2(v1.size()); in inprod2()
65 for(size_t i = 0; i < v1.size(); ++i) { in inprod2()
66 v1[i] = i + 1; in inprod2()
[all …]
/external/chromium/sdch/open-vcdiff/src/gtest/
Dgtest_pred_impl.h90 const T1& v1) { in AssertPred1Helper() argument
91 if (pred(v1)) return AssertionSuccess(); in AssertPred1Helper()
96 << "\n" << e1 << " evaluates to " << v1; in AssertPred1Helper()
102 #define GTEST_PRED_FORMAT1(pred_format, v1, on_failure)\ argument
103 GTEST_ASSERT(pred_format(#v1, v1),\
108 #define GTEST_PRED1(pred, v1, on_failure)\ argument
110 #v1, \
112 v1), on_failure)
115 #define EXPECT_PRED_FORMAT1(pred_format, v1) \ argument
116 GTEST_PRED_FORMAT1(pred_format, v1, GTEST_NONFATAL_FAILURE)
[all …]
/external/gtest/include/gtest/
Dgtest_pred_impl.h90 const T1& v1) { in AssertPred1Helper() argument
91 if (pred(v1)) return AssertionSuccess(); in AssertPred1Helper()
96 << "\n" << e1 << " evaluates to " << v1; in AssertPred1Helper()
102 #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ argument
103 GTEST_ASSERT_(pred_format(#v1, v1),\
108 #define GTEST_PRED1_(pred, v1, on_failure)\ argument
110 #v1, \
112 v1), on_failure)
115 #define EXPECT_PRED_FORMAT1(pred_format, v1) \ argument
116 GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_)
[all …]
/external/protobuf/gtest/include/gtest/
Dgtest_pred_impl.h90 const T1& v1) { in AssertPred1Helper() argument
91 if (pred(v1)) return AssertionSuccess(); in AssertPred1Helper()
96 << "\n" << e1 << " evaluates to " << v1; in AssertPred1Helper()
102 #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ argument
103 GTEST_ASSERT_(pred_format(#v1, v1),\
108 #define GTEST_PRED1_(pred, v1, on_failure)\ argument
110 #v1, \
112 v1), on_failure)
115 #define EXPECT_PRED_FORMAT1(pred_format, v1) \ argument
116 GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_)
[all …]
/external/webkit/JavaScriptCore/runtime/
DOperations.h169 inline bool JSValue::equal(ExecState* exec, JSValue v1, JSValue v2) in equal() argument
171 if (v1.isInt32() && v2.isInt32()) in equal()
172 return v1 == v2; in equal()
174 return equalSlowCase(exec, v1, v2); in equal()
177 ALWAYS_INLINE bool JSValue::equalSlowCaseInline(ExecState* exec, JSValue v1, JSValue v2) in equalSlowCaseInline() argument
180 if (v1.isNumber() && v2.isNumber()) in equalSlowCaseInline()
181 return v1.uncheckedGetNumber() == v2.uncheckedGetNumber(); in equalSlowCaseInline()
183 bool s1 = v1.isString(); in equalSlowCaseInline()
186 return asString(v1)->value(exec) == asString(v2)->value(exec); in equalSlowCaseInline()
188 if (v1.isUndefinedOrNull()) { in equalSlowCaseInline()
[all …]
/external/webkit/JavaScriptCore/wtf/
DVector3.h98 inline Vector3 operator+(const Vector3& v1, const Vector3& v2)
100 return Vector3(v1.x() + v2.x(), v1.y() + v2.y(), v1.z() + v2.z());
103 inline Vector3 operator-(const Vector3& v1, const Vector3& v2)
105 return Vector3(v1.x() - v2.x(), v1.y() - v2.y(), v1.z() - v2.z());
118 inline double dot(const Vector3& v1, const Vector3& v2) in dot() argument
120 return v1.x() * v2.x() + v1.y() * v2.y() + v1.z() * v2.z(); in dot()
123 inline Vector3 cross(const Vector3& v1, const Vector3& v2) in cross() argument
125 double x3 = v1.y() * v2.z() - v1.z() * v2.y(); in cross()
126 double y3 = v1.z() * v2.x() - v1.x() * v2.z(); in cross()
127 double z3 = v1.x() * v2.y() - v1.y() * v2.x(); in cross()
[all …]
/external/openssl/crypto/des/
Dcfb64ede.c72 register DES_LONG v0,v1; in DES_ede3_cfb64_encrypt() local
86 c2l(iv,v1); in DES_ede3_cfb64_encrypt()
89 ti[1]=v1; in DES_ede3_cfb64_encrypt()
92 v1=ti[1]; in DES_ede3_cfb64_encrypt()
96 l2c(v1,iv); in DES_ede3_cfb64_encrypt()
112 c2l(iv,v1); in DES_ede3_cfb64_encrypt()
115 ti[1]=v1; in DES_ede3_cfb64_encrypt()
118 v1=ti[1]; in DES_ede3_cfb64_encrypt()
122 l2c(v1,iv); in DES_ede3_cfb64_encrypt()
132 v0=v1=ti[0]=ti[1]=c=cc=0; in DES_ede3_cfb64_encrypt()
[all …]
Dcfb_enc.c75 register DES_LONG d0,d1,v0,v1; in DES_cfb_encrypt() local
95 c2l(iv,v1); in DES_cfb_encrypt()
102 ti[1]=v1; in DES_cfb_encrypt()
113 { v0=v1; v1=d0; } in DES_cfb_encrypt()
115 { v0=d0; v1=d1; } in DES_cfb_encrypt()
121 l2c(v1,iv); in DES_cfb_encrypt()
125 sh[0]=v0, sh[1]=v1, sh[2]=d0, sh[3]=d1; in DES_cfb_encrypt()
134 v0=sh[0], v1=sh[1]; in DES_cfb_encrypt()
138 c2l(iv,v1); in DES_cfb_encrypt()
149 ti[1]=v1; in DES_cfb_encrypt()
[all …]
/external/v8/benchmarks/
Drichards.js368 function IdleTask(scheduler, v1, count) { argument
370 this.v1 = v1;
377 if ((this.v1 & 1) == 0) {
378 this.v1 = this.v1 >> 1;
381 this.v1 = (this.v1 >> 1) ^ 0xD008;
398 this.v1 = null;
403 if (this.v1 == null) return this.scheduler.suspendCurrent();
404 var v = this.v1;
405 this.v1 = null;
408 this.v1 = packet;
[all …]
/external/webkit/SunSpider/tests/v8-v4/
Dv8-richards.js363 function IdleTask(scheduler, v1, count) { argument
365 this.v1 = v1;
372 if ((this.v1 & 1) == 0) {
373 this.v1 = this.v1 >> 1;
376 this.v1 = (this.v1 >> 1) ^ 0xD008;
393 this.v1 = null;
398 if (this.v1 == null) return this.scheduler.suspendCurrent();
399 var v = this.v1;
400 this.v1 = null;
403 this.v1 = packet;
[all …]

12345678910