//Implementation File:	smallLinked.cpp

#include "smallLinked.h"

	//List IMPLEMENTATION
list::list()	//Constructor
:	front(NULL), rear(NULL) //member initializer list
{
}
	
list & list::add_front (const int number)
{
	node * temp=new node;

	temp->data=number;
	temp->next=front;
	front=temp;

	if (rear==NULL)	//list empty to start
		rear=front;

	return *this;
}

bool list::empty() const
{
	return (front==NULL);
}

	//friend function IMPLEMENTATION
ostream & operator<< (ostream & out, list & L)
{
	node *temp;

	for (temp=L.front; temp!=NULL; temp=temp->next)
		out << temp->data << endl;

	return out;
}