PixelTrackCleanerBySharedHits Class Reference

#include <PixelTrackCleanerBySharedHits.h>

Inheritance diagram for PixelTrackCleanerBySharedHits:

Public Types
typedef pixeltrackfitting::TracksWithRecHits	TracksWithRecHits
Public Types inherited from PixelTrackCleaner
typedef pixeltrackfitting::TracksWithRecHits	TracksWithRecHits

Public Member Functions
virtual TracksWithRecHits	cleanTracks (const TracksWithRecHits &tracksWithRecHits, const TrackerTopology *tTopo)
	PixelTrackCleanerBySharedHits (const edm::ParameterSet &cfg)
virtual	~PixelTrackCleanerBySharedHits ()
Public Member Functions inherited from PixelTrackCleaner
virtual	~PixelTrackCleaner ()

Detailed Description

Definition at line 17 of file PixelTrackCleanerBySharedHits.h.

Member Typedef Documentation

typedef pixeltrackfitting::TracksWithRecHits PixelTrackCleanerBySharedHits::TracksWithRecHits

Definition at line 24 of file PixelTrackCleanerBySharedHits.h.

Constructor & Destructor Documentation

PixelTrackCleanerBySharedHits::PixelTrackCleanerBySharedHits

(

const edm::ParameterSet &

cfg

)

Definition at line 12 of file PixelTrackCleanerBySharedHits.cc.

{}

PixelTrackCleanerBySharedHits::~PixelTrackCleanerBySharedHits ( )

virtual

Definition at line 15 of file PixelTrackCleanerBySharedHits.cc.

{}

Member Function Documentation

TracksWithRecHits PixelTrackCleanerBySharedHits::cleanTracks ( const TracksWithRecHits &  tracksWithRecHits, const TrackerTopology *  tTopo  )

virtual

Implements PixelTrackCleaner.

Definition at line 29 of file PixelTrackCleanerBySharedHits.cc.

References i, LogDebug, and findQualityFiles::size.

{
  typedef std::vector<const TrackingRecHit *> RecHits;
  vector<TrackWithRecHits> cleanedTracks;

  LogDebug("PixelTrackCleanerBySharedHits") << "Cleanering tracks" << "\n";
  unsigned int size = trackHitPairs.size();
  if (size == 0) return cleanedTracks;

  bool trackOk[size];
  for (auto i = 0U; i < size; i++) trackOk[i] = true;

  for (auto iTrack1 = 0U; iTrack1 < size; iTrack1++) {
    auto track1 = trackHitPairs[iTrack1].first;
    const RecHits& recHits1 = trackHitPairs[iTrack1].second;

    if (!trackOk[iTrack1]) continue;

    for (auto iTrack2 = iTrack1 + 1U; iTrack2 < size; iTrack2++)
    {
      if ( !trackOk[iTrack2]) continue; 

      auto track2 = trackHitPairs[iTrack2].first;
      const RecHits& recHits2 = trackHitPairs[iTrack2].second;

      auto commonRecHits = 0U;
      for (auto iRecHit1 = 0U; iRecHit1 < recHits1.size(); iRecHit1++) {
        for (auto iRecHit2 = 0U; iRecHit2 < recHits2.size(); iRecHit2++) {
          if (recHitsAreEqual(recHits1[iRecHit1], recHits2[iRecHit2])) { commonRecHits++; break;} // if a hit is common, no other can be the same!
        }
    if (commonRecHits > 1) break;
      }
      
      if (commonRecHits > 1) {
    if (track1->pt() > track2->pt()) trackOk[iTrack2] = false;
    else { trackOk[iTrack1] = false; break;}
      }

    }
  }

  for (auto i = 0U; i < size; i++)
  {
    if (trackOk[i]) cleanedTracks.push_back(trackHitPairs[i]);
    else delete trackHitPairs[i].first;
  }
  return cleanedTracks;
}