PFB Namespace Reference

Functions
template<typename C , typename M >
void	match (const C &candCollection, const M &matchedCandCollection, std::vector< int > &matchIndices, bool matchCharge=false, float dRMax=-1)
template<typename C , typename M >
void	match (const C &candCollection, const M &matchedCandCollection, std::vector< int > &matchIndices, const edm::ParameterSet &parameterSet, edm::View< reco::Muon > muonMatchedCandCollection, bool matchCharge=false, float dRMax=-1)

Function Documentation

match() [1/2]

template<typename C , typename M >

void PFB::match	(	const C &	candCollection,
		const M &	matchedCandCollection,
		std::vector< int > &	matchIndices,
		bool	matchCharge = false,
		float	dRMax = -1
	)

Definition at line 17 of file Matchers.h.

References ALCARECOTkAlJpsiMuMu_cff::charge, reco::deltaR2(), ALPAKA_ACCELERATOR_NAMESPACE::dR2(), dR2Max, metBenchmark_cfi::dRMax, mps_fire::i, and pfCandidateManager_cfi::matchCharge.

Referenced by PFJetMonitor::fill(), PFCandidateMonitor::fill(), PFCandidateManager::fill(), and PFJetAnalyzerDQM::fillJetResponse().

                               {
    // compute distance to each candidate in the matchedCandCollection.

    float dR2Max = 0;
    if (dRMax > 0)
      dR2Max = dRMax * dRMax;

    matchIndices.clear();
    matchIndices.resize(candCollection.size(), -1);

    for (unsigned i = 0; i < candCollection.size(); ++i) {
      static const double bigNumber = 1e14;
      double dR2min = bigNumber;
      int jMin = -1;
      for (unsigned jm = 0; jm < matchedCandCollection.size(); ++jm) {
        if (matchCharge && candCollection[i].charge() != matchedCandCollection[jm].charge())
          continue;

        double dR2 = reco::deltaR2(candCollection[i], matchedCandCollection[jm]);
        if (dR2 < dR2min) {
          dR2min = dR2;
          jMin = jm;
        }
      }

      if ((dR2Max > 0 && dR2min < dR2Max) || dRMax <= 0) {
        matchIndices[i] = jMin;
        /*  std::cout<<"match "<<dR2min<<std::endl;  */
      }
      // store the closest match, no cut on deltaR.
    }
  }

match() [2/2]

template<typename C , typename M >

void PFB::match	(	const C &	candCollection,
		const M &	matchedCandCollection,
		std::vector< int > &	matchIndices,
		const edm::ParameterSet &	parameterSet,
		edm::View< reco::Muon >	muonMatchedCandCollection,
		bool	matchCharge = false,
		float	dRMax = -1
	)

Definition at line 57 of file Matchers.h.

References ALCARECOTkAlJpsiMuMu_cff::charge, reco::deltaR2(), ALPAKA_ACCELERATOR_NAMESPACE::dR2(), dR2Max, metBenchmark_cfi::dRMax, edm::ParameterSet::getParameter(), mps_fire::i, muon::isGoodMuon(), pfCandidateManager_cfi::matchCharge, edm::parameterSet(), DiDispStaMuonMonitor_cfi::pt, and muon::RPCMuLoose.

                               {
    // compute distance to each candidate in the matchedCandCollection.

    float dR2Max = 0;
    if (dRMax > 0)
      dR2Max = dRMax * dRMax;

    matchIndices.clear();
    matchIndices.resize(candCollection.size(), -1);

    for (unsigned i = 0; i < candCollection.size(); ++i) {
      static const double bigNumber = 1e14;
      double dR2min = bigNumber;
      int jMin = -1;
      for (unsigned jm = 0; jm < matchedCandCollection.size(); ++jm) {
        if (parameterSet.getParameter<bool>("slimmedLikeSelection")) {
          if (!(muonMatchedCandCollection[jm].pt() > parameterSet.getParameter<double>("ptBase") ||
                muonMatchedCandCollection[jm].isPFMuon() ||
                (muonMatchedCandCollection[jm].pt() > parameterSet.getParameter<double>("ptNotPF") &&
                 (muonMatchedCandCollection[jm].isGlobalMuon() || muonMatchedCandCollection[jm].isStandAloneMuon() ||
                  muonMatchedCandCollection[jm].numberOfMatches() > 0 ||
                  muon::isGoodMuon(muonMatchedCandCollection[jm], muon::RPCMuLoose)))))
            continue;
        }

        if (matchCharge && candCollection[i].charge() != matchedCandCollection[jm].charge())
          continue;

        double dR2 = reco::deltaR2(candCollection[i], matchedCandCollection[jm]);
        if (dR2 < dR2min) {
          dR2min = dR2;
          jMin = jm;
        }
      }

      if ((dR2Max > 0 && dR2min < dR2Max) || dRMax <= 0) {
        matchIndices[i] = jMin;
        /*  std::cout<<"match "<<dR2min<<std::endl;  */
      }
      // store the closest match, no cut on deltaR.
    }
  }