Conditions algorithm to unpack fill parameters from COOL. More...

#include <BunchCrossingIntensityCondAlg.h>

Inheritance diagram for BunchCrossingIntensityCondAlg:

Collaboration diagram for BunchCrossingIntensityCondAlg:

Public Member Functions
virtual StatusCode	initialize () override
	Gaudi initialize method.
virtual StatusCode	execute (const EventContext &ctx) const override
	Algorithm execute method.
virtual bool	isReEntrant () const override
	Avoid scheduling algorithm multiple times.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual unsigned int	cardinality () const override
	Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
virtual StatusCode	sysExecute (const EventContext &ctx) override
	Execute an algorithm.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
virtual bool	filterPassed (const EventContext &ctx) const
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard `StoreGateSvc/DetectorStore` Returns (kind of) a pointer to the `StoreGateSvc`.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
std::vector< float >	tokenize (const std::string &pattern) const
	internal methods:
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
SG::ReadCondHandleKey< CondAttrListCollection >	m_fillParamsFolderKey { this, "FillParamsFolderKey", "/TDAQ/OLC/LHC/BUNCHDATA", "" }
	Input conditions object.
SG::ReadCondHandleKey< LuminosityCondData >	m_lumiCondDataKey {this, "LumiCondData", "LuminosityCondData", "Lumi cond data key"}
SG::WriteCondHandleKey< BunchCrossingIntensityCondData >	m_outputKey {this, "OutputKey", "BunchCrossingIntensityData", "Key of output CDO" }
	Output conditions object.
const ServiceHandle< TrigConf::ILVL1ConfigSvc >	m_trigConfigSvc {this, "TrigConfigSvc", "", "Trig Config Svc"}
Gaudi::Property< unsigned long >	m_BPTX { this, "BunchDevice", 0, "Channel assignments: 0=BPTX, 1=fast BCT." }
Gaudi::Property< unsigned long >	m_fBCT { this, "BunchDeviceFast", 1, "Channel assignments: 0=BPTX, 1=fast BCT." }
Gaudi::Property< unsigned >	m_maxBunchSpacing {this, "MaxBunchSpacing",5, "Maximal bunch-spacing to be considered a 'bunch train'"}
Gaudi::Property< unsigned >	m_minBunchesPerTrain {this, "MinBunchesPerTrain",32, "Minimal number of bunches to be considerd a 'bunch train'"}
Gaudi::Property< bool >	m_isRun1 {this,"Run1",false,"Assume run-1 database"}
Gaudi::Property< int >	m_mode {this, "Mode", 1, "Alg mode (COOL FILLPARAMS = 0, MC = 1, TrigConf = 2, Luminosity = 3)"}
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Conditions algorithm to unpack fill parameters from COOL.

Definition at line 30 of file BunchCrossingIntensityCondAlg.h.

Member Typedef Documentation

◆ StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Function Documentation

◆ cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality ( ) const

overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

{
  return 0;
}

◆ declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	hndl,
		const SG::VarHandleKeyType &	)

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

◆ declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

◆ detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

95{ return m_detStore; }

AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

◆ evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

85{ return m_evtStore; }

AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_evtStore

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

StatusCode BunchCrossingIntensityCondAlg::execute ( const EventContext & ctx ) const

overridevirtual

Algorithm execute method.

