//
//	simplified vector class
//
//	Described in Chapter 8 of
//	Data Structures in C++ using the STL
//	Published by Addison-Wesley, 1997
//	Written by Tim Budd, budd@cs.orst.edu
//	Oregon State University
//

# ifndef sVector
# define sVector

# include <algo.h>

template <class T> class vector {
public:
	typedef T * iterator;
	
		// constructors
	vector	() { buffer = 0; reserve(0); }
	vector	(unsigned int size) { buffer = 0; resize(size); }
	vector	(unsigned int size, T initial)
					// some systems use fill_stl for fill command
				{ buffer = 0; resize(size); fill(begin(), end(), initial); }
	vector	(vector & v)
				{ buffer = 0; resize(v.size()); copy(v.begin(), v.end(), begin());}
	~vector	()	{ delete buffer; }
	
		// member functions
	T			back	()	{ return buffer[mySize-1]; }
	iterator	begin	()	{ return buffer; }
	int			capacity	() { return myCapacity; }
	iterator	end		()	{ return buffer + mySize; }
	bool		empty	()	{ return mySize == 0; }
	T			front	()	{ return buffer[0]; }
	void		pop_back () { mySize--; }
	void		push_back	(T value);
	void		reserve	(unsigned int newSize);
	void		resize	(unsigned int newSize)	{ reserve(newSize); mySize = newSize; }
	int			size	()	{ return mySize; }
		// operators
	T &		operator [ ] (unsigned int index) { return buffer[index]; }
private:
	unsigned int mySize;
	unsigned int myCapacity;
	T * buffer;
};

template <class T> void vector<T>::reserve (unsigned int newCapacity)
{
	if (buffer == 0) {
		mySize = 0;
		myCapacity = 0;
		}
	if (newCapacity <= myCapacity)
		return;
	T * newBuffer = new T [newCapacity];
	copy (buffer, buffer + mySize, newBuffer);
	myCapacity = newCapacity;
	delete buffer;
	buffer = newBuffer;
}

template <class T> void vector<T>::push_back (T value)
{
	if (mySize >= myCapacity)
		reserve(myCapacity + 5);
	buffer[mySize++] = value;
}

# endif