TRGGRLMatchModule Class Reference

Match between CDC trigger track and ECL trigger cluster. More...

#include <TRGGRLMatchModule.h>

Inheritance diagram for TRGGRLMatchModule:

Public Types
enum	EModulePropFlags {   c_Input = 1 ,   c_Output = 2 ,   c_ParallelProcessingCertified = 4 ,   c_HistogramManager = 8 ,   c_InternalSerializer = 16 ,   c_TerminateInAllProcesses = 32 ,   c_DontCollectStatistics = 64 }
	Each module can be tagged with property flags, which indicate certain features of the module. More...
typedef ModuleCondition::EAfterConditionPath	EAfterConditionPath
	Forward the EAfterConditionPath definition from the ModuleCondition.

Public Member Functions
	TRGGRLMatchModule ()
	Constructor: Sets the description, the properties and the parameters of the module.
virtual	~TRGGRLMatchModule ()
	Destructor.
virtual void	initialize () override
	Initialize the parameters.
virtual void	beginRun () override
	Called when entering a new run.
virtual void	event () override
	Event processor.
virtual void	endRun () override
	End-of-run action.
virtual void	terminate () override
	Termination action.
void	calculationdistance (CDCTriggerTrack *track, TRGECLCluster *cluster, double *ds, int _match3D)
	calculate dr and dz between track and cluster
void	calculationphiangle (CDCTriggerTrack *track, TRGECLCluster *cluster, int &dphi_d, std::vector< bool > &track_phimap, std::vector< bool > &track_phimap_i)
	calculate dphi_d between track and cluster
void	sectormatching_klm (CDCTriggerTrack *track, StoreObjPtr< KLMTrgSummary > klmtrgsummary, double &dphi, int &klmtrack_ind_phi)
	calculate dphi between 2D track and KLM track
bool	photon_cluster (TRGECLCluster *cluster, std::vector< bool > track_phimap, double e_threshold)
	determine photon from isolated cluster
int	N64 (int x)
	Force an int to be witnin 0 to 63.
int	N36 (int x)
	Force an int to be witnin 0 to 35.
void	fill_pattern_base2 (std::vector< std::vector< int > > &patt)
	Fill the patterns in short tracking logic.
void	make_veto_map (StoreArray< CDCTriggerTrack > track2Dlist, std::vector< bool > &map_veto)
	Make the full track phi veto map for short tracking.
void	make_eecl_map (StoreArray< TRGECLCluster > clusterlist, std::vector< bool > &ecl_phimap, std::vector< bool > &ecl_phimap_fwd, std::vector< bool > &ecl_phimap_bwd, std::vector< bool > &ecl_sectormap_fwd, std::vector< bool > &ecl_sectormap_bwd)
	Make the ecl endcap phi map for inner/short track matching.
void	make_eklm_map (StoreObjPtr< KLMTrgSummary > klmtrgsummary, std::vector< bool > &eklm_sectormap, std::vector< bool > &eklm_sectormap_fwd, std::vector< bool > &eklm_sectormap_bwd)
	Make the klm endcap phi map for inner/short track matching.
void	short_tracking (StoreArray< CDCTriggerSegmentHit > tslist, std::vector< bool > map_veto, std::vector< bool > phimap_i, std::vector< bool > ecl_phimap_fwd, std::vector< bool > ecl_phimap_bwd, std::vector< bool > klm_sectormap_fwd, std::vector< bool > klm_sectormap_bwd, std::vector< std::vector< int > > &pattern_base0, std::vector< std::vector< int > > &pattern_base2, StoreArray< TRGGRLShortTrack > grlst, StoreObjPtr< TRGGRLInfo > trgInfo)
	Short tracking logic.
void	inner_tracking (StoreArray< CDCTriggerSegmentHit > tslist, std::vector< bool > phimap_i, std::vector< bool > ecl_phimap, std::vector< bool > klm_sectormap, StoreArray< TRGGRLInnerTrack > grlit, StoreObjPtr< TRGGRLInfo > trgInfo)
void	matching_eecl_eklm (std::vector< bool > eecl_sectormap_fw, std::vector< bool > eecl_setormap_bw, std::vector< bool > eklm_sectormap_fw, std::vector< bool > eklm_sectormap_bw, StoreObjPtr< TRGGRLInfo > trgInfo)
void	extrapolation (int pattern, int &l, int &r, int &ec)
	Short track extrapolation (to endcap) function.
virtual std::vector< std::string >	getFileNames (bool outputFiles)
	Return a list of output filenames for this modules.
const std::string &	getName () const
	Returns the name of the module.