Definition at line 53 of file BunchCrossingIntensityCondAlg.cxx.

                                                                                {
 
  SG::WriteCondHandle<BunchCrossingIntensityCondData> writeHdl(m_outputKey, ctx);
  if (writeHdl.isValid()) {
 
 
    ATH_MSG_DEBUG("Found valid write handle");
    return StatusCode::SUCCESS;
  }
  // make sure that the output IOV has a valid timestamp, otherwise the conditions
  // data cannot be added to the "mixed" conditions data container. A mixed container
  // is needed when the conditions depends on e.g. the LuminosityCondData
  EventIDRange infinite_range(infiniteIOVBegin(),infiniteIOVEend());
  writeHdl.addDependency(infinite_range);
 
 
  //Output object & range:
  auto bccd=std::make_unique<BunchCrossingIntensityCondData>();
 
  if (m_mode == 2) { // use trigger bunch groups
        // To be filled
  }
 
  if (m_mode == 3) { // use luminosity data
    // To be filled
  }
 
  if (m_mode == 0 || m_mode == 1) { // use FILLPARAMS (data) or /Digitization/Parameters (MC)
 
    SG::ReadCondHandle<CondAttrListCollection> fillParamsHdl (m_fillParamsFolderKey, ctx);
    writeHdl.addDependency(fillParamsHdl);
    const CondAttrListCollection* attrList_link=*fillParamsHdl;
    const coral::AttributeList& attrList = attrList_link->attributeList (m_BPTX);
 
    if (attrList.size() == 0 || attrList["Valid"].isNull()) {
      ATH_MSG_DEBUG ("Can't find information for channel " << m_BPTX);
      return StatusCode::SUCCESS;
    }
    
 
    const coral::AttributeList& attrList_fBCT = attrList_link->attributeList (m_fBCT);
 
    if (attrList_fBCT.size() == 0 || attrList_fBCT["Valid"].isNull()) {
      ATH_MSG_DEBUG ("Can't find information for channel " << m_fBCT);
      return StatusCode::SUCCESS;
    }
 
    // const auto& thisevt = ctx.eventID();
 
    if (m_mode == 1) {
      ATH_MSG_INFO("Assuming MC case");
      ATH_MSG_INFO("Got AttributeList with size " << attrList.size());
      ATH_MSG_INFO("Got AttributeList fBCT with size " << attrList_fBCT.size());
      
    }
    else { // mode == 0, Data-case
 
      float nb1 = attrList["B1BunchAverage"].data<cool::Float>();
      float nb2 = attrList["B2BunchAverage"].data<cool::Float>();
      float nb1_fBCT = attrList_fBCT["B1BunchAverage"].data<cool::Float>();
      float nb2_fBCT = attrList_fBCT["B2BunchAverage"].data<cool::Float>();
 
      unsigned long long RunLB = attrList["RunLB"].data<unsigned long long >();
 
      int run = RunLB>>32;
      int lb = RunLB & 0xffffffff;
      ATH_MSG_DEBUG( "Beam1Intensity: " << nb1 );
      ATH_MSG_DEBUG( "Beam2Intensity: " << nb2 );
      ATH_MSG_DEBUG( "Run: " << run );
      ATH_MSG_DEBUG( "LB: " << lb );
 
      const coral::Blob& blob1 = attrList["B1BunchIntensities"].data<coral::Blob>();
      const coral::Blob& blob2 = attrList["B2BunchIntensities"].data<coral::Blob>();
      const coral::Blob& blob1_fBCT = attrList_fBCT["B1BunchIntensities"].data<coral::Blob>();
      const coral::Blob& blob2_fBCT = attrList_fBCT["B2BunchIntensities"].data<coral::Blob>();
 
 
      if (m_isRun1) {   //Assume run1 layout as explained at https://twiki.cern.ch/twiki/bin/view/AtlasComputing/CoolOnlineData
        ATH_MSG_DEBUG("Assuming run 1 database");
 
      }
      else { 
 
        bccd->SetBeam1IntensityAll(nb1,0);
        bccd->SetBeam2IntensityAll(nb2,0);
        bccd->SetBeam1IntensityAll(nb1_fBCT,1);
        bccd->SetBeam2IntensityAll(nb2_fBCT,1);
        bccd->SetRunLB(RunLB);
 
        //=========== BPTX===================
        //Blob1
        // Hardcode the Run2 BLOB decoding (should use CoolLumiUtilities...)
        const uint8_t* ATH_RESTRICT pchar1 = static_cast<const uint8_t*>(blob1.startingAddress()); // First byte holds storage size and mode
        ++pchar1;  // Points to next char after header
        unsigned int nbcids = BunchCrossingIntensityCondData::m_MAX_BCID;
 
        std::vector<float> instBeam1 (nbcids);
        for (unsigned int i=0; i<nbcids; i++) {
          // Can't use assignment directly because source may be misaligned.
          instBeam1[i] = CxxUtils::get_unaligned_float (pchar1);
          
        }
 
        // Blob2
        // Hardcode the Run2 BLOB decoding (should use CoolLumiUtilities...)
        const uint8_t* ATH_RESTRICT pchar2 = static_cast<const uint8_t*>(blob2.startingAddress()); // First byte holds storage size and mode
        ++pchar2;  // Points to next char after header
        std::vector<float> instBeam2 (nbcids);
        for (unsigned int i=0; i<nbcids; i++) {
          // Can't use assignment directly because source may be misaligned.
          instBeam2[i] = CxxUtils::get_unaligned_float (pchar2);
          
        }
 
        bccd->setBeam1IntensityPerBCIDVector(std::move(instBeam1),0);
        bccd->setBeam2IntensityPerBCIDVector(std::move(instBeam2),0);
        //
 
 
        //=========== fBCT ===================
        //Blob1
        // Hardcode the Run2 BLOB decoding (should use CoolLumiUtilities...)
        const uint8_t* ATH_RESTRICT pchar1_fBCT = static_cast<const uint8_t*>(blob1_fBCT.startingAddress()); // First byte holds storage size and mode
        ++pchar1_fBCT;  // Points to next char after header
        unsigned int nbcids_fBCT = BunchCrossingIntensityCondData::m_MAX_BCID;
 
        std::vector<float> instBeam1_fBCT (nbcids_fBCT);
        for (unsigned int i=0; i<nbcids_fBCT; i++) {
          // Can't use assignment directly because source may be misaligned.
          instBeam1_fBCT[i] = CxxUtils::get_unaligned_float (pchar1_fBCT);
          
        }
 
        // Blob2
        // Hardcode the Run2 BLOB decoding (should use CoolLumiUtilities...)
        const uint8_t* ATH_RESTRICT pchar2_fBCT = static_cast<const uint8_t*>(blob2_fBCT.startingAddress()); // First byte holds storage size and mode
        ++pchar2_fBCT;  // Points to next char after header
        std::vector<float> instBeam2_fBCT (nbcids_fBCT);
        for (unsigned int i=0; i<nbcids_fBCT; i++) {
          // Can't use assignment directly because source may be misaligned.
          instBeam2_fBCT[i] = CxxUtils::get_unaligned_float (pchar2_fBCT);
          
        }
 
        bccd->setBeam1IntensityPerBCIDVector(std::move(instBeam1_fBCT),1);
        bccd->setBeam2IntensityPerBCIDVector(std::move(instBeam2_fBCT),1);
 
 
      }//end else run2 
      //Filled bcid-bitsets, now extract trains
      // bccd->m_trains=findTrains(bccd->m_luminous, m_maxBunchSpacing,m_minBunchesPerTrain);
    }//end else is data
  }
 
  ATH_CHECK( writeHdl.record (std::move (bccd)) );
  return StatusCode::SUCCESS;
}

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

