// Copyright (c) 1994-2009 Nokia Corporation and/or its subsidiary(-ies).

// All rights reserved.

// This component and the accompanying materials are made available

// under the terms of the License "Eclipse Public License v1.0"

// which accompanies this distribution, and is available

// at the URL "http://www.eclipse.org/legal/epl-v10.html".

//

// Initial Contributors:

// Nokia Corporation - initial contribution.

//

// Contributors:

//

// Description:

// e32test\buffer\int_arr.cpp

// 

//

#include <e32test.h>

#include <e32math.h>

#define NUM_TESTS 500

GLREF_D RTest test;

GLREF_C TInt Random();

struct SInt

	{

	SInt(TInt a) {i=a;}

	operator TInt() {return i;}

	TInt i;

	};

LOCAL_C TInt IntAppendAndAccessTest(TInt aCount, TInt aNumTests, TInt aRange)

	{

	TInt n;

	for (n=0; n<aNumTests; n++)

		{

		RArray<TInt> a;

		TInt *pA=(TInt*)User::Alloc(aCount*sizeof(TInt));

		if (!pA)

			{

			a.Close();

			return -65535;

			}

		TInt i;

		for (i=0; i<aCount; i++)

			{

			TInt x=Random()&aRange;

			a.Append(x);

			pA[i]=x;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			return -1;

			}

		for (i=0; i<aCount; i++)

			{

			if (a[i]!=pA[i])

				{

				a.Close();

				return -2;

				}

			TInt x=Random()&aRange;

			a[i]=x;

			pA[i]=x;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			return -3;

			}

		for (i=0; i<aCount; i++)

			{

			if (a[i]!=pA[i])

				{

				a.Close();

				return -4;

				}

			}

		delete pA;

		a.Close();

		}

	return KErrNone;

	}

LOCAL_C TInt IntRemoveTest()

	{

	TInt m=32;

	TInt n=m*m+1;

	RArray<TInt> a;

	TInt i;

	for (i=0; i<n; i++)

		{

		a.Append(i);

		}

	TInt p=2;

	for (i=2; i<=m; i++)

		{

		TInt j;

		for (j=0; j<(2*i-2); j++)

			{

			a.Remove(p);

			}

		p++;

		}

	if (a.Count()!=m+1)

		{

		a.Close();

		return -1;

		}

	for (i=0; i<m; i++)

		{

		if (a[i]!=i*i)

			{

			a.Close();

			return -2;

			}

		}

	a.Close();

	return KErrNone;

	}

LOCAL_C TInt IntFindTest(TInt aCount, TInt aNumTests, TInt aRange)

	{

	TInt n;

	for (n=0; n<aNumTests; n++)

		{

		RArray<TInt> a;

		TInt *pA=(TInt*)User::Alloc(aCount*sizeof(TInt));

		if (!pA)

			{

			a.Close();

			return -65535;

			}

		TInt i;

		for (i=0; i<aCount; i++)

			{

			TInt x=Random()&aRange;

			a.Append(x);

			pA[i]=x;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			return -1;

			}

		for (i=0; i<aCount; i++)

			{

			TInt r=a.Find(pA[i]);

			if (r<0 || pA[r]!=pA[i] || r>i)

				{

				a.Close();

				return -2;

				}

			TInt x=Random()&aRange;

			r=a.Find(x);

			if (r<0)

				{

				TInt j;

				for (j=0; j<aCount; j++)

					{

					if (pA[j]==x)

						{

						a.Close();

						return -3;

						}

					}

				}

			else if (pA[r]!=x)

				{

				a.Close();

				return -4;

				}

			else

				{

				TInt j;

				for (j=0; j<r; j++)

					{

					if (pA[j]==x)

						{

						a.Close();

						return -5;

						}

					}

				}

			}

		delete pA;

		a.Close();

		}

	return KErrNone;

	}

LOCAL_C TInt IntFindInOrderTest(TInt aCount, TInt aNumTests, TInt aRange)

// require aRange*aCount<2^32

	{

	TInt n;

	for (n=0; n<aNumTests; n++)

		{

		RArray<TInt> a;

		TInt *pA=(TInt*)User::Alloc(aCount*sizeof(TInt));

		if (!pA)

			{

			a.Close();

			return -65535;

			}

		TInt i=0;

		TInt y=-256;

		for(i=0; i<aCount; i++)

			{

			TInt x=Random()&aRange;	// this is always >=0

			a.Append(y);

			pA[i]=y;

			y+=x;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			return -1;

			}

		for (i=0; i<aCount; i++)

			{

			TInt r=a.FindInOrder(pA[i]);

			if (r<0 || pA[r]!=pA[i])

				{

				a.Close();

				return -2;

				}

			TInt x=Random()&aRange;

			r=a.FindInOrder(x);

			if (r<0)

				{

				TInt j;

				for (j=0; j<aCount; j++)

					{

					if (pA[j]==x)

						{

						a.Close();

						return -3;

						}

					}

				}

			else if (pA[r]!=x)

				{

				a.Close();

				return -4;

				}

			}

		delete pA;

		a.Close();

		}

	return KErrNone;

	}

