#include <SeedCleanerByHitPosition.h>

Inheritance diagram for SeedCleanerByHitPosition:

Public Member Functions
virtual void	add (const Trajectory *traj)

virtual void	done ()
	Tells the cleaner that the seeds are finished, and so it can clear any cache it has. More...

virtual bool	good (const TrajectorySeed *seed)
	Returns true if the seed is not overlapping with another trajectory. More...

virtual void	init (const std::vector< Trajectory > *vect)
	Provides the cleaner a pointer to the vector where trajectories are stored, in case it does not want to keep a local collection of trajectories. More...

	SeedCleanerByHitPosition ()

Public Member Functions inherited from RedundantSeedCleaner
void	clean (const std::vector< TrajectorySeed > &, std::vector< TrajectorySeed > &)
	clean More...

void	define (std::vector< TrajectorySeed > &)
	collection definition More...

	RedundantSeedCleaner ()
	constructor More...

virtual	~RedundantSeedCleaner ()

	~RedundantSeedCleaner ()
	destructor More...

Private Attributes
const std::vector< Trajectory > *	trajectories

Detailed Description

Definition at line 5 of file SeedCleanerByHitPosition.h.

Constructor & Destructor Documentation

SeedCleanerByHitPosition::SeedCleanerByHitPosition ( )

inline

Definition at line 19 of file SeedCleanerByHitPosition.h.

19 : RedundantSeedCleaner(), trajectories(0) /*,comps_(0), tracks_(0), calls_(0)*/ {}

RedundantSeedCleaner::RedundantSeedCleaner

RedundantSeedCleaner()

constructor

Definition: RedundantSeedCleaner.h:25

SeedCleanerByHitPosition::trajectories

const std::vector< Trajectory > * trajectories

Definition: SeedCleanerByHitPosition.h:21

Member Function Documentation

virtual void SeedCleanerByHitPosition::add ( const Trajectory * traj )

inlinevirtual

In this implementation, it does nothing

Implements RedundantSeedCleaner.

Definition at line 8 of file SeedCleanerByHitPosition.h.

Referenced by counter.Counter::register().

8 { }

void SeedCleanerByHitPosition::done ( )

virtual

Tells the cleaner that the seeds are finished, and so it can clear any cache it has.

Implements RedundantSeedCleaner.

Definition at line 6 of file SeedCleanerByHitPosition.cc.

References trajectories.

                                     {
         // edm::LogInfo("SeedCleanerByHitPosition") << " Calls: " << calls_ << ", Tracks: " << tracks_ <<", Comps: " << comps_  << " Vault: " << trajectories->size() << ".";
         // calls_ = comps_ = tracks_ = 0;
 
         trajectories = 0; 
 }

bool SeedCleanerByHitPosition::good ( const TrajectorySeed * seed )

virtual

Returns true if the seed is not overlapping with another trajectory.

Implements RedundantSeedCleaner.

Definition at line 12 of file SeedCleanerByHitPosition.cc.

References AlCaHLTBitMon_QueryRunRegistry::comp, RecHitComparatorByPosition::equals(), first, newFWLiteAna::found, prof2calltree::last, TrajectorySeed::recHits(), and trajectories.

                                                               {
     const RecHitComparatorByPosition comp;
     typedef TrajectorySeed::const_iterator SI;
     typedef Trajectory::RecHitContainer::const_iterator TI;
     TrajectorySeed::range range = seed->recHits();
     SI first = range.first, curr = range.first, last = range.second;
     //calls_++;
     for (std::vector<Trajectory>::const_iterator trj = trajectories->begin(),
             trjEnd =trajectories->end();
             trj != trjEnd; ++trj) {
         //tracks_++;
         Trajectory::RecHitContainer hits = trj->recHits();
         TI ts = hits.begin(), tc = ts, te = hits.end();
         for (curr = first; curr < last; ++curr) {
             bool found = false;
             for (TI it = tc; it != te; ++it) {
                 //comps_++;
                 if (comp.equals(&(*curr), &(**it))) {
                     tc = it; found = true; break;         
                 }
             }
             if (found == false) {
                 for (TI it = ts; it != tc; ++it) {
                     //comps_++;
                     if (comp.equals(&(*curr), &(**it))) {
                         tc = it; found = true; break;         
                     }
                 }
                 if (found == false) break;
             }
         }
         if (curr == last) return false;   
     }
     return true;
 }