f4b80e5337
Don't support this compiler any more, this allows to get rid of tons of MSVC6-specific workarounds, in particular we can now use Bind() and natural template functions calls in the library code. Also remove MSVC6 project and solution files and don't generate them when bakefile_gen is ran any more (removing the remaining occurrences of msvc6prj from the bakefiles results in weird bake-time errors, so it's simpler to just leave them there). git-svn-id: https://svn.wxwidgets.org/svn/wx/wxWidgets/trunk@76532 c3d73ce0-8a6f-49c7-b76d-6d57e0e08775
353 lines
9.0 KiB
C++
353 lines
9.0 KiB
C++
///////////////////////////////////////////////////////////////////////////////
|
|
// Name: tests/longlong/longlong.cpp
|
|
// Purpose: wxLongLong unit test
|
|
// Author: Vadim Zeitlin, Wlodzimierz ABX Skiba
|
|
// Created: 2004-04-01
|
|
// 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( LoHi );
|
|
CPPUNIT_TEST( Limits );
|
|
CPPUNIT_TEST_SUITE_END();
|
|
|
|
void Conversion();
|
|
void Comparison();
|
|
void Addition();
|
|
void Multiplication();
|
|
void Division();
|
|
void BitOperations();
|
|
void ToString();
|
|
void LoHi();
|
|
void Limits();
|
|
|
|
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 its 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 m = 0; m < ITEMS; m++ )
|
|
{
|
|
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(wxT("%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() == wxT("1311768467139281697") );
|
|
a.Negate();
|
|
CPPUNIT_ASSERT( a.ToString() == wxT("-1311768467139281697") );
|
|
|
|
wxLongLong llMin(-2147483647L - 1L, 0);
|
|
CPPUNIT_ASSERT( llMin.ToString() == wxT("-9223372036854775808") );
|
|
|
|
#if wxUSE_LONGLONG_WX
|
|
wxLongLongWx a1(a.GetHi(), a.GetLo());
|
|
CPPUNIT_ASSERT( a1.ToString() == wxT("-1311768467139281697") );
|
|
a1.Negate();
|
|
CPPUNIT_ASSERT( a1.ToString() == wxT("1311768467139281697") );
|
|
#endif
|
|
|
|
#if wxUSE_LONGLONG_NATIVE
|
|
wxLongLongNative a2(a.GetHi(), a.GetLo());
|
|
CPPUNIT_ASSERT( a2.ToString() == wxT("-1311768467139281697") );
|
|
a2.Negate();
|
|
CPPUNIT_ASSERT( a2.ToString() == wxT("1311768467139281697") );
|
|
#endif
|
|
|
|
}
|
|
|
|
void LongLongTestCase::LoHi()
|
|
{
|
|
wxLongLong ll(123, 456);
|
|
CPPUNIT_ASSERT_EQUAL( 456u, ll.GetLo() );
|
|
CPPUNIT_ASSERT_EQUAL( 123, ll.GetHi() );
|
|
|
|
wxULongLong ull(987, 654);
|
|
CPPUNIT_ASSERT_EQUAL( 654u, ull.GetLo() );
|
|
CPPUNIT_ASSERT_EQUAL( 987u, ull.GetHi() );
|
|
}
|
|
|
|
void LongLongTestCase::Limits()
|
|
{
|
|
#if wxUSE_LONGLONG_NATIVE
|
|
CPPUNIT_ASSERT( std::numeric_limits<wxLongLong>::is_specialized );
|
|
CPPUNIT_ASSERT( std::numeric_limits<wxULongLong>::is_specialized );
|
|
|
|
wxULongLong maxval = std::numeric_limits<wxULongLong>::max();
|
|
CPPUNIT_ASSERT( maxval.ToDouble() > 0 );
|
|
#endif // wxUSE_LONGLONG_NATIVE
|
|
}
|
|
|
|
#endif // wxUSE_LONGLONG
|