/*
 * Portions of this code have been borrowed from
 * http://ww3.datastructures.net/
 * Copyright © 2003, Michael T. Goodrich, Roberto Tamassia, and David M. Mount. 
 */

#include "Deque.h"

template <typename Object>
void Deque<Object>::insertFirst(const Object& e) {		
	NodePtr oldFirst = header->next;
    NodePtr t = new Node(e, header, oldFirst);
    oldFirst->prev = t;
    header->next = t;
    sz++;
}

template <typename Object>
void Deque<Object>::print() {
	NodePtr tmp = header->next;
	while(tmp != trailer) {
		cout << tmp->element << "\n";
		tmp = tmp->next;
	}
	
}