/* 
file: ttest.cc
*/
#include "ttest.h"
#include <stdio.h>
#include <time.h>
#include <stdlib.h>

#define LUNG 5000
static int V[LUNG];
static char buff[128];
typedef VDKBtree<int> intbt;
typedef VDKValueList<int> intlist;

////////////////////////////////////////
DEFINE_SIGNAL_LIST(BTreeWindow,VDKForm);
///////////////////////////////////
int main (int argc, char *argv[])   
{ 
  MyApp app(&argc, argv); 
  app.Run();      
  return 0;  
}
//////////////////////////////////

/*
 */
void    
BTreeWindow::Setup() 
{
  text = new VDKText(this);
  text->Font = new VDKFont(this,fnCourier12);
  Add(text);
  sprintf(buff,"Tests with %d <int> nodes",LUNG);
  VDKBox* hbox = new VDKBox(this,h_box);
  hbox->Add(start = new VDKLabelButton(this,buff));
  hbox->Add(showsource = new VDKLabelButton(this,"Show source"));
  hbox->Add(quit = new VDKLabelButton(this,"Quit"));
  Add(hbox,l_justify,false,false,false);
  SetUsize(VDKPoint(450,400));
  SignalConnect(start,"clicked",&BTreeWindow::Start);
  SignalConnect(showsource,"clicked",&BTreeWindow::ShowSource);
  SignalConnect(quit,"clicked",&BTreeWindow::Quit);
}

/*
 */
bool
BTreeWindow::ShowSource(VDKObject*)
{
text->Clear();
text->LoadFromFile("ttest.cc");
return true;
}
/*
 */
bool
BTreeWindow::Start(VDKObject*)
{
  intbt btree;
  intlist list;
  // random initialize vector
  int t;
  text->Clear();
  srand(time(NULL));
  text->TextInsert("\n** TEST BEGINS **");
  sprintf(buff,"\nRandom initializing %d nodes",LUNG);
  text->TextInsert(buff);
  for (t=0;t<LUNG;t++)
      V[t]=random()%100;
  // add nodes to btree 
  sprintf(buff,"\nadding %d nodes to btree...",LUNG);
  text->TextInsert(buff);
  for (t=0;t<LUNG;t++)
      btree.add(V[t]);
  sprintf(buff,"\n\ttree size:%u",btree.size());
  text->TextInsert(buff);
  // add items to list
  sprintf(buff,"\nadding %d sorted items to list...",LUNG);
  text->TextInsert(buff);
  for (t=0;t<LUNG;t++)
      list.insert(V[t]);
  sprintf(buff,"\n\tlist size:%u",list.size());
  text->TextInsert(buff);
  // makes an heap using vector
  text->TextInsert("\nmaking an heap & sorting...");
  VDKHeap<int> heap(V,LUNG);
  heap.Sort();
  text->TextInsert("\n\tdone.");
  // checks tree vs heap
  // if all tree nodes match heap nodes
  text->TextInsert("\nchecking tree vs heap...");
  // make a btree iterator 
  // iterator begins from lowest key
  intbt::Iterator iter(btree,BtMinKey);
  for(t=0; (t < heap.size()) && iter;t++,iter++)
    {
      if( (iter.current() != heap[t]))
	{
	  text->TextInsert("\nbad tree construct");
	  break;
	}
    }
  // if loop was broken before match not found
  if(t<heap.size())
    text->TextInsert("\n\tbtree test break before end");
  else
    text->TextInsert("\n\tdone, btree and heap match");
  // checks list vs heap
  text->TextInsert("\nchecking list vs heap...");
  // makes a list iterator
  // iterator begins from list head
  VDKValueListIterator<int> liter(list);
  for(t=0; (t < heap.size()) && liter;t++,liter++)
    {
      if(liter.current() != heap[t] )
	{
	  text->TextInsert("\n\tbad list construct");
	  break;
	}
    }
  if(t < heap.size())
    text->TextInsert("\n\tlist test break before end");
  else
    text->TextInsert("\n\tdone, list and heap match");
  // test search on Btree
  text->TextInsert("\nSearch test on btree:");
  for(t=0; t < heap.size() ;t++)
    {
      if(! btree.find(heap[t]) )
	  break;
    }
  if(t < heap.size())
    text->TextInsert("\n\ttest break before end");
  else
    text->TextInsert("\n\tdone, test ok");
  // tests search on List
  text->TextInsert("\nSearch test on list:");
  for(t=0; t < heap.size();t++)
    {
      if(! list.find(heap[t]) )
	  break;
    }
  if(t < heap.size())
    text->TextInsert("\n\ttest break before end");
  else
    text->TextInsert("\n\tdone, test ok");
  // removes all keys from Btree
  text->TextInsert("\nRemoving all nodes from btree:");
  for(t=0; t < heap.size();t++)
      btree.unlink(heap[t]); 
  // should be 0
  sprintf(buff,"\n\ttree size:%d",btree.size());
  text->TextInsert(buff);
  // removes all keys from list
  text->TextInsert("\nRemoving all items from list:");
  for(t=0; t < heap.size();t++)
    {
      // finds heap[t] ordinal position into list
      int pos = list.at(heap[t]); 
      // if at() fails returns -1
      if(pos >= 0)
	list.unlink(pos);  
    }
  sprintf(buff,"\n\tlist size:%d",list.size());
  text->TextInsert(buff);
  text->TextInsert("\n** TEST END **");
return true;
}