const std::string &	getType () const
	Returns the type of the module (i.e.
const std::string &	getPackage () const
	Returns the package this module is in.
const std::string &	getDescription () const
	Returns the description of the module.
void	setName (const std::string &name)
	Set the name of the module.
void	setPropertyFlags (unsigned int propertyFlags)
	Sets the flags for the module properties.
LogConfig &	getLogConfig ()
	Returns the log system configuration.
void	setLogConfig (const LogConfig &logConfig)
	Set the log system configuration.
void	setLogLevel (int logLevel)
	Configure the log level.
void	setDebugLevel (int debugLevel)
	Configure the debug messaging level.
void	setAbortLevel (int abortLevel)
	Configure the abort log level.
void	setLogInfo (int logLevel, unsigned int logInfo)
	Configure the printed log information for the given level.
void	if_value (const std::string &expression, const std::shared_ptr< Path > &path, EAfterConditionPath afterConditionPath=EAfterConditionPath::c_End)
	Add a condition to the module.
void	if_false (const std::shared_ptr< Path > &path, EAfterConditionPath afterConditionPath=EAfterConditionPath::c_End)
	A simplified version to add a condition to the module.
void	if_true (const std::shared_ptr< Path > &path, EAfterConditionPath afterConditionPath=EAfterConditionPath::c_End)
	A simplified version to set the condition of the module.
bool	hasCondition () const
	Returns true if at least one condition was set for the module.
const ModuleCondition *	getCondition () const
	Return a pointer to the first condition (or nullptr, if none was set)
const std::vector< ModuleCondition > &	getAllConditions () const
	Return all set conditions for this module.
bool	evalCondition () const
	If at least one condition was set, it is evaluated and true returned if at least one condition returns true.
std::shared_ptr< Path >	getConditionPath () const
	Returns the path of the last true condition (if there is at least one, else reaturn a null pointer).
Module::EAfterConditionPath	getAfterConditionPath () const
	What to do after the conditional path is finished.
std::vector< std::shared_ptr< Path > >	getAllConditionPaths () const
	Return all condition paths currently set (no matter if the condition is true or not).
bool	hasProperties (unsigned int propertyFlags) const
	Returns true if all specified property flags are available in this module.
bool	hasUnsetForcedParams () const
	Returns true and prints error message if the module has unset parameters which the user has to set in the steering file.
const ModuleParamList &	getParamList () const
	Return module param list.
template<typename T>
ModuleParam< T > &	getParam (const std::string &name) const
	Returns a reference to a parameter.
bool	hasReturnValue () const
	Return true if this module has a valid return value set.
int	getReturnValue () const
	Return the return value set by this module.
std::shared_ptr< PathElement >	clone () const override
	Create an independent copy of this module.
std::shared_ptr< boost::python::list >	getParamInfoListPython () const
	Returns a python list of all parameters.

Static Public Member Functions
static void	exposePythonAPI ()
	Exposes methods of the Module class to Python.

Protected Member Functions
virtual void	def_initialize ()
	Wrappers to make the methods without "def_" prefix callable from Python.
virtual void	def_beginRun ()
	Wrapper method for the virtual function beginRun() that has the implementation to be used in a call from Python.
virtual void	def_event ()
	Wrapper method for the virtual function event() that has the implementation to be used in a call from Python.
virtual void	def_endRun ()
	This method can receive that the current run ends as a call from the Python side.
virtual void	def_terminate ()
	Wrapper method for the virtual function terminate() that has the implementation to be used in a call from Python.
void	setDescription (const std::string &description)
	Sets the description of the module.
void	setType (const std::string &type)
	Set the module type.
template<typename T>
void	addParam (const std::string &name, T &paramVariable, const std::string &description, const T &defaultValue)
	Adds a new parameter to the module.
template<typename T>
void	addParam (const std::string &name, T &paramVariable, const std::string &description)
	Adds a new enforced parameter to the module.
void	setReturnValue (int value)
	Sets the return value for this module as integer.
void	setReturnValue (bool value)
	Sets the return value for this module as bool.
void	setParamList (const ModuleParamList &params)
	Replace existing parameter list.

Private Member Functions
std::list< ModulePtr >	getModules () const override
	no submodules, return empty list
std::string	getPathString () const override
	return the module name.
void	setParamPython (const std::string &name, const boost::python::object &pyObj)
	Implements a method for setting boost::python objects.
void	setParamPythonDict (const boost::python::dict &dictionary)
	Implements a method for reading the parameter values from a boost::python dictionary.

Private Attributes
StoreObjPtr< TRGGRLInfo >	m_TRGGRLInfo
	output for TRGGRLInfo
int	m_simulationMode
	Mode for TRGGRL simulation.
int	m_fastSimulationMode
	Switch for the fast simulation.
int	m_firmwareSimulationMode
	Switch for the firmware simulation. 0:do nothing, 1:do everything.
double	m_dr_threshold
	max value of dr to be identified as match
double	m_dz_threshold
	max value of dz to be identified as match
int	m_dphi_d_threshold
	max value of dphi_d to be identified as match, 1 digit = 10 degrees
double	m_e_threshold
	min value of isolated cluster energy
double	m_dphi_klm_threshold
	max value of dphi (CDC track to KLM sector) to be identified as match (in degrees)
std::vector< bool >	track_phimap
	36 bits phi map of all 2D tracks
std::vector< bool >	track_phimap_i
	36 bits phi map of all 2D tracks
std::vector< bool >	eecl_phimap
	36 bits phi map of ECL clusters at endcap
std::vector< bool >	eecl_phimap_fwd
	36 bits phi map of ECL clusters at forward endcap
std::vector< bool >	eecl_phimap_bwd
	36 bits phi map of ECL clusters at backward endcap
std::vector< bool >	eecl_sectormap_fwd
	8 bits sector map of ECL clusters at forward endcap
std::vector< bool >	eecl_sectormap_bwd
	8 bits sector map of ECL clusters at backward endcap
std::vector< bool >	eklm_sectormap
	8 bits phi map of KLM clusters at endcap
std::vector< bool >	eklm_sectormap_fwd
	8 bits sector map of KLM clusters at forward endcap
std::vector< bool >	eklm_sectormap_bwd
	8 bits sector map of KLM clusters at backward endcap
std::string	m_2d_tracklist
	the 2D finder track list
std::string	m_3d_tracklist
	the 3D NN track list
std::string	m_clusterlist
	the ecl cluster list
std::string	m_klmtrgsummarylist
	the KLM track list
std::string	m_2dmatch_tracklist
	the distance in phi direction between track and cluster
std::string	m_phimatch_tracklist
	the matched 2d track list by phi matching
std::string	m_3dmatch_tracklist
	the matched 3d track list
std::string	m_klmmatch_tracklist
	the matched 2d track list by KLM matching
std::string	m_grlphotonlist
	Non-matched cluster list at GRL.
std::string	m_hitCollectionName
	Track Segment list.
std::string	m_grlstCollectionName
	GRL short track list.
std::string	m_grlitCollectionName
	GRL inner track list.
std::string	m_TrgGrlInformationName
	Name of the StoreArray holding projects information from grl.
std::vector< std::vector< int > >	patterns_base0
	Short tracking patterns based on SL0.
std::vector< std::vector< int > >	patterns_base2
	Short tracking patterns based on SL2.
std::string	m_name
	The name of the module, saved as a string (user-modifiable)
std::string	m_type
	The type of the module, saved as a string.
std::string	m_package
	Package this module is found in (may be empty).
std::string	m_description
	The description of the module.
unsigned int	m_propertyFlags
	The properties of the module as bitwise or (with |) of EModulePropFlags.
LogConfig	m_logConfig
	The log system configuration of the module.
ModuleParamList	m_moduleParamList
	List storing and managing all parameter of the module.
bool	m_hasReturnValue
	True, if the return value is set.
int	m_returnValue
	The return value.
std::vector< ModuleCondition >	m_conditions
	Module condition, only non-null if set.

Detailed Description

Match between CDC trigger track and ECL trigger cluster.

Definition at line 36 of file TRGGRLMatchModule.h.

Member Typedef Documentation

EAfterConditionPath

typedef ModuleCondition::EAfterConditionPath EAfterConditionPath

inherited

Forward the EAfterConditionPath definition from the ModuleCondition.

Definition at line 88 of file Module.h.

Member Enumeration Documentation

EModulePropFlags

enum EModulePropFlags

inherited

Each module can be tagged with property flags, which indicate certain features of the module.

Enumerator
c_Input	This module is an input module (reads data).
c_Output	This module is an output module (writes data).
c_ParallelProcessingCertified	This module can be run in parallel processing mode safely (All I/O must be done through the data store, in particular, the module must not write any files.)
c_HistogramManager	This module is used to manage histograms accumulated by other modules.
c_InternalSerializer	This module is an internal serializer/deserializer for parallel processing.
c_TerminateInAllProcesses	When using parallel processing, call this module's terminate() function in all processes(). This will also ensure that there is exactly one process (single-core if no parallel modules found) or at least one input, one main and one output process.
c_DontCollectStatistics	No statistics is collected for this module.

Definition at line 77 of file Module.h.

                          {
      c_Input                       = 1,  
      c_Output                      = 2,  
      c_ParallelProcessingCertified = 4,  
      c_HistogramManager            = 8, 
      c_InternalSerializer          = 16,  
      c_TerminateInAllProcesses     = 32,  
      c_DontCollectStatistics       = 64,  
    };

Constructor & Destructor Documentation

TRGGRLMatchModule()

TRGGRLMatchModule

(

)

Constructor: Sets the description, the properties and the parameters of the module.

Definition at line 43 of file TRGGRLMatchModule.cc.

                                     : Module()
{
  // Set module properties
  setDescription("match CDC trigger tracks and ECL trigger clusters");
  setPropertyFlags(c_ParallelProcessingCertified);
  addParam("SimulationMode", m_simulationMode, "TRGGRL simulation switch", 1);
  addParam("FastSimulationMode", m_fastSimulationMode, "TRGGRL fast simulation mode", m_fastSimulationMode);
  addParam("FirmwareSimulationMode", m_firmwareSimulationMode, "TRGGRL firmware simulation mode", m_firmwareSimulationMode);
 
  addParam("DrMatch", m_dr_threshold, "the threshold of dr between track and cluster if they are matched successfully", 25.);
  addParam("DzMatch", m_dz_threshold, "the threshold of dz between track and cluster if they are matched successfully", 30.);
  addParam("DphidMatch", m_dphi_d_threshold, "the threshold of dphi_d between track and cluster if they are matched successfully", 2);
  addParam("Ephoton", m_e_threshold, "the threshold of cluster energy as a photon", 1.0);
  addParam("KLMMatch", m_dphi_klm_threshold,
           "the threshold of dphi (in degree) between track and KLM sector if they are matched successfully", 32.5);
  addParam("2DtrackCollection", m_2d_tracklist, "the 2d track list used in the match", std::string("TRGCDC2DFinderTracks"));
  addParam("3DtrackCollection", m_3d_tracklist, "the 3d track list used in the match", std::string("TRGCDCNeuroTracks"));
  addParam("TRGECLClusterCollection", m_clusterlist, "the cluster list used in the match", std::string("TRGECLClusters"));
  addParam("KLMTrgrSummary", m_klmtrgsummarylist, "the KLM track list used in the match", std::string("KLMTrgSummary"));
  addParam("2DmatchCollection", m_2dmatch_tracklist, "the 2d tracklist with associated cluster", std::string("TRG2DMatchTracks"));
  addParam("PhimatchCollection", m_phimatch_tracklist, "the 2d tracklist with associated cluster", std::string("TRGPhiMatchTracks"));
  addParam("3DmatchCollection", m_3dmatch_tracklist, "the 3d NN tracklist with associated cluster", std::string("TRG3DMatchTracks"));
  addParam("KLMmatchCollection", m_klmmatch_tracklist, "the 2d tracklist with associated KLM track",
           std::string("TRGKLMMatchTracks"));
  addParam("GRLphotonCollection", m_grlphotonlist, "the isolated cluster list", std::string("TRGGRLPhotons"));
  addParam("hitCollectionName", m_hitCollectionName, "Name of the input StoreArray of CDCTriggerSegmentHits.", std::string(""));
  addParam("TrgGrlInformation", m_TrgGrlInformationName,
           "Name of the StoreArray holding the information of tracks and clusters from cdc ecl klm.",
           std::string("TRGGRLObjects"));
  addParam("grlstCollectionName", m_grlstCollectionName, "Name of the output StoreArray of TRGGRLShortTrack.",
           std::string("TRGGRLShortTracks"));
  addParam("grlitCollectionName", m_grlitCollectionName, "Name of the output StoreArray of TRGGRLInnerTrack.",
           std::string("TRGGRLInnerTracks"));
 
 
}

~TRGGRLMatchModule()

~TRGGRLMatchModule ( )

virtual

Destructor.

Definition at line 80 of file TRGGRLMatchModule.cc.

{
}

Member Function Documentation

beginRun()

void beginRun ( void )

overridevirtual

Called when entering a new run.

␈

Reimplemented from Module.

Definition at line 153 of file TRGGRLMatchModule.cc.

{
}

calculationdistance()

void calculationdistance	(	CDCTriggerTrack *	track,
		TRGECLCluster *	cluster,
		double *	ds,
		int	_match3D )

calculate dr and dz between track and cluster

Definition at line 341 of file TRGGRLMatchModule.cc.

{
 
//double    _pt = _track->getTransverseMomentum(1.5);
  double    _r = 1.0 / _track->getOmega() ;
  double    _phi = _track->getPhi0() ;
 
  //-- cluster/TRGECL information
  double    _cluster_x = _cluster->getPositionX();
  double    _cluster_y = _cluster->getPositionY();
  double    _cluster_z = _cluster->getPositionZ();
  double    _R = sqrt(_cluster_x * _cluster_x + _cluster_y * _cluster_y);
//double    _D = sqrt(_cluster_x * _cluster_x + _cluster_y * _cluster_y + _cluster_z * _cluster_z);
//double    _re_scaled_p = _pt * _D / _R;
 
  //-- calculation
  if (_R > abs(2 * _r)) {
    ds[0] = 99999.;
  } else {
    double theta0 = _phi - asin(_R / (2 * _r));
 
    double ex_x0 = _R * cos(theta0), ex_y0 = _R * sin(theta0);
    ds[0] = sqrt((ex_x0 - _cluster_x) * (ex_x0 - _cluster_x) + (ex_y0 - _cluster_y) * (ex_y0 - _cluster_y));
  }
  //z information
  if (_match3D == 1) {
    double      _z0 = _track->getZ0();
    double      _slope = _track->getCotTheta();
    double      _ex_z = _z0 + _slope * 2 * _r * asin(_R / (2 * _r));
    ds[1] = fabs(_cluster_z - _ex_z);
 
  }
 
}

calculationphiangle()

void calculationphiangle	(	CDCTriggerTrack *	track,
		TRGECLCluster *	cluster,
		int &	dphi_d,
		std::vector< bool > &	track_phimap,
		std::vector< bool > &	track_phimap_i )

calculate dphi_d between track and cluster

Definition at line 376 of file TRGGRLMatchModule.cc.

{
 
  //-- 2D track information
  double    _r = 1.0 / _track->getOmega() ;
  double    _phi = _track->getPhi0() ;
 
  //-- 2D phi angle calculation
  double phi_p = acos(126.0 / (2 * fabs(_r))); // adjustment angle between 0 to 0.5*M_PI
  int charge = 0;
  if (_r > 0) {charge = 1;}
  else if (_r < 0) {charge = -1;}
  else {charge = 0;}
 
  double phi_CDC = 0.0;
  if (charge == 1) {
    phi_CDC = _phi + phi_p - 0.5 * M_PI;
  } else if (charge == -1) {
    phi_CDC = _phi - phi_p + 0.5 * M_PI;
  } else {
    phi_CDC = _phi;
  }
 
  if (phi_CDC > 2 * M_PI) {phi_CDC = phi_CDC - 2 * M_PI;}
  else if (phi_CDC < 0) {phi_CDC = phi_CDC + 2 * M_PI;}
  if (_phi > 2 * M_PI) {_phi = _phi - 2 * M_PI;}
  else if (_phi < 0) {_phi = _phi + 2 * M_PI;}
 
  //-- cluster/TRGECL information
  double    _cluster_x = _cluster->getPositionX();
  double    _cluster_y = _cluster->getPositionY();
 
  // -- ECL phi angle
  double phi_ECL = 0.0;
  if (_cluster_x >= 0 && _cluster_y >= 0) {phi_ECL = atan(_cluster_y / _cluster_x);}
  else if (_cluster_x < 0 && _cluster_y >= 0) {phi_ECL = atan(_cluster_y / _cluster_x) + M_PI;}
  else if (_cluster_x < 0 && _cluster_y < 0) {phi_ECL = atan(_cluster_y / _cluster_x) + M_PI;}
  else if (_cluster_x >= 0 && _cluster_y < 0) {phi_ECL = atan(_cluster_y / _cluster_x) + 2 * M_PI;}
 
  int phi_ECL_d = 0, phi_CDC_d = 0, phi_i_d = 0;
  // digitization on both angle
  for (int i = 0; i < 36; i++) {
    if (phi_ECL > i * M_PI / 18 && phi_ECL < (i + 1)*M_PI / 18) {phi_ECL_d = i;}
    if (_phi > i * M_PI / 18 && _phi < (i + 1)*M_PI / 18) {phi_i_d = i;}
    if (phi_CDC > i * M_PI / 18 && phi_CDC < (i + 1)*M_PI / 18) {phi_CDC_d = i;}
  }
 
  phimap[phi_CDC_d] = true;
  phimap_i[phi_i_d] = true;
 
  if (abs(phi_ECL_d - phi_CDC_d) == 0 || abs(phi_ECL_d - phi_CDC_d) == 36) {dphi_d = 0;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 1 || abs(phi_ECL_d - phi_CDC_d) == 35) {dphi_d = 1;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 2 || abs(phi_ECL_d - phi_CDC_d) == 34) {dphi_d = 2;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 3 || abs(phi_ECL_d - phi_CDC_d) == 33) {dphi_d = 3;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 4 || abs(phi_ECL_d - phi_CDC_d) == 32) {dphi_d = 4;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 5 || abs(phi_ECL_d - phi_CDC_d) == 31) {dphi_d = 5;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 6 || abs(phi_ECL_d - phi_CDC_d) == 30) {dphi_d = 6;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 7 || abs(phi_ECL_d - phi_CDC_d) == 29) {dphi_d = 7;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 8 || abs(phi_ECL_d - phi_CDC_d) == 28) {dphi_d = 8;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 9 || abs(phi_ECL_d - phi_CDC_d) == 27) {dphi_d = 9;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 10 || abs(phi_ECL_d - phi_CDC_d) == 26) {dphi_d = 10;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 11 || abs(phi_ECL_d - phi_CDC_d) == 25) {dphi_d = 11;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 12 || abs(phi_ECL_d - phi_CDC_d) == 24) {dphi_d = 12;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 13 || abs(phi_ECL_d - phi_CDC_d) == 23) {dphi_d = 13;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 14 || abs(phi_ECL_d - phi_CDC_d) == 22) {dphi_d = 14;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 15 || abs(phi_ECL_d - phi_CDC_d) == 21) {dphi_d = 15;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 16 || abs(phi_ECL_d - phi_CDC_d) == 20) {dphi_d = 16;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 17 || abs(phi_ECL_d - phi_CDC_d) == 19) {dphi_d = 17;}
  else if (abs(phi_ECL_d - phi_CDC_d) == 18) {dphi_d = 18;}
 
}

clone()

std::shared_ptr< PathElement > clone ( ) const

overridevirtualinherited

Create an independent copy of this module.

Note that parameters are shared, so changing them on a cloned module will also affect the original module.

Implements PathElement.

Definition at line 179 of file Module.cc.

{
  ModulePtr newModule = ModuleManager::Instance().registerModule(getType());
  newModule->m_moduleParamList.setParameters(getParamList());
  newModule->setName(getName());
  newModule->m_package = m_package;
  newModule->m_propertyFlags = m_propertyFlags;
  newModule->m_logConfig = m_logConfig;
  newModule->m_conditions = m_conditions;
 
  return newModule;
}

def_beginRun()

virtual void def_beginRun ( )

inlineprotectedvirtualinherited

Wrapper method for the virtual function beginRun() that has the implementation to be used in a call from Python.

Reimplemented in PyModule.

Definition at line 425 of file Module.h.

{ beginRun(); }

def_endRun()

virtual void def_endRun ( )

inlineprotectedvirtualinherited

This method can receive that the current run ends as a call from the Python side.

For regular C++-Modules that forwards the call to the regular endRun() method.

Reimplemented in PyModule.

Definition at line 438 of file Module.h.

{ endRun(); }

def_event()

virtual void def_event ( )

inlineprotectedvirtualinherited

Wrapper method for the virtual function event() that has the implementation to be used in a call from Python.

Reimplemented in PyModule.

Definition at line 431 of file Module.h.

{ event(); }

def_initialize()

virtual void def_initialize ( )

inlineprotectedvirtualinherited

Wrappers to make the methods without "def_" prefix callable from Python.

Overridden in PyModule. Wrapper method for the virtual function initialize() that has the implementation to be used in a call from Python.

Reimplemented in PyModule.

Definition at line 419 of file Module.h.

{ initialize(); }

def_terminate()

virtual void def_terminate ( )

inlineprotectedvirtualinherited

Wrapper method for the virtual function terminate() that has the implementation to be used in a call from Python.

Reimplemented in PyModule.

Definition at line 444 of file Module.h.

{ terminate(); }

endRun()

void endRun ( void )

overridevirtual

End-of-run action.

Reimplemented from Module.

Definition at line 333 of file TRGGRLMatchModule.cc.

{
}

evalCondition()

bool evalCondition ( ) const

inherited

If at least one condition was set, it is evaluated and true returned if at least one condition returns true.

If no condition or result value was defined, the method returns false. Otherwise, the condition is evaluated and true returned, if at least one condition returns true. To speed up the evaluation, the condition strings were already parsed in the method if_value().

Returns

True if at least one condition and return value exists and at least one condition expression was evaluated to true.

Definition at line 96 of file Module.cc.

{
  if (m_conditions.empty()) return false;
 
  //okay, a condition was set for this Module...
  if (!m_hasReturnValue) {
    B2FATAL("A condition was set for '" << getName() << "', but the module did not set a return value!");
  }
 
  for (const auto& condition : m_conditions) {
    if (condition.evaluate(m_returnValue)) {
      return true;
    }
  }
  return false;
}

event()

void event ( void )

overridevirtual

Event processor.

Reimplemented from Module.

Definition at line 157 of file TRGGRLMatchModule.cc.

{
 
  StoreArray<CDCTriggerTrack> track2Dlist(m_2d_tracklist);
  StoreArray<CDCTriggerTrack> track3Dlist(m_3d_tracklist);
  StoreArray<TRGECLCluster> clusterlist(m_clusterlist);
  StoreObjPtr<KLMTrgSummary> klmtrgsummary(m_klmtrgsummarylist);
  StoreArray<CDCTriggerSegmentHit> tslist(m_hitCollectionName);
  StoreArray<TRGGRLMATCH> track2Dmatch(m_2dmatch_tracklist);
  StoreArray<TRGGRLMATCH> trackphimatch(m_phimatch_tracklist);
  StoreArray<TRGGRLMATCH> track3Dmatch(m_3dmatch_tracklist);
  StoreArray<TRGGRLMATCHKLM> trackKLMmatch(m_klmmatch_tracklist);
  StoreArray<TRGGRLPHOTON> grlphoton(m_grlphotonlist);
  StoreArray<TRGGRLShortTrack> grlst(m_grlstCollectionName);
  StoreArray<TRGGRLInnerTrack> grlit(m_grlitCollectionName);
  StoreObjPtr<TRGGRLInfo> trgInfo(m_TrgGrlInformationName);
  trgInfo.create();
 
//initialize the phi map
 
  track_phimap.clear();
  track_phimap_i.clear();
  eecl_phimap.clear();
  eecl_phimap_fwd.clear();
  eecl_phimap_bwd.clear();
  eecl_sectormap_fwd.clear();
  eecl_sectormap_bwd.clear();
  eklm_sectormap.clear();
  eklm_sectormap_fwd.clear();
  eklm_sectormap_bwd.clear();
 
  for (int i = 0; i < 36; i++) {
    track_phimap.push_back(false);
    track_phimap_i.push_back(false);
    eecl_phimap.push_back(false);
    eecl_phimap_fwd.push_back(false);
    eecl_phimap_bwd.push_back(false);
  }
  for (int i = 0; i < 4; i++) {
    eecl_sectormap_fwd.push_back(false);
    eecl_sectormap_bwd.push_back(false);
    eklm_sectormap.push_back(false);
    eklm_sectormap_fwd.push_back(false);
    eklm_sectormap_bwd.push_back(false);
  }
 
//do 2d track match with ECL and KLM cluster
  int klmtrack_ind_phi_map[8] = {};
  for (int i = 0; i < track2Dlist.getEntries(); i++) {
 
    double dr_tmp = 99999.;
    int dphi_d_tmp = 100;
    double dphi_klm_tmp = 100;
    int cluster_ind = -1;
    int cluster_ind_phi = -1;
    int klmtrack_ind_phi = -1;
 
// do 2d track match with KLMTrgSummary
    sectormatching_klm(track2Dlist[i], klmtrgsummary, dphi_klm_tmp, klmtrack_ind_phi);
 
    for (int j = 0; j < clusterlist.getEntries(); j++) {
      // skip the end-cap cluster
      double _cluster_x = clusterlist[j]->getPositionX();
      double _cluster_y = clusterlist[j]->getPositionY();
      double _cluster_z = clusterlist[j]->getPositionZ();
      double _cluster_theta = atan(_cluster_z / (sqrt(_cluster_x * _cluster_x + _cluster_y * _cluster_y)));
      _cluster_theta = 0.5 * M_PI - _cluster_theta;
      if (_cluster_theta < M_PI * 35.0 / 180.0 || _cluster_theta > M_PI * 126.0 / 180.0) continue;
 
      double ds_ct[2] = {99999., 99999.};
      calculationdistance(track2Dlist[i], clusterlist[j], ds_ct, 0);
      int dphi_d = 0;
      calculationphiangle(track2Dlist[i], clusterlist[j], dphi_d, track_phimap, track_phimap_i);
 
      if (dr_tmp > ds_ct[0]) {
        dr_tmp = ds_ct[0];
        cluster_ind = j;
      }
      if (dphi_d_tmp > dphi_d) {
        dphi_d_tmp = dphi_d;
        cluster_ind_phi = j;
      }
 
    }
 
    if (dr_tmp < m_dr_threshold && cluster_ind != -1) {
      TRGGRLMATCH* mat2d = track2Dmatch.appendNew();
      mat2d->setDeltaR(dr_tmp);
      mat2d->addRelationTo(track2Dlist[i]);
      mat2d->addRelationTo(clusterlist[cluster_ind]);
      //   track2Dlist[i]->addRelationTo(clusterlist[cluster_ind]);
      clusterlist[cluster_ind]->addRelationTo(track2Dlist[i]);
    }
    if (dphi_d_tmp < m_dphi_d_threshold && cluster_ind_phi != -1) {
      TRGGRLMATCH* matphi = trackphimatch.appendNew();
      matphi->set_dphi_d(dphi_d_tmp);
      matphi->addRelationTo(track2Dlist[i]);
      matphi->addRelationTo(clusterlist[cluster_ind_phi]);
      matphi->set_e(clusterlist[cluster_ind_phi]->getEnergyDep());
      //   track2Dlist[i]->addRelationTo(clusterlist[cluster_ind]);
      clusterlist[cluster_ind_phi]->addRelationTo(track2Dlist[i]);
    }
 
    if (dphi_klm_tmp < m_dphi_klm_threshold * M_PI / 180.0 && klmtrack_ind_phi > -1 && klmtrack_ind_phi < 8) {
      if (klmtrack_ind_phi_map[klmtrack_ind_phi] == 0) {
        TRGGRLMATCHKLM* matklm = trackKLMmatch.appendNew();
        matklm->set_dphi(dphi_klm_tmp);
        matklm->set_sector(klmtrack_ind_phi);
        matklm->addRelationTo(track2Dlist[i]);
        klmtrack_ind_phi_map[klmtrack_ind_phi] = 1;
      }
    }
 
  }
 
 
//do 3d track match with cluster
  for (int i = 0; i < track3Dlist.getEntries(); i++) {
 
    double dr_tmp = 99999.;
    double dz_tmp = 99999.;
    int cluster_ind = -1;
    for (int j = 0; j < clusterlist.getEntries(); j++) {
      // skip the end-cap cluster
      double _cluster_x = clusterlist[j]->getPositionX();
      double _cluster_y = clusterlist[j]->getPositionY();
      double _cluster_z = clusterlist[j]->getPositionZ();
      double _cluster_theta = atan(_cluster_z / (sqrt(_cluster_x * _cluster_x + _cluster_y * _cluster_y)));
      _cluster_theta = 0.5 * M_PI - _cluster_theta;
      if (_cluster_theta < M_PI * 35.0 / 180.0 || _cluster_theta > M_PI * 126.0 / 180.0) continue;
 
      double ds_ct[2] = {99999., 99999.};
      calculationdistance(track3Dlist[i], clusterlist[j], ds_ct, 1);
      if (dr_tmp > ds_ct[0]) {
        dr_tmp = ds_ct[0];
        dz_tmp = ds_ct[1];
        cluster_ind = j;
      }
    }
    if (dr_tmp < m_dr_threshold && dz_tmp < m_dz_threshold && cluster_ind != -1) {
      TRGGRLMATCH* mat3d = track3Dmatch.appendNew();
      mat3d->setDeltaR(dr_tmp);
      mat3d->setDeltaZ(dz_tmp);
      mat3d->addRelationTo(track3Dlist[i]);
      mat3d->addRelationTo(clusterlist[cluster_ind]);
      clusterlist[cluster_ind]->addRelationTo(track3Dlist[i]);
    }
  }
 
//pick up isolated clusters as photons with energy threshold
  for (int j = 0; j < clusterlist.getEntries(); j++) {
    if (photon_cluster(clusterlist[j], track_phimap, m_e_threshold)) {
      TRGGRLPHOTON* photon = grlphoton.appendNew();
      photon->set_e(clusterlist[j]->getEnergyDep());
      photon->addRelationTo(clusterlist[j]);
    }
  }
 
//endcap cluster map
  make_eecl_map(clusterlist, eecl_phimap, eecl_phimap_fwd, eecl_phimap_bwd, eecl_sectormap_fwd, eecl_sectormap_bwd);
  make_eklm_map(klmtrgsummary, eklm_sectormap, eklm_sectormap_fwd, eklm_sectormap_bwd);
 
// Short tracking
  std::vector<bool> map_veto(64, 0);
  make_veto_map(track2Dlist, map_veto);
  short_tracking(tslist, map_veto, track_phimap_i, eecl_phimap_fwd, eecl_phimap_bwd, eklm_sectormap_fwd, eklm_sectormap_bwd,
                 patterns_base0, patterns_base2, grlst, trgInfo);
 
// Inner tracking
  inner_tracking(tslist, track_phimap_i, eecl_phimap, eklm_sectormap, grlit, trgInfo);
 
// EECL-EKLM matching
  matching_eecl_eklm(eecl_sectormap_fwd, eecl_sectormap_bwd, eklm_sectormap_fwd, eklm_sectormap_bwd, trgInfo);
 
}

exposePythonAPI()

void exposePythonAPI ( )

staticinherited

Exposes methods of the Module class to Python.

Definition at line 325 of file Module.cc.

{
  // to avoid confusion between std::arg and boost::python::arg we want a shorthand namespace as well
  namespace bp = boost::python;
 
  docstring_options options(true, true, false); //userdef, py sigs, c++ sigs
 
  void (Module::*setReturnValueInt)(int) = &Module::setReturnValue;
 
  enum_<Module::EAfterConditionPath>("AfterConditionPath",
                                     R"(Determines execution behaviour after a conditional path has been executed:
 
.. attribute:: END
 
  End processing of this path after the conditional path. (this is the default for if_value() etc.)
 
.. attribute:: CONTINUE
 
  After the conditional path, resume execution after this module.)")
  .value("END", Module::EAfterConditionPath::c_End)
  .value("CONTINUE", Module::EAfterConditionPath::c_Continue)
  ;
 
  /* Do not change the names of >, <, ... we use them to serialize conditional paths */
  enum_<Belle2::ModuleCondition::EConditionOperators>("ConditionOperator")
  .value(">", Belle2::ModuleCondition::EConditionOperators::c_GT)
  .value("<", Belle2::ModuleCondition::EConditionOperators::c_ST)
  .value(">=", Belle2::ModuleCondition::EConditionOperators::c_GE)
  .value("<=", Belle2::ModuleCondition::EConditionOperators::c_SE)
  .value("==", Belle2::ModuleCondition::EConditionOperators::c_EQ)
  .value("!=", Belle2::ModuleCondition::EConditionOperators::c_NE)
  ;
 
  enum_<Module::EModulePropFlags>("ModulePropFlags",
                                  R"(Flags to indicate certain low-level features of modules, see :func:`Module.set_property_flags()`, :func:`Module.has_properties()`. Most useful flags are:
 
.. attribute:: PARALLELPROCESSINGCERTIFIED
 
    This module can be run in parallel processing mode safely (All I/O must be done through the data store, in particular, the module must not write any files.)
 
.. attribute:: HISTOGRAMMANAGER
 
  This module is used to manage histograms accumulated by other modules
 
.. attribute:: TERMINATEINALLPROCESSES
 
  When using parallel processing, call this module's terminate() function in all processes. This will also ensure that there is exactly one process (single-core if no parallel modules found) or at least one input, one main and one output process.
)")
  .value("INPUT", Module::EModulePropFlags::c_Input)
  .value("OUTPUT", Module::EModulePropFlags::c_Output)
  .value("PARALLELPROCESSINGCERTIFIED", Module::EModulePropFlags::c_ParallelProcessingCertified)
  .value("HISTOGRAMMANAGER", Module::EModulePropFlags::c_HistogramManager)
  .value("INTERNALSERIALIZER", Module::EModulePropFlags::c_InternalSerializer)
  .value("TERMINATEINALLPROCESSES", Module::EModulePropFlags::c_TerminateInAllProcesses)
  ;
 
  //Python class definition
  class_<Module, PyModule> module("Module", R"(
Base class for Modules.
 
A module is the smallest building block of the framework.
A typical event processing chain consists of a Path containing
modules. By inheriting from this base class, various types of
modules can be created. To use a module, please refer to
:func:`Path.add_module()`.  A list of modules is available by running
``basf2 -m`` or ``basf2 -m package``, detailed information on parameters is
given by e.g. ``basf2 -m RootInput``.
 
The 'Module Development' section in the manual provides detailed information
on how to create modules, setting parameters, or using return values/conditions:
https://xwiki.desy.de/xwiki/rest/p/f4fa4/#HModuleDevelopment
 
)");
  module
  .def("__str__", &Module::getPathString)
  .def("name", &Module::getName, return_value_policy<copy_const_reference>(),
       "Returns the name of the module. Can be changed via :func:`set_name() <Module.set_name()>`, use :func:`type() <Module.type()>` for identifying a particular module class.")
  .def("type", &Module::getType, return_value_policy<copy_const_reference>(),
       "Returns the type of the module (i.e. class name minus 'Module')")
  .def("set_name", &Module::setName, args("name"), R"(
Set custom name, e.g. to distinguish multiple modules of the same type.
 
>>> path.add_module('EventInfoSetter')
>>> ro = path.add_module('RootOutput', branchNames=['EventMetaData'])
>>> ro.set_name('RootOutput_metadata_only')
>>> print(path)
[EventInfoSetter -> RootOutput_metadata_only]
 
)")
  .def("description", &Module::getDescription, return_value_policy<copy_const_reference>(),
       "Returns the description of this module.")
  .def("package", &Module::getPackage, return_value_policy<copy_const_reference>(),
       "Returns the package this module belongs to.")
  .def("available_params", &_getParamInfoListPython,
       "Return list of all module parameters as `ModuleParamInfo` instances")
  .def("has_properties", &Module::hasProperties, (bp::arg("properties")),
       R"DOCSTRING(Allows to check if the module has the given properties out of `ModulePropFlags` set.
 
>>> if module.has_properties(ModulePropFlags.PARALLELPROCESSINGCERTIFIED):
>>>     ...
 
Parameters:
  properties (int): bitmask of `ModulePropFlags` to check for.
)DOCSTRING")
  .def("set_property_flags", &Module::setPropertyFlags, args("property_mask"),
       "Set module properties in the form of an OR combination of `ModulePropFlags`.");
  {
    // python signature is too crowded, make ourselves
    docstring_options subOptions(true, false, false); //userdef, py sigs, c++ sigs
    module
    .def("if_value", &Module::if_value,
         (bp::arg("expression"), bp::arg("condition_path"), bp::arg("after_condition_path")= Module::EAfterConditionPath::c_End),
         R"DOCSTRING(if_value(expression, condition_path, after_condition_path=AfterConditionPath.END)
 
Sets a conditional sub path which will be executed after this
module if the return value set in the module passes the given ``expression``.
 
Modules can define a return value (int or bool) using ``setReturnValue()``,
which can be used in the steering file to split the Path based on this value, for example
 
>>> module_with_condition.if_value("<1", another_path)
 
In case the return value of the ``module_with_condition`` for a given event is
less than 1, the execution will be diverted into ``another_path`` for this event.
 
You could for example set a special return value if an error occurs, and divert
the execution into a path containing :b2:mod:`RootOutput` if it is found;
saving only the data producing/produced by the error.
 
After a conditional path has executed, basf2 will by default stop processing
the path for this event. This behaviour can be changed by setting the
``after_condition_path`` argument.
 
Parameters:
  expression (str): Expression to determine if the conditional path should be executed.
      This should be one of the comparison operators ``<``, ``>``, ``<=``,
      ``>=``, ``==``, or ``!=`` followed by a numerical value for the return value
  condition_path (Path): path to execute in case the expression is fulfilled
  after_condition_path (AfterConditionPath): What to do once the ``condition_path`` has been executed.
)DOCSTRING")
    .def("if_false", &Module::if_false,
         (bp::arg("condition_path"), bp::arg("after_condition_path")= Module::EAfterConditionPath::c_End),
         R"DOC(if_false(condition_path, after_condition_path=AfterConditionPath.END)
 
Sets a conditional sub path which will be executed after this module if
the return value of the module evaluates to False. This is equivalent to
calling `if_value` with ``expression=\"<1\"``)DOC")
    .def("if_true", &Module::if_true,
         (bp::arg("condition_path"), bp::arg("after_condition_path")= Module::EAfterConditionPath::c_End),
         R"DOC(if_true(condition_path, after_condition_path=AfterConditionPath.END)
 
Sets a conditional sub path which will be executed after this module if
the return value of the module evaluates to True. It is equivalent to
calling `if_value` with ``expression=\">=1\"``)DOC");
  }
  module
  .def("has_condition", &Module::hasCondition,
       "Return true if a conditional path has been set for this module "
       "using `if_value`, `if_true` or `if_false`")
  .def("get_all_condition_paths", &_getAllConditionPathsPython,
       "Return a list of all conditional paths set for this module using "
       "`if_value`, `if_true` or `if_false`")
  .def("get_all_conditions", &_getAllConditionsPython,
       "Return a list of all conditional path expressions set for this module using "
       "`if_value`, `if_true` or `if_false`")
  .add_property("logging", make_function(&Module::getLogConfig, return_value_policy<reference_existing_object>()),
                &Module::setLogConfig)

extrapolation()

void extrapolation	(	int	pattern,
		int &	l,
		int &	r,
		int &	ec )

Short track extrapolation (to endcap) function.

Definition at line 1531 of file TRGGRLMatchModule.cc.

{
  if (pattern == 6) {ec = 1; l = 0; r = 1;}
  if (pattern == 7) {ec = 1; l = 0; r = 1;}
  if (pattern == 8) {ec = 1; l = 0; r = 1;}
  if (pattern == 9) {ec = 1; l = 0; r = 2;}
  if (pattern == 10) {ec = 1; l = 0; r = 2;}
  if (pattern == 11) {ec = 1; l = 0; r = 1;}
  if (pattern == 12) {ec = 1; l = 0; r = 2;}
  if (pattern == 18) {ec = 1; l = 0; r = 2;}
  if (pattern == 19) {ec = 1; l = 0; r = 2;}
  if (pattern == 20) {ec = 1; l = 0; r = 4;}
  if (pattern == 21) {ec = 1; l = 0; r = 4;}
  if (pattern == 28) {ec = 1; l = -4; r = 0;}
  if (pattern == 29) {ec = 1; l = -3; r = 0;}
  if (pattern == 34) {ec = 1; l = 0; r = 1;}
  if (pattern == 35) {ec = 1; l = 0; r = 3;}
  if (pattern == 36) {ec = 1; l = 1; r = 3;}
  if (pattern == 37) {ec = 1; l = 0; r = 3;}
  if (pattern == 44) {ec = 1; l = -4; r = 0;}
  if (pattern == 45) {ec = 1; l = -2; r = 0;}
  if (pattern == 46) {ec = 1; l = -3; r = 0;}
  if (pattern == 54) {ec = 1; l = 1; r = 7;}
  if (pattern == 55) {ec = 1; l = 1; r = 6;}
  if (pattern == 56) {ec = 1; l = 1; r = 5;}
  if (pattern == 57) {ec = 1; l = 1; r = 5;}
  if (pattern == 64) {ec = 1; l = -6; r = -1;}
  if (pattern == 73) {ec = 1; l = 3; r = 13;}
  if (pattern == 81) {ec = 1; l = -10; r = -3;}
  if (pattern == 86) {ec = 1; l = 3; r = 12;}
  if (pattern == 87) {ec = 1; l = 3; r = 6;}
  if (pattern == 100) {ec = 1; l = 7; r = 20;}
  if (pattern == 101) {ec = 1; l = 5; r = 20;}
  if (pattern == 102) {ec = 1; l = 5; r = 20;}
  if (pattern == 103) {ec = 1; l = 4; r = 14;}
  if (pattern == 111) {ec = 1; l = -12; r = -5;}
  if (pattern == 112) {ec = 1; l = -18; r = -5;}
  if (pattern == 116) {ec = 1; l = -11; r = -6;}
  if (pattern == 120) {ec = 1; l = 7; r = 21;}
  if (pattern == 121) {ec = 1; l = 7; r = 14;}
  if (pattern == 122) {ec = 1; l = 7; r = 21;}
  if (pattern == 127) {ec = 1; l = -21; r = -8;}
  if (pattern == 128) {ec = 1; l = -15; r = -7;}
  if (pattern == 129) {ec = 1; l = -12; r = -7;}
  if (pattern == 132) {ec = 1; l = 10; r = 18;}
  if (pattern == 133) {ec = 1; l = 8; r = 18;}
 
  if (pattern == 0) {ec = 2; l = -3; r = 1;}
  if (pattern == 1) {ec = 2; l = -3; r = 1;}
  if (pattern == 3) {ec = 2; l = -3; r = 0;}
  if (pattern == 13) {ec = 2; l = 0; r = 3;}
  if (pattern == 14) {ec = 2; l = 0; r = 4;}
  if (pattern == 15) {ec = 2; l = 0; r = 5;}
  if (pattern == 22) {ec = 2; l = -4; r = -1;}
  if (pattern == 23) {ec = 2; l = -5; r = -1;}
  if (pattern == 24) {ec = 2; l = -3; r = 0;}
  if (pattern == 25) {ec = 2; l = -4; r = 0;}
  if (pattern == 30) {ec = 2; l = 1; r = 5;}
  if (pattern == 39) {ec = 2; l = -2; r = 0;}
  if (pattern == 40) {ec = 2; l = -2; r = 0;}
  if (pattern == 48) {ec = 2; l = 2; r = 6;}
  if (pattern == 49) {ec = 2; l = 3; r = 8;}
  if (pattern == 58) {ec = 2; l = -9; r = -3;}
  if (pattern == 59) {ec = 2; l = -9; r = -3;}
  if (pattern == 67) {ec = 2; l = 5; r = 11;}
  if (pattern == 75) {ec = 2; l = -13; r = -6;}
  if (pattern == 82) {ec = 2; l = 5; r = 9;}
  if (pattern == 83) {ec = 2; l = 5; r = 9;}
  if (pattern == 89) {ec = 2; l = -10; r = -4;}
  if (pattern == 92) {ec = 2; l = -10; r = -4;}
  if (pattern == 97) {ec = 2; l = 7; r = 19;}
  if (pattern == 105) {ec = 2; l = -16; r = -10;}
  if (pattern == 106) {ec = 2; l = -17; r = -7;}
  if (pattern == 109) {ec = 2; l = -17; r = -6;}
  if (pattern == 111) {ec = 2; l = -16; r = -7;}
  if (pattern == 117) {ec = 2; l = 9; r = 19;}
  if (pattern == 118) {ec = 2; l = 9; r = 19;}
  if (pattern == 124) {ec = 2; l = -17; r = -8;}
  if (pattern == 125) {ec = 2; l = -17; r = -8;}
  if (pattern == 126) {ec = 2; l = -17; r = -8;}
 
}

fill_pattern_base2()

void fill_pattern_base2

(

std::vector< std::vector< int > > &

patt

)

Fill the patterns in short tracking logic.

Definition at line 545 of file TRGGRLMatchModule.cc.

{
  patt.push_back({ 0, 0, 0, 0});
  patt.push_back({ 0, -1, 0, 0});
  patt.push_back({ 0, -1, 1, 0});
  patt.push_back({ 0, -1, -1, 0});
  patt.push_back({ 0, -2, 0, 0});
  patt.push_back({ 0, -2, 1, 0});
  patt.push_back({ 0, -2, 2, 0});
  patt.push_back({ 0, -2, 3, 0});
  patt.push_back({ 0, -3, 1, 0});
  patt.push_back({ 0, -3, 2, 0});
  patt.push_back({ 0, -3, 3, 0});
  patt.push_back({ 0, -4, 2, 0});
  patt.push_back({ 0, -4, 3, 0});
  patt.push_back({ 0, 0, 0, 1});
  patt.push_back({ 0, 0, 1, 1});
  patt.push_back({ 0, -1, 0, 1});
  patt.push_back({ 0, -1, 1, 1});
  patt.push_back({ 0, -1, 2, 1});
  patt.push_back({ 0, -2, 2, 1});
  patt.push_back({ 0, -2, 3, 1});
  patt.push_back({ 0, -3, 2, 1});
  patt.push_back({ 0, -3, 3, 1});
  patt.push_back({ 0, 0, 0, -1});
  patt.push_back({ 0, 0, -1, -1});
  patt.push_back({ 0, -1, 0, -1});
  patt.push_back({ 0, -1, -1, -1});
  patt.push_back({ 0, -2, 0, -1});
  patt.push_back({ 0, -2, 1, -1});
  patt.push_back({ 0, -3, 1, -1});
  patt.push_back({ 0, -3, 2, -1});
  patt.push_back({ -1, -1, 0, 0});
  patt.push_back({ -1, -1, 1, 0});
  patt.push_back({ -1, -2, 0, 0});
  patt.push_back({ -1, -2, 1, 0});
  patt.push_back({ -1, -3, 1, 0});
  patt.push_back({ -1, -3, 2, 0});
  patt.push_back({ -1, -3, 3, 0});
  patt.push_back({ -1, -4, 2, 0});
  patt.push_back({ -1, -4, 3, 0});
  patt.push_back({ 1, 0, 1, 0});
  patt.push_back({ 1, 0, 0, 0});
  patt.push_back({ 1, 0, -1, 0});
  patt.push_back({ 1, -1, 0, 0});
  patt.push_back({ 1, -1, 1, 0});
  patt.push_back({ 1, -2, 2, 0});
  patt.push_back({ 1, -2, 3, 0});
  patt.push_back({ 1, -3, 2, 0});
  patt.push_back({ 1, -3, 3, 0});
  patt.push_back({ -1, -1, 0, 1});
  patt.push_back({ -1, -1, 1, 1});
  patt.push_back({ -1, -2, 0, 1});
  patt.push_back({ -1, -2, 1, 1});
  patt.push_back({ -1, -2, 2, 1});
  patt.push_back({ -1, -3, 1, 1});
  patt.push_back({ -1, -3, 2, 1});
  patt.push_back({ -1, -3, 3, 1});
  patt.push_back({ -1, -4, 2, 1});
  patt.push_back({ -1, -4, 3, 1});
  patt.push_back({ 1, 0, -1, -1});
  patt.push_back({ 1, 0, 0, -1});
  patt.push_back({ 1, -1, -1, -1});
  patt.push_back({ 1, -1, 0, -1});
  patt.push_back({ 1, -1, 1, -1});
  patt.push_back({ 1, -2, 1, -1});
  patt.push_back({ 1, -2, 2, -1});
  patt.push_back({ 1, -3, 1, -1});
  patt.push_back({ 1, -3, 2, -1});
  patt.push_back({ -1, -1, 1, 2});
  patt.push_back({ -1, -1, 2, 2});
  patt.push_back({ -1, -2, 1, 2});
  patt.push_back({ -1, -2, 2, 2});
  patt.push_back({ -1, -2, 3, 2});
  patt.push_back({ -1, -3, 2, 2});
  patt.push_back({ -1, -3, 3, 2});
  patt.push_back({ -1, -3, 4, 2});
  patt.push_back({ 1, 0, -1, -2});
  patt.push_back({ 1, 0, 0, -2});
  patt.push_back({ 1, -1, 1, -2});
  patt.push_back({ 1, -1, 0, -2});
  patt.push_back({ 1, -1, -1, -2});
  patt.push_back({ 1, -2, 0, -2});
  patt.push_back({ 1, -2, 1, -2});
  patt.push_back({ -2, -2, 0, 1});
  patt.push_back({ -2, -2, 1, 1});
  patt.push_back({ -2, -3, 1, 1});
  patt.push_back({ -2, -3, 2, 1});
  patt.push_back({ -2, -4, 2, 1});
  patt.push_back({ -2, -4, 3, 1});
  patt.push_back({ -2, -5, 3, 1});
  patt.push_back({ 2, 1, 0, -1});
  patt.push_back({ 2, 0, 1, -1});
  patt.push_back({ 2, 0, 0, -1});
  patt.push_back({ 2, 0, -1, -1});
  patt.push_back({ 2, -1, 1, -1});
  patt.push_back({ 2, -1, 0, -1});
  patt.push_back({ 2, -2, 2, -1});
  patt.push_back({ 2, -2, 1, -1});
  patt.push_back({ -2, -2, 1, 2});
  patt.push_back({ -2, -2, 2, 2});
  patt.push_back({ -2, -3, 1, 2});
  patt.push_back({ -2, -3, 2, 2});
  patt.push_back({ -2, -3, 3, 2});
  patt.push_back({ -2, -4, 2, 2});
  patt.push_back({ -2, -4, 3, 2});
  patt.push_back({ -2, -4, 4, 2});
  patt.push_back({ 2, 1, 0, -2});
  patt.push_back({ 2, 1, -1, -2});
  patt.push_back({ 2, 0, 1, -2});
  patt.push_back({ 2, 0, 0, -2});
  patt.push_back({ 2, 0, -1, -2});
  patt.push_back({ 2, 0, -2, -2});
  patt.push_back({ 2, -1, 2, -2});
  patt.push_back({ 2, -1, 1, -2});
  patt.push_back({ 2, -1, 0, -2});
  patt.push_back({ 2, -1, -1, -2});
  patt.push_back({ 2, -2, 0, -2});
  patt.push_back({ 2, -2, 1, -2});
  patt.push_back({ -2, -2, 1, 3});
  patt.push_back({ -2, -2, 2, 3});
  patt.push_back({ -2, -3, 2, 3});
  patt.push_back({ -2, -3, 3, 3});
  patt.push_back({ -2, -3, 4, 3});
  patt.push_back({ -2, -4, 3, 3});
  patt.push_back({ -2, -4, 4, 3});
  patt.push_back({ 2, 1, -1, -3});
  patt.push_back({ 2, 0, -1, -3});
  patt.push_back({ 2, 0, -2, -3});
  patt.push_back({ 2, -1, 0, -3});
  patt.push_back({ 2, -2, 0, -3});
  patt.push_back({ 2, -2, 1, -3});
  patt.push_back({ -2, -2, 2, 4});
  patt.push_back({ -2, -3, 3, 4});
  patt.push_back({ -2, -3, 4, 4});
  patt.push_back({ -2, -4, 4, 4});
  patt.push_back({ 2, -1, 0, 4});
  patt.push_back({ 2, -1, -1, 4});
  patt.push_back({ 2, -2, 0, 4});
 
}

getAfterConditionPath()

Module::EAfterConditionPath getAfterConditionPath ( ) const

inherited

What to do after the conditional path is finished.

(defaults to c_End if no condition is set)

Definition at line 133 of file Module.cc.

{
  if (m_conditions.empty()) return EAfterConditionPath::c_End;
 
  //okay, a condition was set for this Module...
  if (!m_hasReturnValue) {
    B2FATAL("A condition was set for '" << getName() << "', but the module did not set a return value!");
  }
 
  for (const auto& condition : m_conditions) {
    if (condition.evaluate(m_returnValue)) {
      return condition.getAfterConditionPath();
    }
  }
 
  return EAfterConditionPath::c_End;
}

getAllConditionPaths()

std::vector< std::shared_ptr< Path > > getAllConditionPaths ( ) const

inherited

Return all condition paths currently set (no matter if the condition is true or not).

Definition at line 150 of file Module.cc.

{
  std::vector<std::shared_ptr<Path>> allConditionPaths;
  for (const auto& condition : m_conditions) {
    allConditionPaths.push_back(condition.getPath());
  }
 
  return allConditionPaths;
}

getAllConditions()

const std::vector< ModuleCondition > & getAllConditions ( ) const

inlineinherited

Return all set conditions for this module.

Definition at line 323 of file Module.h.

    {
      return m_conditions;
    }

getCondition()

const ModuleCondition * getCondition ( ) const

inlineinherited

Return a pointer to the first condition (or nullptr, if none was set)

Definition at line 313 of file Module.h.

    {
      if (m_conditions.empty()) {
        return nullptr;
      } else {
        return &m_conditions.front();
      }
    }

getConditionPath()

std::shared_ptr< Path > getConditionPath ( ) const

inherited

Returns the path of the last true condition (if there is at least one, else reaturn a null pointer).

Definition at line 113 of file Module.cc.

{
  PathPtr p;
  if (m_conditions.empty()) return p;
 
  //okay, a condition was set for this Module...
  if (!m_hasReturnValue) {
    B2FATAL("A condition was set for '" << getName() << "', but the module did not set a return value!");
  }
 
  for (const auto& condition : m_conditions) {
    if (condition.evaluate(m_returnValue)) {
      return condition.getPath();
    }
  }
 
  // if none of the conditions were true, return a null pointer.
  return p;
}

getDescription()

const std::string & getDescription ( ) const

inlineinherited

Returns the description of the module.

Definition at line 201 of file Module.h.

{return m_description;}

getFileNames()

virtual std::vector< std::string > getFileNames ( bool outputFiles )

inlinevirtualinherited

Return a list of output filenames for this modules.

This will be called when basf2 is run with "--dry-run" if the module has set either the c_Input or c_Output properties.

If the parameter outputFiles is false (for modules with c_Input) the list of input filenames should be returned (if any). If outputFiles is true (for modules with c_Output) the list of output files should be returned (if any).

If a module has sat both properties this member is called twice, once for each property.

The module should return the actual list of requested input or produced output filenames (including handling of input/output overrides) so that the grid system can handle input/output files correctly.

This function should return the same value when called multiple times. This is especially important when taking the input/output overrides from Environment as they get consumed when obtained so the finalized list of output files should be stored for subsequent calls.

Reimplemented in RootInputModule, RootOutputModule, and StorageRootOutputModule.

Definition at line 133 of file Module.h.

    {
      return std::vector<std::string>();
    }

getLogConfig()

LogConfig & getLogConfig ( )

inlineinherited

Returns the log system configuration.

Definition at line 224 of file Module.h.

{return m_logConfig;}

getModules()

std::list< ModulePtr > getModules ( ) const

inlineoverrideprivatevirtualinherited

no submodules, return empty list

Implements PathElement.

Definition at line 505 of file Module.h.

{ return std::list<ModulePtr>(); }

getName()

const std::string & getName ( ) const

inlineinherited

Returns the name of the module.

This can be changed via e.g. set_name() in the steering file to give more useful names if there is more than one module of the same type.

For identifying the type of a module, using getType() (or type() in Python) is recommended.

Definition at line 186 of file Module.h.

{return m_name;}

getPackage()

const std::string & getPackage ( ) const

inlineinherited

Returns the package this module is in.

Definition at line 196 of file Module.h.

{return m_package;}

getParamInfoListPython()

std::shared_ptr< boost::python::list > getParamInfoListPython ( ) const

inherited

Returns a python list of all parameters.

Each item in the list consists of the name of the parameter, a string describing its type, a python list of all default values and the description of the parameter.

Returns

A python list containing the parameters of this parameter list.

Definition at line 279 of file Module.cc.

{
  return m_moduleParamList.getParamInfoListPython();
}

getParamList()

const ModuleParamList & getParamList ( ) const

inlineinherited

Return module param list.

Definition at line 362 of file Module.h.

{ return m_moduleParamList; }

getPathString()

std::string getPathString ( ) const

overrideprivatevirtualinherited

return the module name.

Implements PathElement.

Definition at line 192 of file Module.cc.

{
 
  std::string output = getName();
 
  for (const auto& condition : m_conditions) {
    output += condition.getString();
  }
 
  return output;
}

getReturnValue()

int getReturnValue ( ) const

inlineinherited

Return the return value set by this module.

This value is only meaningful if hasReturnValue() is true

Definition at line 380 of file Module.h.

{ return m_returnValue; }

getType()

const std::string & getType ( ) const

inherited

Returns the type of the module (i.e.

class name minus 'Module')

Definition at line 41 of file Module.cc.

{
  if (m_type.empty())
    B2FATAL("Module type not set for " << getName());
  return m_type;
}

hasCondition()

bool hasCondition ( ) const

inlineinherited

Returns true if at least one condition was set for the module.

Definition at line 310 of file Module.h.

{ return not m_conditions.empty(); };

hasProperties()

bool hasProperties ( unsigned int propertyFlags ) const

inherited

Returns true if all specified property flags are available in this module.

Parameters

propertyFlags

Ored EModulePropFlags which should be compared with the module flags.

Definition at line 160 of file Module.cc.

{
  return (propertyFlags & m_propertyFlags) == propertyFlags;
}

hasReturnValue()

bool hasReturnValue ( ) const

inlineinherited

Return true if this module has a valid return value set.

Definition at line 377 of file Module.h.

{ return m_hasReturnValue; }

hasUnsetForcedParams()

bool hasUnsetForcedParams ( ) const

inherited

Returns true and prints error message if the module has unset parameters which the user has to set in the steering file.

Definition at line 166 of file Module.cc.

{
  auto missing = m_moduleParamList.getUnsetForcedParams();
  std::string allMissing = "";
  for (const auto& s : missing)
    allMissing += s + " ";
  if (!missing.empty())
    B2ERROR("The following required parameters of Module '" << getName() << "' were not specified: " << allMissing <<
            "\nPlease add them to your steering file.");
  return !missing.empty();
}

if_false()

void if_false ( const std::shared_ptr< Path > & path, EAfterConditionPath afterConditionPath = EAfterConditionPath::c_End )

inherited

A simplified version to add a condition to the module.

Please note that successive calls of this function will add more than one condition to the module. If more than one condition results in true, only the last of them will be used.

Please be careful: Avoid creating cyclic paths, e.g. by linking a condition to a path which is processed before the path where this module is located in.

It is equivalent to the if_value() method, using the expression "<1". This method is meant to be used together with the setReturnValue(bool value) method.

Parameters

path	Shared pointer to the Path which will be executed if the return value is false.
afterConditionPath	What to do after executing 'path'.

Definition at line 85 of file Module.cc.

{
  if_value("<1", path, afterConditionPath);
}

if_true()

void if_true ( const std::shared_ptr< Path > & path, EAfterConditionPath afterConditionPath = EAfterConditionPath::c_End )

inherited

A simplified version to set the condition of the module.

Please note that successive calls of this function will add more than one condition to the module. If more than one condition results in true, only the last of them will be used.

Please be careful: Avoid creating cyclic paths, e.g. by linking a condition to a path which is processed before the path where this module is located in.

It is equivalent to the if_value() method, using the expression ">=1". This method is meant to be used together with the setReturnValue(bool value) method.

Parameters

path	Shared pointer to the Path which will be executed if the return value is true.
afterConditionPath	What to do after executing 'path'.

Definition at line 90 of file Module.cc.

{
  if_value(">=1", path, afterConditionPath);
}

if_value()

void if_value ( const std::string & expression, const std::shared_ptr< Path > & path, EAfterConditionPath afterConditionPath = EAfterConditionPath::c_End )

inherited

Add a condition to the module.

Please note that successive calls of this function will add more than one condition to the module. If more than one condition results in true, only the last of them will be used.

See https://xwiki.desy.de/xwiki/rest/p/a94f2 or ModuleCondition for a description of the syntax.

Please be careful: Avoid creating cyclic paths, e.g. by linking a condition to a path which is processed before the path where this module is located in.

Parameters

expression	The expression of the condition.
path	Shared pointer to the Path which will be executed if the condition is evaluated to true.
afterConditionPath	What to do after executing 'path'.

Definition at line 79 of file Module.cc.

{
  m_conditions.emplace_back(expression, path, afterConditionPath);
}

initialize()

void initialize ( void )

overridevirtual

Initialize the parameters.

Reimplemented from Module.

Definition at line 84 of file TRGGRLMatchModule.cc.

{
  B2DEBUG(100, "TRGGRLMatchModule processing");
  StoreArray<CDCTriggerTrack> track2Dlist(m_2d_tracklist);
  StoreArray<CDCTriggerTrack> track3Dlist(m_3d_tracklist);
  track2Dlist.isRequired();
  track3Dlist.isRequired();
  StoreArray<TRGECLCluster> clusterslist(m_clusterlist);
  clusterslist.isRequired();
  clusterslist.registerRelationTo(track2Dlist);
  clusterslist.registerRelationTo(track3Dlist);
  StoreObjPtr<KLMTrgSummary> klmtrgsummary(m_klmtrgsummarylist);
  klmtrgsummary.isRequired();
 
  StoreArray<CDCTriggerSegmentHit> tslist(m_hitCollectionName);
  tslist.isRequired();
 
  StoreArray<TRGGRLMATCH> track2Dmatch;
  track2Dmatch.registerInDataStore(m_2dmatch_tracklist);
  track2Dmatch.registerRelationTo(track2Dlist);
  track2Dmatch.registerRelationTo(clusterslist);
 
  StoreArray<TRGGRLMATCH> trackphimatch;
  trackphimatch.registerInDataStore(m_phimatch_tracklist);
  trackphimatch.registerRelationTo(track2Dlist);
  trackphimatch.registerRelationTo(clusterslist);
 
  StoreArray<TRGGRLMATCH> track3Dmatch;
  track3Dmatch.registerInDataStore(m_3dmatch_tracklist);
  track3Dmatch.registerRelationTo(clusterslist);
  track3Dmatch.registerRelationTo(track3Dlist);
 
  StoreArray<TRGGRLMATCHKLM> trackKLMmatch;
  trackKLMmatch.registerInDataStore(m_klmmatch_tracklist);
  trackKLMmatch.registerRelationTo(track2Dlist);
 
  StoreArray<TRGGRLPHOTON> grlphoton;
  grlphoton.registerInDataStore(m_grlphotonlist);
  grlphoton.registerRelationTo(clusterslist);
 
  StoreArray<TRGGRLShortTrack> grlst;
  grlst.registerInDataStore(m_grlstCollectionName);
 
  StoreArray<TRGGRLInnerTrack> grlit;
  grlit.registerInDataStore(m_grlitCollectionName);
 
  m_TRGGRLInfo.registerInDataStore(m_TrgGrlInformationName);
 
//-- Fill the patterns for short tracking
 
  fill_pattern_base2(patterns_base2);
 
  for (int p = 0; p < 137; p++) {
    int x0 = patterns_base2[p][0];
    int x1 = patterns_base2[p][1];
    int x2 = 0;
    int x3 = patterns_base2[p][2];
    int x4 = patterns_base2[p][3];
    int d = x2 - x0;
    x1 += d;
    x2 += d;
    x3 += d;
    x4 += d;
    patterns_base0.push_back({x1, x2, x3, x4});
  }
 
 
}

inner_tracking()

void inner_tracking	(	StoreArray< CDCTriggerSegmentHit >	tslist,
		std::vector< bool >	phimap_i,
		std::vector< bool >	ecl_phimap,
		std::vector< bool >	klm_sectormap,
		StoreArray< TRGGRLInnerTrack >	grlit,
		StoreObjPtr< TRGGRLInfo >	trgInfo )

Definition at line 1315 of file TRGGRLMatchModule.cc.

{
  std::vector<bool> SL0(64, 0);
  std::vector<bool> SL1(64, 0);
  std::vector<bool> SL2(64, 0);
  std::vector<bool> IT0(64, 0);
  std::vector<bool> IT0_36b(36, 0);
  std::vector<bool> IT0_4b(4, 0);
 
  //-- collecting TSF info in SL0~2
  for (int i = 0; i < tslist.getEntries(); i++) {
    int id = tslist[i]->getSegmentID();
    int sl = 0;
    if (id >= 0 * 32 && id < 5 * 32) {sl = 0; id -= 0;}
    else if (id >= 5 * 32 && id < 10 * 32) {sl = 1; id -= 5 * 32;}
    else if (id >= 10 * 32 && id < 16 * 32) {sl = 2; id -= 10 * 32;}
    else continue;
 
    if (sl == 0) {
      int X = (int)(id / 5), Y = id % 5;
      if (Y == 0 || Y == 1) { SL0[2 * X] = true; }
      else if (Y == 3 || Y == 4) { SL0[2 * X + 1] = true; }
      else  { SL0[2 * X] = true; SL0[2 * X + 1] = true; }
    } else if (sl == 1) {
      int X = (int)(id / 5), Y = id % 5;
      if (Y == 0 || Y == 1) { SL1[2 * X] = true; }
      else if (Y == 3 || Y == 4) { SL1[2 * X + 1] = true; }
      else  { SL1[2 * X] = true; SL1[2 * X + 1] = true; }
    } else if (sl == 2) {
      int X = (int)(id / 3);
      SL2[X] = true;
    }
  }
 
 
  // -- Inner Track finding with SL0
  for (int i = 0; i < 64; i++) {
    int j1 = i - 4;
    if (j1 < 0) j1 = j1 + 64;
    int j2 = i - 3;
    if (j2 < 0) j2 = j2 + 64;
    int j3 = i - 2;
    if (j3 < 0) j3 = j3 + 64;
    int j4 = i - 1;
    if (j4 < 0) j4 = j4 + 64;
    int j5 = i;
    int j6 = i + 1;
    if (j6 > 63)j6 = j6 - 64;
    int j7 = i + 2;
    if (j7 > 63)j7 = j7 - 64;
    if (
      SL0[i] &&
      (SL1[j1] || SL1[j2] || SL1[j3] || SL1[j4] || SL1[j5]) &&
      (SL2[j3] || SL2[j4] || SL2[j5] || SL2[j6] || SL2[j7])
    ) {
      IT0[i] = true;
    } else {
      IT0[i] = false;
    }
  }
 
  //-- 64b into 36b
  for (int i = 0; i < 4; i++) {
    IT0_36b[0 + 9 * i] = IT0[0 + 16 * i] or IT0[1 + 16 * i];
    IT0_36b[1 + 9 * i] = IT0[1 + 16 * i] or IT0[2 + 16 * i] or IT0[3 + 16 * i];
    IT0_36b[2 + 9 * i] = IT0[3 + 16 * i] or IT0[4 + 16 * i] or IT0[5 + 16 * i];
    IT0_36b[3 + 9 * i] = IT0[5 + 16 * i] or IT0[6 + 16 * i] or IT0[7 + 16 * i];
    IT0_36b[4 + 9 * i] = IT0[7 + 16 * i] or IT0[8 + 16 * i];
    IT0_36b[5 + 9 * i] = IT0[8 + 16 * i] or IT0[9 + 16 * i] or IT0[10 + 16 * i];
    IT0_36b[6 + 9 * i] = IT0[10 + 16 * i] or IT0[11 + 16 * i] or IT0[12 + 16 * i];
    IT0_36b[7 + 9 * i] = IT0[12 + 16 * i] or IT0[13 + 16 * i] or IT0[14 + 16 * i];
    IT0_36b[8 + 9 * i] = IT0[14 + 16 * i] or IT0[15 + 16 * i];
  }
 
  //-- 36b into 4b
  IT0_4b[0] = IT0_36b[35] or IT0_36b[0] or IT0_36b[1] or IT0_36b[2] or IT0_36b[3] or IT0_36b[4] or IT0_36b[5] or IT0_36b[6]
              or IT0_36b[7] or IT0_36b[8] or IT0_36b[9];
  IT0_4b[1] = IT0_36b[8]  or IT0_36b[9] or IT0_36b[10] or IT0_36b[11] or IT0_36b[12] or IT0_36b[13] or IT0_36b[14] or IT0_36b[15]
              or IT0_36b[16] or IT0_36b[17] or IT0_36b[18] or IT0_36b[19];
  IT0_4b[2] = IT0_36b[18]  or IT0_36b[19] or IT0_36b[20] or IT0_36b[21] or IT0_36b[22] or IT0_36b[23] or IT0_36b[24] or IT0_36b[25]
              or IT0_36b[26] or IT0_36b[27] or IT0_36b[28];
  IT0_4b[3] = IT0_36b[26]  or IT0_36b[27] or IT0_36b[28] or IT0_36b[29] or IT0_36b[30] or IT0_36b[31] or IT0_36b[32] or IT0_36b[33]
              or IT0_36b[34] or IT0_36b[36] or IT0_36b[0];
 
  //-- Summary info
  int N_IT = 0;
  bool i2fo = false;
  bool i2io = false;
  int iecl = 0;
  int iklm = 0;
 
  //-- inner track counting
  for (int i = 0; i < 64; i++) {
    if (IT0[i]) N_IT++;
    TRGGRLInnerTrack* it = grlit.appendNew();
    it->set_TS_ID(0, i);
  }
 
  //-- b2b info with IT0 and phi_i map
  for (int i = 0; i < 36; i++) {
    i2fo = (phimap_i[i] and (IT0_36b[N36(i + 18)] or IT0_36b[N36(i + 17)] or IT0_36b[N36(i + 19)]
                             or IT0_36b[N36(i + 16)] or IT0_36b[N36(i + 20)]
                             or IT0_36b[N36(i + 15)] or IT0_36b[N36(i + 21)]
                             or IT0_36b[N36(i + 14)] or IT0_36b[N36(i + 22)]
                             or IT0_36b[N36(i + 13)] or IT0_36b[N36(i + 23)]
                             or IT0_36b[N36(i + 12)] or IT0_36b[N36(i + 24)]
                             or IT0_36b[N36(i + 11)] or IT0_36b[N36(i + 25)]
                             or IT0_36b[N36(i + 10)] or IT0_36b[N36(i + 26)]
                             or IT0_36b[N36(i + 9)] or IT0_36b[N36(i + 27)])) or i2fo ;
  }
  //-- b2b info with IT0
  for (int i = 0; i < 36; i++) {
    i2io = (IT0_36b[i] and (IT0_36b[N36(i + 18)] or IT0_36b[N36(i + 17)] or IT0_36b[N36(i + 19)]
                            or IT0_36b[N36(i + 16)] or IT0_36b[N36(i + 20)]
                            or IT0_36b[N36(i + 15)] or IT0_36b[N36(i + 21)]
                            or IT0_36b[N36(i + 14)] or IT0_36b[N36(i + 22)]
                            or IT0_36b[N36(i + 13)] or IT0_36b[N36(i + 23)]
                            or IT0_36b[N36(i + 12)] or IT0_36b[N36(i + 24)]
                            or IT0_36b[N36(i + 11)] or IT0_36b[N36(i + 25)]
                            or IT0_36b[N36(i + 10)] or IT0_36b[N36(i + 26)]
                            or IT0_36b[N36(i + 9)] or IT0_36b[N36(i + 27)])) or i2io ;
  }
  //inner-ecl matching at endcap
 
  bool IT0_36b_temp[44] = {false};
  for (int i = 4; i < 40; i++) {
    IT0_36b_temp[i] = IT0_36b[i - 4];
  }
  IT0_36b_temp[0] = IT0_36b[32];
  IT0_36b_temp[1] = IT0_36b[33];
  IT0_36b_temp[2] = IT0_36b[34];
  IT0_36b_temp[3] = IT0_36b[35];
  IT0_36b_temp[40] = IT0_36b[0];
  IT0_36b_temp[41] = IT0_36b[1];
  IT0_36b_temp[42] = IT0_36b[2];
  IT0_36b_temp[43] = IT0_36b[3];
 
  for (int i = 4; i < 40; i++) {
    if (ecl_phimap[i - 4] and (IT0_36b_temp[i - 4] or IT0_36b_temp[i - 3] or IT0_36b_temp[i - 2] or IT0_36b_temp[i - 1]
                               or IT0_36b_temp[i] or IT0_36b_temp[i + 1] or IT0_36b_temp[i + 2] or IT0_36b_temp[i + 3] or IT0_36b_temp[i + 4])) {
      iecl++;
    }
  }
 
 
  //std::cout << "sector map " ;
  //for (int i = 0; i < 4; i++) {
  // std::cout << " " << i << " " << IT0_4b[i] << " " << klm_sectormap[i];
  //}
  //std::cout << std::endl;
 
  //inner-klm matching at endcap
  for (int i = 0; i < 4; i++) {
    if (klm_sectormap[i] and IT0_4b[i])iklm++;
  }
  //-- set results
  trgInfo->setNinnertrk(N_IT);
  trgInfo->seti2fo(i2fo);
  trgInfo->seti2io(i2io);
  trgInfo->setNiecl(iecl);
  trgInfo->setNiklm(iklm);
 
  //for (int i = 0; i < 64; i++) {
  //  std::cout <<  SL0[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 64; i++) {
  //  std::cout <<  SL1[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 64; i++) {
  //  std::cout <<  SL2[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 64; i++) {
  //  std::cout <<  IT0[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  IT0_36b[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  phimap_i[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  ecl_phimap[i] << " ";
  //}
  //std::cout << std::endl;
  //std::cout << i2fo << " " << iecl << std::endl;
 
}

make_eecl_map()

void make_eecl_map	(	StoreArray< TRGECLCluster >	clusterlist,
		std::vector< bool > &	ecl_phimap,
		std::vector< bool > &	ecl_phimap_fwd,
		std::vector< bool > &	ecl_phimap_bwd,
		std::vector< bool > &	ecl_sectormap_fwd,
		std::vector< bool > &	ecl_sectormap_bwd )

Make the ecl endcap phi map for inner/short track matching.

Definition at line 756 of file TRGGRLMatchModule.cc.

{
  bool ecl_phimap_loose_fwd[36];
  bool ecl_phimap_loose_bwd[36];
  for (int i = 0; i < 36; i++) {
    ecl_phimap_loose_fwd[i] = false;
    ecl_phimap_loose_bwd[i] = false;
  }
 
  for (int iclst = 0; iclst < clusterlist.getEntries(); iclst++) {
    //-- cluster/TRGECL information
    double    _cluster_x = clusterlist[iclst]->getPositionX();
    double    _cluster_y = clusterlist[iclst]->getPositionY();
 
    // -- ECL phi angle
    double phi_ECL = 0.0;
    if (_cluster_x >= 0 && _cluster_y >= 0) {phi_ECL = atan(_cluster_y / _cluster_x);}
    else if (_cluster_x < 0 && _cluster_y >= 0) {phi_ECL = atan(_cluster_y / _cluster_x) + M_PI;}
    else if (_cluster_x < 0 && _cluster_y < 0) {phi_ECL = atan(_cluster_y / _cluster_x) + M_PI;}
    else if (_cluster_x >= 0 && _cluster_y < 0) {phi_ECL = atan(_cluster_y / _cluster_x) + 2 * M_PI;}
 
    int phi_ECL_d = 0;
    // digitization on both angle
    for (int i = 0; i < 36; i++) {
      if (phi_ECL > i * M_PI / 18 && phi_ECL < (i + 1)*M_PI / 18) {phi_ECL_d = i;}
    }
 
    //fill endcap only
    int _cluster_thetaid = clusterlist[iclst]->getMaxThetaId();
    if (_cluster_thetaid < 4 || _cluster_thetaid > 15) ecl_phimap[phi_ECL_d] = true;
    if (_cluster_thetaid < 4)  ecl_phimap_fwd[phi_ECL_d] = true;
    if (_cluster_thetaid > 15) ecl_phimap_bwd[phi_ECL_d] = true;
    if (_cluster_thetaid < 5)  ecl_phimap_loose_fwd[phi_ECL_d] = true;
    if (_cluster_thetaid > 14) ecl_phimap_loose_bwd[phi_ECL_d] = true;
  }
 
  //-- 36b into 4b
  ecl_sectormap_fwd[0] = ecl_phimap_loose_fwd[35] or ecl_phimap_loose_fwd[0] or ecl_phimap_loose_fwd[1] or ecl_phimap_loose_fwd[2] or
                         ecl_phimap_loose_fwd[3] or ecl_phimap_loose_fwd[4] or ecl_phimap_loose_fwd[5] or ecl_phimap_loose_fwd[6] or
                         ecl_phimap_loose_fwd[7] or ecl_phimap_loose_fwd[8] or ecl_phimap_loose_fwd[9];
  ecl_sectormap_fwd[1] = ecl_phimap_loose_fwd[8]  or ecl_phimap_loose_fwd[9] or ecl_phimap_loose_fwd[10] or ecl_phimap_loose_fwd[11]
                         or
                         ecl_phimap_loose_fwd[12] or ecl_phimap_loose_fwd[13] or ecl_phimap_loose_fwd[14] or ecl_phimap_loose_fwd[15] or
                         ecl_phimap_loose_fwd[16] or ecl_phimap_loose_fwd[17] or ecl_phimap_loose_fwd[18] or ecl_phimap_loose_fwd[19];
  ecl_sectormap_fwd[2] = ecl_phimap_loose_fwd[18]  or ecl_phimap_loose_fwd[19] or ecl_phimap_loose_fwd[20]
                         or ecl_phimap_loose_fwd[21] or
                         ecl_phimap_loose_fwd[22] or ecl_phimap_loose_fwd[23] or ecl_phimap_loose_fwd[24] or ecl_phimap_loose_fwd[25] or
                         ecl_phimap_loose_fwd[26] or ecl_phimap_loose_fwd[27] or ecl_phimap_loose_fwd[28];
  ecl_sectormap_fwd[3] = ecl_phimap_loose_fwd[26]  or ecl_phimap_loose_fwd[27] or ecl_phimap_loose_fwd[28]
                         or ecl_phimap_loose_fwd[29] or
                         ecl_phimap_loose_fwd[30] or ecl_phimap_loose_fwd[31] or ecl_phimap_loose_fwd[32] or ecl_phimap_loose_fwd[33] or
                         ecl_phimap_loose_fwd[34] or ecl_phimap_loose_fwd[35] or ecl_phimap_loose_fwd[0];
  //-- 36b into 4b
  ecl_sectormap_bwd[0] = ecl_phimap_loose_bwd[35] or ecl_phimap_loose_bwd[0] or ecl_phimap_loose_bwd[1] or ecl_phimap_loose_bwd[2] or
                         ecl_phimap_loose_bwd[3] or ecl_phimap_loose_bwd[4] or ecl_phimap_loose_bwd[5] or ecl_phimap_loose_bwd[6] or
                         ecl_phimap_loose_bwd[7] or ecl_phimap_loose_bwd[8] or ecl_phimap_loose_bwd[9];
  ecl_sectormap_bwd[1] = ecl_phimap_loose_bwd[8]  or ecl_phimap_loose_bwd[9] or ecl_phimap_loose_bwd[10] or ecl_phimap_loose_bwd[11]
                         or
                         ecl_phimap_loose_bwd[12] or ecl_phimap_loose_bwd[13] or ecl_phimap_loose_bwd[14] or ecl_phimap_loose_bwd[15] or
                         ecl_phimap_loose_bwd[16] or ecl_phimap_loose_bwd[17] or ecl_phimap_loose_bwd[18] or ecl_phimap_loose_bwd[19];
  ecl_sectormap_bwd[2] = ecl_phimap_loose_bwd[18]  or ecl_phimap_loose_bwd[19] or ecl_phimap_loose_bwd[20]
                         or ecl_phimap_loose_bwd[21] or
                         ecl_phimap_loose_bwd[22] or ecl_phimap_loose_bwd[23] or ecl_phimap_loose_bwd[24] or ecl_phimap_loose_bwd[25] or
                         ecl_phimap_loose_bwd[26] or ecl_phimap_loose_bwd[27] or ecl_phimap_loose_bwd[28];
  ecl_sectormap_bwd[3] = ecl_phimap_loose_bwd[26]  or ecl_phimap_loose_bwd[27] or ecl_phimap_loose_bwd[28]
                         or ecl_phimap_loose_bwd[29] or
                         ecl_phimap_loose_bwd[30] or ecl_phimap_loose_bwd[31] or ecl_phimap_loose_bwd[32] or ecl_phimap_loose_bwd[33] or
                         ecl_phimap_loose_bwd[34] or ecl_phimap_loose_bwd[35] or ecl_phimap_loose_bwd[0];
 
}

make_eklm_map()

void make_eklm_map	(	StoreObjPtr< KLMTrgSummary >	klmtrgsummary,
		std::vector< bool > &	eklm_sectormap,
		std::vector< bool > &	eklm_sectormap_fwd,
		std::vector< bool > &	eklm_sectormap_bwd )

Make the klm endcap phi map for inner/short track matching.

Definition at line 829 of file TRGGRLMatchModule.cc.

{
 
  int _sector_mask_fw = _klmtrgsummary->getSector_mask_Forward_Endcap();
  int _sector_mask_bw = _klmtrgsummary->getSector_mask_Backward_Endcap();
 
  for (int _sector = 0; _sector < 4; _sector++) {
    //if(_sector_mask_fw & (1<<_sector) ) _eklm_sectormap_fwd[_sector]=true;
    if (_sector_mask_bw & (1 << _sector)) _eklm_sectormap_bwd[_sector] = true;
    //if(_sector_mask &    (1<<_sector) ) _eklm_sectormap[_sector]=true;
  }
  if (_sector_mask_fw & (1 << 0)) _eklm_sectormap_fwd[1] = true;
  if (_sector_mask_fw & (1 << 1)) _eklm_sectormap_fwd[0] = true;
  if (_sector_mask_fw & (1 << 2)) _eklm_sectormap_fwd[3] = true;
  if (_sector_mask_fw & (1 << 3)) _eklm_sectormap_fwd[2] = true;
 
  for (int _sector = 0; _sector < 4; _sector++) {
    _eklm_sectormap[_sector] = (_eklm_sectormap_fwd[_sector] || _eklm_sectormap_bwd[_sector]);
  }
}

make_veto_map()

void make_veto_map	(	StoreArray< CDCTriggerTrack >	track2Dlist,
		std::vector< bool > &	map_veto )

Make the full track phi veto map for short tracking.

Definition at line 687 of file TRGGRLMatchModule.cc.

{
  for (int i = 0; i < track2Dlist.getEntries(); i++) {
    int _w = (int)(2271.7 * track2Dlist[i]->getOmega()) ; // omega from -33 to 33
    if (_w >= 33) { _w = 33;}
    else if (_w <= -33) { _w = -33;}
    int _phi = (int)((track2Dlist[i]->getPhi0() + 2 * M_PI) / (M_PI / 32.0)); // phi_i digitized to 0 ~ 63
 
    int charge = 0;
    if (_w > 0) {charge = 1;}
    else if (_w < 0) {charge = -1;}
    else {charge = 0;}
 
    _w = abs(_w);
 
    int L;
    // cppcheck-suppress knownConditionTrueFalse
    if (_w >= 0 && _w <= 8) { L = _phi; }
    else if (_w >= 9 && _w <= 15) {
      if (charge < 0) { L = _phi + 1; }
      else { L = _phi; }
    } else if (_w >= 16 && _w <= 24) {
      if (charge < 0) { L = _phi + 2; }
      else { L = _phi; }
    } else if (_w >= 25 && _w <= 27) {
      if (charge < 0) { L = _phi + 3; }
      else { L = _phi; }
    } else if (_w >= 28 && _w <= 30) {
      if (charge < 0) { L = _phi + 3; }
      else { L = _phi + 1; }
    } else if (_w >= 31 && _w <= 32) {
      if (charge < 0) { L = _phi + 4; }
      else { L = _phi + 1; }
    } else {
      if (charge < 0) { L = _phi + 5; }
      else { L = _phi + 1; }
    }
 
    int R;
    // cppcheck-suppress knownConditionTrueFalse
    if (_w >= 0 && _w <= 8) { R = _phi; }
    else if (_w >= 9 && _w <= 15) {
      if (charge < 0) { R = _phi; }
      else { R = _phi - 1; }
    } else if (_w >= 16 && _w <= 24) {
      if (charge < 0) { R = _phi; }
      else { R = _phi - 2; }
    } else if (_w >= 25 && _w <= 27) {
      if (charge < 0) { R = _phi; }
      else { R = _phi - 3; }
    } else if (_w >= 28 && _w <= 30) {
      if (charge < 0) { R = _phi + 1; }
      else { R = _phi - 3; }
    } else if (_w >= 21 && _w <= 32) {
      if (charge < 0) { R = _phi + 1; }
      else { R = _phi - 4; }
    } else {
      if (charge < 0) { R = _phi + 1; }
      else { R = _phi - 5; }
    }
 
    // L should be > R
    for (int j = R - 1; j < L + 2; j++) {
      map_veto[N64(j)] = true;
    }
  }
 
}

matching_eecl_eklm()

void matching_eecl_eklm	(	std::vector< bool >	eecl_sectormap_fw,
		std::vector< bool >	eecl_setormap_bw,
		std::vector< bool >	eklm_sectormap_fw,
		std::vector< bool >	eklm_sectormap_bw,
		StoreObjPtr< TRGGRLInfo >	trgInfo )

Definition at line 1514 of file TRGGRLMatchModule.cc.

{
  int ieclklm = 0;
  for (int i = 0; i < 4; i++) {
    if (_eklm_sectormap_fw[i] && _eecl_sectormap_fw[i])ieclklm++;
    if (_eklm_sectormap_bw[i] && _eecl_sectormap_bw[i])ieclklm++;
  }
 
  trgInfo->setNeecleklm(ieclklm);
 
}

N36()

int N36

(

int

x

)

Force an int to be witnin 0 to 35.

Definition at line 538 of file TRGGRLMatchModule.cc.

{
  if (x > 35) x -= 36;
  if (x < 0) x += 36;
  return x;
}

N64()

int N64

(

int

x

)

Force an int to be witnin 0 to 63.

Definition at line 531 of file TRGGRLMatchModule.cc.

{
  if (x > 63) x -= 64;
  if (x < 0) x += 64;
  return x;
}

photon_cluster()

bool photon_cluster	(	TRGECLCluster *	cluster,
		std::vector< bool >	track_phimap,
		double	e_threshold )

determine photon from isolated cluster

Definition at line 495 of file TRGGRLMatchModule.cc.

{
 
  //-- cluster/TRGECL information
  double    _cluster_x = _cluster->getPositionX();
  double    _cluster_y = _cluster->getPositionY();
  double    _cluster_z = _cluster->getPositionZ();
  double    _cluster_theta = atan(_cluster_z / (sqrt(_cluster_x * _cluster_x + _cluster_y * _cluster_y)));
  _cluster_theta = 0.5 * M_PI - _cluster_theta;
  bool barrel = true;
  if (_cluster_theta < M_PI * 35.0 / 180.0 || _cluster_theta > M_PI * 126.0 / 180.0) {barrel = false;}
  double  _cluster_e = _cluster->getEnergyDep();
 
  // -- ECL phi angle
  double phi_ECL = 0.0;
  if (_cluster_x >= 0 && _cluster_y >= 0) {phi_ECL = atan(_cluster_y / _cluster_x);}
  else if (_cluster_x < 0 && _cluster_y >= 0) {phi_ECL = atan(_cluster_y / _cluster_x) + M_PI;}
  else if (_cluster_x < 0 && _cluster_y < 0) {phi_ECL = atan(_cluster_y / _cluster_x) + M_PI;}
  else if (_cluster_x >= 0 && _cluster_y < 0) {phi_ECL = atan(_cluster_y / _cluster_x) + 2 * M_PI;}
 
  int phi_ECL_d = 0;
  // digitization on both angle
  for (int i = 0; i < 36; i++) {
    if (phi_ECL > i * M_PI / 18 && phi_ECL < (i + 1)*M_PI / 18) {phi_ECL_d = i;}
  }
 
  int index = phi_ECL_d, index_p = phi_ECL_d + 1, index_m = phi_ECL_d - 1;
  if (index_p > 35) {index_p = index_p - 36;}
  if (index_m < 0) {index_m = index_m + 36;}
 
  if (!phimap[index] && !phimap[index_p] && !phimap[index_m] && _cluster_e >= e_threshold && barrel) {return true;}
  else if (!barrel) {return true;}
  else {return false;}
 
}

sectormatching_klm()

void sectormatching_klm	(	CDCTriggerTrack *	track,
		StoreObjPtr< KLMTrgSummary >	klmtrgsummary,
		double &	dphi,
		int &	klmtrack_ind_phi )

calculate dphi between 2D track and KLM track

Definition at line 449 of file TRGGRLMatchModule.cc.

{
 
  //-- 2D track information
  double    _r = 1.0 / _track->getOmega() ;
  double    _phi = _track->getPhi0() ;
 
  //-- 2D phi angle calculation (extrapolating up to superconducting coil)
  double phi_p = acos(176.0 / (2 * fabs(_r))); // adjustment angle between 0 to 0.5*M_PI
  int charge = 0;
  if (_r > 0) {charge = 1;}
  else if (_r < 0) {charge = -1;}
  else {charge = 0;}
 
  double phi_CDC = 0.0;
  if (charge == 1) {
    phi_CDC = _phi + phi_p - 0.5 * M_PI;
  } else if (charge == -1) {
    phi_CDC = _phi - phi_p + 0.5 * M_PI;
  } else {
    phi_CDC = _phi;
  }
 
  if (phi_CDC > 2 * M_PI) {phi_CDC = phi_CDC - 2 * M_PI;}
  else if (phi_CDC < 0) {phi_CDC = phi_CDC + 2 * M_PI;}
 
  // KLM track's sector central phi
  int _sector_mask_fw = _klmtrgsummary->getSector_mask_Forward_Barrel();
  int _sector_mask_bw = _klmtrgsummary->getSector_mask_Backward_Barrel();
  int _sector_mask = _sector_mask_fw | _sector_mask_bw;
  for (int _sector = 0; _sector < 8; _sector++) {
    if (_sector_mask & (1 << _sector)) {
      double _sector_central = 0.25 * M_PI * _sector;
      double dphi_temp;
      if (fabs(phi_CDC - _sector_central) < M_PI) { dphi_temp = fabs(phi_CDC - _sector_central); }
      else  { dphi_temp = 2 * M_PI - fabs(phi_CDC - _sector_central); }
      if (dphi_temp < dphi) {
        dphi = dphi_temp;
        phiid_klm = _sector;
      }
    }
  }
 
}

setAbortLevel()

void setAbortLevel ( int abortLevel )

inherited

Configure the abort log level.

Definition at line 67 of file Module.cc.

{
  m_logConfig.setAbortLevel(static_cast<LogConfig::ELogLevel>(abortLevel));
}

setDebugLevel()

void setDebugLevel ( int debugLevel )

inherited

Configure the debug messaging level.

Definition at line 61 of file Module.cc.

{
  m_logConfig.setDebugLevel(debugLevel);
}

setDescription()

void setDescription ( const std::string & description )

protectedinherited

Sets the description of the module.

Parameters

description

A description of the module.

Definition at line 214 of file Module.cc.

{
  m_description = description;
}

setLogConfig()

void setLogConfig ( const LogConfig & logConfig )

inlineinherited

Set the log system configuration.

Definition at line 229 of file Module.h.

{m_logConfig = logConfig;}

setLogInfo()

void setLogInfo ( int logLevel, unsigned int logInfo )

inherited

Configure the printed log information for the given level.

Parameters

logLevel	The log level (one of LogConfig::ELogLevel)
logInfo	What kind of info should be printed? ORed combination of LogConfig::ELogInfo flags.

Definition at line 73 of file Module.cc.

{
  m_logConfig.setLogInfo(static_cast<LogConfig::ELogLevel>(logLevel), logInfo);
}

setLogLevel()

void setLogLevel ( int logLevel )

inherited

Configure the log level.

Definition at line 55 of file Module.cc.

{
  m_logConfig.setLogLevel(static_cast<LogConfig::ELogLevel>(logLevel));
}

setName()

void setName ( const std::string & name )

inlineinherited

Set the name of the module.

Note

The module name is set when using the REG_MODULE macro, but the module can be renamed before calling process() using the set_name() function in your steering file.

Parameters

name	The name of the module

Definition at line 213 of file Module.h.

{ m_name = name; };

setParamList()

void setParamList ( const ModuleParamList & params )

inlineprotectedinherited

Replace existing parameter list.

Definition at line 500 of file Module.h.

{ m_moduleParamList = params; }

setParamPython()

void setParamPython ( const std::string & name, const boost::python::object & pyObj )

privateinherited

Implements a method for setting boost::python objects.

The method supports the following types: list, dict, int, double, string, bool The conversion of the python object to the C++ type and the final storage of the parameter value is done in the ModuleParam class.

Parameters

name	The unique name of the parameter.
pyObj	The object which should be converted and stored as the parameter value.

Definition at line 234 of file Module.cc.

{
  LogSystem& logSystem = LogSystem::Instance();
  logSystem.updateModule(&(getLogConfig()), getName());
  try {
    m_moduleParamList.setParamPython(name, pyObj);
  } catch (std::runtime_error& e) {
    throw std::runtime_error("Cannot set parameter '" + name + "' for module '"
                             + m_name + "': " + e.what());
  }
 
  logSystem.updateModule(nullptr);
}

setParamPythonDict()

void setParamPythonDict ( const boost::python::dict & dictionary )

privateinherited

Implements a method for reading the parameter values from a boost::python dictionary.

The key of the dictionary has to be the name of the parameter and the value has to be of one of the supported parameter types.

Parameters

dictionary

The python dictionary from which the parameter values are read.

Definition at line 249 of file Module.cc.

{
 
  LogSystem& logSystem = LogSystem::Instance();
  logSystem.updateModule(&(getLogConfig()), getName());
 
  boost::python::list dictKeys = dictionary.keys();
  int nKey = boost::python::len(dictKeys);
 
  //Loop over all keys in the dictionary
  for (int iKey = 0; iKey < nKey; ++iKey) {
    boost::python::object currKey = dictKeys[iKey];
    boost::python::extract<std::string> keyProxy(currKey);
 
    if (keyProxy.check()) {
      const boost::python::object& currValue = dictionary[currKey];
      setParamPython(keyProxy, currValue);
    } else {
      B2ERROR("Setting the module parameters from a python dictionary: invalid key in dictionary!");
    }
  }
 
  logSystem.updateModule(nullptr);
}

setPropertyFlags()

void setPropertyFlags ( unsigned int propertyFlags )

inherited

Sets the flags for the module properties.

Parameters

propertyFlags

bitwise OR of EModulePropFlags

Definition at line 208 of file Module.cc.

{
  m_propertyFlags = propertyFlags;
}

setReturnValue() [1/2]

void setReturnValue ( bool value )

protectedinherited

Sets the return value for this module as bool.

The bool value is saved as an integer with the convention 1 meaning true and 0 meaning false. The value can be used in the steering file to divide the analysis chain into several paths.

Parameters

value

The value of the return value.

Definition at line 227 of file Module.cc.

{
  m_hasReturnValue = true;
  m_returnValue = value;
}

setReturnValue() [2/2]

void setReturnValue ( int value )

protectedinherited

Sets the return value for this module as integer.

The value can be used in the steering file to divide the analysis chain into several paths.

Parameters

value

The value of the return value.

Definition at line 220 of file Module.cc.

{
  m_hasReturnValue = true;
  m_returnValue = value;
}

setType()

void setType ( const std::string & type )

protectedinherited

Set the module type.

Only for use by internal modules (which don't use the normal REG_MODULE mechanism).

Definition at line 48 of file Module.cc.

{
  if (!m_type.empty())
    B2FATAL("Trying to change module type from " << m_type << " is not allowed, the value is assumed to be fixed.");
  m_type = type;
}

short_tracking()

void short_tracking	(	StoreArray< CDCTriggerSegmentHit >	tslist,
		std::vector< bool >	map_veto,
		std::vector< bool >	phimap_i,
		std::vector< bool >	ecl_phimap_fwd,
		std::vector< bool >	ecl_phimap_bwd,
		std::vector< bool >	klm_sectormap_fwd,
		std::vector< bool >	klm_sectormap_bwd,
		std::vector< std::vector< int > > &	pattern_base0,
		std::vector< std::vector< int > > &	pattern_base2,
		StoreArray< TRGGRLShortTrack >	grlst,
		StoreObjPtr< TRGGRLInfo >	trgInfo )

Short tracking logic.

Definition at line 852 of file TRGGRLMatchModule.cc.

{
  std::vector<bool> SL0(64, 0);
  std::vector<bool> SL1(64, 0);
  std::vector<bool> SL2(64, 0);
  std::vector<bool> SL3(64, 0);
  std::vector<bool> SL4(64, 0);
  std::vector<bool> ST0(64, 0);
  std::vector<bool> ST0_36b(36, 0);
  std::vector<bool> ST2(64, 0);
  std::vector<int> patt_ID(64, -1);
 
  std::vector<bool> st_ec1(64, 0);
  std::vector<bool> st_ec1_36b(36, 0);
  std::vector<bool> st_ec1_4b(4, 0);
  std::vector<bool> st_ec2(64, 0);
  std::vector<bool> st_ec2_36b(36, 0);
  std::vector<bool> st_ec2_4b(4, 0);
 
//-- collecting TSF info in SL0~4
  for (int i = 0; i < tslist.getEntries(); i++) {
    int id = tslist[i]->getSegmentID();
    int sl = 0;
    if (id >= 0 * 32 && id < 5 * 32) {sl = 0; id -= 0;}
    else if (id >= 5 * 32 && id < 10 * 32) {sl = 1; id -= 5 * 32;}
    else if (id >= 10 * 32 && id < 16 * 32) {sl = 2; id -= 10 * 32;}
    else if (id >= 16 * 32 && id < 23 * 32) {sl = 3; id -= 16 * 32;}
    else if (id >= 23 * 32 && id < 31 * 32) {sl = 4; id -= 23 * 32;}
    else continue;
 
    if (sl == 0) {
      int X = (int)(id / 5), Y = id % 5;
      if (Y == 0 || Y == 1) { SL0[2 * X] = true; }
      else if (Y == 3 || Y == 4) { SL0[2 * X + 1] = true; }
      else  { SL0[2 * X] = true; SL0[2 * X + 1] = true; }
    } else if (sl == 1) {
      int X = (int)(id / 5), Y = id % 5;
      if (Y == 0 || Y == 1) { SL1[2 * X] = true; }
      else if (Y == 3 || Y == 4) { SL1[2 * X + 1] = true; }
      else  { SL1[2 * X] = true; SL1[2 * X + 1] = true; }
    } else if (sl == 2) {
      int X = (int)(id / 3);
      SL2[X] = true;
    } else if (sl == 3) {
      int X = (int)(id / 7), Y = id % 7;
      if (Y == 0 || Y == 1 || Y == 2) { SL3[2 * X] = true; }
      else if (Y == 4 || Y == 5 || Y == 6) { SL3[2 * X + 1] = true; }
      else  { SL3[2 * X] = true; SL3[2 * X + 1] = true; }
    } else if (sl == 4) {
      int X = (int)(id / 4);
      SL4[X] = true;
    }
 
  }
 
//-- making veto
  for (int i = 0; i < 64; i++) {
    if (map_veto[i]) {SL0[i] = false; SL1[i] = false; SL2[i] = false;}
  }
  /*
        for (int i = 0; i < 64; i++) { std::cout<<map_veto[63-i]; if((64-i)%10==1) std::cout<<" ";}
        std::cout<<std::endl;
        for (int i = 0; i < 64; i++) { std::cout<<SL4[63-i]; if((64-i)%10==1) std::cout<<" ";}
        std::cout<<std::endl;
        for (int i = 0; i < 64; i++) { std::cout<<SL3[63-i]; if((64-i)%10==1) std::cout<<" ";}
        std::cout<<std::endl;
        for (int i = 0; i < 64; i++) { std::cout<<SL2[63-i]; if((64-i)%10==1) std::cout<<" ";}
        std::cout<<std::endl;
        for (int i = 0; i < 64; i++) { std::cout<<SL1[63-i]; if((64-i)%10==1) std::cout<<" ";}
        std::cout<<std::endl;
        for (int i = 0; i < 64; i++) { std::cout<<SL0[63-i]; if((64-i)%10==1) std::cout<<" ";}
        std::cout<<std::endl;
  */
//-- doing short tracking
 
  std::vector< std::vector<int> > stlist_buf(0);
 
  // -- ST finding with SL2
  for (int i = 0; i < 64; i++) {
 
    int ID0 = 0;
    int ID1 = 0;
    int ID2 = 0;
    int ID3 = 0;
    int ID4 = 0;
    stlist_buf.push_back({0, 0, 0, 0, 0, 0});
 
    if (!SL2[i]) continue;
    bool SL2_already_found = false;
 
    for (int p = 0; p < 137; p++) {
 
      // following patterns will not be used.
      if (p == 4) continue;
      if (p == 5) continue;
      if (p == 17) continue;
      if (p == 26) continue;
      if (p == 38) continue;
      if (p == 41) continue;
      if (p == 42) continue;
      if (p == 47) continue;
      if (p == 50) continue;
      if (p == 60) continue;
      if (p == 63) continue;
      if (p == 64) continue;
      if (p == 74) continue;
      if (p == 93) continue;
      if (p == 94) continue;
      if (p == 95) continue;
      if (p == 96) continue;
      if (p == 104) continue;
      if (p == 113) continue;
      if (p == 114) continue;
      if (p == 115) continue;
      if (p == 123) continue;
      if (p == 134) continue;
      if (p == 135) continue;
      if (p == 136) continue;
 
      int x0 = pattern_base2[p][0];
      int x1 = pattern_base2[p][1];
      int x3 = pattern_base2[p][2];
      int x4 = pattern_base2[p][3];
 
 
      if (SL2[i] && SL0[N64(i + x0)] && SL1[N64(i + x1)] && SL3[N64(i + x3)] && SL4[N64(i + x4)] && !SL2_already_found) {
        ST2[i] = true;
        ID0 = N64(i + x0);
        ID1 = N64(i + x1);
        ID2 = i;
        ID3 = N64(i + x3);
        ID4 = N64(i + x4);
        SL2_already_found = true; // if it has been found in previous pattern, no need to do it again.
      }
 
      // if a pattern is found, no need to look for other pattern
      if (SL2_already_found) break;
 
    }
 
    if (SL2_already_found) {
      stlist_buf[i][0] = 1;
      stlist_buf[i][1] = ID0;
      stlist_buf[i][2] = ID1;
      stlist_buf[i][3] = ID2;
      stlist_buf[i][4] = ID3;
      stlist_buf[i][5] = ID4;
    }
  }
//-- ST finding with SL0
  for (int i = 0; i < 64; i++) {
 
    if (!SL0[i]) continue;
    bool SL0_already_found = false;
 
    for (int p = 0; p < 137; p++) {
 
      // following patterns will not be used.
      if (p == 4) continue;
      if (p == 5) continue;
      if (p == 17) continue;
      if (p == 26) continue;
      if (p == 38) continue;
      if (p == 41) continue;
      if (p == 42) continue;
      if (p == 47) continue;
      if (p == 50) continue;
      if (p == 60) continue;
      if (p == 63) continue;
      if (p == 64) continue;
      if (p == 74) continue;
      if (p == 93) continue;
      if (p == 94) continue;
      if (p == 95) continue;
      if (p == 96) continue;
      if (p == 104) continue;
      if (p == 113) continue;
      if (p == 114) continue;
      if (p == 115) continue;
      if (p == 123) continue;
      if (p == 134) continue;
      if (p == 135) continue;
      if (p == 136) continue;
 
      int y1 = pattern_base0[p][0];
      int y2 = pattern_base0[p][1];
      int y3 = pattern_base0[p][2];
      int y4 = pattern_base0[p][3];
 
      if (SL0[i] && SL1[N64(i + y1)] && SL2[N64(i + y2)] && SL3[N64(i + y3)] && SL4[N64(i + y4)] && !SL0_already_found) {
        ST0[i] = true;
        if (patt_ID[i] < 0) { patt_ID[i] = p; }
        SL0_already_found = true; // if it has been found in previous pattern, no need to do it again.
      }
 
      // if a pattern is found, no need to look for other pattern
      if (SL0_already_found) break;
 
    }
 
  }
//-- extrapolation
  for (int i = 0; i < 64; i++) {
    if (patt_ID[i] == -1) continue;
 
    int ec = 0, l = 0, r = 0;
    extrapolation(patt_ID[i], l, r, ec);
    if (ec == 1) {
      for (int e = l; e <= r; e++) { st_ec1[N64(i + e)] = true; }
    }
    if (ec == 2) {
      for (int e = l; e <= r; e++) { st_ec2[N64(i + e)] = true; }
    }
 
  }
//-- 64b into 36b
  for (int i = 0; i < 4; i++) {
    ST0_36b[0 + 9 * i] = ST0[0 + 16 * i] or ST0[1 + 16 * i];
    ST0_36b[1 + 9 * i] = ST0[1 + 16 * i] or ST0[2 + 16 * i] or ST0[3 + 16 * i];
    ST0_36b[2 + 9 * i] = ST0[3 + 16 * i] or ST0[4 + 16 * i] or ST0[5 + 16 * i];
    ST0_36b[3 + 9 * i] = ST0[5 + 16 * i] or ST0[6 + 16 * i] or ST0[7 + 16 * i];
    ST0_36b[4 + 9 * i] = ST0[7 + 16 * i] or ST0[8 + 16 * i];
    ST0_36b[5 + 9 * i] = ST0[8 + 16 * i] or ST0[9 + 16 * i] or ST0[10 + 16 * i];
    ST0_36b[6 + 9 * i] = ST0[10 + 16 * i] or ST0[11 + 16 * i] or ST0[12 + 16 * i];
    ST0_36b[7 + 9 * i] = ST0[12 + 16 * i] or ST0[13 + 16 * i] or ST0[14 + 16 * i];
    ST0_36b[8 + 9 * i] = ST0[14 + 16 * i] or ST0[15 + 16 * i];
    st_ec1_36b[0 + 9 * i] = st_ec1[0 + 16 * i] or st_ec1[1 + 16 * i];
    st_ec1_36b[1 + 9 * i] = st_ec1[1 + 16 * i] or st_ec1[2 + 16 * i] or st_ec1[3 + 16 * i];
    st_ec1_36b[2 + 9 * i] = st_ec1[3 + 16 * i] or st_ec1[4 + 16 * i] or st_ec1[5 + 16 * i];
    st_ec1_36b[3 + 9 * i] = st_ec1[5 + 16 * i] or st_ec1[6 + 16 * i] or st_ec1[7 + 16 * i];
    st_ec1_36b[4 + 9 * i] = st_ec1[7 + 16 * i] or st_ec1[8 + 16 * i];
    st_ec1_36b[5 + 9 * i] = st_ec1[8 + 16 * i] or st_ec1[9 + 16 * i] or st_ec1[10 + 16 * i];
    st_ec1_36b[6 + 9 * i] = st_ec1[10 + 16 * i] or st_ec1[11 + 16 * i] or st_ec1[12 + 16 * i];
    st_ec1_36b[7 + 9 * i] = st_ec1[12 + 16 * i] or st_ec1[13 + 16 * i] or st_ec1[14 + 16 * i];
    st_ec1_36b[8 + 9 * i] = st_ec1[14 + 16 * i] or st_ec1[15 + 16 * i];
 
    st_ec2_36b[0 + 9 * i] = st_ec2[0 + 16 * i] or st_ec2[1 + 16 * i];
    st_ec2_36b[1 + 9 * i] = st_ec2[1 + 16 * i] or st_ec2[2 + 16 * i] or st_ec2[3 + 16 * i];
    st_ec2_36b[2 + 9 * i] = st_ec2[3 + 16 * i] or st_ec2[4 + 16 * i] or st_ec2[5 + 16 * i];
    st_ec2_36b[3 + 9 * i] = st_ec2[5 + 16 * i] or st_ec2[6 + 16 * i] or st_ec2[7 + 16 * i];
    st_ec2_36b[4 + 9 * i] = st_ec2[7 + 16 * i] or st_ec2[8 + 16 * i];
    st_ec2_36b[5 + 9 * i] = st_ec2[8 + 16 * i] or st_ec2[9 + 16 * i] or st_ec2[10 + 16 * i];
    st_ec2_36b[6 + 9 * i] = st_ec2[10 + 16 * i] or st_ec2[11 + 16 * i] or st_ec2[12 + 16 * i];
    st_ec2_36b[7 + 9 * i] = st_ec2[12 + 16 * i] or st_ec2[13 + 16 * i] or st_ec2[14 + 16 * i];
    st_ec2_36b[8 + 9 * i] = st_ec2[14 + 16 * i] or st_ec2[15 + 16 * i];
  }
//-- 36b into 4b
  st_ec1_4b[0] = st_ec1_36b[35] or st_ec1_36b[0] or st_ec1_36b[1] or st_ec1_36b[2] or st_ec1_36b[3] or st_ec1_36b[4] or st_ec1_36b[5]
                 or st_ec1_36b[6] or st_ec1_36b[7] or st_ec1_36b[8] or st_ec1_36b[9];
  st_ec1_4b[1] = st_ec1_36b[8]  or st_ec1_36b[9] or st_ec1_36b[10] or st_ec1_36b[11] or st_ec1_36b[12] or st_ec1_36b[13]
                 or st_ec1_36b[14] or st_ec1_36b[15] or st_ec1_36b[16] or st_ec1_36b[17] or st_ec1_36b[18] or st_ec1_36b[19];
  st_ec1_4b[2] = st_ec1_36b[18]  or st_ec1_36b[19] or st_ec1_36b[20] or st_ec1_36b[21] or st_ec1_36b[22] or st_ec1_36b[23]
                 or st_ec1_36b[24] or st_ec1_36b[25] or st_ec1_36b[26] or st_ec1_36b[27] or st_ec1_36b[28];
  st_ec1_4b[3] = st_ec1_36b[26]  or st_ec1_36b[27] or st_ec1_36b[28] or st_ec1_36b[29] or st_ec1_36b[30] or st_ec1_36b[31]
                 or st_ec1_36b[32] or st_ec1_36b[33] or st_ec1_36b[34] or st_ec1_36b[35] or st_ec1_36b[0];
  st_ec2_4b[0] = st_ec2_36b[35] or st_ec2_36b[0] or st_ec2_36b[1] or st_ec2_36b[2] or st_ec2_36b[3] or st_ec2_36b[4] or st_ec2_36b[5]
                 or st_ec2_36b[6] or st_ec2_36b[7] or st_ec2_36b[8] or st_ec2_36b[9];
  st_ec2_4b[1] = st_ec2_36b[8]  or st_ec2_36b[9] or st_ec2_36b[10] or st_ec2_36b[11] or st_ec2_36b[12] or st_ec2_36b[13]
                 or st_ec2_36b[14] or st_ec2_36b[15] or st_ec2_36b[16] or st_ec2_36b[17] or st_ec2_36b[18] or st_ec2_36b[19];
  st_ec2_4b[2] = st_ec2_36b[18]  or st_ec2_36b[19] or st_ec2_36b[20] or st_ec2_36b[21] or st_ec2_36b[22] or st_ec2_36b[23]
                 or st_ec2_36b[24] or st_ec2_36b[25] or st_ec2_36b[26] or st_ec2_36b[27] or st_ec2_36b[28];
  st_ec2_4b[3] = st_ec2_36b[26]  or st_ec2_36b[27] or st_ec2_36b[28] or st_ec2_36b[29] or st_ec2_36b[30] or st_ec2_36b[31]
                 or st_ec2_36b[32] or st_ec2_36b[33] or st_ec2_36b[34] or st_ec2_36b[35] or st_ec2_36b[0];
 
 
 
 
//-- Summary info
 
  int N_ST = 0;
  int N_ST_fwd = 0;
  int N_ST_bwd = 0;
  bool s2s3 = false;
  bool s2s5 = false;
  bool s2so = false;
  bool s2s30 = false;
  bool s2f3 = false;
  bool s2f5 = false;
  bool s2fo = false;
  bool s2f30 = false;
  int secl = 0;
  int secl_fwd = 0;
  int secl_bwd = 0;
  int sklm = 0;
  int sklm_fwd = 0;
  int sklm_bwd = 0;
 
//-- short track counting on ST2
  for (int i = 0; i < 64; i++) {
    if (ST2[i]) {
      N_ST++;
      ST2[i] = false;
      int L = i - 1, R = i + 1;
      while (ST2[N64(L)]) {
        ST2[N64(L)] = false;
        L--;
      }
      while (ST2[N64(R)]) {
        ST2[N64(R)] = false;
        R++;
      }
 
      //-- Fill the store array
      L++; R--;
      int index = N64((L + R) / 2); // fill the middle one when multiple ST is found continuously in the map
      TRGGRLShortTrack* st = grlst.appendNew();
      st->set_TS_ID(0, stlist_buf[index][1]);
      st->set_TS_ID(1, stlist_buf[index][2]);
      st->set_TS_ID(2, stlist_buf[index][3]);
      st->set_TS_ID(3, stlist_buf[index][4]);
      st->set_TS_ID(4, stlist_buf[index][5]);
    }
  }
  for (int i = 0; i < 64; i++) {
    if (st_ec1[i]) N_ST_fwd++;
  }
  for (int i = 0; i < 64; i++) {
    if (st_ec2[i]) N_ST_bwd++;
  }
 
//-- b2b info with ST0 and phi_i map
  for (int i = 0; i < 36; i++) {
    s2s3 = (ST0_36b[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)])) or s2s3;
    s2s5 = (ST0_36b[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)]
                            or ST0_36b[N36(i + 16)] or ST0_36b[N36(i + 20)])) or s2s5;
    s2so = (ST0_36b[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)]
                            or ST0_36b[N36(i + 16)] or ST0_36b[N36(i + 20)]
                            or ST0_36b[N36(i + 15)] or ST0_36b[N36(i + 21)]
                            or ST0_36b[N36(i + 14)] or ST0_36b[N36(i + 22)]
                            or ST0_36b[N36(i + 13)] or ST0_36b[N36(i + 23)]
                            or ST0_36b[N36(i + 12)] or ST0_36b[N36(i + 24)]
                            or ST0_36b[N36(i + 11)] or ST0_36b[N36(i + 25)]
                            or ST0_36b[N36(i + 10)] or ST0_36b[N36(i + 26)]
                            or ST0_36b[N36(i + 9)] or ST0_36b[N36(i + 27)])) or s2so ;
    s2s30 = (ST0_36b[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)]
                             or ST0_36b[N36(i + 16)] or ST0_36b[N36(i + 20)]
                             or ST0_36b[N36(i + 15)] or ST0_36b[N36(i + 21)]
                             or ST0_36b[N36(i + 14)] or ST0_36b[N36(i + 22)]
                             or ST0_36b[N36(i + 13)] or ST0_36b[N36(i + 23)]
                             or ST0_36b[N36(i + 12)] or ST0_36b[N36(i + 24)]
                             or ST0_36b[N36(i + 11)] or ST0_36b[N36(i + 25)]
                             or ST0_36b[N36(i + 10)] or ST0_36b[N36(i + 26)]
                             or ST0_36b[N36(i + 9)] or ST0_36b[N36(i + 27)]
                             or ST0_36b[N36(i + 8)] or ST0_36b[N36(i + 28)]
                             or ST0_36b[N36(i + 7)] or ST0_36b[N36(i + 29)]
                             or ST0_36b[N36(i + 6)] or ST0_36b[N36(i + 30)]
                             or ST0_36b[N36(i + 5)] or ST0_36b[N36(i + 31)]
                             or ST0_36b[N36(i + 4)] or ST0_36b[N36(i + 32)]
                             or ST0_36b[N36(i + 3)] or ST0_36b[N36(i + 33)])) or s2s30 ;
 
 
    s2f3 = (phimap_i[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)])) or s2f3;
    s2f5 = (phimap_i[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)]
                             or ST0_36b[N36(i + 16)] or ST0_36b[N36(i + 20)])) or s2f5;
    s2fo = (phimap_i[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)]
                             or ST0_36b[N36(i + 16)] or ST0_36b[N36(i + 20)]
                             or ST0_36b[N36(i + 15)] or ST0_36b[N36(i + 21)]
                             or ST0_36b[N36(i + 14)] or ST0_36b[N36(i + 22)]
                             or ST0_36b[N36(i + 13)] or ST0_36b[N36(i + 23)]
                             or ST0_36b[N36(i + 12)] or ST0_36b[N36(i + 24)]
                             or ST0_36b[N36(i + 11)] or ST0_36b[N36(i + 25)]
                             or ST0_36b[N36(i + 10)] or ST0_36b[N36(i + 26)]
                             or ST0_36b[N36(i + 9)] or ST0_36b[N36(i + 27)])) or s2fo ;
    s2f30 = (phimap_i[i] and (ST0_36b[N36(i + 18)] or ST0_36b[N36(i + 17)] or ST0_36b[N36(i + 19)]
                              or ST0_36b[N36(i + 16)] or ST0_36b[N36(i + 20)]
                              or ST0_36b[N36(i + 15)] or ST0_36b[N36(i + 21)]
                              or ST0_36b[N36(i + 14)] or ST0_36b[N36(i + 22)]
                              or ST0_36b[N36(i + 13)] or ST0_36b[N36(i + 23)]
                              or ST0_36b[N36(i + 12)] or ST0_36b[N36(i + 24)]
                              or ST0_36b[N36(i + 11)] or ST0_36b[N36(i + 25)]
                              or ST0_36b[N36(i + 10)] or ST0_36b[N36(i + 26)]
                              or ST0_36b[N36(i + 9)] or ST0_36b[N36(i + 27)]
                              or ST0_36b[N36(i + 8)] or ST0_36b[N36(i + 28)]
                              or ST0_36b[N36(i + 7)] or ST0_36b[N36(i + 29)]
                              or ST0_36b[N36(i + 6)] or ST0_36b[N36(i + 30)]
                              or ST0_36b[N36(i + 5)] or ST0_36b[N36(i + 31)]
                              or ST0_36b[N36(i + 4)] or ST0_36b[N36(i + 32)]
                              or ST0_36b[N36(i + 3)] or ST0_36b[N36(i + 33)])) or s2f30 ;
 
  }
 
