User Manual, Developers Guide and API Documentation

FastListNode.hpp

Go to the documentation of this file.

/*******************************************************************************
 * This file is part of openWNS (open Wireless Network Simulator)
 * _____________________________________________________________________________
 *
 * Copyright (C) 2004-2007
 * Chair of Communication Networks (ComNets)
 * Kopernikusstr. 16, D-52074 Aachen, Germany
 * phone: ++49-241-80-27910,
 * fax: ++49-241-80-22242
 * email: info@openwns.org
 * www: http://www.openwns.org
 * _____________________________________________________________________________
 *
 * openWNS is free software; you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 2 as published by the
 * Free Software Foundation;
 *
 * openWNS 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 Lesser General Public License for more
 * details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 ******************************************************************************/

#ifndef WNS_CONTAINER_FASTLISTNODE_HPP
#define WNS_CONTAINER_FASTLISTNODE_HPP

namespace wns { namespace container {

    // Forward Decleration of FastList
    template <typename T> class FastList;

    template<typename T> class FastListNode {
        friend class FastList<T>;

    public:
        explicit FastListNode(const T& x) :
            data(x),
            previousNode(this),
            nextNode(this)
        {};

        ~FastListNode() {};

        void removeFromList()
        {
            previousNode->nextNode = nextNode;
            nextNode->previousNode = previousNode;
        };

        void addToList(FastListNode& begin)
        {
            nextNode = begin.nextNode;
            previousNode = &begin;

            begin.nextNode = this;
            nextNode->previousNode = this;
        };

        FastListNode* getNext() const
        {
            return nextNode;
        }

        FastListNode* getPrevious() const
        {
            return previousNode;
        }

        T& getData()
        {
            return data;
        };

    protected:
        FastListNode() :
            previousNode(this),
            nextNode(this)
        {}

    private:
        T data;

        FastListNode* previousNode;

        FastListNode* nextNode;
    };
}}
#endif

---