EgAmbiguityTools Namespace Reference

Functions
bool	isBetter (reco::GsfElectron const &, reco::GsfElectron const &)
bool	isInnerMost (reco::GsfElectron const &, reco::GsfElectron const &)
int	sharedDets (reco::GsfTrackRef const &, reco::GsfTrackRef const &)
int	sharedDets (const GsfTrackRef &gsfTrackRef1, const GsfTrackRef &gsfTrackRef2)
float	sharedEnergy (reco::CaloCluster const &clu1, reco::CaloCluster const &clu2, EcalRecHitCollection const &barrelRecHits, EcalRecHitCollection const &endcapRecHits)
float	sharedEnergy (reco::SuperClusterRef const &sc1, reco::SuperClusterRef const &sc2, EcalRecHitCollection const &barrelRecHits, EcalRecHitCollection const &endcapRecHits)
int	sharedHits (reco::GsfTrackRef const &, reco::GsfTrackRef const &)
int	sharedHits (const GsfTrackRef &gsfTrackRef1, const GsfTrackRef &gsfTrackRef2)

Function Documentation

bool EgAmbiguityTools::isBetter	(	reco::GsfElectron const &	e1,
		reco::GsfElectron const &	e2
	)

Definition at line 17 of file EgAmbiguityTools.cc.

References funct::abs(), and reco::GsfElectron::eSuperClusterOverP().

Referenced by isInnerMost(), and GsfElectronBaseProducer::setAmbiguityData().

 { return (std::abs(e1.eSuperClusterOverP()-1) < std::abs(e2.eSuperClusterOverP() - 1)) ; }

bool EgAmbiguityTools::isInnerMost	(	reco::GsfElectron const &	e1,
		reco::GsfElectron const &	e2
	)

Definition at line 20 of file EgAmbiguityTools.cc.

References reco::GsfElectron::gsfTrack(), and isBetter().

Referenced by GsfElectronBaseProducer::setAmbiguityData().

{
    // retreive first valid hit
    int gsfHitCounter1 = 0 ;
    for(auto const& elHit : e1.gsfTrack()->recHits())
    {
        if (elHit->isValid()) break;
        gsfHitCounter1++;
    }

    int gsfHitCounter2 = 0 ;
    for(auto const& elHit : e2.gsfTrack()->recHits())
    {
        if (elHit->isValid()) break;
        gsfHitCounter2++;
    }

    uint32_t gsfHit1 = e1.gsfTrack()->hitPattern().getHitPattern(HitPattern::TRACK_HITS, gsfHitCounter1);
    uint32_t gsfHit2 = e2.gsfTrack()->hitPattern().getHitPattern(HitPattern::TRACK_HITS, gsfHitCounter2);

    if (HitPattern::getSubStructure(gsfHit1) != HitPattern::getSubStructure(gsfHit2)){
        return (HitPattern::getSubStructure(gsfHit1) < HitPattern::getSubStructure(gsfHit2));
    }else if (HitPattern::getLayer(gsfHit1) != HitPattern::getLayer(gsfHit2)){
        return (HitPattern::getLayer(gsfHit1) < HitPattern::getLayer(gsfHit2));
    }else{
        return isBetter(e1, e2);
    }
}

int EgAmbiguityTools::sharedDets	(	reco::GsfTrackRef const &	,
		reco::GsfTrackRef const &
	)

int EgAmbiguityTools::sharedDets	(	const GsfTrackRef &	gsfTrackRef1,
		const GsfTrackRef &	gsfTrackRef2
	)

Definition at line 101 of file EgAmbiguityTools.cc.

References reco::HitPattern::getHitPattern().

{
    //get the Hit Pattern for the gsfTracks
    const HitPattern &gsfHitPattern1 = gsfTrackRef1->hitPattern();
    const HitPattern &gsfHitPattern2 = gsfTrackRef2->hitPattern();

    unsigned int shared = 0;

    int gsfHitCounter1 = 0;
    for(trackingRecHit_iterator elHitsIt1 = gsfTrackRef1->recHitsBegin();
            elHitsIt1 != gsfTrackRef1->recHitsEnd(); elHitsIt1++, gsfHitCounter1++) {
        if(!((**elHitsIt1).isValid())){
            //count only valid Hits
            continue;
        }
        //if (gsfHitCounter1>1) continue; // to test only the first hit of the track 1
        uint32_t gsfHit = gsfHitPattern1.getHitPattern(HitPattern::TRACK_HITS, gsfHitCounter1);
        if(!(HitPattern::pixelHitFilter(gsfHit)
                    || HitPattern::stripTIBHitFilter(gsfHit)
                    || HitPattern::stripTOBHitFilter(gsfHit)
                    || HitPattern::stripTECHitFilter(gsfHit)
                    || HitPattern::stripTIDHitFilter(gsfHit)))
        {
            continue;
        }

        int gsfHitsCounter2 = 0;
        for(trackingRecHit_iterator gsfHitsIt2 = gsfTrackRef2->recHitsBegin();
                gsfHitsIt2 != gsfTrackRef2->recHitsEnd(); gsfHitsIt2++, gsfHitsCounter2++) {
            if(!((**gsfHitsIt2).isValid())){
                //count only valid Hits!
                continue;
            }

            uint32_t gsfHit2 = gsfHitPattern2.getHitPattern(HitPattern::TRACK_HITS, gsfHitsCounter2);
            if(!(HitPattern::pixelHitFilter(gsfHit2)
                        || HitPattern::stripTIBHitFilter(gsfHit2)
                        || HitPattern::stripTOBHitFilter(gsfHit2)
                        || HitPattern::stripTECHitFilter(gsfHit2)
                        || HitPattern::stripTIDHitFilter(gsfHit2) )
              ) continue;
            if ((**elHitsIt1).geographicalId() == (**gsfHitsIt2).geographicalId()) shared++;
        }//gsfHits2 iterator
    }//gsfHits1 iterator

    //std::cout << "[sharedHits] number of shared dets " << shared << std::endl;
    //return shared/min(gsfTrackRef1->numberOfValidHits(),gsfTrackRef2->numberOfValidHits());
    return shared;

}

