---

list.h

/*
 *                         Sun Public License Notice
 *
 * The contents of this file are subject to the Sun Public License
 * Version 1.0 (the "License"); you may not use this file except
 * in compliance with the License. A copy of the License is available
 * at http://www.sun.com/
 *
 * The Original Code is the Java Profiler module.  The Initial Developers
 * of the Original Code are Jan Stola, Pavel Vacha, Michal Pise, Petr Luner,
 * Lukas Petru and Marek Przeczek.
 *
 * Portions created by Jan Stola are Copyright (C) 2000-2001.
 * All Rights Reserved.
 *
 * Portions created by Pavel Vacha are Copyright (C) 2000-2001.
 * All Rights Reserved.
 *
 * Portions created by Michal Pise are Copyright (C) 2000-2001.
 * All Rights Reserved.
 *
 * Portions created by Petr Luner are Copyright (C) 2000-2001.
 * All Rights Reserved.
 *
 * Portions created by Lukas Petru are Copyright (C) 2000-2001.
 * All Rights Reserved.
 *
 * Portions created by Marek Przeczek are Copyright (C) 2000-2001.
 * All Rights Reserved.
 *
 * Contributors: Jan Stola, Pavel Vacha, Michal Pise, Petr Luner,
 *               Lukas Petru and Marek Przeczek.
 */

#ifndef _LIST_H_
#define _LIST_H_

#include "../main/includes.h"
#include "../list/listItem.h"

template<class T, class L> class List {

        ListItem* _list;

public:
        
        List() :
        
                _list( NULL)
                
                {}

        ~List() { clear();}

        void clear() {

                while( _list) destroy( static_cast<T*>( static_cast<L*>( _list)));
        }

        T* first() const { return static_cast<T*>( static_cast<L*>( _list));}

        T* next( T* item) const {

                return static_cast<T*>( static_cast<L*>( item->L::next()));
        }

        int isEmpty() const { return !_list;}

        T* add( T* p) {

                if( !p) return NULL;

                _list = p->L::add( &_list);

                return p;
        }
        
        T* remove( T* p) {

                if( !p) return NULL;

                ListItem* q = p->L::remove();
                if( p == static_cast<T*>( static_cast<L*>( _list))) _list = q;

                return p;
        }

        void destroy( T* p) {

                if( !p) return;

                remove( p)->L::destroy();
        }

        int forEach( int (*f)( T*, void**), void** inout) {

                T* p = first();
                int rc;

                while( p) {

                        if( rc = f( p, inout)) return rc;
                        p = next( p);
                }

                return 0;
        }

        int length() const {

                int len = 0;
                for( T* p = first(); p; p = next( p), len++);
                return len;
        }
};

#endif // _LIST_H_

---