[wxWidgets.git] / tests / longlong / longlongtest.cpp

///////////////////////////////////////////////////////////////////////////////
// Name:        tests/longlong/longlong.cpp
// Purpose:     wxLongLong unit test
// Author:      Vadim Zeitlin, Wlodzimierz ABX Skiba
// Created:     2004-04-01
// RCS-ID:      $Id$
// Copyright:   (c) 2004 Vadim Zeitlin, Wlodzimierz Skiba
///////////////////////////////////////////////////////////////////////////////

// ----------------------------------------------------------------------------
// headers
// ----------------------------------------------------------------------------

#include "testprec.h"

#ifdef __BORLANDC__
    #pragma hdrstop
#endif

#ifndef WX_PRECOMP
    #include "wx/wx.h"
#endif // WX_PRECOMP

#include "wx/longlong.h"
#include "wx/timer.h"

#if wxUSE_LONGLONG

// ----------------------------------------------------------------------------
// helpers for testing
// ----------------------------------------------------------------------------

// number of iterations in loops
#define ITEMS 1000

// make a 64 bit number from 4 16 bit ones
#define MAKE_LL(x1, x2, x3, x4) wxLongLong((x1 << 16) | x2, (x3 << 16) | x3)

// get a random 64 bit number
#define RAND_LL()   MAKE_LL(rand(), rand(), rand(), rand())

static const long testLongs[] =
{
    0,
    1,
    -1,
    LONG_MAX,
    LONG_MIN,
    0x1234,
    -0x1234
};

// ----------------------------------------------------------------------------
// test class
// ----------------------------------------------------------------------------

class LongLongTestCase : public CppUnit::TestCase
{
public:
    LongLongTestCase();

private:
    CPPUNIT_TEST_SUITE( LongLongTestCase );
        CPPUNIT_TEST( Conversion );
        CPPUNIT_TEST( Comparison );
        CPPUNIT_TEST( Addition );
        CPPUNIT_TEST( Multiplication );
        CPPUNIT_TEST( Division );
        CPPUNIT_TEST( BitOperations );
        CPPUNIT_TEST( ToString );
    CPPUNIT_TEST_SUITE_END();

    void Conversion();
    void Comparison();
    void Addition();
    void Multiplication();
    void Division();
    void BitOperations();
    void ToString();

    DECLARE_NO_COPY_CLASS(LongLongTestCase)
};

// register in the unnamed registry so that these tests are run by default
CPPUNIT_TEST_SUITE_REGISTRATION( LongLongTestCase );

// also include in it's own registry so that these tests can be run alone
CPPUNIT_TEST_SUITE_NAMED_REGISTRATION( LongLongTestCase, "LongLongTestCase" );

LongLongTestCase::LongLongTestCase()
{
    srand((unsigned)time(NULL));
}

void LongLongTestCase::Conversion()
{
    for ( size_t n = 0; n < ITEMS; n++ )
    {
        wxLongLong a = RAND_LL();

        wxLongLong b(a.GetHi(), a.GetLo());
        CPPUNIT_ASSERT( a == b );

#if wxUSE_LONGLONG_WX
        wxLongLongWx c(a.GetHi(), a.GetLo());
        CPPUNIT_ASSERT( a == c );
#endif

#if wxUSE_LONGLONG_NATIVE
        wxLongLongNative d(a.GetHi(), a.GetLo());
        CPPUNIT_ASSERT( a == d );
#endif
    }
}

void LongLongTestCase::Comparison()
{
    static const long ls[2] =
    {
        0x1234,
       -0x1234,
    };

    wxLongLong lls[2];
    lls[0] = ls[0];
    lls[1] = ls[1];

    for ( size_t n = 0; n < WXSIZEOF(testLongs); n++ )
    {
        for ( size_t m = 0; m < WXSIZEOF(lls); m++ )
        {
            CPPUNIT_ASSERT( (lls[m] < testLongs[n]) == (ls[m] < testLongs[n]) );
            CPPUNIT_ASSERT( (lls[m] > testLongs[n]) == (ls[m] > testLongs[n]) );
            CPPUNIT_ASSERT( (lls[m] <= testLongs[n]) == (ls[m] <= testLongs[n]) );
            CPPUNIT_ASSERT( (lls[m] >= testLongs[n]) == (ls[m] >= testLongs[n]) );
            CPPUNIT_ASSERT( (lls[m] != testLongs[n]) == (ls[m] != testLongs[n]) );
            CPPUNIT_ASSERT( (lls[m] == testLongs[n]) == (ls[m] == testLongs[n]) );
        }
    }
}

void LongLongTestCase::Addition()
{
    for ( size_t n = 0; n < ITEMS; n++ )
    {
        wxLongLong a = RAND_LL();
        wxLongLong b = RAND_LL();
        wxLongLong c = a + b;

#if wxUSE_LONGLONG_NATIVE
        wxLongLongNative a1 = a;
        wxLongLongNative b1 = b;
        wxLongLongNative c1 = a1 + b1;
        CPPUNIT_ASSERT( c == c1 );
#endif

#if wxUSE_LONGLONG_WX
        wxLongLongWx a2 = a;
        wxLongLongWx b2 = b;
        wxLongLongWx c2 = a2 + b2;
        CPPUNIT_ASSERT( c == c2 );
#endif
    }
}

