]>
Commit | Line | Data |
---|---|---|
1 | /////////////////////////////////////////////////////////////////////////////// | |
2 | // Name: tests/longlong/longlong.cpp | |
3 | // Purpose: wxLongLong unit test | |
4 | // Author: Vadim Zeitlin, Wlodzimierz ABX Skiba | |
5 | // Created: 2004-04-01 | |
6 | // RCS-ID: $Id$ | |
7 | // Copyright: (c) 2004 Vadim Zeitlin, Wlodzimierz Skiba | |
8 | /////////////////////////////////////////////////////////////////////////////// | |
9 | ||
10 | // ---------------------------------------------------------------------------- | |
11 | // headers | |
12 | // ---------------------------------------------------------------------------- | |
13 | ||
14 | #include "wx/wxprec.h" | |
15 | ||
16 | #ifdef __BORLANDC__ | |
17 | #pragma hdrstop | |
18 | #endif | |
19 | ||
20 | #ifndef WX_PRECOMP | |
21 | #include "wx/wx.h" | |
22 | #endif // WX_PRECOMP | |
23 | ||
24 | #include "wx/longlong.h" | |
25 | #include "wx/timer.h" | |
26 | ||
27 | #include "wx/cppunit.h" | |
28 | ||
29 | // ---------------------------------------------------------------------------- | |
30 | // helpers for testing | |
31 | // ---------------------------------------------------------------------------- | |
32 | ||
33 | // number of iterations in loops | |
34 | #define ITEMS 10000 | |
35 | ||
36 | // make a 64 bit number from 4 16 bit ones | |
37 | #define MAKE_LL(x1, x2, x3, x4) wxLongLong((x1 << 16) | x2, (x3 << 16) | x3) | |
38 | ||
39 | // get a random 64 bit number | |
40 | #define RAND_LL() MAKE_LL(rand(), rand(), rand(), rand()) | |
41 | ||
42 | static const long testLongs[] = | |
43 | { | |
44 | 0, | |
45 | 1, | |
46 | -1, | |
47 | LONG_MAX, | |
48 | LONG_MIN, | |
49 | 0x1234, | |
50 | -0x1234 | |
51 | }; | |
52 | ||
53 | // ---------------------------------------------------------------------------- | |
54 | // test class | |
55 | // ---------------------------------------------------------------------------- | |
56 | ||
57 | class LongLongTestCase : public CppUnit::TestCase | |
58 | { | |
59 | public: | |
60 | LongLongTestCase(); | |
61 | ||
62 | private: | |
63 | CPPUNIT_TEST_SUITE( LongLongTestCase ); | |
64 | CPPUNIT_TEST( Conversion ); | |
65 | CPPUNIT_TEST( Comparison ); | |
66 | CPPUNIT_TEST( Addition ); | |
67 | CPPUNIT_TEST( Multiplication ); | |
68 | CPPUNIT_TEST( Division ); | |
69 | CPPUNIT_TEST( BitOperations ); | |
70 | CPPUNIT_TEST( ToString ); | |
71 | CPPUNIT_TEST_SUITE_END(); | |
72 | ||
73 | void Conversion(); | |
74 | void Comparison(); | |
75 | void Addition(); | |
76 | void Multiplication(); | |
77 | void Division(); | |
78 | void BitOperations(); | |
79 | void ToString(); | |
80 | ||
81 | DECLARE_NO_COPY_CLASS(LongLongTestCase) | |
82 | }; | |
83 | ||
84 | // register in the unnamed registry so that these tests are run by default | |
85 | CPPUNIT_TEST_SUITE_REGISTRATION( LongLongTestCase ); | |
86 | ||
87 | // also include in it's own registry so that these tests can be run alone | |
88 | CPPUNIT_TEST_SUITE_NAMED_REGISTRATION( LongLongTestCase, "LongLongTestCase" ); | |
89 | ||
90 | LongLongTestCase::LongLongTestCase() | |
91 | { | |
92 | srand((unsigned)time(NULL)); | |
93 | } | |
94 | ||
95 | void LongLongTestCase::Conversion() | |
96 | { | |
97 | for ( size_t n = 0; n < ITEMS; n++ ) | |
98 | { | |
99 | wxLongLong a = RAND_LL(); | |
100 | ||
101 | wxLongLong b(a.GetHi(), a.GetLo()); | |
102 | CPPUNIT_ASSERT( a == b ); | |
103 | ||
104 | #if wxUSE_LONGLONG_WX | |
105 | wxLongLongWx c(a.GetHi(), a.GetLo()); | |
106 | CPPUNIT_ASSERT( a == c ); | |
107 | #endif | |
108 | ||
109 | #if wxUSE_LONGLONG_NATIVE | |
110 | wxLongLongNative d(a.GetHi(), a.GetLo()); | |
111 | CPPUNIT_ASSERT( a == d ); | |
112 | #endif | |
113 | } | |
114 | } | |
115 | ||
116 | void LongLongTestCase::Comparison() | |
117 | { | |
118 | static const long ls[2] = | |
119 | { | |
120 | 0x1234, | |
121 | -0x1234, | |
122 | }; | |
123 | ||
124 | wxLongLong lls[2]; | |
125 | lls[0] = ls[0]; | |
126 | lls[1] = ls[1]; | |
127 | ||
128 | for ( size_t n = 0; n < WXSIZEOF(testLongs); n++ ) | |
129 | { | |
130 | for ( size_t m = 0; m < WXSIZEOF(lls); m++ ) | |
131 | { | |
132 | CPPUNIT_ASSERT( (lls[m] < testLongs[n]) == (ls[m] < testLongs[n]) ); | |
133 | CPPUNIT_ASSERT( (lls[m] > testLongs[n]) == (ls[m] > testLongs[n]) ); | |
134 | CPPUNIT_ASSERT( (lls[m] <= testLongs[n]) == (ls[m] <= testLongs[n]) ); | |
135 | CPPUNIT_ASSERT( (lls[m] >= testLongs[n]) == (ls[m] >= testLongs[n]) ); | |
136 | CPPUNIT_ASSERT( (lls[m] != testLongs[n]) == (ls[m] != testLongs[n]) ); | |
137 | CPPUNIT_ASSERT( (lls[m] == testLongs[n]) == (ls[m] == testLongs[n]) ); | |
138 | } | |
139 | } | |
140 | } | |
141 | ||
142 | void LongLongTestCase::Addition() | |
143 | { | |
144 | for ( size_t n = 0; n < ITEMS; n++ ) | |
145 | { | |
146 | wxLongLong a = RAND_LL(); | |
147 | wxLongLong b = RAND_LL(); | |
148 | wxLongLong c = a + b; | |
149 | ||
150 | #if wxUSE_LONGLONG_NATIVE | |
151 | wxLongLongNative a1 = a; | |
152 | wxLongLongNative b1 = b; | |
153 | wxLongLongNative c1 = a1 + b1; | |
154 | CPPUNIT_ASSERT( c == c1 ); | |
155 | #endif | |
156 | ||
157 | #if wxUSE_LONGLONG_WX | |
158 | wxLongLongWx a2 = a; | |
159 | wxLongLongWx b2 = b; | |
160 | wxLongLongWx c2 = a2 + b2; | |
161 | CPPUNIT_ASSERT( c == c2 ); | |
162 | #endif | |
163 | } | |
164 | } | |
165 | ||
166 | void LongLongTestCase::Multiplication() | |
167 | { | |
168 | for ( size_t n = 0; n < ITEMS; n++ ) | |
169 | { | |
170 | wxLongLong a = RAND_LL(); | |
171 | wxLongLong b = RAND_LL(); | |
172 | wxLongLong c = a*b; | |
173 | ||
174 | wxLongLong a1(a.GetHi(), a.GetLo()); | |
175 | wxLongLong b1(b.GetHi(), b.GetLo()); | |
176 | wxLongLong c1 = a1*b1; | |
177 | CPPUNIT_ASSERT( c1 == c ); | |
178 | ||
179 | #if wxUSE_LONGLONG_WX | |
180 | wxLongLongWx a2(a.GetHi(), a.GetLo()); | |
181 | wxLongLongWx b2(b.GetHi(), b.GetLo()); | |
182 | wxLongLongWx c2 = a2*b2; | |
183 | CPPUNIT_ASSERT( c2 == c ); | |
184 | #endif | |
185 | ||
186 | #if wxUSE_LONGLONG_NATIVE | |
187 | wxLongLongNative a3(a.GetHi(), a.GetLo()); | |
188 | wxLongLongNative b3(b.GetHi(), b.GetLo()); | |
189 | wxLongLongNative c3 = a3*b3; | |
190 | CPPUNIT_ASSERT( c3 == c ); | |
191 | #endif | |
192 | } | |
193 | } | |
194 | ||
195 | void LongLongTestCase::Division() | |
196 | { | |
197 | for ( size_t n = 0; n < ITEMS; n++ ) | |
198 | { | |
199 | // get a random wxLongLong (shifting by 12 the MSB ensures that the | |
200 | // multiplication will not overflow) | |
201 | wxLongLong a = MAKE_LL((rand() >> 12), rand(), rand(), rand()); | |
202 | ||
203 | // get a random (but non null) long (not wxLongLong for now) divider | |
204 | long l; | |
205 | do | |
206 | { | |
207 | l = rand(); | |
208 | } | |
209 | while ( !l ); | |
210 | ||
211 | wxLongLong q = a / l; | |
212 | wxLongLong r = a % l; | |
213 | ||
214 | CPPUNIT_ASSERT( a == ( q * l + r ) ); | |
215 | ||
216 | #if wxUSE_LONGLONG_WX | |
217 | wxLongLongWx a1(a.GetHi(), a.GetLo()); | |
218 | wxLongLongWx q1 = a1 / l; | |
219 | wxLongLongWx r1 = a1 % l; | |
220 | CPPUNIT_ASSERT( q == q1 ); | |
221 | CPPUNIT_ASSERT( r == r1 ); | |
222 | CPPUNIT_ASSERT( a1 == ( q1 * l + r1 ) ); | |
223 | #endif | |
224 | ||
225 | #if wxUSE_LONGLONG_NATIVE | |
226 | wxLongLongNative a2(a.GetHi(), a.GetLo()); | |
227 | wxLongLongNative q2 = a2 / l; | |
228 | wxLongLongNative r2 = a2 % l; | |
229 | CPPUNIT_ASSERT( q == q2 ); | |
230 | CPPUNIT_ASSERT( r == r2 ); | |
231 | CPPUNIT_ASSERT( a2 == ( q2 * l + r2 ) ); | |
232 | #endif | |
233 | } | |
234 | } | |
235 | ||
236 | void LongLongTestCase::BitOperations() | |
237 | { | |
238 | for ( size_t n = 0; n < ITEMS; n++ ) | |
239 | { | |
240 | wxLongLong a = RAND_LL(); | |
241 | ||
242 | for ( size_t n = 0; n < 33; n++ ) | |
243 | { | |
244 | wxLongLong b(a.GetHi(), a.GetLo()), c, d = b, e; | |
245 | d >>= n; | |
246 | c = b >> n; | |
247 | CPPUNIT_ASSERT( c == d ); | |
248 | d <<= n; | |
249 | e = c << n; | |
250 | CPPUNIT_ASSERT( d == e ); | |
251 | ||
252 | #if wxUSE_LONGLONG_WX | |
253 | wxLongLongWx b1(a.GetHi(), a.GetLo()), c1, d1 = b1, e1; | |
254 | d1 >>= n; | |
255 | c1 = b1 >> n; | |
256 | CPPUNIT_ASSERT( c1 == d1 ); | |
257 | d1 <<= n; | |
258 | e1 = c1 << n; | |
259 | CPPUNIT_ASSERT( d1 == e1 ); | |
260 | #endif | |
261 | ||
262 | #if wxUSE_LONGLONG_NATIVE | |
263 | wxLongLongNative b2(a.GetHi(), a.GetLo()), c2, d2 = b2, e2; | |
264 | d2 >>= n; | |
265 | c2 = b2 >> n; | |
266 | CPPUNIT_ASSERT( c2 == d2 ); | |
267 | d2 <<= n; | |
268 | e2 = c2 << n; | |
269 | CPPUNIT_ASSERT( d2 == e2 ); | |
270 | #endif | |
271 | } | |
272 | } | |
273 | } | |
274 | ||
275 | void LongLongTestCase::ToString() | |
276 | { | |
277 | wxString s1, s2; | |
278 | ||
279 | for ( size_t n = 0; n < WXSIZEOF(testLongs); n++ ) | |
280 | { | |
281 | wxLongLong a = testLongs[n]; | |
282 | s1 = wxString::Format(_T("%ld"), testLongs[n]); | |
283 | s2 = a.ToString(); | |
284 | CPPUNIT_ASSERT( s1 == s2 ); | |
285 | ||
286 | #if wxUSE_LONGLONG_WX | |
287 | wxLongLongWx a1 = testLongs[n]; | |
288 | s2 = a1.ToString(); | |
289 | CPPUNIT_ASSERT( s1 == s2 ); | |
290 | #endif | |
291 | ||
292 | #if wxUSE_LONGLONG_NATIVE | |
293 | wxLongLongNative a2 = testLongs[n]; | |
294 | s2 = a2.ToString(); | |
295 | CPPUNIT_ASSERT( s1 == s2 ); | |
296 | #endif | |
297 | } | |
298 | ||
299 | wxLongLong a(0x12345678, 0x87654321); | |
300 | CPPUNIT_ASSERT( a.ToString() == _T("1311768467139281697") ); | |
301 | a.Negate(); | |
302 | CPPUNIT_ASSERT( a.ToString() == _T("-1311768467139281697") ); | |
303 | ||
304 | #if wxUSE_LONGLONG_WX | |
305 | wxLongLongWx a1(a.GetHi(), a.GetLo()); | |
306 | CPPUNIT_ASSERT( a1.ToString() == _T("-1311768467139281697") ); | |
307 | a1.Negate(); | |
308 | CPPUNIT_ASSERT( a1.ToString() == _T("1311768467139281697") ); | |
309 | #endif | |
310 | ||
311 | #if wxUSE_LONGLONG_NATIVE | |
312 | wxLongLongNative a2(a.GetHi(), a.GetLo()); | |
313 | CPPUNIT_ASSERT( a2.ToString() == _T("-1311768467139281697") ); | |
314 | a2.Negate(); | |
315 | CPPUNIT_ASSERT( a2.ToString() == _T("1311768467139281697") ); | |
316 | #endif | |
317 | ||
318 | } | |
319 |