prog4.cpp

#ifndef PROG4_CPP
#define PROG4_CPP

#include <iostream>
#include <string.h>
#include "global.h"
#include "binTree.h"
#include "item.h"
#include "binTree.cpp"
#include "store_functions.cpp"
#include "item.cpp"

bool debugRead = false;
void ReadData(Tree *cleanTree);
void instructions();
//void addStore(ItemPtr itPtr, StorePtr newStore);



//use mainly as a driver function
int main () //Author: Alexi
{
	Tree *itemTree; 
	itemTree = new Tree();
	
	/*
	int testChoice;
	instructions();
	cin>>testChoice;
	//driver test function
	switch (testChoice) 
	{
	case 0: 
	  {
	    ItemPtr L1 = new Item("L1");
	    ItemPtr L2 = new Item("L2");
	    ItemPtr M2 = new Item("M2");
	    ItemPtr L2_2 = new Item("L2");
	    
	    cout<<"Compare " << (L1->getName()) << " and " << (L2->getName()) <<": "<< L1->id_compare(L2) << endl; //should return -1
	    cout<<"Compare M2 and L2: "<< M2->id_compare(L2)<<endl; //should return 1
	    cout<<"Compare L2 and L2: "<< L2->id_compare(L2_2) <<endl; //should return 0
	  }
	  break;
	case 1: //Test store_compare
	  cout << "store_compare test here\n";
	  {
	    Store s0 = {0,0,0, 4, NULL};
	    Store s1 = {1, 1, 1, 3, NULL};
	    Store s2 = {2, 2, 1, 3, NULL};
	    Store s3 = {1, 1, 1, 3, NULL};

	    cout<<"Compare 4 items and 3 items: "<<store_compare(&s0, &s1) << endl;
	    cout<<"Compare 3 items and 4 items: "<<store_compare(&s1, &s0)<<endl;
	    cout<<"Compare 3 items and 3 items (diff location): "<<store_compare(&s1, &s2)<<endl;
	    cout<<"Compare 3 items and 3 items (same location): "<<store_compare(&s1, &s3)<<endl;
	  }
	  break;
	case 2: //test addItem. Seems to work fine
	  cout<<"\nTesting addItem\n";
		{
		ItemPtr L1 = new Item("L1");
	    ItemPtr L2 = new Item("L2");
	    ItemPtr M2 = new Item("M2");
	    ItemPtr L2_2 = new Item("L2");
		ItemPtr A7 = new Item("A7");
	    ItemPtr S2 = new Item("S2");
		
		Store s0 = {0,0,0, 4, NULL};
	    Store s1 = {1, 1, 1, 3, NULL};
	    Store s2 = {2, 2, 1, 3, NULL};
	    Store s3 = {1, 1, 1, 3, NULL};
		
		cout << "Testing item:\n";
		L1->printItem();
		L2->printItem();
		M2->printItem();
		cout << "Adding to tree\n";
		
		itemTree->addItem(L2, &s0);
		cout<<"Added first successfully\n";
		cout << "Printing Tree:\n\n";
		itemTree->PrintTree();
		
		itemTree->addItem(M2, &s1);
		cout<<"Added second successfully\n";
		cout << "Printing Tree:\n\n";
		itemTree->PrintTree();
		
		itemTree->addItem(L1, &s2);
		cout<<"Added third successfully\n";
		cout << "Printing Tree:\n\n";
		itemTree->PrintTree();
		
		itemTree->addItem(L2_2, &s3);
		cout<<"Added fourth successfully\n";
		cout << "Printing Tree:\n\n";
		itemTree->PrintTree();
		
		itemTree->addItem(A7, &s2);
		cout<<"Added fourth successfully\n";
		cout << "Printing Tree:\n\n";
		itemTree->PrintTree();
		
		itemTree->addItem(S2, &s2);
		cout<<"Added fifth successfully\n";
		cout << "Printing Tree:\n\n";
		itemTree->PrintTree();
		}
		break;
	case 3: //tests basic addStore
	  cout << "\nTesting addStore\n";
	  {
	    ItemPtr L1 = new Item("L1");
	    ItemPtr L2 = new Item("L2");
	    ItemPtr M2 = new Item("M2");
	    ItemPtr L2_2 = new Item("L2");
	    
	    Store s0 = {0,0,0, 4, NULL};
	    Store s1 = {1, 1, 1, 5, NULL};
	    Store s2 = {2, 2, 1, 6, NULL};
	    Store s3 = {1, 1, 1, 7, NULL};
	    
	    cout<<"Printing store list for L1:\n";
	    printStoreList((L1->getStores()));
	    
	    cout << "Going to add following store\n";
	    printStore(&s0);
	    cout<<endl;
	    addStore(L1, &s0);
	    
	    //cout<<"printing store list now"<<endl;
	    
	    printStoreList(L1->getStores());
	    
	    cout<<endl;
	    addStore(L1, &s1);
	    printStoreList(L1->getStores());
	    
	    cout<<endl;
	    addStore(L1, &s2);
	    cout<<"printed third store"<<endl;
	    
	    cout<<endl;
	    addStore(L1, &s3);
	    cout << "Printing store list\n";
	    printStoreList(L1->getStores());

		}
		break;
	case 4: //tests addStore on tree
		cout << "\nTesting addStore\n";
		{
		ItemPtr L1 = new Item("L1");
	    ItemPtr L2 = new Item("L2");
	    ItemPtr M2 = new Item("M2");
	    ItemPtr L2_2 = new Item("L2");
		
		Store s0 = {0,0,0, 4, NULL};
	    Store s1 = {1, 1, 1, 3, NULL};
	    Store s2 = {2, 2, 1, 3, NULL};
	    Store s3 = {1, 1, 1, 6, NULL};
		
		cout << "Adding " << L2->getName() << " and store\n";
		printStore(&s0);
		cout <<endl;
		itemTree->addItem(L2, &s0);
		cout<<"Added first successfully, item at root is:\n";
		itemTree->getRoot()->printItem();
		cout<<"Printing store list:\n";
		printStoreList(((*itemTree).getRoot())->getStores());
		cout<<endl;
		
		cout << "Adding " << M2->getName() << " and store\n";
		printStore(&s1);
		cout <<endl;
		itemTree->addItem(M2, &s1);
		cout<<"Added second successfully\n";
		cout<<"Printing store list:\n";
		printStoreList(((*itemTree).getRoot())->getStores());
		cout<<endl;
		
		cout << "Adding " << L1->getName() << " and store\n";
		printStore(&s2);
		cout <<endl;
		itemTree->addItem(L1, &s2);
		cout<<"Added third successfully\n";
		cout<<"Printing store list:\n";
		printStoreList(((*itemTree).getRoot())->getStores());
		cout<<endl;
		
		cout << "Adding " << L2_2->getName() << " and store\n";
		printStore(&s3);
		cout <<endl;
		itemTree->addItem(L2_2, &s3);
		cout<<"Added fourth successfully\n";
		cout<<"Printing store list:\n";
		printStoreList(((*itemTree).getRoot())->getStores());
		}
		break;
	case 5: //test readData
		cout << "\nTesting ReadData\n";
		{
			ReadData(*itemTree);
			cout << "Read Data completing properly:\n";
			itemTree->PrintTree();
		}
	default:
	  cout<<"Improper or no test chosen\n";
	  break;
	} */
	
	//code for after testing is complete	
	ReadData(itemTree);
	//cout << "Read Data completing properly:\n";
	itemTree->PrintTree();
	
	return 0;
}