//short-ecl matching at endcap
  for (int i = 0; i < 36; i++) {
    if (ecl_phimap_fwd[i] and st_ec1_36b[i])secl_fwd++;
  }
  for (int i = 0; i < 36; i++) {
    if (ecl_phimap_bwd[i] and st_ec2_36b[i])secl_bwd++;
  }
  secl = secl_fwd + secl_bwd;
 
//short-klm matching at endcap
  for (int i = 0; i < 4; i++) {
    if (klm_sectormap_fwd[i] and st_ec1_4b[i])sklm_fwd++;
  }
  for (int i = 0; i < 4; i++) {
    if (klm_sectormap_bwd[i] and st_ec2_4b[i])sklm_bwd++;
  }
  sklm = sklm_fwd + sklm_bwd;
 
//-- set results
  trgInfo->setNshorttrk(N_ST);
  trgInfo->setNshorttrk_fwd(N_ST_fwd);
  trgInfo->setNshorttrk_bwd(N_ST_bwd);
  trgInfo->sets2s3(s2s3);
  trgInfo->sets2s5(s2s5);
  trgInfo->sets2so(s2so);
  trgInfo->sets2s30(s2s30);
  trgInfo->sets2f3(s2f3);
  trgInfo->sets2f5(s2f5);
  trgInfo->sets2fo(s2fo);
  trgInfo->sets2f30(s2f30);
  trgInfo->setbwdsb(0);
  trgInfo->setbwdnb(0);
  trgInfo->setfwdsb(0);
  trgInfo->setfwdnb(0);
  trgInfo->setbrlfb(0);
  trgInfo->setbrlnb(0);
  trgInfo->setNsecl(secl);
  trgInfo->setNsecl_fwd(secl_fwd);
  trgInfo->setNsecl_bwd(secl_bwd);
  trgInfo->setNsklm(sklm);
  trgInfo->setNsklm_fwd(sklm_fwd);
  trgInfo->setNsklm_bwd(sklm_bwd);
 
  //for (int i = 0; i < 64; i++) {
  //  std::cout <<  st_ec1[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 64; i++) {
  //  std::cout <<  st_ec2[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  st_ec1_36b[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  st_ec2_36b[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  ecl_phimap_fwd[i] << " ";
  //}
  //std::cout << std::endl;
  //for (int i = 0; i < 36; i++) {
  //  std::cout <<  ecl_phimap_bwd[i] << " ";
  //}
  //std::cout << std::endl;
  //std::cout << secl << " " << secl_fwd << " " << secl_bwd << std::endl;
 
}

