// ======================================================================================== // TLinkedList.h Copyright (C) 2001-2002 Mike Lockwood. All rights reserved. // ======================================================================================== /* This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #ifndef __TLinkedList__ #define __TLinkedList__ class TLinkedListItem { public: TLinkedListItem(); inline TLinkedListItem* Next() { return fNext; } private: friend class TLinkedListBase; TLinkedListItem* fNext; }; class TLinkedListBase { public: TLinkedListBase(); ~TLinkedListBase(); inline bool IsEmpty() const { return (fItems == NULL); } protected: void InsertItem(TLinkedListItem* item); void RemoveItem(TLinkedListItem* item); TLinkedListItem* fItems; }; template class TLinkedList : public TLinkedListBase { public: inline TLinkedList() : TLinkedListBase() {} inline void Insert(T* item) { InsertItem(item); } inline void Remove(T* item) { RemoveItem(item); } inline T* First() { return (T *)fItems; } }; template class TLinkedListIterator { public: inline TLinkedListIterator(TLinkedList& list) { fCurrent = list.First(); } T* Next(); private: T* fCurrent; }; template T* TLinkedListIterator::Next() { if (fCurrent) { T* result = fCurrent; fCurrent = (T *)fCurrent->Next(); return result; } else return NULL; } #endif