void ReadData(Tree *cleanTree) //Author: Alexi
{
	Tree tree = *cleanTree;
	int Sentinel = 0, counter = 0, itemCount = 0;
	string name;
	Store tempStore;
	
	while (Sentinel != 2)  //Going to represent 16 16 16, need to rework logic slightly
	{
		int x, y, z, itemNumber;
		x = 0;
		y = 0;
		z = 0;
		itemNumber = 0;
		
		//cout << "Reading in data\n";
		cin>>x; 
		if (x==16)
		  Sentinel++;
		cin>>y;
		if (y==16)
		  Sentinel++;
		cin>>z;
		if (z==16)
		  Sentinel++;
		if (Sentinel==3){
		  break;
		} else {
		  Sentinel=0;
		}
		cin>>itemNumber;

		for (counter = 0; counter < itemNumber; counter++)
		{
		  name = " ";
		  itemCount = 0;
		  
		  cin>>name;
		  cin>>itemCount;

		  StorePtr tempStorePtr = new Store();
		  tempStorePtr->x = x;
		  tempStorePtr->y = y;
		  tempStorePtr->z = z;
		  tempStorePtr->itemCount = itemCount;
		  tempStorePtr->nextStore = NULL;
		  //Store tempStore = *tempStorePtr;
		  ItemPtr tempItem = new Item(name);
			
			if (debugRead){
				cout << "\nPrinting temporary item and store\n";
				tempItem->printItem();
				printStore(tempStorePtr);
			}
			if (debugRead){
			  //tree.PrintTree();
			  cout << "Adding item:\n";
			}
			tree.addItem(tempItem, tempStorePtr); 
			//cout << "\n TREE \n";
			//tree.PrintTree();
		}
		if (debugRead)
			cout << "Printing tree:\n";
		
	} //end for
	//tree.PrintTree();
	*cleanTree = tree;
} //end ReadData

void instructions() //Author: Alexi
{
	cout <<"Choice of 0 currently tests: id_compare\n";
	cout << "Choice of 1 currently tests: store_compare" << endl;
	cout << "Choice of 2 currently tests: addItem and PrintTree\n";
	cout << "Choice of 3 currently tests: addStore and printStores()\n";
	cout << "Choice of 4 currently tests: addItem and addStore on tree\n";
	cout << "Choice of 5 currently tests: ReadData()\n";
	cout <<"Please enter a test choice:";
}
#endif