// SSTSortLinkList.h
//

#ifndef SSTSORTLINKLIST
#define SSTSORTLINKLIST

#include "SSLinkList.h"

template <class SortOrder>
class SSTSortLinkList : public SSLinkList {
	public:
		SSTSortLinkList() {
			lastFound=0;
		}
		virtual void add(SubStr *s) {
			Node *nnode=new 
			if(head==0) {
			}

			Node *rover;
			if(tail!=0 && SortOrder::compare(*(tail->data),*s)<1) {
				rover=lastFound;
			} else {
				rover=head;
			}
		}
		virtual SubStr *search(const SubStr &s) const;
		virtual SubStr *search(const string &s) const;
	private:
		Node *lastFound;
		Node *tail;
};

class compareAlpha {
	public:
		static int compare(const SubStr &s1,const SubStr &s2) const {
			return s1.compare(s2);
		}
};

#endif