LOCAL_C TInt IntFindInOrderTest2()

	{

	TInt i;

	RArray<TInt> sq;

	for (i=0; i<1024; i++)

		{

		TInt j=i*i;

		sq.Append(j);

		}

	for (i=0; i<10000; i++)

		{

		TInt x=Random()&1023;

		TInt y=x*x;

		TInt r=sq.FindInOrder(y);

		if (r!=x)

			{

			sq.Close();

			return -1;

			}

		}

	sq.Close();

	return 0;

	}

LOCAL_C TInt IntInsertInOrderTest(TInt aCount, TInt aNumTests, TInt aRange)

	{

	TInt n;

	for (n=0; n<aNumTests; n++)

		{

		RArray<TInt> a;

		RArray<TInt> b;

		RArray<TInt> c;

		TInt i;

		TInt cc=0;

		for (i=0; i<aCount; i++)

			{

			TInt x=Random()&aRange;

			a.Append(x);

			b.InsertInOrderAllowRepeats(x);

			TInt r=c.InsertInOrder(x);

			if (r==KErrNone)

				cc++;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			b.Close();

			c.Close();

			return -1;

			}

		if (b.Count()!=aCount)

			{

			a.Close();

			b.Close();

			c.Close();

			return -2;

			}

		for (i=0; i<aCount-1; i++)

			{

			if (b[i]>b[i+1])

				{

				a.Close();

				b.Close();

				c.Close();

				return -3;

				}

			}

		for (i=0; i<aCount; i++)

			{

			if (a.Find(b[i])<0)

				{

				a.Close();

				b.Close();

				c.Close();

				return -4;

				}

			if (b.Find(a[i])<0)

				{

				a.Close();

				b.Close();

				c.Close();

				return -5;

				}

			if (c.Find(a[i])<0)

				{

				a.Close();

				b.Close();

				c.Close();

				return -6;

				}

			}

		if (c.Count()!=cc)

			{

			a.Close();

			b.Close();

			c.Close();

			return -7;

			}

		for (i=0; i<c.Count()-1; i++)

			{

			if (c[i]>=c[i+1])

				{

				a.Close();

				b.Close();

				c.Close();

				return -8;

				}

			if (a.Find(c[i])<0)

				{

				a.Close();

				b.Close();

				c.Close();

				return -9;

				}

			}

		a.Close();

		b.Close();

		c.Close();

		}

	return KErrNone;

	}

LOCAL_C TInt IntInsertInOrderTest2()

	{

	TInt i;

	RArray<TInt> sq;

	for (i=0; i<1024; i++)

		{

		TInt j=i*i;

		sq.InsertInOrder(j);

		sq.InsertInOrder(-j);

		}

	if (sq.Count()!=2047)

		{

		sq.Close();

		return -1;

		}

	for (i=0; i<2047; i++)

		{

		TInt y=0;

		if (i<1023)

			y=-(1023-i)*(1023-i);

		else if (i==1023)

			y=0;

		else if (i>1023)

			y=(i-1023)*(i-1023);

		if (sq[i]!=y)

			{

			sq.Close();

			return -2;

			}

		}

	sq.Close();

	return 0;

	}

LOCAL_C TInt IntSortTest(TInt aCount, TInt aNumTests, TInt aRange)

	{

	TInt n;

	for (n=0; n<aNumTests; n++)

		{

		RArray<TInt> a;

		RArray<TInt> b;

		TInt i;

		for (i=0; i<aCount; i++)

			{

			TInt x=Random()&aRange;

			a.Append(x);

			b.InsertInOrderAllowRepeats(x);

			}

		a.Sort();

		if (a.Count()!=aCount)

			{

			a.Close();

			b.Close();

			return -1;

			}

		if (b.Count()!=aCount)

			{

			a.Close();

			b.Close();

			return -2;

			}

		for (i=0; i<aCount; i++)

			{

			if (a[i]!=b[i])

				{

				a.Close();

				b.Close();

				return -3;

				}

			}

		a.Close();

		b.Close();

		}

	return KErrNone;

	}

LOCAL_C TInt SIntAppendAndAccessTest(TInt aCount, TInt aNumTests, TInt aRange)

	{

	TInt n;

	for (n=0; n<aNumTests; n++)

		{

		RArray<SInt> a;

		TInt *pA=(TInt*)User::Alloc(aCount*sizeof(TInt));

		if (!pA)

			{

			a.Close();

			return -65535;

			}

		TInt i;

		for (i=0; i<aCount; i++)

			{

			TInt x=Random()&aRange;

			a.Append(x);

			pA[i]=x;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			return -1;

			}

		for (i=0; i<aCount; i++)

			{

			if (a[i]!=pA[i])

				{

				a.Close();

				return -2;

				}

			TInt x=Random()&aRange;

			a[i]=x;

			pA[i]=x;

			}

		if (a.Count()!=aCount)

			{

			a.Close();

			return -3;

			}

		for (i=0; i<aCount; i++)

			{

			if (a[i]!=pA[i])

				{

				a.Close();

				return -4;

				}

			}

		delete pA;

		a.Close();

		}

	return KErrNone;

	}

LOCAL_C TInt SIntRemoveTest()

	{

	TInt m=32;

	TInt n=m*m+1;

	RArray<SInt> a;

	TInt i;

	for (i=0; i<n; i++)

		{

		a.Append(i);

		}

	TInt p=2;

	for (i=2; i<=m; i++)

		{

		TInt j;

		for (j=0; j<(2*i-2); j++)

			{

			a.Remove(p);

			}

		p++;

		}

	if (a.Count()!=m+1)