tlist.h

Go to the documentation of this file.

/*! \file
  \brief  A templated list, disti::TList.

  \par Copyright Information

  Copyright (c) 2015 by The DiSTI Corporation.<br>
  11301 Corporate Blvd; Suite 100<br>
  Orlando, Florida 32817<br>
  USA<br>
  <br>
  All rights reserved.<br>

  This Software contains proprietary trade secrets of DiSTI and may not be
reproduced, in whole or part, in any form, or by any means of electronic,
mechanical, or otherwise, without the written permission of DiSTI.  Said
permission may be derived through the purchase of applicable DiSTI product
licenses which detail the distribution rights of this content and any
Derivative Works based on this or other copyrighted DiSTI Software.

  NO WARRANTY. THE SOFTWARE IS PROVIDED "AS-IS," WITHOUT WARRANTY OF ANY KIND,
AND ANY USE OF THIS SOFTWARE PRODUCT IS AT YOUR OWN RISK. TO THE MAXIMUM EXTENT
PERMITTED BY APPLICABLE LAW, DISTI AND ITS SUPPLIERS DISCLAIM ALL WARRANTIES
AND CONDITIONS, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
IMPLIED WARRANTIES AND CONDITIONS OF MERCHANTABILITY AND/OR FITNESS FOR A
PARTICULAR PURPOSE, TITLE, AND NON-INFRINGEMENT, WITH REGARD TO THE SOFTWARE.

  LIMITATION OF LIABILITY. TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW,
IN NO EVENT SHALL DISTI OR ITS SUPPLIERS BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
INDIRECT, OR CONSEQUENTIAL DAMAGES WHATSOEVER (INCLUDING, WITHOUT LIMITATION,
DAMAGES FOR LOSS OF BUSINESS PROFITS, BUSINESS INTERRUPTION, LOSS OF BUSINESS
INFORMATION, OR ANY OTHER PECUNIARY LOSS) ARISING OUT OF THE USE OF OR
INABILITY TO USE THE SOFTWARE, EVEN IF DISTI HAS BEEN ADVISED OF THE POSSIBILITY
OF SUCH DAMAGES.  DISTI'S ENTIRE LIABILITY AND YOUR EXCLUSIVE REMEDY SHALL NOT
EXCEED FIVE DOLLARS (US$5.00).

  The aforementioned terms and restrictions are governed by the laws of the
State of Florida and the United States of America.

*/
#ifndef _TLIST_H
#define _TLIST_H

#include "disti_include.h"

namespace disti
{

/** A templated list class */
template <class T, const int deleteOnRemove = 0>
class TList 
{

public:
    /** List Item */
    class  ListItem
    {
    public:
        ListItem *_next;
        ListItem *_prev;
        T _data;
    public:
        ListItem( T &data) :
          _next(0),
          _prev(0),
          _data(data)
        {
        }
        virtual ~ListItem()
        { 
          //FIXTHIS if (deleteOnRemove)
          // We need to cleanup      delete _data;
        }
        ListItem *Next()
        {
            return _next;
        }
        ListItem *Prev()
        {
            return _prev;
        }
        void Next(ListItem *next)
        {
            _next = next;
        }
        void Prev(ListItem *prev)
        {
            _prev = prev;
        }

        T &Data()
        {
            return _data;
        }

        void Data( T &data )
        {
            _data = data;
        }
    };

private:
    ListItem *_head;
    ListItem *_tail;
    int _count;
public:

    TList() :
        _head(0),
        _tail(0),
        _count(0)
    {
    }
    virtual ~TList()
    {
        while(_head)
            Remove(_head);
    }

    void InsertAfter( ListItem *where, T &val )
    {
        ListItem *newItem = new ListItem(val);

        // List is empty, where doesn't matter
        if (_tail == 0 && 
            _head == 0)
        {
            _tail = _head = newItem;
        }
        else
        {
            if (where == _tail)
            {
                _tail = newItem;
            }
            newItem->Prev(where);
            newItem->Next(where->Next());
            if (where->Next())
                where->Next()->Prev(newItem);
            where->Next(newItem);
        }

        _count++;
    }

    /*void Add( T &val )
    {
        InsertAfter(_tail, val);
    }
    */
    void Add( T val )
    {
        InsertAfter(_tail, val);
    }

    void InsertBefore( ListItem *where, T &val )
    {
        ListItem *newItem = new ListItem(val);

        // List is empty, where doesn't matter
        if (_tail == 0 && 
            _head == 0)
        {
            _tail = _head = newItem;
        }
        else
        {
            if (where == _head)
            {
                _head = newItem;
            }
            newItem->Next(where);
            newItem->Prev(where->Prev());
            if (where->Prev())
                where->Prev()->Next(newItem);
            where->Prev(newItem);
        }
        _count++;
    }
    ListItem *First()
    {
        return _head;
    }
    ListItem *Last()
    {
        return _tail;
    }
    int Count()
    {
        return _count;
    }
    void Remove(ListItem *where)
    {
        if (!where || _count <= 0)
            return;

        if (where == _head)
        {
            _head = where->Next();

        }
        if (where == _tail)
        {
            _tail = where->Prev();
        }

        if (where->Prev())
            where->Prev()->Next(where->Next());
        if (where->Next())
            where->Next()->Prev(where->Prev());

        delete where;
        _count--;
    }
    
};

}
#endif