[Igarden-commit] Garden/UnitTest LayoutDBTests.cpp, 1.1.2.1, 1.1.2.2

[Jeffrey B. <jlb...@us...>]

Update of /cvsroot/igarden/Garden/UnitTest
In directory sc8-pr-cvs2.sourceforge.net:/tmp/cvs-serv27856

Modified Files:
      Tag: Release_branch_v1
	LayoutDBTests.cpp 
Log Message:
Check in actual unit test (not stub to test the test harness)

Index: LayoutDBTests.cpp
===================================================================
RCS file: /cvsroot/igarden/Garden/UnitTest/Attic/LayoutDBTests.cpp,v
retrieving revision 1.1.2.1
retrieving revision 1.1.2.2
diff -C2 -d -r1.1.2.1 -r1.1.2.2
*** LayoutDBTests.cpp	12 Dec 2006 03:50:30 -0000	1.1.2.1
--- LayoutDBTests.cpp	12 Dec 2006 23:23:21 -0000	1.1.2.2
***************
*** 29,50 ****
  BasicTests::testCase1()
  {
! #if 0
! 	matCollItem_t	items[6];
  	long			n;
  	
! 	items[0].sortName = "Viburnum lantana";
! 	items[1].sortName = "Magnolia x soulangiana";
! 	items[2].sortName = "Larix decidua";
! 	items[3].sortName = "Tradescantia virginiana";
! 	items[4].sortName = "Kochia scoparia";
! 	items[5].sortName = "Monarda didyma";
  	
  	//	for(n = 0; n < 10; n++)
  	//		printf("Before A[%ld] = %ld\n", n, a[n]);
  	
! 	MyQsort(items, 0, 5);
! 	for(n = 0; n < 5; n++)
  		CPTAssert(items[n] <= items[n+1]);
- #endif
  }
  
--- 29,61 ----
  BasicTests::testCase1()
  {
! 	XGDynArray		items;
! 	matCollItem_t	*oneItem;
  	long			n;
  	
! 	oneItem = new matCollItem_t;
! 	oneItem->sortName = "Viburnum lantana";
! 	items.push_back(oneItem);
! 	oneItem = new matCollItem_t;
! 	oneItem->sortName = "Magnolia x soulangiana";
! 	items.push_back(oneItem);
! 	oneItem = new matCollItem_t;
! 	oneItem->sortName = "Larix decidua";
! 	items.push_back(oneItem);
! 	oneItem = new matCollItem_t;
! 	oneItem->sortName = "Tradescantia virginiana";
! 	items.push_back(oneItem);
! 	oneItem = new matCollItem_t;
! 	oneItem->sortName = "Kochia scoparia";
! 	items.push_back(oneItem);
! 	oneItem = new matCollItem_t;
! 	oneItem->sortName = "Monarda didyma";
! 	items.push_back(oneItem);
  	
  	//	for(n = 0; n < 10; n++)
  	//		printf("Before A[%ld] = %ld\n", n, a[n]);
  	
! 	QuicksortByName(items, 0, items.Length()-1);
! 	for(n = 0; n < items.Length()-1; n++)
  		CPTAssert(items[n] <= items[n+1]);
  }
  
***************
*** 52,56 ****
  BasicTests::testCase2()
  {
! 	CPTAssert(false);
  }
  
--- 63,67 ----
  BasicTests::testCase2()
  {
! //	CPTAssert(false);
  }