void LongLongTestCase::Multiplication()
{
    for ( size_t n = 0; n < ITEMS; n++ )
    {
        wxLongLong a = RAND_LL();
        wxLongLong b = RAND_LL();
        wxLongLong c = a*b;

        wxLongLong a1(a.GetHi(), a.GetLo());
        wxLongLong b1(b.GetHi(), b.GetLo());
        wxLongLong c1 = a1*b1;
        CPPUNIT_ASSERT( c1 == c );

#if wxUSE_LONGLONG_WX
        wxLongLongWx a2(a.GetHi(), a.GetLo());
        wxLongLongWx b2(b.GetHi(), b.GetLo());
        wxLongLongWx c2 = a2*b2;
        CPPUNIT_ASSERT( c2 == c );
#endif

#if wxUSE_LONGLONG_NATIVE
        wxLongLongNative a3(a.GetHi(), a.GetLo());
        wxLongLongNative b3(b.GetHi(), b.GetLo());
        wxLongLongNative c3 = a3*b3;
        CPPUNIT_ASSERT( c3 == c );
#endif
    }
}

void LongLongTestCase::Division()
{
    for ( size_t n = 0; n < ITEMS; n++ )
    {
        // get a random wxLongLong (shifting by 12 the MSB ensures that the
        // multiplication will not overflow)
        wxLongLong a = MAKE_LL((rand() >> 12), rand(), rand(), rand());

        // get a random (but non null) long (not wxLongLong for now) divider
        long l;
        do
        {
           l = rand();
        }
        while ( !l );

        wxLongLong q = a / l;
        wxLongLong r = a % l;

        CPPUNIT_ASSERT( a == ( q * l + r ) );

#if wxUSE_LONGLONG_WX
        wxLongLongWx a1(a.GetHi(), a.GetLo());
        wxLongLongWx q1 = a1 / l;
        wxLongLongWx r1 = a1 % l;
        CPPUNIT_ASSERT( q == q1 );
        CPPUNIT_ASSERT( r == r1 );
        CPPUNIT_ASSERT( a1 == ( q1 * l + r1 ) );
#endif

#if wxUSE_LONGLONG_NATIVE
        wxLongLongNative a2(a.GetHi(), a.GetLo());
        wxLongLongNative q2 = a2 / l;
        wxLongLongNative r2 = a2 % l;
        CPPUNIT_ASSERT( q == q2 );
        CPPUNIT_ASSERT( r == r2 );
        CPPUNIT_ASSERT( a2 == ( q2 * l + r2 ) );
#endif
    }
}

void LongLongTestCase::BitOperations()
{
    for ( size_t n = 0; n < ITEMS; n++ )
    {
        wxLongLong a = RAND_LL();

        for ( size_t n = 0; n < 33; n++ )
        {
            wxLongLong b(a.GetHi(), a.GetLo()), c, d = b, e;
            d >>= n;
            c = b >> n;
            CPPUNIT_ASSERT( c == d );
            d <<= n;
            e = c << n;
            CPPUNIT_ASSERT( d == e );

#if wxUSE_LONGLONG_WX
            wxLongLongWx b1(a.GetHi(), a.GetLo()), c1, d1 = b1, e1;
            d1 >>= n;
            c1 = b1 >> n;
            CPPUNIT_ASSERT( c1 == d1 );
            d1 <<= n;
            e1 = c1 << n;
            CPPUNIT_ASSERT( d1 == e1 );
#endif

#if wxUSE_LONGLONG_NATIVE
            wxLongLongNative b2(a.GetHi(), a.GetLo()), c2, d2 = b2, e2;
            d2 >>= n;
            c2 = b2 >> n;
            CPPUNIT_ASSERT( c2 == d2 );
            d2 <<= n;
            e2 = c2 << n;
            CPPUNIT_ASSERT( d2 == e2 );
#endif
        }
    }
}

