ClusterMatcherModule.cc

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
#include <reconstruction/modules/ClusterMatcher/ClusterMatcherModule.h>
 
#include <framework/gearbox/Const.h>
 
 
#include <mdst/dataobjects/KLMCluster.h>
#include <mdst/dataobjects/ECLCluster.h>
#include <mdst/dataobjects/Cluster.h>
#include <mdst/dataobjects/KlId.h>
 
#include <Math/VectorUtil.h>
 
using namespace Belle2;
using namespace std;
 
 
REG_MODULE(ClusterMatcher);
 
ClusterMatcherModule::ClusterMatcherModule(): Module() // constructor kan nkeine argumente nehmen
{
  setDescription("Match KLM cluster to ECL Clusters within a certain cone.");
 
  setPropertyFlags(c_ParallelProcessingCertified);
  addParam("coneInRad",
           m_coneInRad,
           "Cone angle in rad, will be devided by 2 for the matching",
           m_coneInRad);
}
 
ClusterMatcherModule::~ClusterMatcherModule()
{
}
 
void ClusterMatcherModule::initialize()
{
  // require existence of necessary datastore obj
  m_klmClusters.isRequired();
  m_eclClusters.isRequired();
  m_eclClusters.registerRelationTo(m_klmClusters);
 
  m_Clusters.registerInDataStore();
  m_klmClusters.registerRelationTo(m_Clusters);
  m_eclClusters.registerRelationTo(m_Clusters);
 
}//init
 
 
void ClusterMatcherModule::event()
{
  float angleDist;
 
  for (const ECLCluster& eclCluster : m_eclClusters) {
 
    const ROOT::Math::XYZVector& eclClusterPos = eclCluster.getClusterPosition();
 
    Cluster* clusterecl = m_Clusters.appendNew();
    //Once available we will have to set ECL likelihoods here as is done for KLM
    eclCluster.addRelationTo(clusterecl);
 
    for (KLMCluster& klmcluster : m_klmClusters) {
 
      const ROOT::Math::XYZVector& klmClusterPos = klmcluster.getClusterPosition();
 
      angleDist = ROOT::Math::VectorUtil::Angle(eclClusterPos, klmClusterPos);
 
      if (angleDist < (m_coneInRad / 2.0)) {
 
        eclCluster.addRelationTo(&klmcluster, angleDist);
        klmcluster.addRelationTo(clusterecl);
      } else {
        Cluster* clusterklm = m_Clusters.appendNew();
        clusterklm->setLogLikelihood(
          Const::KLM,
          Const::clusterKlong,
          (klmcluster.getRelatedTo<KlId>() != nullptr) ? klmcluster.getRelatedTo<KlId>()->getKlId() : std::numeric_limits<float>::quiet_NaN()
        );
        klmcluster.addRelationTo(clusterklm);
      }
    }//klmcluster loop
 
 
  }// for ecl cluster in clusters
} // event