terminate()

void terminate ( void )

overridevirtual

Termination action.

Reimplemented from Module.

Definition at line 337 of file TRGGRLMatchModule.cc.

{
}

Member Data Documentation

eecl_phimap

std::vector<bool> eecl_phimap

private

36 bits phi map of ECL clusters at endcap

Definition at line 147 of file TRGGRLMatchModule.h.

eecl_phimap_bwd

std::vector<bool> eecl_phimap_bwd

private

36 bits phi map of ECL clusters at backward endcap

Definition at line 151 of file TRGGRLMatchModule.h.

eecl_phimap_fwd

std::vector<bool> eecl_phimap_fwd

private

36 bits phi map of ECL clusters at forward endcap

Definition at line 149 of file TRGGRLMatchModule.h.

eecl_sectormap_bwd

std::vector<bool> eecl_sectormap_bwd

private

8 bits sector map of ECL clusters at backward endcap

Definition at line 155 of file TRGGRLMatchModule.h.

eecl_sectormap_fwd

std::vector<bool> eecl_sectormap_fwd

private

8 bits sector map of ECL clusters at forward endcap

Definition at line 153 of file TRGGRLMatchModule.h.

eklm_sectormap

std::vector<bool> eklm_sectormap

private

8 bits phi map of KLM clusters at endcap

