#include <SeedGeneratorFromRegionHits.h>

Public Member Functions
void	run (TrajectorySeedCollection &seedCollection, const TrackingRegion &region, const edm::Event &ev, const edm::EventSetup &es)

	SeedGeneratorFromRegionHits (std::unique_ptr< OrderedHitsGenerator > aGenerator, std::unique_ptr< SeedComparitor > aComparitor=nullptr, std::unique_ptr< SeedCreator > aSeedCreator=nullptr)

Private Attributes
std::unique_ptr< SeedComparitor >	theComparitor

std::unique_ptr< OrderedHitsGenerator >	theHitsGenerator

std::unique_ptr< SeedCreator >	theSeedCreator

Detailed Description

Definition at line 19 of file SeedGeneratorFromRegionHits.h.

Constructor & Destructor Documentation

◆ SeedGeneratorFromRegionHits()

SeedGeneratorFromRegionHits::SeedGeneratorFromRegionHits	(	std::unique_ptr< OrderedHitsGenerator >	aGenerator,
		std::unique_ptr< SeedComparitor >	aComparitor = `nullptr`,
		std::unique_ptr< SeedCreator >	aSeedCreator = `nullptr`
	)

Definition at line 7 of file SeedGeneratorFromRegionHits.cc.

10 : theHitsGenerator{std::move(ohg)}, theComparitor{std::move(asc)}, theSeedCreator{std::move(asp)} {}

References eostools::move().

Member Function Documentation

◆ run()

void SeedGeneratorFromRegionHits::run	(	TrajectorySeedCollection &	seedCollection,
		const TrackingRegion &	region,
		const edm::Event &	ev,
		const edm::EventSetup &	es
	)

Definition at line 12 of file SeedGeneratorFromRegionHits.cc.

                                                                {
   if (theComparitor)
     theComparitor->init(ev, es);
   theSeedCreator->init(region, es, theComparitor.get());
   const OrderedSeedingHits& hitss = theHitsGenerator->run(region, ev, es);
  
   unsigned int nHitss = hitss.size();
   // Modified 10/Jun/2014 Mark Grimes - At 140 pileup this reserve massively overestimates
   // the amount of memory required. Removing it doesn't appear to slow down the algorithm
   // noticeably.
   //if (seedCollection.empty()) seedCollection.reserve(nHitss); // don't do multiple reserves in the case of multiple regions: it would make things even worse
   //                                                            // as it will cause N re-allocations instead of the normal log(N)/log(2)
   for (unsigned int iHits = 0; iHits < nHitss; ++iHits) {
     const SeedingHitSet& hits = hitss[iHits];
     if (!theComparitor || theComparitor->compatible(hits)) {
       theSeedCreator->makeSeed(seedCollection, hits);
     }
   }
   theHitsGenerator->clear();
 }