void LongLongTestCase::ToString()
{
    wxString s1, s2;

    for ( size_t n = 0; n < WXSIZEOF(testLongs); n++ )
    {
        wxLongLong a = testLongs[n];
        s1 = wxString::Format(_T("%ld"), testLongs[n]);
        s2 = a.ToString();
        CPPUNIT_ASSERT( s1 == s2 );

        s2 = wxEmptyString;
        s2 << a;
        CPPUNIT_ASSERT( s1 == s2 );

#if wxUSE_LONGLONG_WX
        wxLongLongWx a1 = testLongs[n];
        s2 = a1.ToString();
        CPPUNIT_ASSERT( s1 == s2 );
#endif

#if wxUSE_LONGLONG_NATIVE
        wxLongLongNative a2 = testLongs[n];
        s2 = a2.ToString();
        CPPUNIT_ASSERT( s1 == s2 );
#endif
    }

    wxLongLong a(0x12345678, 0x87654321);
    CPPUNIT_ASSERT( a.ToString() == _T("1311768467139281697") );
    a.Negate();
    CPPUNIT_ASSERT( a.ToString() == _T("-1311768467139281697") );

    wxLongLong llMin(-2147483647L - 1L, 0);
    CPPUNIT_ASSERT( llMin.ToString() == _T("-9223372036854775808") );

#if wxUSE_LONGLONG_WX
    wxLongLongWx a1(a.GetHi(), a.GetLo());
    CPPUNIT_ASSERT( a1.ToString() == _T("-1311768467139281697") );
    a1.Negate();
    CPPUNIT_ASSERT( a1.ToString() == _T("1311768467139281697") );
#endif

#if wxUSE_LONGLONG_NATIVE
    wxLongLongNative a2(a.GetHi(), a.GetLo());
    CPPUNIT_ASSERT( a2.ToString() == _T("-1311768467139281697") );
    a2.Negate();
    CPPUNIT_ASSERT( a2.ToString() == _T("1311768467139281697") );
#endif

}

#endif // wxUSE_LONGLONG
Commit	Line	Data
1b035b8c VS	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
8899b155	14	#include "testprec.h"
1b035b8c VS	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
216a72f3 VZ	27	#if wxUSE_LONGLONG
216a72f3 VZ	28
1b035b8c VS	29	// ----------------------------------------------------------------------------
	30	// helpers for testing
	31	// ----------------------------------------------------------------------------
	32
	33	// number of iterations in loops
95762eaf	34	#define ITEMS 1000
1b035b8c VS	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;
51496782 WS	245	d >>= n;
51496782 WS	246	c = b >> n;
1b035b8c	247	CPPUNIT_ASSERT( c == d );
51496782 WS	248	d <<= n;
51496782 WS	249	e = c << n;
1b035b8c VS	250	CPPUNIT_ASSERT( d == e );
	251
	252	#if wxUSE_LONGLONG_WX
	253	wxLongLongWx b1(a.GetHi(), a.GetLo()), c1, d1 = b1, e1;
51496782 WS	254	d1 >>= n;
51496782 WS	255	c1 = b1 >> n;
1b035b8c	256	CPPUNIT_ASSERT( c1 == d1 );
51496782 WS	257	d1 <<= n;
51496782 WS	258	e1 = c1 << n;
1b035b8c VS	259	CPPUNIT_ASSERT( d1 == e1 );
	260	#endif
	261
	262	#if wxUSE_LONGLONG_NATIVE
	263	wxLongLongNative b2(a.GetHi(), a.GetLo()), c2, d2 = b2, e2;
51496782 WS	264	d2 >>= n;
51496782 WS	265	c2 = b2 >> n;
1b035b8c	266	CPPUNIT_ASSERT( c2 == d2 );
51496782 WS	267	d2 <<= n;
51496782 WS	268	e2 = c2 << n;
1b035b8c VS	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
51496782 WS	286	s2 = wxEmptyString;
	287	s2 << a;
	288	CPPUNIT_ASSERT( s1 == s2 );
	289
1b035b8c VS	290	#if wxUSE_LONGLONG_WX
	291	wxLongLongWx a1 = testLongs[n];
	292	s2 = a1.ToString();
	293	CPPUNIT_ASSERT( s1 == s2 );
	294	#endif
	295
	296	#if wxUSE_LONGLONG_NATIVE
	297	wxLongLongNative a2 = testLongs[n];
	298	s2 = a2.ToString();
	299	CPPUNIT_ASSERT( s1 == s2 );
	300	#endif
	301	}
	302
	303	wxLongLong a(0x12345678, 0x87654321);
	304	CPPUNIT_ASSERT( a.ToString() == _T("1311768467139281697") );
	305	a.Negate();
	306	CPPUNIT_ASSERT( a.ToString() == _T("-1311768467139281697") );
	307
1d805c14	308	wxLongLong llMin(-2147483647L - 1L, 0);
981cc5bb	309	CPPUNIT_ASSERT( llMin.ToString() == _T("-9223372036854775808") );
1d4037aa	310
1b035b8c VS	311	#if wxUSE_LONGLONG_WX
	312	wxLongLongWx a1(a.GetHi(), a.GetLo());
	313	CPPUNIT_ASSERT( a1.ToString() == _T("-1311768467139281697") );
	314	a1.Negate();
	315	CPPUNIT_ASSERT( a1.ToString() == _T("1311768467139281697") );
	316	#endif
	317
	318	#if wxUSE_LONGLONG_NATIVE
	319	wxLongLongNative a2(a.GetHi(), a.GetLo());
	320	CPPUNIT_ASSERT( a2.ToString() == _T("-1311768467139281697") );
	321	a2.Negate();
	322	CPPUNIT_ASSERT( a2.ToString() == _T("1311768467139281697") );
	323	#endif
	324
	325	}
	326
216a72f3	327	#endif // wxUSE_LONGLONG