Notes

#ifndef ARRAYLIST_HPP
#define ARRAYLIST_HPP

#include <iostream>
using namespace std;

template<typename Object>
class ArrayList(
private:
Object *items;
int length;
int capacity:
void reserve(int newCapasity){
Object *tmp = new Object[newCapasity];
for(int i = 0;i<capacity; i++){
tmp[i] = items[i];
}
delete [] items;
items=tmp;
capacity = newCapasity;


public:
ArrayList(){
length=0;
capacity =100;
items = new Object[capacity];
}
int size(){
return length;
}
bool isEmpty(){
return length == 0;
}
void add(const Object& item){
insert(length,item);
}
void insert(int index, const Object& item){
if(index< 0 || index > length) throw "Out of range";
if(length == capacity ) reserve(2*capacity);
for(int i=length-1;i>index;i--)items[i+1]=items[i];
items[index] = item;
length++;
}
int indexOf(const Object& item){
for(int index=0;index<length;index++){
if(items[index] == item) return index;
}
throw "item not found";
}
const Object& elementAt(int index){
if(index< 0 || index >= length) throw "Out of range";
return items[index];
}
const Object& first(){
if(isEmpty()) throw "List is empty";
return items[0];
}
const Object& last(){
if(isEmpty()) throw "List is empty";
return items[length-1];
}
void remove(const Object& item){
int index = indexOf(item);
removeAt(index);
}
void removeAt(int index){

}