#include "homeworklist.h"
homeworklist::homeworklist()
{
	current_size = 0;
}
bool homeworklist::add(homework h)
{
	if(current_size >= LIST_MAX)
		return false;
	list[current_size++] = h;
	return true;
}
homeworklist homeworklist::dueon(date d)
{
	homeworklist hwtemp;
	for(int i = 0 ;i<current_size; i++)
		if(list[i].compareTo(homework("temp",date(),d)) == 0)
			hwtemp.add(list[i]);
	return hwtemp;			
}
homeworklist homeworklist::dueafter(date d)
{	
	homeworklist hwtemp;
	for(int i = 0 ;i<current_size; i++)
		if(list[i].compareTo(homework("temp",date(),d)) == 1)
			hwtemp.add(list[i]);
	return hwtemp;
}
homeworklist homeworklist::duebefore(date d)
{
	homeworklist hwtemp;
	for(int i = 0 ;i<current_size; i++)
		if(list[i].compareTo(homework("temp",date(),d)) == -1)
			hwtemp.add(list[i]);
	return hwtemp;
}
ostream &operator<< (ostream &stream, homeworklist hl)
{
	for(int i=0;i<hl.current_size;i++)
		stream<<hl.list[i]<<endl;
	return stream;
}