---

GroupedCkfTrajectoryBuilder Class Reference

A highly configurable trajectory builder that allows full exploration of the combinatorial tree of possible continuations, and provides efficient ways of trimming the combinatorial tree. More...

#include <RecoTracker/CkfPattern/interface/GroupedCkfTrajectoryBuilder.h>

Inheritance diagram for GroupedCkfTrajectoryBuilder:

List of all members.

Public Member Functions
double	chiSquareCut ()
	Chi**2 Cut on the new Trajectory Measurements to consider.
const Chi2MeasurementEstimatorBase &	estimator () const
	GroupedCkfTrajectoryBuilder (const edm::ParameterSet &conf, const TrajectoryStateUpdator *updator, const Propagator *propagatorAlong, const Propagator *propagatorOpposite, const Chi2MeasurementEstimatorBase *estimator, const TransientTrackingRecHitBuilder *RecHitBuilder, const MeasurementTracker *measurementTracker, const TrajectoryFilter *filter)
	constructor from ParameterSet
float	lostHitPenalty ()
	Chi**2 Penalty for each lost hit.
double	mass ()
	Mass hypothesis used for propagation.
int	maxCand ()
	Maximum number of trajectory candidates to propagate to the next layer.
double	ptCut ()
	Tells whether an intermediary cleaning stage should take place during TB.
void	rebuildSeedingRegion (const TrajectorySeed &, TrajectoryContainer &result) const
	trajectories re-building in the seeding region.
virtual void	setEvent (const edm::Event &event) const
	set Event for the internal MeasurementTracker data member
void	trajectories (const TrajectorySeed &, TrajectoryContainer &ret, const TrackingRegion &) const
	trajectories building starting from a seed with a region
TrajectoryContainer	trajectories (const TrajectorySeed &, const TrackingRegion &) const
	trajectories building starting from a seed with a region
void	trajectories (const TrajectorySeed &, TrajectoryContainer &ret) const
	trajectories building starting from a seed, return in an already allocated vector
TrajectoryContainer	trajectories (const TrajectorySeed &) const
	trajectories building starting from a seed
const TrajectoryStateUpdator &	updator () const
virtual	~GroupedCkfTrajectoryBuilder ()
	destructor
Protected Member Functions
virtual void	analyseMeasurements (const std::vector< TM > &meas, const Trajectory &traj) const
virtual void	analyseResult (const TrajectoryContainer &result) const
virtual void	analyseSeed (const TrajectorySeed &seed) const
Private Types
enum	work_MaxSize_Size_ { work_MaxSize_ = 50 }
Private Member Functions
bool	advanceOneLayer (TempTrajectory &traj, const TrajectoryFilter *regionalCondition, const Propagator *propagator, TempTrajectoryContainer &newCand, TempTrajectoryContainer &result) const
void	backwardFit (TempTrajectory &candidate, unsigned int nSeed, const TrajectoryFitter &fitter, TempTrajectoryContainer &fittedTracks, std::vector< const TrackingRecHit * > &remainingHits) const
void	buildTrajectories (const TrajectorySeed &, TrajectoryContainer &ret, const TrajectoryFilter *) const
	common part of both public trajectory building methods
	GroupedCkfTrajectoryBuilder (const GroupedCkfTrajectoryBuilder &)
	no copy constructor
void	groupedIntermediaryClean (TempTrajectoryContainer &theTrajectories) const
	intermediate cleaning in the case of grouped measurements
void	groupedLimitedCandidates (TempTrajectory &startingTraj, const TrajectoryFilter *regionalCondition, const Propagator *propagator, TempTrajectoryContainer &result) const
void	layers (const TempTrajectory::DataContainer &measurements, std::vector< const DetLayer * > &fillme) const
	fills in a list of layers from a container of TrajectoryMeasurements the "fillme" vector is cleared beforehand.
GroupedCkfTrajectoryBuilder &	operator= (const GroupedCkfTrajectoryBuilder &)
	no assignment operator
PropagationDirection	oppositeDirection (PropagationDirection dir) const
	change of propagation direction
int	rebuildSeedingRegion (const std::vector< const TrackingRecHit * > &seedHits, TempTrajectory &candidate, TempTrajectoryContainer &result) const
void	rebuildSeedingRegion (TempTrajectory &startingTraj, TempTrajectoryContainer &result) const
	try to find additional hits in seeding region
bool	tkxor (bool a, bool b) const
bool	verifyHits (TempTrajectory::DataContainer::const_iterator rbegin, size_t maxDepth, const std::vector< const TrackingRecHit * > &hits) const
	Verifies presence of a RecHits in a range of TrajectoryMeasurements.
Private Attributes
bool	theAlwaysUseInvalid
bool	theBestHitOnly
	Use only best hit / group when building segments.
double	theChiSquareCut
	Chi**2 Cut on the new Trajectory Measurements to consider.
TrajectoryFilter *	theConfigurableCondition
float	theFoundHitBonus
	Chi**2 bonus for each found hit (favours candidates with more measurements).
bool	theIntermediateCleaning
	Tells whether an intermediary cleaning stage should take place during TB.
bool	theLockHits
	Lock hits when building segments in a layer.
float	theLostHitPenalty
	Chi**2 Penalty for each lost hit.
double	theMass
	Mass hypothesis used for propagation.
int	theMaxCand
	Maximum number of trajectory candidates to propagate to the next layer.
unsigned int	theMinNrOf2dHitsForRebuild
	Minimum nr.
unsigned int	theMinNrOfHitsForRebuild
	Minimum nr.
double	theptCut
	ptCut
bool	theRequireSeedHitsInRebuild
	Only accept rebuilt trajectories if they contain the seed hits.
TempTrajectoryContainer	work_

---

Detailed Description

A highly configurable trajectory builder that allows full exploration of the combinatorial tree of possible continuations, and provides efficient ways of trimming the combinatorial tree.

Definition at line 23 of file GroupedCkfTrajectoryBuilder.h.

---

Member Enumeration Documentation

enum GroupedCkfTrajectoryBuilder::work_MaxSize_Size_ [private]

Enumerator:

work_MaxSize_

Definition at line 196 of file GroupedCkfTrajectoryBuilder.h.

{ work_MaxSize_ = 50 };  // if it grows above this number, it is forced to resize to half this amount when cleared

---

Constructor & Destructor Documentation

GroupedCkfTrajectoryBuilder::GroupedCkfTrajectoryBuilder	(	const edm::ParameterSet &	conf,
		const TrajectoryStateUpdator *	updator,
		const Propagator *	propagatorAlong,
		const Propagator *	propagatorOpposite,
		const Chi2MeasurementEstimatorBase *	estimator,
		const TransientTrackingRecHitBuilder *	RecHitBuilder,
		const MeasurementTracker *	measurementTracker,
		const TrajectoryFilter *	filter
	)

constructor from ParameterSet

Definition at line 61 of file GroupedCkfTrajectoryBuilder.cc.