Definition at line 157 of file TRGGRLMatchModule.h.

eklm_sectormap_bwd

std::vector<bool> eklm_sectormap_bwd

private

8 bits sector map of KLM clusters at backward endcap

Definition at line 161 of file TRGGRLMatchModule.h.

eklm_sectormap_fwd

std::vector<bool> eklm_sectormap_fwd

private

8 bits sector map of KLM clusters at forward endcap

Definition at line 159 of file TRGGRLMatchModule.h.

m_2d_tracklist

std::string m_2d_tracklist

private

the 2D finder track list

Definition at line 163 of file TRGGRLMatchModule.h.

m_2dmatch_tracklist

std::string m_2dmatch_tracklist

private

the distance in phi direction between track and cluster

the distance in z direction between track and cluster the matched 2d track list

Definition at line 175 of file TRGGRLMatchModule.h.

m_3d_tracklist

std::string m_3d_tracklist

private

the 3D NN track list

Definition at line 165 of file TRGGRLMatchModule.h.

m_3dmatch_tracklist

std::string m_3dmatch_tracklist

private

the matched 3d track list

Definition at line 179 of file TRGGRLMatchModule.h.

m_clusterlist

std::string m_clusterlist

private

the ecl cluster list

Definition at line 167 of file TRGGRLMatchModule.h.

