// SimpleList.cpp - wdg - 2008
// implementation code for a list of doubles
// uses partially filled array

#include <stdexcept>
using namespace std;

   template <class T>
   SimpleList<T>::SimpleList(int cap) : count(0), capacity(cap), A(new T[cap])
   {
   }

   template <class T>
   void SimpleList<T>::add(T item) 
   {
     if( count == capacity )
        throw invalid_argument("No room in list");
      A[count]=item;
      count++;
   }

   template <class T>
   T SimpleList<T>::getItem(int position) const
   {
     if( position<0 || position>=count)
        throw invalid_argument("Invalid position");
      return A[position];
   }

   template <class T>
   SimpleList<T> & SimpleList<T>::operator=(const SimpleList<T> & rhs) 
   {
     if ( this!= &rhs ) { // uses addressof operator so that compare pointers  
       capacity = rhs.capacity;
       count = rhs.count;
       delete [] A;
       A = new T[capacity];
       for(int i=0; i<count; i++)
          A[i] = rhs.A[i];
     }
     return *this;
   }