| /external/stlport/test/unit/ |
| perm_test.cpp | 44 int v1[3] = { 0, 1, 2 }; local
45 prev_permutation(v1, v1 + 3);
47 CPPUNIT_ASSERT(v1[0]==2);
48 CPPUNIT_ASSERT(v1[1]==1);
49 CPPUNIT_ASSERT(v1[2]==0);
53 vector <int> v1(3);
54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end())
137 int v1[3] = { 0, 1, 2 }; local
[all...] |
| fib.h | 6 Fibonacci() : v1(0), v2(1) {}
9 int v1; member in class:Fibonacci
16 int r = v1 + v2;
17 v1 = v2;
19 return v1;
|
| nthelm_test.cpp | 51 vector <int> v1(numbers, numbers+10);
52 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
54 CPPUNIT_ASSERT(v1[0]==1);
55 CPPUNIT_ASSERT(v1[1]==1);
56 CPPUNIT_ASSERT(v1[2]==4);
57 CPPUNIT_ASSERT(v1[3]==2);
58 CPPUNIT_ASSERT(v1[4]==5)
[all...] |
| rotate_test.cpp | 50 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[3]==4)
[all...] |
| generator_test.cpp | 51 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[6]==13)
[all...] |
| rndshf_test.cpp | 55 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.begin(), v1.end(), 2)==1)
[all...] |
| inplace_test.cpp | 45 vector<size_t> v1(10);
46 for(size_t i = 0; i < v1.size(); ++i)
47 v1[i] =(v1.size() - i - 1) % 5;
49 inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater<size_t>());
51 CPPUNIT_ASSERT(v1[0]==4);
52 CPPUNIT_ASSERT(v1[1]==4);
53 CPPUNIT_ASSERT(v1[2]==3)
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| perm_test.cpp | 44 int v1[3] = { 0, 1, 2 }; local
45 prev_permutation(v1, v1 + 3);
47 CPPUNIT_ASSERT(v1[0]==2);
48 CPPUNIT_ASSERT(v1[1]==1);
49 CPPUNIT_ASSERT(v1[2]==0);
53 vector <int> v1(3);
54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end())
137 int v1[3] = { 0, 1, 2 }; local
[all...] |
| fib.h | 6 Fibonacci() : v1(0), v2(1) {}
9 int v1; member in class:Fibonacci
16 int r = v1 + v2;
17 v1 = v2;
19 return v1;
|
| nthelm_test.cpp | 51 vector <int> v1(numbers, numbers+10);
52 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
54 CPPUNIT_ASSERT(v1[0]==1);
55 CPPUNIT_ASSERT(v1[1]==1);
56 CPPUNIT_ASSERT(v1[2]==4);
57 CPPUNIT_ASSERT(v1[3]==2);
58 CPPUNIT_ASSERT(v1[4]==5)
[all...] |
| rotate_test.cpp | 50 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[3]==4)
[all...] |
| generator_test.cpp | 51 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[6]==13)
[all...] |
| rndshf_test.cpp | 55 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.begin(), v1.end(), 2)==1)
[all...] |
| inplace_test.cpp | 45 vector<size_t> v1(10);
46 for(size_t i = 0; i < v1.size(); ++i)
47 v1[i] =(v1.size() - i - 1) % 5;
49 inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater<size_t>());
51 CPPUNIT_ASSERT(v1[0]==4);
52 CPPUNIT_ASSERT(v1[1]==4);
53 CPPUNIT_ASSERT(v1[2]==3)
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| perm_test.cpp | 44 int v1[3] = { 0, 1, 2 }; local
45 prev_permutation(v1, v1 + 3);
47 CPPUNIT_ASSERT(v1[0]==2);
48 CPPUNIT_ASSERT(v1[1]==1);
49 CPPUNIT_ASSERT(v1[2]==0);
53 vector <int> v1(3);
54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end())
137 int v1[3] = { 0, 1, 2 }; local
[all...] |
| fib.h | 6 Fibonacci() : v1(0), v2(1) {}
9 int v1; member in class:Fibonacci
16 int r = v1 + v2;
17 v1 = v2;
19 return v1;
|
| nthelm_test.cpp | 51 vector <int> v1(numbers, numbers+10);
52 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
54 CPPUNIT_ASSERT(v1[0]==1);
55 CPPUNIT_ASSERT(v1[1]==1);
56 CPPUNIT_ASSERT(v1[2]==4);
57 CPPUNIT_ASSERT(v1[3]==2);
58 CPPUNIT_ASSERT(v1[4]==5)
[all...] |
| rotate_test.cpp | 50 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[3]==4)
[all...] |
| generator_test.cpp | 51 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[6]==13)
[all...] |
| rndshf_test.cpp | 55 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.begin(), v1.end(), 2)==1)
[all...] |
| inplace_test.cpp | 45 vector<size_t> v1(10);
46 for(size_t i = 0; i < v1.size(); ++i)
47 v1[i] =(v1.size() - i - 1) % 5;
49 inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater<size_t>());
51 CPPUNIT_ASSERT(v1[0]==4);
52 CPPUNIT_ASSERT(v1[1]==4);
53 CPPUNIT_ASSERT(v1[2]==3)
[all...] |
| /external/chromium/sdch/open-vcdiff/src/gtest/ |
| gtest_pred_impl.h | 46 // ASSERT_PRED_FORMAT1(pred_format, v1)
47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2)
58 // ASSERT_PRED1(pred, v1)
59 // ASSERT_PRED2(pred, v1, v2)
63 // and the values v1, v2, ..., must support the << operator for
90 const T1& v1) {
91 if (pred(v1)) return AssertionSuccess();
96 << "\n" << e1 << " evaluates to " << v1; local
102 #define GTEST_PRED_FORMAT1(pred_format, v1, on_failure)\
103 GTEST_ASSERT(pred_format(#v1, v1),
[all...] |
| /external/chromium/testing/gtest/include/gtest/ |
| gtest_pred_impl.h | 46 // ASSERT_PRED_FORMAT1(pred_format, v1)
47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2)
58 // ASSERT_PRED1(pred, v1)
59 // ASSERT_PRED2(pred, v1, v2)
63 // and the values v1, v2, ..., must support the << operator for
90 const T1& v1) {
91 if (pred(v1)) return AssertionSuccess();
95 << "\n" << e1 << " evaluates to " << v1;
100 #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\
101 GTEST_ASSERT_(pred_format(#v1, v1),
[all...] |
| /external/gtest/include/gtest/ |
| gtest_pred_impl.h | 46 // ASSERT_PRED_FORMAT1(pred_format, v1)
47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2)
58 // ASSERT_PRED1(pred, v1)
59 // ASSERT_PRED2(pred, v1, v2)
63 // and the values v1, v2, ..., must support the << operator for
90 const T1& v1) {
91 if (pred(v1)) return AssertionSuccess();
96 << "\n" << e1 << " evaluates to " << v1; local
102 #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\
103 GTEST_ASSERT_(pred_format(#v1, v1),
[all...] |
| /external/llvm/utils/unittest/googletest/include/gtest/ |
| gtest_pred_impl.h | 46 // ASSERT_PRED_FORMAT1(pred_format, v1)
47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2)
58 // ASSERT_PRED1(pred, v1)
59 // ASSERT_PRED2(pred, v1, v2)
63 // and the values v1, v2, ..., must support the << operator for
90 const T1& v1) {
91 if (pred(v1)) return AssertionSuccess();
95 << "\n" << e1 << " evaluates to " << v1;
100 #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\
101 GTEST_ASSERT_(pred_format(#v1, v1),
[all...] |