m_conditions

std::vector<ModuleCondition> m_conditions

privateinherited

Module condition, only non-null if set.

Definition at line 520 of file Module.h.

m_description

std::string m_description

privateinherited

The description of the module.

Definition at line 510 of file Module.h.

m_dphi_d_threshold

int m_dphi_d_threshold

private

max value of dphi_d to be identified as match, 1 digit = 10 degrees

Definition at line 137 of file TRGGRLMatchModule.h.

m_dphi_klm_threshold

double m_dphi_klm_threshold

private

max value of dphi (CDC track to KLM sector) to be identified as match (in degrees)

Definition at line 141 of file TRGGRLMatchModule.h.

m_dr_threshold

double m_dr_threshold

private

max value of dr to be identified as match

Definition at line 133 of file TRGGRLMatchModule.h.

m_dz_threshold

double m_dz_threshold

private

max value of dz to be identified as match

Definition at line 135 of file TRGGRLMatchModule.h.

m_e_threshold

double m_e_threshold

private

min value of isolated cluster energy

Definition at line 139 of file TRGGRLMatchModule.h.

m_fastSimulationMode

int m_fastSimulationMode

private

Switch for the fast simulation.

0:do everything, 1:stop after the track segment simulation. Default is 0.

Definition at line 127 of file TRGGRLMatchModule.h.