float EgAmbiguityTools::sharedEnergy	(	reco::CaloCluster const &	clu1,
		reco::CaloCluster const &	clu2,
		EcalRecHitCollection const &	barrelRecHits,
		EcalRecHitCollection const &	endcapRecHits
	)

Definition at line 152 of file EgAmbiguityTools.cc.

References EcalBarrel, EcalEndcap, edm::SortedCollection< T, SORT >::end(), edm::SortedCollection< T, SORT >::find(), conversionTrackCandidates_cfi::fractionShared, and reco::CaloCluster::hitsAndFractions().

Referenced by RealisticHitToClusterAssociator::findAndMergeInvisibleClusters(), GsfElectronBaseProducer::setAmbiguityData(), and sharedEnergy().

{

  double fractionShared = 0;

  for(auto const& h1 : clu1.hitsAndFractions()) {

    for(auto const& h2 : clu2.hitsAndFractions()) {

      if ( h1.first != h2.first ) continue;

      // here we have common Xtal id
      EcalRecHitCollection::const_iterator itt;
      if (h1.first.subdetId() == EcalBarrel) {
        if ((itt=barrelRecHits.find(h1.first))!=barrelRecHits.end())
        fractionShared += itt->energy();
      } else if (h1.first.subdetId() == EcalEndcap) {
        if ((itt=endcapRecHits.find(h1.first))!=endcapRecHits.end())
        fractionShared += itt->energy();
      }

    }
  }

  //std::cout << "[sharedEnergy] shared energy /min(energy1,energy2) " << fractionShared << std::endl;
  return fractionShared;

}

float EgAmbiguityTools::sharedEnergy	(	reco::SuperClusterRef const &	sc1,
		reco::SuperClusterRef const &	sc2,
		EcalRecHitCollection const &	barrelRecHits,
		EcalRecHitCollection const &	endcapRecHits
	)

Definition at line 183 of file EgAmbiguityTools.cc.

References sharedEnergy().

{
  double energyShared = 0;
  for(CaloCluster_iterator icl1=sc1->clustersBegin();icl1!=sc1->clustersEnd(); icl1++) {
    for(CaloCluster_iterator icl2=sc2->clustersBegin();icl2!=sc2->clustersEnd(); icl2++) {
      energyShared += sharedEnergy(**icl1,**icl2,barrelRecHits,endcapRecHits );
    }
  }
  return energyShared;

}

int EgAmbiguityTools::sharedHits	(	reco::GsfTrackRef const &	,
		reco::GsfTrackRef const &
	)

int EgAmbiguityTools::sharedHits	(	const GsfTrackRef &	gsfTrackRef1,
		const GsfTrackRef &	gsfTrackRef2
	)

Definition at line 49 of file EgAmbiguityTools.cc.

References reco::HitPattern::getHitPattern(), and TrackingRecHit::some.

{
  //get the Hit Pattern for the gsfTracks
  HitPattern const& gsfHitPattern1 = gsfTrackRef1->hitPattern();
  HitPattern const& gsfHitPattern2 = gsfTrackRef2->hitPattern();

  unsigned int shared = 0;

  int gsfHitCounter1 = 0;
  for(trackingRecHit_iterator elHitsIt1 = gsfTrackRef1->recHitsBegin();
          elHitsIt1 != gsfTrackRef1->recHitsEnd(); elHitsIt1++, gsfHitCounter1++) {
      if(!(*elHitsIt1)->isValid()){
          //count only valid Hits
          continue;
      }
      //if (gsfHitCounter1>1) continue; // test only the first hit of the track 1
      uint32_t gsfHit = gsfHitPattern1.getHitPattern(HitPattern::TRACK_HITS, gsfHitCounter1);
      if(!(HitPattern::pixelHitFilter(gsfHit)
                  || HitPattern::stripTIBHitFilter(gsfHit)
                  || HitPattern::stripTOBHitFilter(gsfHit)
                  || HitPattern::stripTECHitFilter(gsfHit)
                  || HitPattern::stripTIDHitFilter(gsfHit))){
          continue;
      }

      int gsfHitsCounter2 = 0;
      for(trackingRecHit_iterator gsfHitsIt2 = gsfTrackRef2->recHitsBegin();
              gsfHitsIt2 != gsfTrackRef2->recHitsEnd(); gsfHitsIt2++, gsfHitsCounter2++) {
          if(!(**gsfHitsIt2).isValid()){
              //count only valid Hits
              continue;
          }
          uint32_t gsfHit2 = gsfHitPattern2.getHitPattern(HitPattern::TRACK_HITS, gsfHitsCounter2);
          if(!(HitPattern::pixelHitFilter(gsfHit2)
                      || HitPattern::stripTIBHitFilter(gsfHit2)
                      || HitPattern::stripTOBHitFilter(gsfHit2)
                      || HitPattern::stripTECHitFilter(gsfHit2)
                      || HitPattern::stripTIDHitFilter(gsfHit2))){
              continue;
          }
          if((*elHitsIt1)->sharesInput(&(**gsfHitsIt2), TrackingRecHit::some)) {
              //if (comp.equals(&(**elHitsIt1),&(**gsfHitsIt2))) {
              shared++;
          }
      }//gsfHits2 iterator
  }//gsfHits1 iterator

  //std::cout << "[sharedHits] number of shared hits " << shared << std::endl;
  return shared;
}