#include "sorted_list.h"

template <class Object, class Comparator>
SortedList<Object, Comparator>::SortedList() {
	cursize = 0;
}

template <class Object, class Comparator>
SortedList<Object, Comparator>::~SortedList() {
	for(int i = 0; i < cursize; i++) {
		delete objects[i];
	}
}

template <class Object, class Comparator>
void SortedList<Object, Comparator>::insert(Comparator * comp, Object * newobj) {
	if(cursize >= MAX) {
		return;
	}

	bool inserted = false;
	for(int i = 0; i < cursize; i++) {
		if(comp->isLess(newobj, objects[i])) {
			for(int j = cursize; j >= i; j--) {
				objects[j] = objects[(j-1)];
			}
			objects[i] = newobj;
			inserted = true;
			break;
		}
	}
	if(!inserted) {
		objects[cursize] = newobj;
	}
	cursize++;
}

template <class Object, class Comparator>
void SortedList<Object, Comparator>::print() {
	for(int i = 0; i < cursize; i++) {
		objects[i]->print();
	}
}