In This Package:

DybNextEntryPolicyTool.cc

Go to the documentation of this file.

#include "DybNextEntryPolicyTool.h"
#include "GaudiKernel/IRndmGenSvc.h"

DybNextEntryPolicyTool::DybNextEntryPolicyTool(const std::string& type,
                                   const std::string& name,
                                   const IInterface* parent)
    : GaudiTool(type,name,parent)
    , m_entries(-1)
    , m_entry(0)
    , m_step(1)
    , m_last(-1)
{
    declareInterface<IDybEntryPolicyTool>(this);
    declareProperty("Start",m_entry=0, "Entry to start at");
    declareProperty("Step",m_step=1, "Number of entries to step");
    declareProperty("Mode",m_modeName="random","Loading mode: random or sequential");
}

DybNextEntryPolicyTool::~DybNextEntryPolicyTool()
{

}
    
StatusCode DybNextEntryPolicyTool::queryInterface( const InterfaceID& riid, void** ppvIf )
{
    if ( riid == IDybEntryPolicyTool::interfaceID() )  {
        *ppvIf = (IDybEntryPolicyTool*)this;
        addRef();
        return StatusCode::SUCCESS;
    }
    return AlgTool::queryInterface( riid, ppvIf );
}

StatusCode DybNextEntryPolicyTool::initialize()
{
  IRndmGenSvc *rgs = 0;
  if (service("RndmGenSvc",rgs,true).isFailure()) {
    fatal() << "Failed to get random service" << endreq;
    return StatusCode::FAILURE;
  }

  StatusCode sc;
  if (m_rand.initialize(rgs, Rndm::Flat(0,1)).isFailure()) {
    fatal() << "Failed to initialize flat random numbers" << endreq;
    return StatusCode::FAILURE;
  }

  if( m_modeName=="random" ) {
    m_mode=1;
  }
  if( m_modeName=="sequential" ) {
    m_mode=2;
  }
  info()<<"Running mode: "<<m_modeName<<" "<<m_mode<<endreq;
  return StatusCode::SUCCESS;
}

int DybNextEntryPolicyTool::set_entries(int entries)
{
  m_entries = entries;
  return m_entries;
}

int DybNextEntryPolicyTool::next_entry()
{
  int ret;
  
  // [0,entries-1]
  if( m_mode==1 ) {
      do {
          ret = int( m_rand() * m_entries );
      }
      while (ret == m_last);    // don't pick the same one twice in a row
  }

  if( m_mode==2 ) {
    ret = m_entry;
    m_entry += m_step;
    if( m_entries>0 ) m_entry = m_entry % m_entries;
  }
 
  m_last = ret;
  return ret;
}

---