ConsumerChain.cc

// Copyright 2008 Michael Marsh, University of Maryland.
//
// This file is part of pydtn.
//
// pydtn is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// pydtn 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with pydtn.  If not, see <http://www.gnu.org/licenses/>.
//
// The views and conclusions contained in the software and documentation
// are those of the authors and should not be interpreted as representing
// official policies, either expressed or implied, of the University
// of Maryland.
//
// pydtn extends and embeds the Python interpreter, which is
// Copyright 2001-2006 Python Software Foundation, All Rights Reserved,
// and is released under the PSF License Agreement.
//
// RANLUX random number generation uses the Boost library,
// Copyright 1994-2006 by various authors (details in individual files),
// which is released under the Boost Software License, Version 1.0.

#include "ConsumerChain.h"
#include "Bundle.h"
#include "Node.h"

using namespace DTN;

ConsumerChain::~ConsumerChain()
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         delete *itr;
      }
   }
}

void
ConsumerChain::operator()( const Bundle& b )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (**itr)(b);
      }
   }
}

void
ConsumerChain::drop( const Bundle& b, const DropCause& c )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->drop(b,c);
      }
   }
}

void
ConsumerChain::custody( const Bundle& b )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->custody(b);
      }
   }
}

void
ConsumerChain::persistentStore( const Bundle& b )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->persistentStore(b);
      }
   }
}

void
ConsumerChain::persistentRemove( const Bundle& b, bool cleanup )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->persistentRemove(b,cleanup);
      }
   }
}

void
ConsumerChain::send( const Bundle& b )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->send(b);
      }
   }
}

void
ConsumerChain::recv( const Bundle& b )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->recv(b);
      }
   }
}

void
ConsumerChain::exhausted( const Bundle& b )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->exhausted(b);
      }
   }
}

void
ConsumerChain::addConsumer( Consumer* c )
{
   if ( 0 != c )
   {
      m_chain.push_back(c);
   }
}

---