UserLimitsSvc.cxx

Go to the documentation of this file.

/*
  Copyright (C) 2002-2022 CERN for the benefit of the ATLAS collaboration
*/
 
// class header
#include "UserLimitsSvc.h"
 
// Geant4 includes used in functions
#include "G4LogicalVolume.hh"
#include "G4LogicalVolumeStore.hh"
#include "G4UserLimits.hh"
 
// STL library
#include "CxxUtils/StringUtils.h"
#include <limits>
UserLimitsSvc::UserLimitsSvc( const std::string& name, ISvcLocator* pSvcLocator )
  : base_class(name,pSvcLocator)
{
}
 
// Athena method, called at initialization time
StatusCode UserLimitsSvc::initialize()
{
  ATH_MSG_INFO(" initializing UserLimitsSvc "<<name() );
  G4LogicalVolumeStore& lvs=*(G4LogicalVolumeStore::GetInstance());
  
  ATH_MSG_INFO("G4LogicalVolumeStore size: " << lvs.size());
  std::set<G4String> volumes;
  for (unsigned int i = 0; i < lvs.size(); i++) {
      volumes.insert(lvs[i]->GetName());
  }
  ATH_MSG_INFO("G4LogicalVolumeStore unique size: " << volumes.size());
 
  // Define with a configurable string which string comparison fucntion to use
  using function_t = bool (UserLimitsSvc::*) (const std::string& pattern, const std::string& logicalVolume) const;
  std::map<std::string, function_t> funcMap;
  funcMap.emplace("isMatch", &UserLimitsSvc::isMatch);
  funcMap.emplace("contains", &UserLimitsSvc::contains);
 
  // Call Limit setting methods here:
  std::vector<std::string>::const_iterator volumeItr(m_logicalVolumes.value().begin());
  const std::vector<std::string>::const_iterator endOfVolumesItr(m_logicalVolumes.value().end());
  while(volumeItr!=endOfVolumesItr)
    {
      const std::string& volName(*volumeItr);
      unsigned int ndone(0);
      for (unsigned int i=0;i<lvs.size();i++)
        {
          G4LogicalVolume *lv=lvs[i];
          // Compare two strings with a configurable method...
          if ( (this->*(funcMap[m_matchType.value()]))(volName, lv->GetName()) ){
              G4UserLimits *ul=lv->GetUserLimits();
              if (!ul) ul=new G4UserLimits;
              if (-0.5 < m_MaxStep)        { ul->SetMaxAllowedStep(m_MaxStep); }
              if (-0.5 < m_MinEkine)       { ul->SetUserMinEkine(m_MinEkine); }
              if (-0.5 < m_MaxTrackLength) { ul->SetUserMaxTrackLength(m_MaxTrackLength); }
              if (-0.5 < m_MaxTime)        { ul->SetUserMaxTime(m_MaxTime); }
              if (-0.5 < m_MinRange)       { ul->SetUserMinRange(m_MinRange); }
              lv->SetUserLimits(ul);
              ++ndone;
            }
        }
      if (-0.5 < m_MaxStep) { ATH_MSG_DEBUG ( "MaxStep set to "<<m_MaxStep<<" to "<<ndone<<" copies of "<<volName ); }
      if (-0.5 < m_MinEkine){ ATH_MSG_DEBUG ( "MinEkine set to "<<m_MinEkine<<" to "<<ndone<<" copies of "<<volName );}
      if (-0.5 < m_MaxTrackLength) { ATH_MSG_DEBUG ( "MaxTrackLength set to "<<m_MaxTrackLength<<" to "<<ndone<<" copies of "<<volName ); }
      if (-0.5 < m_MaxTime)        { ATH_MSG_DEBUG ( "MaxTime set to "<<m_MaxTime<<" to "<<ndone<<" copies of "<<volName ); }
      if (-0.5 < m_MinRange)       { ATH_MSG_DEBUG ( "MinRange set to "<<m_MinRange<<" to "<<ndone<<" copies of "<<volName ); }
 
      ++volumeItr;
    }
  // TODO would probably be more CPU efficient to loop over the geometry and compare with each limit volume.
  return StatusCode::SUCCESS;
}
 
bool UserLimitsSvc::contains(const std::string& pattern, const std::string& logicalVolume) const
{
    return (logicalVolume.find(pattern) != std::string::npos);
}
 
bool UserLimitsSvc::isMatch(const std::string& a,const std::string& b) const
{
  // straightforward cases
  if (a=="*") return true;
  if (a==b) return true;
  // wildcards
  bool returnValue=true;
  std::string temp=b;
  //FIXME This next bit is a bit hacky
  const std::vector<std::string> tokens = CxxUtils::tokenize(a, '*');
   for (unsigned int i=0;i<tokens.size();i++)
     {
       if (tokens[i].empty()) continue;
       std::string::size_type npos=temp.find(tokens[i]);
       if (i==0 && npos)
         return false;
       if (npos!=std::string::npos)
         {
           temp=temp.substr(npos, temp.size()-npos);
         }
       else
         {
           returnValue=false;
           break;
         }
     }
   if (returnValue && !tokens[tokens.size()-1].empty())
     {
       std::string temp=tokens[tokens.size()-1];
       std::string temp2=b.substr(b.size()-temp.size(),temp.size());
       if (temp!=temp2)
         return false;
     }
  return returnValue;
}