---

List.h

/*
 $Id: List.h,v 1.13 2003/07/12 03:44:51 mindstorm2600 Exp $

 This class is responsible for the management of linked lists using templates
 please take in account that this is not a thread safe class, so use it
 wisely
 */
#ifndef __CLAW_LIST_H__
#define __CLAW_LIST_H__
#include<Container.h>

namespace clawsoft{

        template<class T>
        class List:public Container{
                protected:
                        class nodeT:public Container{
                                public:
                                T data;
                                nodeT *next;
                                nodeT *before;
                                nodeT():Container(clawsoft::_clawList__nodeT){
                                        next = 0;
                                        before = 0;
                                }
                                nodeT(T d):Container(clawsoft::_clawList__nodeT){
                                        data = d;
                                        next = 0;
                                        before = 0;
                                }
                        };
                        unsigned int middle;
                        nodeT *list;
                        nodeT *end;
                        nodeT *act;
                public:
                        List():Container(clawsoft::_clawList){
                                list = 0;
                                end = 0;
                                act = 0;
                        }
                        ~List(){
                                destroy();
                        }
                        void destroy(){
                                nodeT *q = 0, *t = 0;
                                q = list;
                                while(q != 0){
                                        t = q;
                                        q = q->next;
                                        delete t;
                                }
                        }
                        void add(T data){
                                nodeT *q;
                                q = new nodeT(data);
                                if(list == 0){
                                        list = q;
                                        end = list;
                                }
                                else{
                                        end->next = q;
                                        q->before = end;
                                        end = q;
                                }
                                num_data++;
                                middle = num_data / 2;
                                act = list;
                        }
                        void remove(unsigned int idx){
                                nodeT *q, *b, *a, *t;
                                unsigned int i;
                                q = list;
                                b = list;
                                if(idx < 0 || idx >= num_data)
                                        throw ElementNotFoundException();
                                for(i = 0; q != 0; i++, q = q->next){
                                        if(i == idx){
                                                t = q;
                                                a = q->next;
                                                b->next = a;
                                                if(a != 0)
                                                        a->before = b;
                                                if(t == list){
                                                        if(list != 0){
                                                                list = t->next;
                                                                if(list != 0)
                                                                        list->before = 0;
                                                        }
                                                }
                                                if(t == end){
                                                        if(end != 0){
                                                                end = end->before;
                                                                if(end != 0)
                                                                        end->next = 0;
                                                        }
                                                }
                                                delete t;
                                                num_data--;
                                                break;
                                        }
                                        b = q;
                                }
                        }

                        T &get(unsigned int j){
                                nodeT *r;
                                nodeT *t;
                                nodeT *q;
                                unsigned int i;
                                q = list;
                                r = end;
                                if(j >= num_data){
                                        throw ArrayIndexOutOfLimitsException();
                                }
                                if(j < middle){
                                        for(i = 0; i != j; i++)
                                                q=q->next;
                                        t = q;
                                }
                                else{
                                        for(i = num_data - 1; i != j; i--)
                                                r=r->before;
                                        t = r;
                                }
                                return t->data;
                        }

                        T &get(){
                                if(act != 0){
                                        return act->data;
                                        act = act->next;
                                }
                                return (T)0;
                        }

                        void rewind(){
                                act = list;
                        }

                        T &operator[](unsigned int i){
                                return get(i);
                        }

                        
        };

};

#endif

Authors:

Juan V. Guerrero
Jannette C. Mejia
Juan C. Guevara

Powered by: