//chapter 13 page 137
// List ADT implementation

#include <iostream>

using namespace std;

const int MAX = 100;

class List
{
	int length;
	int data[MAX];		// assuming integer list
public:
	List() //  default constructor
	{
		length = 0;
	}
	int Length() const	//observer
	{
		return length;
	}
	bool IsEmpty() const	//observer
	{
		return length == 0;
	}
	bool IsFull() const	//observer
	{
		return length == MAX;
	}
	void Insert(int item)   //transformer
	{
		data[length] = item;
		length ++;
	}
	bool IsPresent(int item) const;		// prototype
	void Print() const   //observer
	{
		for(int i=0; i<length; i++)
			cout << data[i] << "   " ;	//prints out horizontally instead of vertically
		cout << endl;
	}
};

bool List :: IsPresent (int item) const
{	bool done = false;
	for(int i=0; i<length&&!done; i++)
		if(item == data[i])
			done = true;
	return done;
}

int main()
{	int item;

	// Q: declare a list obj. list1?
	List list1;
	// Q: output the length of list1?
	cout << "Length: " << list1.Length() << endl;
	// Q: insert 1 to the list?
	//List1.insert(1);
	//List1.insert(11);
	//List1.insert(7);
	//List1.insert(8);
	//check the length
	cout << "Length: " << list1.Length() << endl;	
	//Q: output the list to the screen.
	cout << "The list is:  ";
	list1.Print();

	//Q: check if 77 is in the list? out put the correct message
	if(list1.IsPresent(77) 
		cout << "77 is in the list.\n ";
	else
		cout <<"77 is not in the list.\n "; 
	//make interface for user to input item
	cout << "Input an integer:  ";
	cin >> item;	
	return 0;
};