Question

I'm just not sure how to tackle all the template class this header wants me to write. I got this far into making the template for public and private and would like help on the template functions. Thank you! This is in C++ by the way.

#include <iostream>
#include <cassert>

using namespace std;

#ifndef ARRAYLIST_H
#define ARRAYLIST_H

template<typename T>
class arrayList
{
public:
   arrayList();
//Constructor with default parameter.
//Sets maxSize = 100 and length = 0 if no parameter is provided
//Sets maxSize = <n> and length = 0 if <n> is provided and it is larger than 0 (otherwise use default value)
   arrayList(int = 100);
  
   //Copy constructor.
   //Must achieve deep copy of original arrayList
   arrayList(const arrayList<T>&);
  
   //Overloaded assignment operator =.
   //Must achieve deep copy of original arrayList
   arrayList<T>& operator=(const arrayList<T>&);
  
   //isEmpty returns true if list is empty, false otherwise
   bool isEmpty() const;
  
   //isEmpty returns true if list is full, false otherwise
   bool isFull() const;
  
   //Return length
   int listSize( ) const;
  
   //Return maxSize
   int maxListSize( ) const;
  
   //Print all elements in the list separated by a single space
   void print() const;
  
   //Empty list
   void clearList( );
  
   //Remove from list item at a given position.
   //If position is out of bounds, print an error message.
   void removeAt(int);
  
   //Remove from list an item.
   //If the item is not found, or if list is empty, print an error message.
   void remove(const T&);
  
   //Add item to list preserving ascending order.
   //If list is full, print an error message.
   void insert(const T&);
  
   //Access an item in the list at a given position.
   //If position is out of bounds, print an error message.
   //Otherwise, return found item in parameter d.
   void retrieveAt(int pos, T& d) const;
  
   //Search an item in the list and return its position.
   //If not found, return -1;
   int search(const T&) const;
   ~arrayList( );

private:
   T* list;
   int length;
   int maxSize;
};

#endif

//Write your functions below

Answer 1

template<typename T>
arrayList<T>::arrayList()
{
   // no instruction given
}
template<typename T>
arrayList<T>::arrayList(int n = 100) {
   maxSize = n;
   length = 0;
   list = new int[maxSize];
}
template<typename T>
arrayList<T>::arrayList(const arrayList<T>& x) {
   list = x.list;
   maxSize = x.maxSize;
   length = x.length;
   list = new T[maxSize];
   for (int k = 0; k<x.length; k++)
   {
       list[k] = x.list[k];
   }
}
template <typename T>
arrayList<T>& arrayList<T>::operator=(const arrayList<T>& rhs)
{
   T *tmp;
   tmp = new T[rhs.maxSize];
   for (int i = 0; i< rhs.length; i++)
   tmp[i] = rhs.list[i];
   delete[] list;
   list = tmp;
   length = rhs.length;
   maxSize = rhs.maxSize;
   return *this;
}
template <typename T>
bool arrayList<T>::isEmpty() const
{
   return (length == 0 ? true : false);
}

template <typename T>
bool arrayList<T>::isFull() const
{
   return (length == maxSize ? true : false);
}
template <typename T>
int arrayList<T>::listSize() const
{
   return length;
}
template <typename T>
void arrayList<T>::clearList()
{
   maxSize = 0;
   length = 0;
   delete[] list;
   list = NULL;
}
template<typename T>
void arrayList<T>::removeAt(int index)
{
   for (int i = index; i<length; i++)
       list[i] = list[i + 1];
   length--;
}
template<typename T>
void arrayList<T>::remove(const T & t)
{
   for (int i = 0; i < length; i++)
   {
       if (list[i] == t)
       list[i] = list[i + 1];
   }
   length--;
}
template<typename T>
void arrayList<T>::insert(const T & val)
{
   if (length < maxSize) {
       list[length] = val;
       length = length + 1;
      
       for (int i = 1; i < length; i++) {
           int temp = list[i];
           int j = i - 1;
           while (j >= 0 && list[j] > temp) {
               list[j + 1] = list[j];
               j--;
           }
           list[j + 1] = temp;
       }
   }
   else {
       cout << "Full" << endl;
   }

  
}
template<typename T>
void arrayList<T>::retrieveAt(int pos, T & d) const
{
   if (pos > length) {
       cout < , "Error out of bound ";
       return 0;
   }
   else {
       d = list[pos];
       return d;
   }
}
template<typename T>
int arrayList<T>::search(const T & x) const
{

int found = 1;
   for (int k = 0; k < length; k++)
   {
       if (list[k] == x)
       {
           found= k;
           break;
       }
       else {
           found=-1;
       }
   }
   if (found == -1) {
       return -1;
   }
   else {
       return found;
   }

   }
  
}
template<typename T>
arrayList<T>::~arrayList()
{

}
template <typename T>
int arrayList<T>::maxListSize() const
{
   return maxSize;
};

template <typename T>
void arrayList<T>::print() const {
   for (int i = 0; i < length; i++) {
       cout << list[i] << " ";
   }
   cout << endl;
}

IF YOU HAVE ANY QUERY PLEASE COMMENT DOWN BELOW

PLEASE HIT THE LIKE BUTTON