m_firmwareSimulationMode

int m_firmwareSimulationMode

private

Switch for the firmware simulation. 0:do nothing, 1:do everything.

Definition at line 130 of file TRGGRLMatchModule.h.

m_grlitCollectionName

std::string m_grlitCollectionName

private

GRL inner track list.

Definition at line 189 of file TRGGRLMatchModule.h.

m_grlphotonlist

std::string m_grlphotonlist

private

Non-matched cluster list at GRL.

Definition at line 183 of file TRGGRLMatchModule.h.

m_grlstCollectionName

std::string m_grlstCollectionName

private

GRL short track list.

Definition at line 187 of file TRGGRLMatchModule.h.

m_hasReturnValue

bool m_hasReturnValue

privateinherited

True, if the return value is set.

Definition at line 517 of file Module.h.

m_hitCollectionName

std::string m_hitCollectionName

private

Track Segment list.

Definition at line 185 of file TRGGRLMatchModule.h.

m_klmmatch_tracklist

std::string m_klmmatch_tracklist

private

the matched 2d track list by KLM matching

Definition at line 181 of file TRGGRLMatchModule.h.

m_klmtrgsummarylist

std::string m_klmtrgsummarylist

private

the KLM track list

Definition at line 169 of file TRGGRLMatchModule.h.

