arraytest.java

Last week I posted an article on a simple C++ template class, XYDataArray, I used in my system devel

import java.util.*;

class ArrayTest
{
	public static void main (String[] args)
	{
		// initialize the data array with random integers
		int nSize = 640*1024;
		XYObjArray testArray = new XYObjArray();
		testArray.SetSize(nSize,64);
		for(int i=0;i<nSize;i++) 
		{
			testArray.SetAt(i,new TestObj(XYObjArray.GetRandomInt(nSize),i));
		}

		// sort the data array, change bAscending to fals to sort in descending order
		boolean bAscending = true;
		System.out.println("array size = "+testArray.GetSize());
		System.out.println("sort ...");
		System.out.println("begin: "+new Date().toString());
		testArray.Sort(bAscending?1:(-1));
		//Arrays.sort(testArray.GetDataPtr(),0,nSize);
		System.out.println("  end: "+new Date().toString());
		
		// verify that the sort is done correctly
		for(int k=1;k<nSize;k++)
		{
			TestObj obj1 = (TestObj)testArray.GetAt(k);
			TestObj obj2 = (TestObj)testArray.GetAt(k-1);
			Comparable ref1 = (Comparable)obj1;
			if(bAscending&&(ref1.compareTo(obj2)<0||obj1.m_nIndex<obj2.m_nIndex&&ref1.compareTo(obj2)==0)||!bAscending&&(ref1.compareTo(obj2)>0||obj1.m_nIndex<obj2.m_nIndex&&ref1.compareTo(obj2)==0))
			{
				System.out.println("Error in sorting!\n");
				return;
			}
		}

		// find a randomly generated object in the existing array
		TestObj obj = new TestObj(XYObjArray.GetRandomInt(nSize),-1);
		System.out.println("seach ...");
		System.out.println("begin: "+new Date().toString());
		int nIndex = testArray.Find(obj);
		System.out.println("  end: "+new Date().toString());
		if(nIndex>=0)
		{
			System.out.println("found: ");
			System.out.println(obj.m_nData+", "+obj.m_nIndex);
			System.out.println(((TestObj)testArray.GetAt(nIndex)).m_nData+", "+((TestObj)testArray.GetAt(nIndex)).m_nIndex);
		}
		else
		{
			System.out.println("not found: ");
			System.out.println(obj.m_nData+", "+obj.m_nIndex);
		}
	}
}