author | William Roberts <williamr@symbian.org> |
Thu, 22 Jul 2010 16:48:56 +0100 | |
branch | GCC_SURGE |
changeset 45 | 4b03adbd26ca |
parent 18 | 47c74d1534e1 |
parent 34 | 5fae379060a7 |
permissions | -rw-r--r-- |
31 | 1 |
/* |
2 |
* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
3 |
* All rights reserved. |
|
34
5fae379060a7
Revision: 201023
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
31
diff
changeset
|
4 |
*/ |
31 | 5 |
|
6 |
#include <vector> |
|
7 |
#include <e32std.h> |
|
8 |
#include "cppunit/cppunit_proxy.h" |
|
9 |
||
10 |
#if defined(_STLP_USE_NAMESPACES) |
|
11 |
using namespace std; |
|
12 |
#endif |
|
13 |
||
14 |
// |
|
15 |
// TestCase class |
|
16 |
// |
|
17 |
class BvectorTest : public CPPUNIT_NS::TestCase |
|
18 |
{ |
|
19 |
CPPUNIT_TEST_SUITE(BvectorTest); |
|
20 |
#if !defined (STLPORT) || defined (_STLP_NO_EXTENSIONS) |
|
21 |
CPPUNIT_IGNORE; |
|
22 |
#endif |
|
23 |
CPPUNIT_TEST(bvec1); |
|
24 |
CPPUNIT_TEST(bvec_cov); |
|
25 |
CPPUNIT_TEST(bvec_cov1); |
|
26 |
CPPUNIT_TEST_SUITE_END(); |
|
27 |
||
28 |
protected: |
|
29 |
void bvec1(); |
|
30 |
void bvec_cov(); |
|
31 |
void bvec_cov1(); |
|
32 |
}; |
|
33 |
||
34 |
CPPUNIT_TEST_SUITE_REGISTRATION(BvectorTest); |
|
35 |
||
36 |
// |
|
37 |
// tests implementation |
|
38 |
// |
|
39 |
void BvectorTest::bvec1() |
|
40 |
{ |
|
41 |
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS) |
|
42 |
bool ii[3]= {1,0,1}; |
|
43 |
bit_vector b(3); |
|
44 |
||
45 |
CPPUNIT_ASSERT(b[0]==0); |
|
46 |
CPPUNIT_ASSERT(b[1]==0); |
|
47 |
CPPUNIT_ASSERT(b[2]==0); |
|
48 |
||
49 |
b[0] = b[2] = 1; |
|
50 |
||
51 |
CPPUNIT_ASSERT(b[0]==1); |
|
52 |
CPPUNIT_ASSERT(b[1]==0); |
|
53 |
CPPUNIT_ASSERT(b[2]==1); |
|
54 |
||
55 |
b.insert(b.begin(),(bool*)ii, ii+2); |
|
56 |
||
57 |
CPPUNIT_ASSERT(b[0]==1); |
|
58 |
CPPUNIT_ASSERT(b[1]==0); |
|
59 |
CPPUNIT_ASSERT(b[2]==1); |
|
60 |
CPPUNIT_ASSERT(b[3]==0); |
|
61 |
CPPUNIT_ASSERT(b[4]==1); |
|
62 |
||
63 |
bit_vector bb = b; |
|
64 |
if (bb != b) |
|
65 |
exit(1); |
|
66 |
||
67 |
b[0] |= 0; |
|
68 |
b[1] |= 0; |
|
69 |
b[2] |= 1; |
|
70 |
b[3] |= 1; |
|
71 |
CPPUNIT_ASSERT(!((b[0] != 1) || (b[1] != 0) || (b[2] != 1) || (b[3] != 1))); |
|
72 |
||
73 |
||
74 |
bb[0] &= 0; |
|
75 |
bb[1] &= 0; |
|
76 |
bb[2] &= 1; |
|
77 |
bb[3] &= 1; |
|
78 |
CPPUNIT_ASSERT(!((bb[0] != 0) || (bb[1] != 0) || (bb[2] != 1) || (bb[3] != 0))); |
|
79 |
#endif |
|
80 |
} |
|
81 |
void BvectorTest::bvec_cov() |
|
82 |
{ |
|
83 |
// __UHEAP_MARK; |
|
84 |
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS) |
|
85 |
{ |
|
86 |
bit_vector b1(3),b2(2); |
|
87 |
b1[0] = b1[2] = 1; |
|
88 |
b2[1] = 1; |
|
89 |
||
90 |
b1.swap(b2); |
|
91 |
CPPUNIT_ASSERT(b1.size() == 2); |
|
92 |
CPPUNIT_ASSERT(b2.size() == 3); |
|
93 |
||
94 |
CPPUNIT_ASSERT(*b1.rbegin() == 1); |
|
95 |
CPPUNIT_ASSERT(*b1.rend() == 0); |
|
96 |
||
97 |
b2.pop_back(); |
|
98 |
CPPUNIT_ASSERT(b2.size() == 2); |
|
99 |
CPPUNIT_ASSERT(*b2.rbegin() == 0); |
|
100 |
bool val = b2[0]; |
|
101 |
CPPUNIT_ASSERT(val == true); |
|
102 |
} |
|
103 |
{ |
|
104 |
bit_vector b1(3),b2(2); |
|
105 |
b1[0] = b1[2] = 1; |
|
106 |
b2[1] = 1; |
|
107 |
||
108 |
b1.max_size(); |
|
109 |
CPPUNIT_ASSERT(b1.front() == 1); |
|
110 |
CPPUNIT_ASSERT(b1.back() == 1); |
|
111 |
b1.erase(b1.begin()); |
|
112 |
CPPUNIT_ASSERT(b1.size() == 2); |
|
113 |
b1.erase(b1.begin(),b1.end()); |
|
114 |
CPPUNIT_ASSERT(b1.size() == 0); |
|
115 |
CPPUNIT_ASSERT(b1.empty() == true); |
|
116 |
const bool &res1 = b2.at(0); |
|
117 |
CPPUNIT_ASSERT(res1 == false); |
|
118 |
CPPUNIT_ASSERT(b2.at(1) == true); |
|
119 |
b2.clear(); |
|
120 |
CPPUNIT_ASSERT(b2.empty() == true); |
|
121 |
} |
|
122 |
#endif |
|
123 |
// __UHEAP_MARKEND; |
|
124 |
} |
|
125 |
void BvectorTest::bvec_cov1() |
|
126 |
{ |
|
127 |
// __UHEAP_MARK; |
|
128 |
#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS) |
|
129 |
{ |
|
130 |
bit_vector b1(5),b2(2); |
|
131 |
b1[0] = b1[2] = 1; |
|
132 |
b2[1] = 1; |
|
133 |
||
134 |
b1.assign(b1.begin()+1,b1.begin()+3); |
|
135 |
CPPUNIT_ASSERT(b1.size() == 2); |
|
136 |
b1.assign(7,1); |
|
137 |
CPPUNIT_ASSERT(b1.size() == 7); |
|
138 |
b2.resize(3,1); |
|
139 |
CPPUNIT_ASSERT(b2.size() == 3); |
|
140 |
} |
|
141 |
{ |
|
142 |
bit_vector b1(2),b2(2); |
|
143 |
b1[1] = 1; |
|
144 |
b2[0] = 1; |
|
145 |
b1.flip(); |
|
146 |
CPPUNIT_ASSERT(b1.front() == 1); |
|
147 |
CPPUNIT_ASSERT(b1.back() == 0); |
|
148 |
CPPUNIT_ASSERT(b1 == b2); |
|
149 |
CPPUNIT_ASSERT(!(b1 < b2)); |
|
150 |
||
151 |
b2.reserve(10); |
|
152 |
CPPUNIT_ASSERT(b2.capacity() >= 10); |
|
153 |
} |
|
154 |
{ |
|
155 |
bit_vector b(2); |
|
156 |
b[1] = 1; |
|
157 |
b.insert(b.begin(),1); |
|
158 |
CPPUNIT_ASSERT(b.size() == 3); |
|
159 |
CPPUNIT_ASSERT(b.front() == 1); |
|
160 |
} |
|
161 |
#endif |
|
162 |
// __UHEAP_MARKEND; |
|
163 |
} |