References edm::ParameterSet::getParameter(), max, theAlwaysUseInvalid, theBestHitOnly, theFoundHitBonus, theIntermediateCleaning, theLockHits, theLostHitPenalty, theMaxCand, theMinNrOf2dHitsForRebuild, theMinNrOfHitsForRebuild, and theRequireSeedHitsInRebuild.

                                                                         :

  BaseCkfTrajectoryBuilder(conf,
                           updator, propagatorAlong,propagatorOpposite,
                           estimator, recHitBuilder, measurementTracker,filter)
{
  // fill data members from parameters (eventually data members could be dropped)
  //
  theMaxCand                  = conf.getParameter<int>("maxCand");

  theLostHitPenalty           = conf.getParameter<double>("lostHitPenalty");
  theFoundHitBonus            = conf.getParameter<double>("foundHitBonus");
  theIntermediateCleaning     = conf.getParameter<bool>("intermediateCleaning");
  theAlwaysUseInvalid         = conf.getParameter<bool>("alwaysUseInvalidHits");
  theLockHits                 = conf.getParameter<bool>("lockHits");
  theBestHitOnly              = conf.getParameter<bool>("bestHitOnly");
  theMinNrOf2dHitsForRebuild  = 2;
  theRequireSeedHitsInRebuild = conf.getParameter<bool>("requireSeedHitsInRebuild");
  theMinNrOfHitsForRebuild    = max(0,conf.getParameter<int>("minNrOfHitsForRebuild"));

  /* ======= B.M. to be ported later =======
  bool setOK = thePropagator->setMaxDirectionChange(1.6);
  if (!setOK) 
    cout  << "GroupedCkfTrajectoryBuilder WARNING: "
          << "propagator does not support setMaxDirectionChange" 
          << endl;
  //   addStopCondition(theMinPtStopCondition);
  theConfigurableCondition = createAlgo<TrajectoryFilter>(componentConfig("StopCondition"));
  ===================================== */

}

virtual GroupedCkfTrajectoryBuilder::~GroupedCkfTrajectoryBuilder

(

)

[inline, virtual]

destructor

Definition at line 37 of file GroupedCkfTrajectoryBuilder.h.

{}

GroupedCkfTrajectoryBuilder::GroupedCkfTrajectoryBuilder

(

const GroupedCkfTrajectoryBuilder &

)

[private]

no copy constructor

---

Member Function Documentation

bool GroupedCkfTrajectoryBuilder::advanceOneLayer	(	TempTrajectory &	traj,
		const TrajectoryFilter *	regionalCondition,
		const Propagator *	propagator,
		TempTrajectoryContainer &	newCand,
		TempTrajectoryContainer &	result
	)			const [private]

Definition at line 344 of file GroupedCkfTrajectoryBuilder.cc.

References BaseCkfTrajectoryBuilder::addToResult(), GenMuonPlsPt100GeV_cfg::cout, TrajectoryStateOnSurface::curvilinearError(), lat::endl(), TransverseImpactPointExtrapolator::extrapolate(), BaseCkfTrajectoryBuilder::findStateAndLayers(), cmsutils::bqueue< T >::front(), TrajectoryStateOnSurface::globalMomentum(), TrajectoryStateOnSurface::globalPosition(), i, TrajectoryStateOnSurface::isValid(), TempTrajectory::lastLayer(), LogDebug, CurvilinearTrajectoryError::matrix(), middle, TrackingRecHit::missing, PV3DBase< T, PVType, FrameType >::perp(), GloballyPositioned< T >::position(), TempTrajectory::push(), Cylinder::radius(), TrajectorySegmentBuilder::segments(), cmsutils::bqueue< T >::size(), ForwardDetLayer::specificSurface(), BarrelDetLayer::specificSurface(), funct::sqrt(), theAlwaysUseInvalid, theBestHitOnly, BaseCkfTrajectoryBuilder::theEstimator, BaseCkfTrajectoryBuilder::theForwardPropagator, BaseCkfTrajectoryBuilder::theLayerMeasurements, theLockHits, BaseCkfTrajectoryBuilder::theMeasurementTracker, BaseCkfTrajectoryBuilder::theUpdator, BaseCkfTrajectoryBuilder::toBeContinued(), and PV3DBase< T, PVType, FrameType >::z().

Referenced by groupedLimitedCandidates().

