#include "linkedlist.h"

template<class T>
LinkedList<T>::LinkedList() {
  head = new ListNode();
  tail = new ListNode();
  tail->prev = head;
  head->next = tail;
  head->prev = NULL;
  tail->next = NULL;
}


template<class T>
void LinkedList<T>::add(const T &data) {
  ListNode *n = new ListNode();
  tail->prev->next = n;
  n->prev = tail->prev;
  tail->prev = n;
  n->next = tail;
  n->data = data;
}

template<class T>
bool LinkedList<T>::isEmpty() {
  return (head->next == tail);
}

template<class T>
void LinkedList<T>::remove(Iterator &i) {
  ListNode *n = i.current;
  i.next();
  n->prev->next = n->next;
  n->next->prev = n->prev;
  delete n;
}

int main(int argc, char *argv[]) {
  LinkedList<int> l;
  for (unsigned int i=0; i<10; i++) {
	l.add(i);
  }
  LinkedList<int>::Iterator i(l);
  while (i.isValid()) {
	std::cout<<i.data()<<std::endl;
	l.remove(i);
  }
  std::cout<<"second loop"<<std::endl;
  LinkedList<int>::Iterator j(l);
  while (j.isValid()) {
	std::cout<<j.data()<<std::endl;
	l.remove(j);
  }
  
}