#include <string.h>
#define DefaultListSize 1024
template <class Elem>
class AList
{
		
	public:
		int maxSize;
		int listSize;
		int fence;
		Elem* listArray;
		AList(int size = DefaultListSize)
		{
			maxSize = size;
			listSize = fence = 0;
			listArray = new Elem[maxSize];
		}
		~AList() { delete [] listArray;}
		void clear()
		{
			delete []listArray;
			listSize = fence = 0;
			listArray = new Elem[maxSize];
		}
		bool insert (const Elem&);
		bool append (const Elem&);
		bool remove ();
		void setStart () { fence = 0;}
		void setEnd ()   {fence = listSize;}
		void prev ()     {if (fence != 0) fence--;}
		void next ()     {if (fence <= listSize) fence++;}
		int leftLength() const  {return fence;}
		int rightLength() const {return listSize - fence;}
		int findName(Elem& item);
		int findXY(Elem& item);
		bool setPos(int pos)
		{
			if ((pos>=0) && (pos<=listSize)) fence = pos;
			return (pos>=0) && (pos<=listSize);
		}
		bool getValue(Elem& it)const
		{
			if(rigthLength()==0)return false;
			else { it = listArray[fence]; return true;}
		}
};

template <class Elem>
bool AList<Elem>::insert (const Elem& item)
{
	if(listSize == maxSize)return false;
	for (int i=fence; i<listSize; i++)  //記錄后移
		listArray[i] = listArray[i-1];
	listArray[fence] = item;   //插入新記錄到指定位置
	listSize++;     //擁有記錄數增加
	return true;
}
template <class Elem>
bool AList<Elem>::append (const Elem& item)
{
	if(listSize == maxSize)return false;
	listArray[listSize++] = item;
	return true;
}
template <class Elem>
bool AList<Elem>::remove ()
{
	if (rightLength() == 0) return false;
	for (int i=fence; i<listSize-1; i++)
		listArray[i] = listArray[i+1];
	listSize--;
	return true;
}

template <class Elem>
int AList<Elem>::findName(Elem& item)
{
	for(int i=0; i<listSize; i++)
		if(listArray[i].name == item.name)  
			return i;
	return -1;
}

template <class Elem>
int AList<Elem>::findXY(Elem& item)
{
	for(int i=0; i<listSize; i++)
		if(listArray[i].x==item.x && listArray[i].y==item.y)  
			return i;
	return -1;
}