#include"simpleList.hpp"

simpleNode::simpleNode(int i) {
	data=i;
	next=nullptr;
}

void simpleNode::setData(int i) {
	data=i;
}

int simpleNode::getData() {
	return data;
}

void simpleNode::setNext(simpleNode *n){
	next=n;
}

simpleNode *simpleNode::getNext(){
	return next;
}
bool simpleNode::isLast(){
	return next==nullptr;
}

simpleList::~simpleList(){
	simpleNode *current;

	while(front!=nullptr){
		current=front;
		front=front->getNext();
		delete current;
	}
}

bool simpleList::isEmpty() {
	return front==nullptr;
}

bool simpleList::removeFromFront(int &item){
	simpleNode *tmp;
	if (isEmpty())
		return false;
	tmp=front;
	front=front->getNext();
	item=tmp->getData();
	delete tmp;
	return true;
}

bool simpleList::insertAtFront(int item) {
	simpleNode *tmp;

	tmp=new simpleNode(item);
	tmp->setNext(front);
	front=tmp;
	return true;
}