using namespace std;
template<class T>
class MyArray
{
public:
MyArray(int capacity)
{
this->m_Capacity = capacity;
this->m_Size = 0;
this->pAddress = new T[this->m_Capacity];
}
~MyArray()
{
if (this->pAddress != NULL)
{
delete[] this->pAddress;
this->pAddress = NULL;
this->m_Capacity = 0;
this->m_Size = 0;
}
}
//Copy function (deep copy)
MyArray(const MyArray& arr)
{
this->pAddress = new T[arr.m_Capacity];
this->m_Capacity = arr.m_Capacity;
this->m_Size = arr.m_Size;
for (int i = 0; i < arr.m_Size; i++)
{
this->pAddress[i] = arr[i];
}
}
//Equal sign overload
MyArray& operator=(const MyArray &arr)
{
if (this->pAddress != NULL)
{
delete[] this->pAddress;
this->pAddress = NULL;
this->m_Capacity = 0;
this->m_Size = 0;
}
this->pAddress = new T[arr.m_Capacity];
this->m_Capacity = arr.m_Capacity;
this->m_Size = arr.m_Size;
for (int i = 0; i < arr.m_Size; i++)
{
this->pAddress[i] = arr[i];
}
return *this;
}
//Overload[] to get any value
T& operator[](const int index)
{
return this->pAddress[index];
}
//The value added by the tail insertion method
void Push_back(const T& val)
{
if (this->m_Size == this->m_Capacity)
{
return;
}
this->m_Size++;
this->pAddress[this->m_Size] = val;
}
//The value is deleted by the tail deletion method
void Pop_back()
{
if (this->m_Size == 0)
{
return;
}
this->m_Size--;
}
int getCapacity()
{
return this->m_Capacity;
}
int getSize()
{
return this->m_Size;
}
private:
int m_Capacity;
int m_Size;
T* pAddress;
};