presendingchain.h

/***************************************************************************
 * The contents of this file are subject to the Mozilla Public             *
 * License Version 1.1 (the "License"); you may not use this file          *
 * except in compliance with the License. You may obtain a copy of         *
 * the License at http://www.mozilla.org/MPL/                              *
 *                                                                         *
 * Software distributed under the License is distributed on an "AS         *
 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or              *
 * implied. See the License for the specific language governing            *
 * rights and limitations under the License.                               *
 *                                                                         *
 * The Original Code is Game Network Framework (GaNeF).                    *
 *                                                                         *
 * The Initial Developers of the Original Code are                         *
 * Lars Langer and Emanuel Greisen                                         *
 * Copyright (C) 2005. Lars Langer & Emanuel Greisen                       *
 * All Rights Reserved.                                                    *
 *                                                                         *
 * Contributor(s):                                                         *
 *   none yet....                                                          *
 *                                                                         *
 ***************************************************************************/
#ifndef PRESENDINGCHAIN_H
#define PRESENDINGCHAIN_H

#include <vector>
#include <set>

#include "plugin.h"
#include "../common/queue.h"

template<class PacketType>
class PacketChainStep;
class ServerFramework;

/**
 * @ingroup Common
 * @brief This is a chain of plugins(PacketChainStep) ending with the outbound queue.
 * @author Lars Langer and Emanuel Greisen
*/
template<class PacketType>
class PreSendingChain
{
private:
   typedef typename std::vector<Plugin<PacketType> *>::const_reverse_iterator PluginVecIt;

private:
   PacketChainStep<PacketType> * first_station;
   PacketChainStep<PacketType> * end_station;

public:
   PreSendingChain(const std::vector<Plugin<PacketType> *> & stations, Queue<PacketType> *outqueue);
   //PreSendingChain(const PluginVec & stations, Queue<PacketType> *outqueue);
   ~PreSendingChain();
   void pack(PacketType * packet);
   void unpack(PacketType * packet);
   void purge();

public:
   void appendUniqueIds(std::set<unsigned int> & pluginids);
};


template<class PacketType>
      PreSendingChain<PacketType>::PreSendingChain(const std::vector<Plugin<PacketType> *> & stations, Queue<PacketType> * outqueue)
   : end_station(outqueue),first_station(outqueue)
{
   for(PluginVecIt it = stations.rbegin(); it != stations.rend(); ++it)
   {
      (*it)->setNext(first_station);
      first_station = *it;
   }
}

template<class PacketType>
PreSendingChain<PacketType>::~PreSendingChain()
{
}

template<class PacketType>
void PreSendingChain<PacketType>::appendUniqueIds( std::set< unsigned int > & pluginids )
{
   PacketChainStep<PacketType> * tmp_station = first_station;

   while(tmp_station != end_station)
   {
      pluginids.insert(dynamic_cast<Plugin<PacketType> *>(tmp_station)->getUniqueId());
      tmp_station = tmp_station->getNext();
   }
}

template<class PacketType>
void PreSendingChain<PacketType>::pack( PacketType * packet )
{
   if(!first_station)
      std::cout << "CRAPPPPPP, the first station does not exist:"<<first_station<<std::endl;
   first_station->pack(packet);
}

template<class PacketType>
void PreSendingChain<PacketType>::unpack( PacketType * packet )
{
   first_station->unpack(packet);
}

template<class PacketType>
void PreSendingChain<PacketType>::purge( )
{
   first_station->purge();
}





#endif

---