◆ extraOutputDeps()

const DataObjIDColl & AthCommonReentrantAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 94 of file AthCommonReentrantAlgorithm.cxx.

{
  // If we didn't find any symlinks to add, just return the collection
  // from the base class.  Otherwise, return the extended collection.
  if (!m_extendedExtraObjects.empty()) {
    return m_extendedExtraObjects;
  }
  return BaseAlg::extraOutputDeps();
}

◆ filterPassed()

virtual bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

                                                           {
    return execState( ctx ).filterPassed();
  }

◆ initialize()

StatusCode BunchCrossingIntensityCondAlg::initialize ( )

overridevirtual

Gaudi initialize method.

Definition at line 39 of file BunchCrossingIntensityCondAlg.cxx.

                                                     {
 
 
  if (m_mode == 2) {
    ATH_CHECK( m_trigConfigSvc.retrieve() );
  }
 
  ATH_CHECK( m_fillParamsFolderKey.initialize( m_mode == 0 || m_mode == 1 ) );
  ATH_CHECK( m_lumiCondDataKey.initialize( m_mode == 3 ) );
  ATH_CHECK( m_outputKey.initialize() );
  return StatusCode::SUCCESS;
}

◆ inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

◆ isClonable()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ITkPixelCablingAlg, ITkStripCablingAlg, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, and Simulation::BeamEffectsAlg.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

