User Manual, Developers Guide and API Documentation

FastListEnabler.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_FASTLISTENABLER_HPP
#define WNS_CONTAINER_FASTLISTENABLER_HPP

#include <WNS/container/FastList.hpp>
#include <WNS/NonCopyable.hpp>
#include <map>

namespace wns { namespace container {
    template<typename T>
    class FastListEnabler :
        private NonCopyable
    {
        typedef std::map<FastList<T>*, FastListNode<T>*> MapType;
    public:
        FastListEnabler()
            : listsAndNodes(MapType())
        {}

        virtual ~FastListEnabler()
        {
            removeFromAllLists();
        }

        FastListNode<T>* getFastListNode(FastList<T>* f) const
        {
            assure(listsAndNodes.find(f)!=listsAndNodes.end(), "Node not in that list");
            return listsAndNodes.find(f)->second;
        };

        void setFastListNode(FastList<T>* f, FastListNode<T>* FLN)
        {
            assure(f, "Inavlid list");
            assure(FLN, "Invalid node");
            assure(listsAndNodes.find(f)==listsAndNodes.end(), "Node already in that list");
            listsAndNodes[f] = FLN;
        };

        void removeFastListNode(FastList<T>* f)
        {
            assure(listsAndNodes.find(f)!=listsAndNodes.end(), "Node not in that list");
            listsAndNodes.erase(f);
        };

        void removeFromAllLists()
        {
            typename MapType::iterator itr;
            itr = listsAndNodes.begin();
            while(itr != listsAndNodes.end()) {
                itr->first->remove(itr->second->getData());
                itr = listsAndNodes.begin();
            }
            assure(listsAndNodes.empty(), "Destructor executet, but list not empty");
        }

        bool isInList(FastList<T>* f) const
        {
            return listsAndNodes.find(f)!=listsAndNodes.end();
        }

    private:
        MapType listsAndNodes;
    };


    template<typename T>
    class SingleFastListEnabler :
        private NonCopyable
    {
    public:
        SingleFastListEnabler()
            : list(NULL),
              node(NULL)
        {};

        virtual ~SingleFastListEnabler()
        {
            removeFromAllLists();
        };

#ifndef WNS_NDEBUG
        FastListNode<T>* getFastListNode(FastList<T>* l) const
#else
        FastListNode<T>* getFastListNode(FastList<T>* /*l*/) const
#endif
        {
            assure(list==l, "Node not in list");
            assure(node, "Inavlid node");
            return node;
        };

        void setFastListNode(FastList<T>* f, FastListNode<T>* FLN)
        {
            assure(f, "Inavlid node");
            assure(FLN, "Inavlid list");
            assure(!list, "Node with SingleFastListEnabler can't be in more than one list");
            assure(!node, "Node with SingleFastListEnabler can't be in more than one list");
            list = f;
            node = FLN;
        };

#ifndef WNS_NDEBUG
        void removeFastListNode(FastList<T>* f)
#else
        void removeFastListNode(FastList<T>* /*f*/)
#endif
        {
            assure(list, "Node not in list");
            assure(list==f, "Node not in this list");
            assure(node, "Node invalid");
            list=NULL;
            node=NULL;
        };

        void removeFromAllLists()
        {
            if(list || node) {
                assure(list, "Invalid list");
                assure(node, "Invalid node");
                list->remove(node->getData());
            }
        }
        bool isInList(FastList<T>* f) const
        {
            return list==f;
        }

    private:
        FastList<T>* list;

        FastListNode<T>* node;
    };
}}
#endif

---