m_logConfig

LogConfig m_logConfig

privateinherited

The log system configuration of the module.

Definition at line 513 of file Module.h.

m_moduleParamList

ModuleParamList m_moduleParamList

privateinherited

List storing and managing all parameter of the module.

Definition at line 515 of file Module.h.

m_name

std::string m_name

privateinherited

The name of the module, saved as a string (user-modifiable)

Definition at line 507 of file Module.h.

m_package

std::string m_package

privateinherited

Package this module is found in (may be empty).

Definition at line 509 of file Module.h.

m_phimatch_tracklist

std::string m_phimatch_tracklist

private

the matched 2d track list by phi matching

Definition at line 177 of file TRGGRLMatchModule.h.

m_propertyFlags

unsigned int m_propertyFlags

privateinherited

The properties of the module as bitwise or (with |) of EModulePropFlags.

Definition at line 511 of file Module.h.

m_returnValue

int m_returnValue

privateinherited

The return value.

Definition at line 518 of file Module.h.

m_simulationMode

int m_simulationMode

private

Mode for TRGGRL simulation.

0th bit : fast simulation switch, 1st bit : firmware simulation switch.

Definition at line 123 of file TRGGRLMatchModule.h.

m_TRGGRLInfo

StoreObjPtr<TRGGRLInfo> m_TRGGRLInfo

private

output for TRGGRLInfo

Definition at line 119 of file TRGGRLMatchModule.h.

m_TrgGrlInformationName

std::string m_TrgGrlInformationName

private

Name of the StoreArray holding projects information from grl.

Definition at line 191 of file TRGGRLMatchModule.h.

m_type

std::string m_type

privateinherited

The type of the module, saved as a string.

Definition at line 508 of file Module.h.

patterns_base0

std::vector< std::vector<int> > patterns_base0

private

Short tracking patterns based on SL0.

Definition at line 193 of file TRGGRLMatchModule.h.

patterns_base2

std::vector< std::vector<int> > patterns_base2

private

Short tracking patterns based on SL2.

Definition at line 195 of file TRGGRLMatchModule.h.

track_phimap

std::vector<bool> track_phimap

private

36 bits phi map of all 2D tracks

Definition at line 143 of file TRGGRLMatchModule.h.

track_phimap_i

std::vector<bool> track_phimap_i

private

36 bits phi map of all 2D tracks

Definition at line 145 of file TRGGRLMatchModule.h.

---

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

• trg/grl/modules/trggrl/include/TRGGRLMatchModule.h
• trg/grl/modules/trggrl/src/TRGGRLMatchModule.cc