{
  std::pair<TSOS,std::vector<const DetLayer*> > stateAndLayers = findStateAndLayers(traj);
  vector<const DetLayer*>::iterator layerBegin = stateAndLayers.second.begin();
  vector<const DetLayer*>::iterator layerEnd   = stateAndLayers.second.end();

  //   if (nl.empty()) {
  //     addToResult(traj,result);
  //     return false;
  //   }
  
#ifdef DBG_GCTB
  vector<const DetLayer*> & nl = stateAndLayers.second;
  #include "TrackingTools/DetLayers/interface/BarrelDetLayer.h"
  #include "TrackingTools/DetLayers/interface/ForwardDetLayer.h"
  //B.M. TkLayerName layerName;
  //B.M. cout << "Started from " << layerName(traj.lastLayer()) 
  const BarrelDetLayer* sbdl = dynamic_cast<const BarrelDetLayer*>(traj.lastLayer());
  const ForwardDetLayer* sfdl = dynamic_cast<const ForwardDetLayer*>(traj.lastLayer());
  if (sbdl)     cout << "Started from " << traj.lastLayer() << " r " << sbdl->specificSurface().radius() << endl;
  if (sfdl) cout << "Started from " << traj.lastLayer() << " z " << sfdl->specificSurface().position().z() << endl;
  cout << "Trying to go to";
  for ( vector<const DetLayer*>::iterator il=nl.begin();
        il!=nl.end(); il++){ 
    //B.M. cout << " " << layerName(*il)  << " " << *il << endl;
    const BarrelDetLayer* bdl = dynamic_cast<const BarrelDetLayer*>(*il);
    const ForwardDetLayer* fdl = dynamic_cast<const ForwardDetLayer*>(*il);

    if (bdl) cout << " r " << bdl->specificSurface().radius() << endl;
    if (fdl) cout << " z " << fdl->specificSurface().position().z() << endl;
    //cout << " " << *il << endl;   
  }
  cout << endl;
#endif

  bool foundSegments(false);
  bool foundNewCandidates(false);
  for ( vector<const DetLayer*>::iterator il=layerBegin; 
        il!=layerEnd; il++) {

    TSOS stateToUse = stateAndLayers.first;
    if ((*il)==traj.lastLayer())
      {
        LogDebug("CkfPattern")<<" self propagating in advanceOneLayer.\n from: \n"<<stateToUse;
        //self navigation case
        // go to a middle point first
        TransverseImpactPointExtrapolator middle;
        GlobalPoint center(0,0,0);
        stateToUse = middle.extrapolate(stateToUse, center, *theForwardPropagator);
        
        if (!stateToUse.isValid()) continue;
        LogDebug("CkfPattern")<<"to: "<<stateToUse;
      }

    TrajectorySegmentBuilder layerBuilder(theMeasurementTracker,
                                          theLayerMeasurements,
                                          **il,*propagator,
                                          *theUpdator,*theEstimator,
                                          theLockHits,theBestHitOnly);

#ifdef DBG_GCTB
    cout << "GCTB: starting from r / z = " << stateToUse.globalPosition().perp()
     << " / " << stateToUse.globalPosition().z() << " , pt / pz = "
     << stateToUse.globalMomentum().perp() << " / "
     << stateToUse.globalMomentum().z() << " for layer at "
     << *il << endl;
    cout << "     errors:";
    for ( int i=0; i<5; i++ )  cout << " " << sqrt(stateToUse.curvilinearError().matrix()(i,i));
    cout << endl;

    //cout << "GCTB: starting from r / phi / z = " << stateAndLayers.first.globalPosition().perp()
         //<< " / " << stateAndLayers.first.globalPosition().phi()
         //<< " / " << stateAndLayers.first.globalPosition().z() << " , pt / pz = " 
         //<< stateAndLayers.first.globalMomentum().perp() << " / " 
         //<< stateAndLayers.first.globalMomentum().z() << " for layer at "
         //<< *il << endl;
    //cout << "     errors:";
    //for ( int i=0; i<5; i++ )  cout << " " << sqrt(stateAndLayers.first.curvilinearError().matrix()(i,i));
    //cout << endl;
#endif

    TempTrajectoryContainer segments=
      //layerBuilder.segments(stateAndLayers.first);
      layerBuilder.segments(stateToUse);

#ifdef DBG_GCTB
    cout << "GCTB: number of segments = " << segments.size() << endl;
#endif

    if ( !segments.empty() )  foundSegments = true;

    for ( TempTrajectoryContainer::const_iterator is=segments.begin();
          is!=segments.end(); is++ ) {
      //
      // assume "invalid hit only" segment is last in list
      //
      const TempTrajectory::DataContainer & measurements = is->measurements();
      if ( !theAlwaysUseInvalid && is!=segments.begin() && measurements.size()==1 && 
           (measurements.front().recHit()->getType() == TrackingRecHit::missing) )  break;
      //
      // create new candidate
      //
      TempTrajectory newTraj(traj);
      
      newTraj.push(*is);
      //GIO// for ( vector<TM>::const_iterator im=measurements.begin();
      //GIO//        im!=measurements.end(); im++ )  newTraj.push(*im);
      //if ( toBeContinued(newTraj,regionalCondition) ) { TOBE FIXED
      if ( toBeContinued(newTraj) ) {

#ifdef DBG_GCTB
        cout << "GCTB: adding new trajectory to candidates" << endl;
#endif

        newCand.push_back(newTraj);
        foundNewCandidates = true;
      }
      else {

#ifdef DBG_GCTB
        cout << "GCTB: adding new trajectory to results" << endl;
#endif

        addToResult(newTraj,result);
      }
    }
  }

#ifdef DBG_GCTB
  if ( !foundSegments )  cout << "GCTB: adding input trajectory to result" << endl;
#endif

  if ( !foundSegments )  addToResult(traj,result);
  return foundNewCandidates;
}

virtual void GroupedCkfTrajectoryBuilder::analyseMeasurements	(	const std::vector< TM > &	meas,
		const Trajectory &	traj
	)			const [inline, protected, virtual]

Definition at line 92 of file GroupedCkfTrajectoryBuilder.h.

                                                                 {}

virtual void GroupedCkfTrajectoryBuilder::analyseResult

(

const TrajectoryContainer &

result

)

const [inline, protected, virtual]

Definition at line 94 of file GroupedCkfTrajectoryBuilder.h.

{}

virtual void GroupedCkfTrajectoryBuilder::analyseSeed

(

const TrajectorySeed &

seed

)

const [inline, protected, virtual]

Definition at line 90 of file GroupedCkfTrajectoryBuilder.h.

{}

void GroupedCkfTrajectoryBuilder::backwardFit	(	TempTrajectory &	candidate,
		unsigned int	nSeed,
		const TrajectoryFitter &	fitter,
		TempTrajectoryContainer &	fittedTracks,
		std::vector< const TrackingRecHit * > &	remainingHits
	)			const [private]

Definition at line 802 of file GroupedCkfTrajectoryBuilder.cc.

References GenMuonPlsPt100GeV_cfg::cout, TempTrajectory::direction(), Trajectory::direction(), end, lat::endl(), Trajectory::firstMeasurement(), TrajectoryFitter::fit(), TrackingRecHit::isValid(), TempTrajectory::measurements(), oppositeDirection(), Trajectory::push(), cmsutils::bqueue< T >::rbegin(), Trajectory::recHits(), cmsutils::bqueue< T >::rend(), TempTrajectory::seed(), Trajectory::seed(), theMinNrOfHitsForRebuild, and TrajectoryMeasurement::updatedState().

Referenced by rebuildSeedingRegion().