{
  // Reentrant algorithms are clonable.
  return true;
}

◆ isReEntrant()

virtual bool AthCondAlgorithm::isReEntrant ( ) const

inlineoverridevirtualinherited

Avoid scheduling algorithm multiple times.

With multiple concurrent events, conditions objects often expire simultaneously for all slots. To avoid that the scheduler runs the CondAlg in each slot, we declare it as "non-reentrant". This ensures that the conditions objects are only created once.

In case a particular CondAlg should behave differently, it can override this method again and return true.

See also: ATEAM-836

Definition at line 39 of file AthCondAlgorithm.h.

39{ return false; }

◆ msg()

MsgStream & AthCommonMsg< Gaudi::Algorithm >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

◆ msgLvl()

bool AthCommonMsg< Gaudi::Algorithm >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

◆ outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

◆ renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

◆ renounceArray()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

◆ setFilterPassed()

virtual void AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed	(	bool	state,
		const EventContext &	ctx ) const

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

                                                                            {
    execState( ctx ).setFilterPassed( state );
  }

◆ sysExecute()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx )

overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

◆ sysInitialize()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >.

Reimplemented in HypoBase, and InputMakerBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.cxx.

                                                               {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<BaseAlg>>::sysInitialize();
 
  if (sc.isFailure()) {
    return sc;
  }
  
  ServiceHandle<ICondSvc> cs("CondSvc",name());
  for (auto h : outputHandles()) {
    if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
      // do this inside the loop so we don't create the CondSvc until needed
      if ( cs.retrieve().isFailure() ) {
        ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
        return StatusCode::SUCCESS;
      }      
      if (cs->regHandle(this,*h).isFailure()) {
        sc = StatusCode::FAILURE;
        ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                      << " with CondSvc");
      }
    }
  }
  return sc;  
}

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

◆ tokenize()

std::vector< float > BunchCrossingIntensityCondAlg::tokenize ( const std::string & pattern ) const

private

internal methods:

This helper function is used to convert a string of type "[0.0, 0.0, 1.0, 1.0, 1.0]" into a vector of floats.

As it happens, the digitization stores the bunch pattern in such a fancy style...

Parameters

pattern The pattern extracted from the MC file metadata

Returns: The "decoded" bunch pattern

Definition at line 220 of file BunchCrossingIntensityCondAlg.cxx.

                                                                                         {
  ATH_MSG_VERBOSE("Input to tokenize: " << pattern);
  
  std::vector< float > result;
  const char* c= pattern.data();
  const char* cEnd= c + pattern.size();
  while(c<cEnd) {
    //This loop swallows actually any string containing numbers
    //separated by non-numbers
    char* end;
    float f=std::strtof(c,&end);
    if (c==end) {//Can't convert, try next
      c++;
    }
    else { //got a value
      result.push_back(f);
      c=end;
    }
  }//end while loop
  return result;
}

◆ updateVHKA()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

◆ m_BPTX

Gaudi::Property<unsigned long> BunchCrossingIntensityCondAlg::m_BPTX { this, "BunchDevice", 0, "Channel assignments: 0=BPTX, 1=fast BCT." }

private

Definition at line 65 of file BunchCrossingIntensityCondAlg.h.

65{ this, "BunchDevice", 0, "Channel assignments: 0=BPTX, 1=fast BCT." };

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

◆ m_fBCT

Gaudi::Property<unsigned long> BunchCrossingIntensityCondAlg::m_fBCT { this, "BunchDeviceFast", 1, "Channel assignments: 0=BPTX, 1=fast BCT." }

private

Definition at line 66 of file BunchCrossingIntensityCondAlg.h.

66{ this, "BunchDeviceFast", 1, "Channel assignments: 0=BPTX, 1=fast BCT." };

