SeedGeneratorFromRegionHits Class Reference

#include <SeedGeneratorFromRegionHits.h>

Public Member Functions
void	run (TrajectorySeedCollection &seedCollection, const TrackingRegion &region, const edm::Event &ev, const edm::EventSetup &es)
	SeedGeneratorFromRegionHits (OrderedHitsGenerator *aGenerator, SeedComparitor *aComparitor=0, SeedCreator *aSeedCreator=0)

Private Attributes
std::unique_ptr< SeedComparitor >	theComparitor
std::unique_ptr< OrderedHitsGenerator >	theHitsGenerator
std::unique_ptr< SeedCreator >	theSeedCreator

Detailed Description

Definition at line 17 of file SeedGeneratorFromRegionHits.h.

Constructor & Destructor Documentation

SeedGeneratorFromRegionHits::SeedGeneratorFromRegionHits	(	OrderedHitsGenerator *	aGenerator,
		SeedComparitor *	aComparitor = 0,
		SeedCreator *	aSeedCreator = 0
	)

Definition at line 10 of file SeedGeneratorFromRegionHits.cc.

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

Member Function Documentation

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

Definition at line 16 of file SeedGeneratorFromRegionHits.cc.

References hfClusterShapes_cfi::hits, OrderedSeedingHits::size(), theComparitor, theHitsGenerator, and theSeedCreator.

Referenced by TSGSmart::run(), and TSGFromOrderedHits::run().

{
  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();
}

Member Data Documentation

std::unique_ptr<SeedComparitor> SeedGeneratorFromRegionHits::theComparitor

private

Definition at line 33 of file SeedGeneratorFromRegionHits.h.

Referenced by run().

std::unique_ptr<OrderedHitsGenerator> SeedGeneratorFromRegionHits::theHitsGenerator

private

Definition at line 32 of file SeedGeneratorFromRegionHits.h.

Referenced by run().

std::unique_ptr<SeedCreator> SeedGeneratorFromRegionHits::theSeedCreator

private

Definition at line 34 of file SeedGeneratorFromRegionHits.h.

Referenced by run().