git.saurik.com Git - wxWidgets.git/blame_incremental

... / ...

Commit	Line	Data
	1	///////////////////////////////////////////////////////////////////////////////
	2	// Name: tests/arrays/arrays.cpp
	3	// Purpose: wxArray 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 "testprec.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/dynarray.h"
	25
	26	// ----------------------------------------------------------------------------
	27	// helpers for testing values and sizes
	28	// ----------------------------------------------------------------------------
	29
	30	#define COMPARE_VALUE( array , index , value ) ( array.Item( index ) == value )
	31
	32	#define COMPARE_2_VALUES( array , p0 , p1 ) \
	33	COMPARE_VALUE( array , 0 , p0 ) && \
	34	COMPARE_VALUE( array , 1 , p1 )
	35
	36	#define COMPARE_3_VALUES( array , p0 , p1 , p2 ) \
	37	COMPARE_2_VALUES( array , p0 , p1 ) && \
	38	COMPARE_VALUE( array , 2 , p2 )
	39
	40	#define COMPARE_4_VALUES( array , p0 , p1 , p2 , p3 ) \
	41	COMPARE_3_VALUES( array , p0 , p1 , p2 ) && \
	42	COMPARE_VALUE( array , 3 , p3 )
	43
	44	#define COMPARE_5_VALUES( array , p0 , p1 , p2 , p3 , p4 ) \
	45	COMPARE_4_VALUES( array , p0 , p1 , p2 , p3 ) && \
	46	COMPARE_VALUE( array , 4 , p4 )
	47
	48	#define COMPARE_6_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 ) \
	49	COMPARE_5_VALUES( array , p0 , p1 , p2 , p3 , p4 ) && \
	50	COMPARE_VALUE( array , 5 , p5 )
	51
	52	#define COMPARE_7_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 ) \
	53	COMPARE_6_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 ) && \
	54	COMPARE_VALUE( array , 6 , p6 )
	55
	56	#define COMPARE_8_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 , p7 ) \
	57	COMPARE_7_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 ) && \
	58	COMPARE_VALUE( array , 7 , p7 )
	59
	60	#define COMPARE_9_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 , p7 , p8 ) \
	61	COMPARE_8_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 , p7 ) && \
	62	COMPARE_VALUE( array , 8 , p8 )
	63
	64	#define COMPARE_10_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 , p7 , p8 , p9 ) \
	65	COMPARE_9_VALUES( array , p0 , p1 , p2 , p3 , p4 , p5 , p6 , p7 , p8 ) && \
	66	COMPARE_VALUE( array , 9 , p9 )
	67
	68	#define COMPARE_COUNT( array , n ) \
	69	( array.GetCount() == n ) && \
	70	( array.Last() == array.Item( n - 1 ) )
	71
	72	// ----------------------------------------------------------------------------
	73	// helpers for testing wxObjArray
	74	// ----------------------------------------------------------------------------
	75
	76	class Bar
	77	{
	78	public:
	79	Bar(const wxString& name) : m_name(name) { ms_bars++; }
	80	Bar(const Bar& bar) : m_name(bar.m_name) { ms_bars++; }
	81	~Bar() { ms_bars--; }
	82
	83	static size_t GetNumber() { return ms_bars; }
	84
	85	const wxChar *GetName() const { return m_name; }
	86
	87	private:
	88	wxString m_name;
	89
	90	static size_t ms_bars;
	91	};
	92
	93	size_t Bar::ms_bars = 0;
	94
	95	WX_DECLARE_OBJARRAY(Bar, ArrayBars);
	96	#include "wx/arrimpl.cpp"
	97	WX_DEFINE_OBJARRAY(ArrayBars);
	98
	99	// ----------------------------------------------------------------------------
	100	// helpers for sorting arrays and comparing items
	101	// ----------------------------------------------------------------------------
	102
	103	int wxCMPFUNC_CONV StringLenCompare(const wxString& first,
	104	const wxString& second)
	105	{
	106	return first.length() - second.length();
	107	}
	108
	109	#define DEFINE_COMPARE(name, T) \
	110	\
	111	int wxCMPFUNC_CONV name ## CompareValues(T first, T second) \
	112	{ \
	113	return first - second; \
	114	} \
	115	\
	116	int wxCMPFUNC_CONV name ## Compare(T* first, T* second) \
	117	{ \
	118	return first - second; \
	119	} \
	120	\
	121	int wxCMPFUNC_CONV name ## RevCompare(T* first, T* second) \
	122	{ \
	123	return second - first; \
	124	} \
	125
	126	typedef unsigned short ushort;
	127
	128	DEFINE_COMPARE(UShort, ushort);
	129	DEFINE_COMPARE(Int, int);
	130
	131	WX_DEFINE_ARRAY_SHORT(ushort, wxArrayUShort);
	132	WX_DEFINE_SORTED_ARRAY_SHORT(ushort, wxSortedArrayUShortNoCmp);
	133	WX_DEFINE_SORTED_ARRAY_CMP_SHORT(ushort, UShortCompareValues, wxSortedArrayUShort);
	134	WX_DEFINE_SORTED_ARRAY_CMP_INT(int, IntCompareValues, wxSortedArrayInt);
	135
	136	// ----------------------------------------------------------------------------
	137	// test class
	138	// ----------------------------------------------------------------------------
	139
	140	class ArraysTestCase : public CppUnit::TestCase
	141	{
	142	public:
	143	ArraysTestCase() { }
	144
	145	private:
	146	CPPUNIT_TEST_SUITE( ArraysTestCase );
	147	CPPUNIT_TEST( wxStringArrayTest );
	148	CPPUNIT_TEST( wxObjArrayTest );
	149	CPPUNIT_TEST( wxArrayUShortTest );
	150	CPPUNIT_TEST( wxArrayIntTest );
	151	CPPUNIT_TEST( TestSTL );
	152	CPPUNIT_TEST( Alloc );
	153	CPPUNIT_TEST_SUITE_END();
	154
	155	void wxStringArrayTest();
	156	void wxObjArrayTest();
	157	void wxArrayUShortTest();
	158	void wxArrayIntTest();
	159	void TestSTL();
	160	void Alloc();
	161
	162	DECLARE_NO_COPY_CLASS(ArraysTestCase)
	163	};
	164
	165	// register in the unnamed registry so that these tests are run by default
	166	CPPUNIT_TEST_SUITE_REGISTRATION( ArraysTestCase );
	167
	168	// also include in it's own registry so that these tests can be run alone
	169	CPPUNIT_TEST_SUITE_NAMED_REGISTRATION( ArraysTestCase, "ArraysTestCase" );
	170
	171	void ArraysTestCase::wxStringArrayTest()
	172	{
	173	wxArrayString a1;
	174	a1.Add(_T("thermit"));
	175	a1.Add(_T("condor"));
	176	a1.Add(_T("lion"), 3);
	177	a1.Add(_T("dog"));
	178	a1.Add(_T("human"));
	179	a1.Add(_T("alligator"));
	180
	181	CPPUNIT_ASSERT( COMPARE_8_VALUES( a1 , _T("thermit") ,
	182	_T("condor") ,
	183	_T("lion") ,
	184	_T("lion") ,
	185	_T("lion") ,
	186	_T("dog") ,
	187	_T("human") ,
	188	_T("alligator") ) );
	189	CPPUNIT_ASSERT( COMPARE_COUNT( a1 , 8 ) );
	190
	191	wxArrayString a2(a1);
	192
	193	CPPUNIT_ASSERT( COMPARE_8_VALUES( a2 , _T("thermit") ,
	194	_T("condor") ,
	195	_T("lion") ,
	196	_T("lion") ,
	197	_T("lion") ,
	198	_T("dog") ,
	199	_T("human") ,
	200	_T("alligator") ) );
	201	CPPUNIT_ASSERT( COMPARE_COUNT( a2 , 8 ) );
	202
	203	wxSortedArrayString a3(a1);
	204
	205	CPPUNIT_ASSERT( COMPARE_8_VALUES( a3 , _T("alligator") ,
	206	_T("condor") ,
	207	_T("dog") ,
	208	_T("human") ,
	209	_T("lion") ,
	210	_T("lion") ,
	211	_T("lion") ,
	212	_T("thermit") ) );
	213	CPPUNIT_ASSERT( COMPARE_COUNT( a3 , 8 ) );
	214
	215	wxSortedArrayString a4;
	216	for (wxArrayString::iterator it = a1.begin(), en = a1.end(); it != en; ++it)
	217	a4.Add(*it);
	218
	219	CPPUNIT_ASSERT( COMPARE_8_VALUES( a4 , _T("alligator") ,
	220	_T("condor") ,
	221	_T("dog") ,
	222	_T("human") ,
	223	_T("lion") ,
	224	_T("lion") ,
	225	_T("lion") ,
	226	_T("thermit") ) );
	227	CPPUNIT_ASSERT( COMPARE_COUNT( a4 , 8 ) );
	228
	229	a1.RemoveAt(2,3);
	230
	231	CPPUNIT_ASSERT( COMPARE_5_VALUES( a1 , _T("thermit") ,
	232	_T("condor") ,
	233	_T("dog") ,
	234	_T("human") ,
	235	_T("alligator") ) );
	236	CPPUNIT_ASSERT( COMPARE_COUNT( a1 , 5 ) );
	237
	238	a2 = a1;
	239
	240	CPPUNIT_ASSERT( COMPARE_5_VALUES( a2 , _T("thermit") ,
	241	_T("condor") ,
	242	_T("dog") ,
	243	_T("human") ,
	244	_T("alligator") ) );
	245	CPPUNIT_ASSERT( COMPARE_COUNT( a2 , 5 ) );
	246
	247	a1.Sort(false);
	248
	249	CPPUNIT_ASSERT( COMPARE_5_VALUES( a1 , _T("alligator") ,
	250	_T("condor") ,
	251	_T("dog") ,
	252	_T("human") ,
	253	_T("thermit") ) );
	254	CPPUNIT_ASSERT( COMPARE_COUNT( a1 , 5 ) );
	255
	256	a1.Sort(true);
	257
	258	CPPUNIT_ASSERT( COMPARE_5_VALUES( a1 , _T("thermit") ,
	259	_T("human") ,
	260	_T("dog") ,
	261	_T("condor") ,
	262	_T("alligator") ) );
	263	CPPUNIT_ASSERT( COMPARE_COUNT( a1 , 5 ) );
	264
	265	a1.Sort(&StringLenCompare);
	266
	267	CPPUNIT_ASSERT( COMPARE_5_VALUES( a1 , _T("dog") ,
	268	_T("human") ,
	269	_T("condor") ,
	270	_T("thermit") ,
	271	_T("alligator") ) );
	272	CPPUNIT_ASSERT( COMPARE_COUNT( a1 , 5 ) );
	273	CPPUNIT_ASSERT( a1.Index( _T("dog") ) == 0 );
	274	CPPUNIT_ASSERT( a1.Index( _T("human") ) == 1 );
	275	CPPUNIT_ASSERT( a1.Index( _T("humann") ) == wxNOT_FOUND );
	276	CPPUNIT_ASSERT( a1.Index( _T("condor") ) == 2 );
	277	CPPUNIT_ASSERT( a1.Index( _T("thermit") ) == 3 );
	278	CPPUNIT_ASSERT( a1.Index( _T("alligator") ) == 4 );
	279
	280	wxArrayString a5;
	281
	282	CPPUNIT_ASSERT( a5.Add( _T("x"), 1 ) == 0 );
	283	CPPUNIT_ASSERT( a5.Add( _T("a"), 3 ) == 1 );
	284
	285	CPPUNIT_ASSERT( COMPARE_4_VALUES( a5, _T("x") ,
	286	_T("a") ,
	287	_T("a") ,
	288	_T("a") ) );
	289	}
	290
	291	void ArraysTestCase::wxObjArrayTest()
	292	{
	293	{
	294	ArrayBars bars;
	295	Bar bar(_T("first bar in general, second bar in array (two copies!)"));
	296
	297	CPPUNIT_ASSERT( bars.GetCount() == 0 );
	298	CPPUNIT_ASSERT( Bar::GetNumber() == 1 );
	299
	300	bars.Add(new Bar(_T("first bar in array")));
	301	bars.Add(bar,2);
	302
	303	CPPUNIT_ASSERT( bars.GetCount() == 3 );
	304	CPPUNIT_ASSERT( Bar::GetNumber() == 4 );
	305
	306	bars.RemoveAt(1, bars.GetCount() - 1);
	307
	308	CPPUNIT_ASSERT( bars.GetCount() == 1 );
	309	CPPUNIT_ASSERT( Bar::GetNumber() == 2 );
	310
	311	bars.Empty();
	312
	313	CPPUNIT_ASSERT( bars.GetCount() == 0 );
	314	CPPUNIT_ASSERT( Bar::GetNumber() == 1 );
	315	}
	316	CPPUNIT_ASSERT( Bar::GetNumber() == 0 );
	317	}
	318
	319	#define TestArrayOf(name) \
	320	\
	321	void ArraysTestCase::wxArray ## name ## Test() \
	322	{ \
	323	wxArray##name a; \
	324	a.Add(1); \
	325	a.Add(17,2); \
	326	a.Add(5,3); \
	327	a.Add(3,4); \
	328	\
	329	CPPUNIT_ASSERT( COMPARE_10_VALUES(a,1,17,17,5,5,5,3,3,3,3) ); \
	330	CPPUNIT_ASSERT( COMPARE_COUNT( a , 10 ) ); \
	331	\
	332	a.Sort(name ## Compare); \
	333	\
	334	CPPUNIT_ASSERT( COMPARE_10_VALUES(a,1,3,3,3,3,5,5,5,17,17) ); \
	335	CPPUNIT_ASSERT( COMPARE_COUNT( a , 10 ) ); \
	336	\
	337	a.Sort(name ## RevCompare); \
	338	\
	339	CPPUNIT_ASSERT( COMPARE_10_VALUES(a,17,17,5,5,5,3,3,3,3,1) ); \
	340	CPPUNIT_ASSERT( COMPARE_COUNT( a , 10 ) ); \
	341	\
	342	wxSortedArray##name b; \
	343	\
	344	b.Add(1); \
	345	b.Add(17); \
	346	b.Add(5); \
	347	b.Add(3); \
	348	\
	349	CPPUNIT_ASSERT( COMPARE_4_VALUES(b,1,3,5,17) ); \
	350	CPPUNIT_ASSERT( COMPARE_COUNT( b , 4 ) ); \
	351	CPPUNIT_ASSERT( b.Index( 0 ) == wxNOT_FOUND ); \
	352	CPPUNIT_ASSERT( b.Index( 1 ) == 0 ); \
	353	CPPUNIT_ASSERT( b.Index( 3 ) == 1 ); \
	354	CPPUNIT_ASSERT( b.Index( 4 ) == wxNOT_FOUND ); \
	355	CPPUNIT_ASSERT( b.Index( 5 ) == 2 ); \
	356	CPPUNIT_ASSERT( b.Index( 6 ) == wxNOT_FOUND ); \
	357	CPPUNIT_ASSERT( b.Index( 17 ) == 3 ); \
	358	}
	359
	360	TestArrayOf(UShort);
	361
	362	TestArrayOf(Int);
	363
	364	void ArraysTestCase::Alloc()
	365	{
	366	wxArrayInt a;
	367	a.Add(17);
	368	a.Add(9);
	369	CPPUNIT_ASSERT_EQUAL( size_t(2), a.GetCount() );
	370
	371	a.Alloc(1000);
	372
	373	CPPUNIT_ASSERT_EQUAL( size_t(2), a.GetCount() );
	374	CPPUNIT_ASSERT_EQUAL( 17, a[0] );
	375	CPPUNIT_ASSERT_EQUAL( 9, a[1] );
	376	}
	377
	378	void ArraysTestCase::TestSTL()
	379	{
	380	wxArrayInt list1;
	381	wxArrayInt::iterator it, en;
	382	wxArrayInt::reverse_iterator rit, ren;
	383	int i;
	384	static const int COUNT = 5;
	385
	386	for ( i = 0; i < COUNT; ++i )
	387	list1.push_back(i);
	388
	389	CPPUNIT_ASSERT( list1.capacity() >= (size_t)COUNT );
	390	CPPUNIT_ASSERT_EQUAL( (size_t)COUNT, list1.size() );
	391
	392	for ( it = list1.begin(), en = list1.end(), i = 0;
	393	it != en; ++it, ++i )
	394	{
	395	CPPUNIT_ASSERT( *it == i );
	396	}
	397
	398	CPPUNIT_ASSERT_EQUAL( COUNT, i );
	399
	400	for ( rit = list1.rbegin(), ren = list1.rend(), i = COUNT;
	401	rit != ren; ++rit, --i )
	402	{
	403	CPPUNIT_ASSERT( *rit == i-1 );
	404	}
	405
	406	CPPUNIT_ASSERT_EQUAL( 0, i );
	407
	408	CPPUNIT_ASSERT( list1.rbegin() == (list1.end()-1) &&
	409	list1.begin() == (list1.rend()-1) );
	410
	411	it = list1.begin()+1;
	412	rit = list1.rbegin()+1;
	413	CPPUNIT_ASSERT( list1.begin() == (it-1) &&
	414	list1.rbegin() == (rit-1) );
	415
	416	CPPUNIT_ASSERT( ( list1.front() == 0 ) && ( list1.back() == COUNT - 1 ) );
	417
	418	list1.erase(list1.begin());
	419	list1.erase(list1.end()-1);
	420
	421	for ( it = list1.begin(), en = list1.end(), i = 1;
	422	it != en; ++it, ++i )
	423	{
	424	CPPUNIT_ASSERT( *it == i );
	425	}
	426	}