◆ m_fillParamsFolderKey

SG::ReadCondHandleKey<CondAttrListCollection> BunchCrossingIntensityCondAlg::m_fillParamsFolderKey { this, "FillParamsFolderKey", "/TDAQ/OLC/LHC/BUNCHDATA", "" }

private

Input conditions object.

Definition at line 49 of file BunchCrossingIntensityCondAlg.h.

49{ this, "FillParamsFolderKey", "/TDAQ/OLC/LHC/BUNCHDATA", "" };

◆ m_isRun1

Gaudi::Property<bool> BunchCrossingIntensityCondAlg::m_isRun1 {this,"Run1",false,"Assume run-1 database"}

private

Definition at line 71 of file BunchCrossingIntensityCondAlg.h.

71{this,"Run1",false,"Assume run-1 database"};

◆ m_lumiCondDataKey

SG::ReadCondHandleKey<LuminosityCondData> BunchCrossingIntensityCondAlg::m_lumiCondDataKey {this, "LumiCondData", "LuminosityCondData", "Lumi cond data key"}

private

Definition at line 50 of file BunchCrossingIntensityCondAlg.h.

50{this, "LumiCondData", "LuminosityCondData", "Lumi cond data key"};

◆ m_maxBunchSpacing

Gaudi::Property<unsigned> BunchCrossingIntensityCondAlg::m_maxBunchSpacing {this, "MaxBunchSpacing",5, "Maximal bunch-spacing to be considered a 'bunch train'"}

private

Definition at line 69 of file BunchCrossingIntensityCondAlg.h.

69{this, "MaxBunchSpacing",5, "Maximal bunch-spacing to be considered a 'bunch train'"};

◆ m_minBunchesPerTrain

Gaudi::Property<unsigned> BunchCrossingIntensityCondAlg::m_minBunchesPerTrain {this, "MinBunchesPerTrain",32, "Minimal number of bunches to be considerd a 'bunch train'"}

private

Definition at line 70 of file BunchCrossingIntensityCondAlg.h.

70{this, "MinBunchesPerTrain",32, "Minimal number of bunches to be considerd a 'bunch train'"};

◆ m_mode

Gaudi::Property<int> BunchCrossingIntensityCondAlg::m_mode {this, "Mode", 1, "Alg mode (COOL FILLPARAMS = 0, MC = 1, TrigConf = 2, Luminosity = 3)"}

private

Definition at line 72 of file BunchCrossingIntensityCondAlg.h.

72{this, "Mode", 1, "Alg mode (COOL FILLPARAMS = 0, MC = 1, TrigConf = 2, Luminosity = 3)"};

◆ m_outputKey

SG::WriteCondHandleKey<BunchCrossingIntensityCondData> BunchCrossingIntensityCondAlg::m_outputKey {this, "OutputKey", "BunchCrossingIntensityData", "Key of output CDO" }

private

Output conditions object.

Definition at line 54 of file BunchCrossingIntensityCondAlg.h.

54{this, "OutputKey", "BunchCrossingIntensityData", "Key of output CDO" };

◆ m_trigConfigSvc

const ServiceHandle<TrigConf::ILVL1ConfigSvc> BunchCrossingIntensityCondAlg::m_trigConfigSvc {this, "TrigConfigSvc", "", "Trig Config Svc"}

private

Definition at line 57 of file BunchCrossingIntensityCondAlg.h.

57{this, "TrigConfigSvc", "", "Trig Config Svc"};

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

The documentation for this class was generated from the following files:

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Member Function Documentation

◆ cardinality()

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ isReEntrant()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ tokenize()

◆ updateVHKA()

Member Data Documentation

◆ m_BPTX

◆ m_detStore

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_fBCT

◆ m_fillParamsFolderKey

◆ m_isRun1

◆ m_lumiCondDataKey

◆ m_maxBunchSpacing

◆ m_minBunchesPerTrain

◆ m_mode

◆ m_outputKey

◆ m_trigConfigSvc

◆ m_varHandleArraysDeclared

◆ m_vhka