#include <SeedCleanerBySharedInput.h>

Inheritance diagram for SeedCleanerBySharedInput:

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

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

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

void	init (const std::vector< Trajectory > *vect) override
	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...

	SeedCleanerBySharedInput ()

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

Copy of SeedCleanerByHitPosition. Difference: uses sharedInput method of TrackingRecHit to determine equality.

Definition at line 8 of file SeedCleanerBySharedInput.h.

Constructor & Destructor Documentation

SeedCleanerBySharedInput::SeedCleanerBySharedInput ( )

inline

Definition at line 22 of file SeedCleanerBySharedInput.h.

22 : RedundantSeedCleaner(), trajectories(nullptr) {}

RedundantSeedCleaner::RedundantSeedCleaner

RedundantSeedCleaner()

constructor

Definition: RedundantSeedCleaner.h:25

SeedCleanerBySharedInput::trajectories

const std::vector< Trajectory > * trajectories

Definition: SeedCleanerBySharedInput.h:24

Member Function Documentation

void SeedCleanerBySharedInput::add ( const Trajectory * traj )

inlineoverridevirtual

In this implementation, it does nothing

Implements RedundantSeedCleaner.

Definition at line 11 of file SeedCleanerBySharedInput.h.

Referenced by counter.Counter::register().

11 { }

void SeedCleanerBySharedInput::done ( )

inlineoverridevirtual

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

Implements RedundantSeedCleaner.

Definition at line 16 of file SeedCleanerBySharedInput.h.

References good(), SurveyInfoScenario_cff::seed, and trajectories.

16 { trajectories = nullptr; };

SeedCleanerBySharedInput::trajectories

const std::vector< Trajectory > * trajectories

Definition: SeedCleanerBySharedInput.h:24

bool SeedCleanerBySharedInput::good ( const TrajectorySeed * seed )

overridevirtual

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

Implements RedundantSeedCleaner.

Definition at line 3 of file SeedCleanerBySharedInput.cc.

References TrackingRecHit::all, plotBeamSpotDB::first, runEdmFileComparison::found, hfClusterShapes_cfi::hits, plotBeamSpotDB::last, TrajectorySeed::recHits(), and trajectories.

Referenced by done().

                                                               {
     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;
 //     for (std::vector<Trajectory>::const_iterator trj = trajectories->begin(),
 //             trjEnd =trajectories->end();
 //             trj != trjEnd; ++trj) {
 // Try reverse direction (possible gain in speed)
     for (std::vector<Trajectory>::const_reverse_iterator trj = trajectories->rbegin(),
             trjEnd =trajectories->rend();
             trj != trjEnd; ++trj) {
         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) {
           if ( curr->sharesInput((**it).hit(),TrackingRecHit::all) ) {
                     tc = it; found = true; break;         
                 }
             }
             if (found == false) {
                 for (TI it = ts; it != tc; ++it) {
           if ( curr->sharesInput((**it).hit(),TrackingRecHit::all) ) {
                         tc = it; found = true; break;         
                     }
                 }
                 if (found == false) break;
             }
         }
         if (curr == last)  return false;   
     }
     return true;
 }