source: golgotha/src/maxtool/sdk_inc/linklist.h @ 80 Tweet

/**********************************************************************
 *<
        FILE: linklist.cpp

        DESCRIPTION:  Linked-list template classes

        CREATED BY: Tom Hudson

        HISTORY: created 10 December 1995

 *>     Copyright (c) 1995, All Rights Reserved.
 **********************************************************************/

#ifndef __LINKLIST_H__

#define __LINKLIST_H__

template <class T> class LinkedEntryT {
public:
        T data;
        void *next;
        LinkedEntryT(T& d) { data = d; next = NULL; }
        };

template <class T,class TE> class LinkedListT {
private:
    TE* head;
        TE* tail;
        int count;
public:
                                        LinkedListT() { head = tail = NULL; count = 0; }
                                        ~LinkedListT() { New(); }
                void            New() {
                                                while(head) {
                                                        TE* next = (TE*)head->next;
                                                        delete head;
                                                        head = next;
                                                        }
                                                head = tail = NULL;
                                                count = 0;
                                                }
                int                     Count() { return count; }
                void            Append(T& item) {
                                                TE *entry = new TE(item);
                                                if(tail)
                                                        tail->next = entry;
                                                tail = entry;
                                                if(!head)
                                                        head = entry;
                                                count++;        
                                                }
                T                       &operator[](int index) {
                                                TE *e = head;
                                                while(index && e) {
                                                        e = (TE*)e->next;
                                                        index--;
                                                        }
                                                if(!e) {
                                                        assert(0);
                                                        return T();
                                                        }
                                                return e->data;
                                                }
                LinkedListT     &operator=(LinkedListT &from) {
                                                New();
                                                for(int i = 0; i < from.Count(); ++i)
                                                        Append(from[i]);
                                                return *this;
                                                }
        };

// Handy macro for defining linked-lists

#define MakeLinkedList(TYPE) typedef LinkedEntryT<TYPE> TYPE##Entry; typedef LinkedListT<TYPE,TYPE##Entry> TYPE##List;

#endif // __LINKLIST_H__