{
  //
  // clear array of non-fitted hits
  //
  remainingHits.clear();
  fittedTracks.clear();
  //
  // skip candidates which are not exceeding the seed size
  // (should not happen)
  //
  if ( candidate.measurements().size()<=nSeed ) {
    fittedTracks.clear();
    return;
  }
#ifdef DBG2_GCTB
    {
      cout << "nSeed " << nSeed << endl;
      cout << "Old traj direction = " << candidate.direction() << endl;
      cmsutils::bqueue<TM> tms = candidate.measurements();
      for (cmsutils::bqueue<TM>::const_iterator im=tms.rbegin(),end=tms.rend();
           im!=end; --im ) {
        if ( im->recHit()->isValid() )  cout << im->recHit()->globalPosition();
        else cout << "(-,-,-)";
        cout << " layer " << im->layer();
        cout << " fwdPred " << im->forwardPredictedState().isValid();
        cout << " bwdPred " << im->backwardPredictedState().isValid();
        cout << " upPred " << im->updatedState().isValid() << " ;";
        //SimIdPrinter()(im->recHit());
        cout << endl;
      }
    }
#endif
  //
  // backward fit trajectory (excluding the seeding region)
  //
  TempTrajectory::DataContainer oldMeasurements(candidate.measurements());
//   int nOld(oldMeasurements.size());
//   const unsigned int nHitAllMin(5);
//   const unsigned int nHit2dMin(2);
  unsigned int nHit(0);    // number of valid hits after seeding region
  //unsigned int nHit2d(0);  // number of valid hits after seeding region with 2D info
  // use all hits except the first n (from seed), but require minimum
  // specified in configuration.
  //unsigned int nHitMin = max(oldMeasurements.size()-nSeed,theMinNrOfHitsForRebuild);
  unsigned int nHitMin = oldMeasurements.size()-nSeed;
  // we want to rebuild only if the number of measurements excluding the seed measurements is higher than the cut
  if (nHitMin<theMinNrOfHitsForRebuild){
        fittedTracks.clear();
        return;
  }
  //cout << "nHitMin " << nHitMin << endl;
#ifdef DBG2_GCTB
  cout << "Sizes: " << oldMeasurements.size() << " / " << endl;
#endif
  //
  // create input trajectory for backward fit
  //
  Trajectory fwdTraj(candidate.seed(),oppositeDirection(candidate.direction()));
  //const TrajectorySeed seed = TrajectorySeed(PTrajectoryStateOnDet(), TrajectorySeed::recHitContainer(), oppositeDirection(candidate.direction()));
  //Trajectory fwdTraj(seed, oppositeDirection(candidate.direction()));
  std::vector<const DetLayer*> bwdDetLayer; 
  for ( TempTrajectory::DataContainer::const_iterator im=oldMeasurements.rbegin();
        im!=oldMeasurements.rend(); --im) {
    const TrackingRecHit* hit = im->recHit()->hit();
    //
    // add hits until required number is reached
    //
    if ( nHit<nHitMin ){//|| nHit2d<theMinNrOf2dHitsForRebuild ) {
      fwdTraj.push(*im);
      bwdDetLayer.push_back(im->layer());
      //
      // count valid / 2D hits
      //
      if ( hit->isValid() ) {
        nHit++;
        //if ( hit.isMatched() ||
        //     hit.det().detUnits().front()->type().module()==pixel )
        //nHit2d++;
      }
    }
    //if (nHit==nHitMin) lastBwdDetLayer=im->layer();   
    //
    // keep remaining (valid) hits for verification
    //
    else if ( hit->isValid() ) {
      //std::cout << "Adding a remaining hit" << std::endl;
      remainingHits.push_back(hit);
    }
  }
  //
  // Fit only if required number of valid hits can be used
  //
  if ( nHit<nHitMin ){  //|| nHit2d<theMinNrOf2dHitsForRebuild ) {
    fittedTracks.clear();
    return;
  }
  //
  // Do the backward fit (important: start from scaled, not random cov. matrix!)
  //
  TrajectoryStateOnSurface firstTsos(fwdTraj.firstMeasurement().updatedState());
  //cout << "firstTsos "<< firstTsos << endl;
  firstTsos.rescaleError(100.);
  //TrajectoryContainer bwdFitted(fitter.fit(fwdTraj.seed(),fwdTraj.recHits(),firstTsos));
  TrajectoryContainer bwdFitted(fitter.fit(
                TrajectorySeed(PTrajectoryStateOnDet(), TrajectorySeed::recHitContainer(), oppositeDirection(candidate.direction())),
                fwdTraj.recHits(),firstTsos));
  if (bwdFitted.size()){
#ifdef DBG2_GCTB
        cout << "Obtained " << bwdFitted.size() << " bwdFitted trajectories with measurement size " << bwdFitted.front().measurements().size() << endl;
#endif
        TempTrajectory fitted(fwdTraj.seed(), fwdTraj.direction());
        vector<TM> tmsbf = bwdFitted.front().measurements();
        int iDetLayer=0;
        //this is ugly but the TM in the fitted track do not contain the DetLayer.
        //So we have to cache the detLayer pointers and replug them in.
        //For the backward building it would be enaugh to cache the last DetLayer, 
        //but for the intermediary cleaning we need all
        for ( vector<TM>::const_iterator im=tmsbf.begin();im!=tmsbf.end(); im++ ) {
                fitted.push(TM( (*im).forwardPredictedState(),
                                (*im).backwardPredictedState(),
                                (*im).updatedState(),
                                (*im).recHit(),
                                (*im).estimate(),
                                bwdDetLayer[iDetLayer]));
#ifdef DBG2_GCTB
                if ( im->recHit()->isValid() )  cout << im->recHit()->globalPosition();
                else cout << "(-,-,-)";
                cout << " layer " << bwdDetLayer[iDetLayer];
                cout << " fwdPred " << im->forwardPredictedState().isValid();
                cout << " bwdPred " << im->backwardPredictedState().isValid();
                cout << " upPred " << im->updatedState().isValid() << " ;";
                //SimIdPrinter()(im->recHit());
                cout << endl;   
#endif          
                iDetLayer++;
        }
/*
        TM lastMeas = bwdFitted.front().lastMeasurement();
        fitted.pop();
        fitted.push(TM(lastMeas.forwardPredictedState(), 
                               lastMeas.backwardPredictedState(), 
                               lastMeas.updatedState(),
                               lastMeas.recHit(),
                               lastMeas.estimate(),
                               lastBwdDetLayer));*/
        fittedTracks.push_back(fitted);
  }
  //
  // save result
  //
  //fittedTracks.swap(bwdFitted);
  //cout << "Obtained " << fittedTracks.size() << " fittedTracks trajectories with measurement size " << fittedTracks.front().measurements().size() << endl;

void GroupedCkfTrajectoryBuilder::buildTrajectories	(	const TrajectorySeed &	,
		TrajectoryContainer &	ret,
		const TrajectoryFilter *
	)			const [private]

common part of both public trajectory building methods

Referenced by trajectories().

double GroupedCkfTrajectoryBuilder::chiSquareCut

(

)

[inline]

Chi**2 Cut on the new Trajectory Measurements to consider.

Definition at line 70 of file GroupedCkfTrajectoryBuilder.h.

References theChiSquareCut.

{return theChiSquareCut;}

const Chi2MeasurementEstimatorBase& GroupedCkfTrajectoryBuilder::estimator

(

void

)

const [inline]

Definition at line 65 of file GroupedCkfTrajectoryBuilder.h.

References BaseCkfTrajectoryBuilder::theEstimator.

Referenced by rebuildSeedingRegion().

{return *theEstimator;}

void GroupedCkfTrajectoryBuilder::groupedIntermediaryClean

(

TempTrajectoryContainer &

theTrajectories

)

const [private]

intermediate cleaning in the case of grouped measurements

recHitEqualByChannels(im1->recHit(),im2->recHit()) ) {

recHitEqualByChannels(im1->recHit(),im2->recHit()) ) {

Definition at line 486 of file GroupedCkfTrajectoryBuilder.cc.

References HLT_VtxMuL3::firstValid, TempTrajectory::isValid(), layers(), cmsutils::bqueue< T >::rbegin(), cmsutils::bqueue< T >::rend(), TrackingRecHit::some, and tkxor().

Referenced by groupedLimitedCandidates().

{
  //if (theTrajectories.empty()) return TrajectoryContainer();
  //TrajectoryContainer result;
  if (theTrajectories.empty()) return;  
  //RecHitEqualByChannels recHitEqualByChannels(false, false);
  int firstLayerSize, secondLayerSize;
  vector<const DetLayer*> firstLayers, secondLayers;

  for (TempTrajectoryContainer::iterator firstTraj=theTrajectories.begin();
       firstTraj!=(theTrajectories.end()-1); firstTraj++) {

    if ( (!firstTraj->isValid()) ||
         (!firstTraj->lastMeasurement().recHit()->isValid()) ) continue;
    const TempTrajectory::DataContainer & firstMeasurements = firstTraj->measurements();
    layers(firstMeasurements, firstLayers);
    firstLayerSize = firstLayers.size();
    if ( firstLayerSize<4 )  continue;

    for (TempTrajectoryContainer::iterator secondTraj=(firstTraj+1);
       secondTraj!=theTrajectories.end(); secondTraj++) {

      if ( (!secondTraj->isValid()) ||
           (!secondTraj->lastMeasurement().recHit()->isValid()) ) continue;
      const TempTrajectory::DataContainer & secondMeasurements = secondTraj->measurements();
      layers(secondMeasurements, secondLayers);
      secondLayerSize = secondLayers.size();
      //
      // only candidates using the same last 3 layers are compared
      //
      if ( firstLayerSize!=secondLayerSize )  continue;
      if ( firstLayers[0]!=secondLayers[0] ||
           firstLayers[1]!=secondLayers[1] ||
           firstLayers[2]!=secondLayers[2] )  continue;

      TempTrajectory::DataContainer::const_iterator im1 = firstMeasurements.rbegin();
      TempTrajectory::DataContainer::const_iterator im2 = secondMeasurements.rbegin();
      //
      // check for identical hits in the last layer
      //
      bool unequal(false);
      const DetLayer* layerPtr = firstLayers[0];
      while ( im1!=firstMeasurements.rend()&&im2!=secondMeasurements.rend() ) {
        if ( im1->layer()!=layerPtr || im2->layer()!=layerPtr )  break;
        if ( !(im1->recHit()->isValid()) || !(im2->recHit()->isValid()) ||
             !im1->recHit()->hit()->sharesInput(im2->recHit()->hit(), TrackingRecHit::some) ) {
          unequal = true;
          break;
        }
        --im1;
        --im2;
      }
      if ( im1==firstMeasurements.rend() || im2==secondMeasurements.rend() ||
           im1->layer()==layerPtr || im2->layer()==layerPtr || unequal )  continue;
      //
      // check for invalid hits in the layer -2
      // compare only candidates with invalid / valid combination
      //
      layerPtr = firstLayers[1];
      bool firstValid(true);
      while ( im1!=firstMeasurements.rend()&&im1->layer()==layerPtr ) {
        if ( !im1->recHit()->isValid() )  firstValid = false;
        --im1;
      }
      bool secondValid(true);
      while ( im2!=secondMeasurements.rend()&&im2->layer()==layerPtr ) {
        if ( !im2->recHit()->isValid() )  secondValid = false;
        --im2;
      }
      if ( !tkxor(firstValid,secondValid) )  continue;
      //
      // ask for identical hits in layer -3
      //
      unequal = false;
      layerPtr = firstLayers[2];
      while ( im1!=firstMeasurements.rend()&&im2!=secondMeasurements.rend() ) {
        if ( im1->layer()!=layerPtr || im2->layer()!=layerPtr )  break;
        if ( !(im1->recHit()->isValid()) || !(im2->recHit()->isValid()) ||
             !im1->recHit()->hit()->sharesInput(im2->recHit()->hit(), TrackingRecHit::some) ) {
          unequal = true;
          break;
        }
        --im1;
        --im2;
      }
      if ( im1==firstMeasurements.rend() || im2==secondMeasurements.rend() ||
           im1->layer()==layerPtr || im2->layer()==layerPtr || unequal )  continue;

      if ( !firstValid ) {
        firstTraj->invalidate();
        break;
      }
      else {
        secondTraj->invalidate();
        break;
      }
    }
  }
/*
  for (TempTrajectoryContainer::const_iterator it = theTrajectories.begin();
       it != theTrajectories.end(); it++) {
    if(it->isValid()) result.push_back( *it);
  }

  return result;
*/
  theTrajectories.erase(std::remove_if( theTrajectories.begin(),theTrajectories.end(),
                                        std::not1(std::mem_fun_ref(&TempTrajectory::isValid))),
 //                                     boost::bind(&TempTrajectory::isValid,_1)), 
                        theTrajectories.end());
}

void GroupedCkfTrajectoryBuilder::groupedLimitedCandidates	(	TempTrajectory &	startingTraj,
		const TrajectoryFilter *	regionalCondition,
		const Propagator *	propagator,
		TempTrajectoryContainer &	result
	)			const [private]

Definition at line 247 of file GroupedCkfTrajectoryBuilder.cc.

References advanceOneLayer(), IntermediateTrajectoryCleaner::clean(), GenMuonPlsPt100GeV_cfg::cout, dumpCandidates(), lat::endl(), groupedIntermediaryClean(), it, LogDebug, python::multivaluedict::sort(), theFoundHitBonus, theIntermediateCleaning, theLostHitPenalty, and theMaxCand.

Referenced by rebuildSeedingRegion().

{
  uint nIter=1;
  TempTrajectoryContainer candidates;
  TempTrajectoryContainer newCand;
  candidates.push_back( startingTraj);

  while ( !candidates.empty()) {
#ifdef DBG_GCTB
    cout << "===== GCTB::groupedLimitedCandidates, start NEW iteration of WHILE loop" << endl;
#endif
    newCand.clear();
    for (TempTrajectoryContainer::iterator traj=candidates.begin();
         traj!=candidates.end(); traj++) {
      if ( !advanceOneLayer(*traj,regionalCondition, propagator, newCand,result) ) {
#ifdef DBG_GCTB
        cout << "GCTB: terminating after advanceOneLayer==false" << endl;
#endif
        continue;
      }
    
#ifdef DBG_GCTB
      cout << "newCand(1)";
      for ( TempTrajectoryContainer::const_iterator it=newCand.begin();
            it!=newCand.end(); it++ ) 
        cout << " " << it->lostHits() << " " << it->foundHits() 
             << " " << it->chiSquared() << " ;";
      cout << endl;
//       cout << "newCand.size() = " << newCand.size() << endl;
#endif
      if ((int)newCand.size() > theMaxCand) {
#ifdef DBG_GCTB
        //ShowCand()(newCand);
#endif
        sort( newCand.begin(), newCand.end(), GroupedTrajCandLess(theLostHitPenalty,theFoundHitBonus));
        newCand.erase( newCand.begin()+theMaxCand, newCand.end());
      }
#ifdef DBG_GCTB
      cout << "newCand(2)";
      for ( TempTrajectoryContainer::const_iterator it=newCand.begin();
            it!=newCand.end(); it++ ) 
        cout << " " << it->lostHits() << " " << it->foundHits() 
             << " " << it->chiSquared() << " ;";
      cout << endl;
#endif
    }

#ifdef DBG_GCTB
    cout << "newCand.size() at end = " << newCand.size() << endl;
#endif
/*
    if (theIntermediateCleaning) {
      candidates.clear();
      candidates = groupedIntermediaryClean(newCand);
    } else {
      candidates.swap(newCand);
    }
*/
    if (theIntermediateCleaning) {
#ifdef STANDARD_INTERMEDIARYCLEAN
        IntermediateTrajectoryCleaner::clean(newCand);  
#else 
        groupedIntermediaryClean(newCand);
#endif  

    }   
    candidates.swap(newCand);

    LogDebug("CkfPattern") <<result.size()<<" candidates after "<<nIter++<<" groupedCKF iteration: \n"
                           <<dumpCandidates(result)
                           <<"\n "<<candidates.size()<<" running candidates are: \n"
                           <<dumpCandidates(candidates);

#ifdef DBG_GCTB
    cout << "candidates(3)";
    for ( TempTrajectoryContainer::const_iterator it=candidates.begin();
          it!=candidates.end(); it++ ) 
      cout << "lost,found,chi2, last pt, r,z: " 
           << it->lostHits() << " , " 
           << it->foundHits() << " , " 
           << it->chiSquared() << " , "
           << it->lastMeasurement().updatedState().globalMomentum().perp() << " , "
           << it->lastMeasurement().updatedState().globalPosition().perp() << " , "
           << it->lastMeasurement().updatedState().globalPosition().z() << endl; 
    cout << endl;

    cout << "after intermediate cleaning = " << candidates.size() << endl;
    //B.M. ShowCand()(candidates);
    cout << "===== GCTB::groupedLimitedCandidates, END iteration of WHILE loop" << endl;
#endif
  }
}

void GroupedCkfTrajectoryBuilder::layers	(	const TempTrajectory::DataContainer &	measurements,
		std::vector< const DetLayer * > &	fillme
	)			const [private]

fills in a list of layers from a container of TrajectoryMeasurements the "fillme" vector is cleared beforehand.

Referenced by groupedIntermediaryClean().

float GroupedCkfTrajectoryBuilder::lostHitPenalty

(

)

[inline]

Chi**2 Penalty for each lost hit.

Definition at line 77 of file GroupedCkfTrajectoryBuilder.h.

References theLostHitPenalty.

{return theLostHitPenalty;}

double GroupedCkfTrajectoryBuilder::mass

(

)

[inline]

Mass hypothesis used for propagation.

Definition at line 86 of file GroupedCkfTrajectoryBuilder.h.

References theMass.

{return theMass;}

int GroupedCkfTrajectoryBuilder::maxCand

(

)

[inline]

Maximum number of trajectory candidates to propagate to the next layer.

Definition at line 73 of file GroupedCkfTrajectoryBuilder.h.

References theMaxCand.

{return theMaxCand;}

GroupedCkfTrajectoryBuilder& GroupedCkfTrajectoryBuilder::operator=

(

const GroupedCkfTrajectoryBuilder &

)

[private]

no assignment operator

PropagationDirection GroupedCkfTrajectoryBuilder::oppositeDirection

(

PropagationDirection

dir

)

const [inline, private]

change of propagation direction

Definition at line 154 of file GroupedCkfTrajectoryBuilder.h.

References alongMomentum, and oppositeToMomentum.

Referenced by backwardFit().

                                                                                 {
    if ( dir==alongMomentum )  return oppositeToMomentum;
    else if ( dir==oppositeToMomentum )  return alongMomentum;
    return dir;
  }

double GroupedCkfTrajectoryBuilder::ptCut

(

)

[inline]

Tells whether an intermediary cleaning stage should take place during TB.

Pt cut

Definition at line 83 of file GroupedCkfTrajectoryBuilder.h.

References theptCut.

{return theptCut;}

int GroupedCkfTrajectoryBuilder::rebuildSeedingRegion	(	const std::vector< const TrackingRecHit * > &	seedHits,
		TempTrajectory &	candidate,
		TempTrajectoryContainer &	result
	)			const [private]

Definition at line 691 of file GroupedCkfTrajectoryBuilder.cc.

References GenMuonPlsPt100GeV_cfg::cout, end, lat::endl(), groupedLimitedCandidates(), it, TempTrajectory::measurements(), cmsutils::bqueue< T >::rbegin(), cmsutils::bqueue< T >::rend(), BaseCkfTrajectoryBuilder::theBackwardPropagator, theRequireSeedHitsInRebuild, and verifyHits().

{
  //
  // Try to rebuild one candidate in the seeding region.
  // The resulting trajectories are returned in result,
  // the count is the return value.
  //
  TempTrajectoryContainer rebuiltTrajectories;
#ifdef DBG2_GCTB
/*  const LayerFinderByDet layerFinder;
  if ( !seedHits.empty() && seedHits.front().isValid() ) {
    DetLayer* seedLayer = layerFinder(seedHits.front().det());
    cout << "Seed hit at " << seedHits.front().globalPosition()
         << " " << seedLayer << endl;
    cout << "Started from " 
         << candidate.lastMeasurement().updatedState().globalPosition().perp() << " "
         << candidate.lastMeasurement().updatedState().globalPosition().z() << endl;
    pair<bool,TrajectoryStateOnSurface> layerComp(false,TrajectoryStateOnSurface());
    if ( seedLayer ) layerComp =
      seedLayer->compatible(candidate.lastMeasurement().updatedState(),
                              propagator(),estimator());
    pair<bool,TrajectoryStateOnSurface> detComp =
      seedHits.front().det().compatible(candidate.lastMeasurement().updatedState(),
                                        propagator(),estimator());
    cout << "  layer compatibility = " << layerComp.first;
    cout << "  det compatibility = " << detComp.first;
    if ( detComp.first ) {
      cout << "  estimate = " 
           << estimator().estimate(detComp.second,seedHits.front()).second ;
    }
    cout << endl;
  }*/
  cout << "Before backward building: #measurements = " 
       << candidate.measurements().size() ; //<< endl;;
#endif
  //
  // Use standard building with standard cuts. Maybe better to use different
  // cuts from "forward" building (e.g. no check on nr. of invalid hits)?
  //
  groupedLimitedCandidates(candidate,(const TrajectoryFilter*)0, theBackwardPropagator, rebuiltTrajectories);
#ifdef DBG2_GCTB
  cout << "   After backward building: #measurements =";
  for ( TempTrajectoryContainer::iterator it=rebuiltTrajectories.begin();
        it!=rebuiltTrajectories.end(); it++ )  cout << " " << it->measurements().size();
  cout << endl;
#endif
  //
  // Check & count resulting candidates
  //
  int nrOfTrajectories(0);
  //const RecHitEqualByChannels recHitEqual(false,false);
  //vector<TM> oldMeasurements(candidate.measurements());
  for ( TempTrajectoryContainer::iterator it=rebuiltTrajectories.begin();
        it!=rebuiltTrajectories.end(); it++ ) {

    TempTrajectory::DataContainer newMeasurements(it->measurements());
    //
    // Verify presence of seeding hits?
    //
    if ( theRequireSeedHitsInRebuild ) {
      // no hits found (and possibly some invalid hits discarded): drop track
      if ( newMeasurements.size()<=candidate.measurements().size() ){  
#ifdef DBG2_GCTB
        cout << "newMeasurements.size()<=candidate.measurements().size()" << endl;
#endif
        continue;
      } 
      // verify presence of hits
      //GIO//if ( !verifyHits(newMeasurements.begin()+candidate.measurements().size(),
      //GIO//                  newMeasurements.end(),seedHits) ){
      if ( !verifyHits(newMeasurements.rbegin(), 
                       newMeasurements.size() - candidate.measurements().size(),
                       seedHits) ){
#ifdef DBG2_GCTB
          cout << "seed hits not found in rebuild" << endl;     
#endif  
          continue; 
      }
    }
    //
    // construct final trajectory in the right order
    //
    TempTrajectory reversedTrajectory(it->seed(),it->seed().direction());
    for (TempTrajectory::DataContainer::const_iterator im=newMeasurements.rbegin(), ed = newMeasurements.rend();
          im != ed; --im ) {
      reversedTrajectory.push(*im);
    }
    // save & count result
    result.push_back(reversedTrajectory);
    nrOfTrajectories++;
#ifdef DBG2_GCTB
    cout << "New traj direction = " << reversedTrajectory.direction() << endl;
    cmsutils::bqueue<TM> tms = reversedTrajectory.measurements();
    for (cmsutils::bqueue<TM>::const_iterator im=tms.rbegin(),end=tms.rend();
         im!=end; --im ) {
      if ( im->recHit()->isValid() )  cout << im->recHit()->globalPosition();
      else cout << "(-,-,-)";
      cout << " ";
      cout << " fwdPred " << im->forwardPredictedState().isValid();
      cout << " bwdPred " << im->backwardPredictedState().isValid();
      cout << " upPred " << im->updatedState().isValid();
      //SimIdPrinter()(im->recHit());
      cout << endl;
    }
#endif
  }
  return nrOfTrajectories;

void GroupedCkfTrajectoryBuilder::rebuildSeedingRegion	(	TempTrajectory &	startingTraj,
		TempTrajectoryContainer &	result
	)			const [private]

try to find additional hits in seeding region

Definition at line 623 of file GroupedCkfTrajectoryBuilder.cc.

References backwardFit(), GenMuonPlsPt100GeV_cfg::cout, lat::endl(), estimator(), it, TempTrajectory::measurements(), rebuildSeedingRegion(), TrajectorySeed::recHits(), TempTrajectory::seed(), BaseCkfTrajectoryBuilder::theBackwardPropagator, and updator().

{
  //
  // Rebuilding of trajectories. Candidates are taken from result,
  // which will be replaced with the solutions after rebuild
  // (assume vector::swap is more efficient than building new container)
  //
#ifdef DBG2_GCTB
  cout << "Starting to rebuild " << result.size() << " tracks" << endl;
#endif
  //
  // Fitter (need to create it here since the propagation direction
  // might change between different starting trajectories)
  //
  KFTrajectoryFitter fitter(*theBackwardPropagator,updator(),estimator());
  //
  TempTrajectoryContainer reFitted;
  TrajectorySeed::range rseedHits = startingTraj.seed().recHits();
  std::vector<const TrackingRecHit*> seedHits;
  //seedHits.insert(seedHits.end(), rseedHits.first, rseedHits.second);
  //for (TrajectorySeed::recHitContainer::const_iterator iter = rseedHits.first; iter != rseedHits.second; iter++){
  //    seedHits.push_back(&*iter);
  //}

  //unsigned int nSeed(seedHits.size());
  unsigned int nSeed(rseedHits.second-rseedHits.first);
  //seedHits.reserve(nSeed);
  TempTrajectoryContainer rebuiltTrajectories;
  for ( TempTrajectoryContainer::iterator it=result.begin();
        it!=result.end(); it++ ) {
    //
    // skip candidates which are not exceeding the seed size
    // (should not happen) - keep existing trajectory
    //
    if ( it->measurements().size()<=startingTraj.measurements().size() ) {
      rebuiltTrajectories.push_back(*it);
      #ifdef DBG2_GCTB
      cout << " candidates not exceeding the seed size; skipping " <<  endl;
      #endif
      continue;
    }
    //
    // Refit - keep existing trajectory in case fit is not possible
    // or fails
    //
    backwardFit(*it,nSeed,fitter,reFitted,seedHits);
    if ( reFitted.size()!=1 ) {
      rebuiltTrajectories.push_back(*it);
      //std::cout << "after reFitted.size() " << reFitted.size() << std::endl;
      continue;
    }
    //std::cout << "after reFitted.size() " << reFitted.size() << std::endl;
    //
    // Rebuild seeding part. In case it fails: keep initial trajectory
    // (better to drop it??)
    //
    int nRebuilt =
      rebuildSeedingRegion (seedHits,reFitted.front(),rebuiltTrajectories);
    if ( nRebuilt==0 )  rebuiltTrajectories.push_back(*it);
  }
  //
  // Replace input trajectories with new ones
  //
  result.swap(rebuiltTrajectories);
}

void GroupedCkfTrajectoryBuilder::rebuildSeedingRegion	(	const TrajectorySeed &	seed,
		TrajectoryContainer &	result
	)			const

trajectories re-building in the seeding region.

It looks for additional measurements in the seeding region of the intial trajectories. Only valid trajectories are returned. Invalid ones are dropped from the input collection.

Definition at line 142 of file GroupedCkfTrajectoryBuilder.cc.

References BaseCkfTrajectoryBuilder::createStartingTrajectory().

Referenced by rebuildSeedingRegion().

                                                                                     {    
  TempTrajectory startingTraj = createStartingTrajectory( seed);
  TempTrajectoryContainer work;

  TrajectoryContainer final;

  work.reserve(result.size());
  for (TrajectoryContainer::iterator traj=result.begin();
       traj!=result.end(); ++traj) {
    if(traj->isValid()) work.push_back(TempTrajectory(*traj));
  }

  rebuildSeedingRegion(startingTraj,work);
  final.reserve(work.size());

  for (TempTrajectoryContainer::iterator traj=work.begin();
       traj!=work.end(); ++traj) {
    final.push_back(traj->toTrajectory());
  }
  
  result.swap(final);
  
}

void GroupedCkfTrajectoryBuilder::setEvent

(

const edm::Event &

event

)

const [virtual]

set Event for the internal MeasurementTracker data member

Implements BaseCkfTrajectoryBuilder.

Definition at line 101 of file GroupedCkfTrajectoryBuilder.cc.

References BaseCkfTrajectoryBuilder::theMeasurementTracker, and MeasurementTracker::update().

{
  theMeasurementTracker->update(event);
}

bool GroupedCkfTrajectoryBuilder::tkxor	(	bool	a,
		bool	b
	)			const [inline, private]

Definition at line 108 of file GroupedCkfTrajectoryBuilder.h.

Referenced by groupedIntermediaryClean().

{return (a||b) && !(a&&b);}

void GroupedCkfTrajectoryBuilder::trajectories	(	const TrajectorySeed &	,
		TrajectoryContainer &	ret,
		const TrackingRegion &
	)			const

trajectories building starting from a seed with a region

GroupedCkfTrajectoryBuilder::TrajectoryContainer GroupedCkfTrajectoryBuilder::trajectories	(	const TrajectorySeed &	seed,
		const TrackingRegion &	region
	)			const

trajectories building starting from a seed with a region

Definition at line 116 of file GroupedCkfTrajectoryBuilder.cc.

References buildTrajectories().

{
  TrajectoryContainer ret; 
  ret.reserve(10);
  RegionalTrajectoryFilter regionalCondition(region);
  buildTrajectories(seed, ret, &regionalCondition);
  return ret; 
}

void GroupedCkfTrajectoryBuilder::trajectories	(	const TrajectorySeed &	,
		TrajectoryContainer &	ret
	)			const

trajectories building starting from a seed, return in an already allocated vector

GroupedCkfTrajectoryBuilder::TrajectoryContainer GroupedCkfTrajectoryBuilder::trajectories

(

const TrajectorySeed &

seed

)

const [virtual]

trajectories building starting from a seed

Implements BaseCkfTrajectoryBuilder.

Definition at line 107 of file GroupedCkfTrajectoryBuilder.cc.

References buildTrajectories().

{
  TrajectoryContainer ret; 
  ret.reserve(10);
  buildTrajectories(seed, ret, 0);
  return ret; 
}

const TrajectoryStateUpdator& GroupedCkfTrajectoryBuilder::updator

(

)

const [inline]

Definition at line 64 of file GroupedCkfTrajectoryBuilder.h.

References BaseCkfTrajectoryBuilder::theUpdator.

Referenced by rebuildSeedingRegion().

{return *theUpdator;}

bool GroupedCkfTrajectoryBuilder::verifyHits	(	TempTrajectory::DataContainer::const_iterator	rbegin,
		size_t	maxDepth,
		const std::vector< const TrackingRecHit * > &	hits
	)			const [private]

Verifies presence of a RecHits in a range of TrajectoryMeasurements.

Definition at line 961 of file GroupedCkfTrajectoryBuilder.cc.

References GenMuonPlsPt100GeV_cfg::cout, lat::endl(), and TrackingRecHit::some.

Referenced by rebuildSeedingRegion().

{
  //
  // verify presence of the seeding hits
  //
#ifdef DBG2_GCTB
  cout << "Checking for " << hits.size() << " hits in "
       << maxDepth << " measurements" << endl;
#endif
  TempTrajectory::DataContainer::const_iterator rend = rbegin; 
  while (maxDepth > 0) { --maxDepth; --rend; }
  for ( vector<const TrackingRecHit*>::const_iterator ir=hits.begin();
        ir!=hits.end(); ir++ ) {
    // assume that all seeding hits are valid!
    bool foundHit(false);
    for ( TempTrajectory::DataContainer::const_iterator im=rbegin; im!=rend; --im ) {
      if ( im->recHit()->isValid() && (*ir)->sharesInput(im->recHit()->hit(), TrackingRecHit::some) ) {
        foundHit = true;
        break;
      }
    }
    if ( !foundHit )  return false;
  }
  return true;

---

Member Data Documentation

bool GroupedCkfTrajectoryBuilder::theAlwaysUseInvalid [private]

Definition at line 181 of file GroupedCkfTrajectoryBuilder.h.

Referenced by advanceOneLayer(), and GroupedCkfTrajectoryBuilder().

bool GroupedCkfTrajectoryBuilder::theBestHitOnly [private]

Use only best hit / group when building segments.

Definition at line 184 of file GroupedCkfTrajectoryBuilder.h.

Referenced by advanceOneLayer(), and GroupedCkfTrajectoryBuilder().

double GroupedCkfTrajectoryBuilder::theChiSquareCut [private]

Chi**2 Cut on the new Trajectory Measurements to consider.

Definition at line 167 of file GroupedCkfTrajectoryBuilder.h.

Referenced by chiSquareCut().

TrajectoryFilter* GroupedCkfTrajectoryBuilder::theConfigurableCondition [private]

Definition at line 162 of file GroupedCkfTrajectoryBuilder.h.

float GroupedCkfTrajectoryBuilder::theFoundHitBonus [private]

Chi**2 bonus for each found hit (favours candidates with more measurements).

Definition at line 176 of file GroupedCkfTrajectoryBuilder.h.

Referenced by GroupedCkfTrajectoryBuilder(), and groupedLimitedCandidates().

bool GroupedCkfTrajectoryBuilder::theIntermediateCleaning [private]

Tells whether an intermediary cleaning stage should take place during TB.

Definition at line 178 of file GroupedCkfTrajectoryBuilder.h.

Referenced by GroupedCkfTrajectoryBuilder(), and groupedLimitedCandidates().

bool GroupedCkfTrajectoryBuilder::theLockHits [private]

Lock hits when building segments in a layer.

Definition at line 183 of file GroupedCkfTrajectoryBuilder.h.

Referenced by advanceOneLayer(), and GroupedCkfTrajectoryBuilder().

float GroupedCkfTrajectoryBuilder::theLostHitPenalty [private]

Chi**2 Penalty for each lost hit.

Definition at line 175 of file GroupedCkfTrajectoryBuilder.h.

Referenced by GroupedCkfTrajectoryBuilder(), groupedLimitedCandidates(), and lostHitPenalty().

double GroupedCkfTrajectoryBuilder::theMass [private]

Mass hypothesis used for propagation.

Definition at line 171 of file GroupedCkfTrajectoryBuilder.h.

Referenced by mass().

int GroupedCkfTrajectoryBuilder::theMaxCand [private]

Maximum number of trajectory candidates to propagate to the next layer.

Definition at line 173 of file GroupedCkfTrajectoryBuilder.h.

Referenced by GroupedCkfTrajectoryBuilder(), groupedLimitedCandidates(), and maxCand().

unsigned int GroupedCkfTrajectoryBuilder::theMinNrOf2dHitsForRebuild [private]

Minimum nr.

of non-seed 2D hits required for rebuild.

Definition at line 192 of file GroupedCkfTrajectoryBuilder.h.

Referenced by GroupedCkfTrajectoryBuilder().

unsigned int GroupedCkfTrajectoryBuilder::theMinNrOfHitsForRebuild [private]

Minimum nr.

of non-seed hits required for rebuild. If ==0 the seeding part will remain untouched.

Definition at line 189 of file GroupedCkfTrajectoryBuilder.h.

Referenced by backwardFit(), and GroupedCkfTrajectoryBuilder().

double GroupedCkfTrajectoryBuilder::theptCut [private]

ptCut

Definition at line 169 of file GroupedCkfTrajectoryBuilder.h.

Referenced by ptCut().

bool GroupedCkfTrajectoryBuilder::theRequireSeedHitsInRebuild [private]

Only accept rebuilt trajectories if they contain the seed hits.

Definition at line 187 of file GroupedCkfTrajectoryBuilder.h.

Referenced by GroupedCkfTrajectoryBuilder(), and rebuildSeedingRegion().

TempTrajectoryContainer GroupedCkfTrajectoryBuilder::work_ [mutable, private]

Definition at line 195 of file GroupedCkfTrajectoryBuilder.h.

---

The documentation for this class was generated from the following files:

• RecoTracker/CkfPattern/interface/GroupedCkfTrajectoryBuilder.h
• RecoTracker/CkfPattern/src/GroupedCkfTrajectoryBuilder.cc

---