#include <TIBRing.h>

Inheritance diagram for TIBRing:

Classes
struct	SubRingCrossings

Public Member Functions
virtual const std::vector < const GeomDet * > &	basicComponents () const

virtual std::pair< bool, TrajectoryStateOnSurface >	compatible (const TrajectoryStateOnSurface &ts, const Propagator &, const MeasurementEstimator &) const __attribute__((cold))

virtual const std::vector < const GeometricSearchDet * > &	components () const __attribute__((cold))
	Returns basic components, if any. More...

virtual void	groupedCompatibleDetsV (const TrajectoryStateOnSurface &startingState, const Propagator &prop, const MeasurementEstimator &est, std::vector< DetGroup > &result) const __attribute__((hot))

virtual const BoundCylinder &	specificSurface () const
	Return the ring surface as a. More...

virtual const BoundSurface &	surface () const
	The surface of the GeometricSearchDet. More...

	TIBRing (std::vector< const GeomDet * > &theGeomDets) __attribute__((cold))

	~TIBRing () __attribute__((cold))

Public Member Functions inherited from GeometricSearchDet
virtual std::vector< DetWithState >	compatibleDets (const TrajectoryStateOnSurface &startingState, const Propagator &prop, const MeasurementEstimator &est) const

virtual void	compatibleDetsV (const TrajectoryStateOnSurface &startingState, const Propagator &prop, const MeasurementEstimator &est, std::vector< DetWithState > &result) const

	GeometricSearchDet (bool doHaveGroups)

virtual std::vector< DetGroup >	groupedCompatibleDets (const TrajectoryStateOnSurface &startingState, const Propagator &prop, const MeasurementEstimator &est) const

bool	hasGroups () const

virtual const Surface::PositionType &	position () const
	Returns position of the surface. More...

virtual	~GeometricSearchDet ()

Private Types
typedef PeriodicBinFinderInPhi < float >	BinFinderType

Private Member Functions
void	checkPeriodicity (std::vector< const GeomDet * >::const_iterator first, std::vector< const GeomDet * >::const_iterator last) __attribute__((cold))

void	checkRadius (std::vector< const GeomDet * >::const_iterator first, std::vector< const GeomDet * >::const_iterator last) __attribute__((cold))

SubRingCrossings	computeCrossings (const TrajectoryStateOnSurface &startingState, PropagationDirection propDir) const __attribute__((hot))

void	computeHelicity () __attribute__((cold))

float	computeWindowSize (const GeomDet *det, const TrajectoryStateOnSurface &tsos, const MeasurementEstimator &est) const __attribute__((hot))

void	searchNeighbors (const TrajectoryStateOnSurface &tsos, const Propagator &prop, const MeasurementEstimator &est, const SubRingCrossings &crossings, float window, std::vector< DetGroup > &result) const __attribute__((hot))

Private Attributes
BinFinderType	theBinFinder

ReferenceCountingPointer < BoundCylinder >	theCylinder

std::vector< const GeomDet * >	theDets

int	theHelicity

Additional Inherited Members
Public Types inherited from GeometricSearchDet
typedef std::pair< const GeomDet *, TrajectoryStateOnSurface >	DetWithState

typedef BoundSurface::PositionType	PositionType

typedef BoundSurface::RotationType	RotationType

typedef TrajectoryStateOnSurface	TrajectoryState

Protected Attributes inherited from GeometricSearchDet
bool	haveGroups

GeomDetCompatibilityChecker	theCompatibilityChecker

Detailed Description

A concrete implementation for TIB rings

Definition at line 13 of file TIBRing.h.

Member Typedef Documentation

typedef PeriodicBinFinderInPhi<float> TIBRing::BinFinderType

private

Definition at line 86 of file TIBRing.h.

Constructor & Destructor Documentation

TIBRing::TIBRing ( std::vector< const GeomDet * > & theGeomDets )

Definition at line 21 of file TIBRing.cc.

References computeHelicity(), i, LogDebug, theBinFinder, theCylinder, and theDets.

                                                    :
   GeometricSearchDet(true),
   theDets(theGeomDets.begin(),theGeomDets.end())
 {
   //checkRadius( first, last);
   //sort( theDets.begin(), theDets.end(), DetLessPhi());
   //checkPeriodicity( theDets.begin(), theDets.end());
 
   theBinFinder = BinFinderType( theDets.front()->surface().position().phi(),
                 theDets.size());
 
   theCylinder = CylinderBuilderFromDet()( theDets.begin(), theDets.end());
 
   computeHelicity();
 
   
   LogDebug("TkDetLayers") << "==== DEBUG TIBRing =====" ; 
   LogDebug("TkDetLayers") << "radius, thickness, lenght: " 
               << theCylinder->radius() << " , "
               << theCylinder->bounds().thickness() << " , "
               << theCylinder->bounds().length() ;
 
   for (vector<const GeomDet*>::const_iterator i=theDets.begin();
        i != theDets.end(); i++){
     LogDebug("TkDetLayers") << "Ring's Det pos z,perp,eta,phi: " 
      << (**i).position().z() << " , " 
      << (**i).position().perp() << " , " 
      << (**i).position().eta() << " , " 
      << (**i).position().phi() ;
   }
   LogDebug("TkDetLayers") << "==== end DEBUG TIBRing =====" ; 
  
   
 }

TIBRing::~TIBRing ( )

Definition at line 119 of file TIBRing.cc.

                  {
 
 } 

Member Function Documentation

virtual const std::vector<const GeomDet*>& TIBRing::basicComponents ( ) const

inlinevirtual

Implements GeometricSearchDet.

Definition at line 21 of file TIBRing.h.

References theDets.

21 {return theDets;}

TIBRing::theDets

std::vector< const GeomDet * > theDets

Definition: TIBRing.h:89

void TIBRing::checkPeriodicity	(	std::vector< const GeomDet * >::const_iterator	first,
		std::vector< const GeomDet * >::const_iterator	last
	)

private

Definition at line 79 of file TIBRing.cc.

References funct::abs(), plotBeamSpotDB::first, i, j, Geom::pi(), stat_mean(), relval_parameters_module::step, and theDets.

 {
   vector<double> adj_diff(last-first-1);
   for (int i=0; i < static_cast<int>(adj_diff.size()); i++) {
     vector<const GeomDet*>::const_iterator curent = first + i;
     adj_diff[i] = (**(curent+1)).surface().position().phi() - 
                   (**curent).surface().position().phi();
   }
   double step = stat_mean( adj_diff);
   double phi_step = 2.*Geom::pi()/(last-first);  
 
   if ( std::abs(step-phi_step)/phi_step > 0.01) {
     int ndets = last-first;
     edm::LogError("TkDetLayers") << "TIBRing Warning: not periodic. ndets=" << ndets ;
     for (int j=0; j<ndets; j++) {
       edm::LogError("TkDetLayers") << "Dets(r,phi): (" << theDets[j]->surface().position().perp() 
                  << "," << theDets[j]->surface().position().phi() << ") " ;
     }
     throw DetLayerException( "Error: TIBRing is not periodic");
   }
 }

void TIBRing::checkRadius	(	std::vector< const GeomDet * >::const_iterator	first,
		std::vector< const GeomDet * >::const_iterator	last
	)

private

Definition at line 63 of file TIBRing.cc.

References i, plotBeamSpotDB::last, and alignCSCRings::r.

 {
   // check radius range
   float rMin = 10000.;
   float rMax = 0.;
   for (vector<const GeomDet*>::const_iterator i=first; i!=last; i++) {
     float r = (**i).surface().position().perp();
     if (r < rMin) rMin = r;
     if (r > rMax) rMax = r;
   }
   if (rMax - rMin > 0.1) throw DetLayerException(
     "TIBRing construction failed: detectors not at constant radius");
 }

pair< bool, TrajectoryStateOnSurface > TIBRing::compatible	(	const TrajectoryStateOnSurface &	ts,
		const Propagator &	,
		const MeasurementEstimator &
	)		const

virtual

tests the geometrical compatibility of the Det with the predicted state. The FreeTrajectoryState argument is propagated to the Det surface using the Propagator argument. The resulting TrajectoryStateOnSurface is tested for compatibility with the surface bounds. If compatible, a std::pair< true, propagatedState> is returned. If the propagation fails, or if the state is not compatible, a std::pair< false, propagatedState> is returned.

Implements GeometricSearchDet.

Definition at line 125 of file TIBRing.cc.

                                             {
   edm::LogError("TkDetLayers") << "temporary dummy implementation of TIBRing::compatible()!!" ;
   return pair<bool,TrajectoryStateOnSurface>();
 }

const vector< const GeometricSearchDet * > & TIBRing::components ( ) const

virtual

Returns basic components, if any.

Returns direct components, if any

Implements GeometricSearchDet.

Definition at line 58 of file TIBRing.cc.

 {
   throw DetLayerException("TIBRing doesn't have GeometricSearchDet components");
 }

TIBRing::SubRingCrossings TIBRing::computeCrossings	(	const TrajectoryStateOnSurface &	startingState,
		PropagationDirection	propDir
	)		const

private

Definition at line 227 of file TIBRing.cc.

References funct::abs(), PV3DBase< T, PVType, FrameType >::barePhi(), HelixBarrelCylinderCrossing::bestSol, PeriodicBinFinderInPhi< T >::binIndex(), HelixBarrelCylinderCrossing::direction(), TrajectoryStateOnSurface::globalMomentum(), TrajectoryStateOnSurface::globalPosition(), HelixBarrelCylinderCrossing::hasSolution(), GloballyPositioned< T >::position(), HelixBarrelCylinderCrossing::position(), rho, specificSurface(), surface(), theBinFinder, theDets, TrajectoryStateOnSurface::transverseCurvature(), and PV3DBase< T, PVType, FrameType >::x().

Referenced by groupedCompatibleDetsV().

 {
   typedef HelixBarrelPlaneCrossing2OrderLocal    Crossing;
   typedef MeasurementEstimator::Local2DVector Local2DVector;
 
   GlobalPoint startPos( startingState.globalPosition());
   GlobalVector startDir( startingState.globalMomentum());
   auto rho = startingState.transverseCurvature();
 
   HelixBarrelCylinderCrossing cylCrossing( startPos, startDir, rho,
                        propDir,specificSurface(),
                          HelixBarrelCylinderCrossing::bestSol);
 
   if (!cylCrossing.hasSolution()) return SubRingCrossings();
 
   GlobalPoint  cylPoint( cylCrossing.position());
   GlobalVector cylDir( cylCrossing.direction());
   int closestIndex = theBinFinder.binIndex(cylPoint.barePhi());
 
   const Plane& closestPlane( theDets[closestIndex]->surface());
 
   LocalPoint closestPos = Crossing::positionOnly( cylPoint, cylDir, rho, closestPlane);
   float closestDist = closestPos.x(); // use fact that local X perp to global Z 
 
   //int next = cylPoint.phi() - closestPlane.position().phi() > 0 ? closest+1 : closest-1;
   int nextIndex = PhiLess()( closestPlane.position().barePhi(), cylPoint.barePhi()) ? 
     closestIndex+1 : closestIndex-1;
 
   const Plane& nextPlane( theDets[ theBinFinder.binIndex(nextIndex)]->surface());
   LocalPoint nextPos = Crossing::positionOnly( cylPoint, cylDir, rho, nextPlane);
   float nextDist = nextPos.x();
 
   if (std::abs(closestDist) < std::abs(nextDist)) {
     return SubRingCrossings( closestIndex, nextIndex, nextDist);
   }
   else {
     return SubRingCrossings( nextIndex, closestIndex, closestDist);
   }
 }

void TIBRing::computeHelicity ( )

private

Definition at line 102 of file TIBRing.cc.

References Vector3DBase< T, FrameTag >::dot(), PV3DBase< T, PVType, FrameType >::phi(), GloballyPositioned< T >::position(), GeomDet::surface(), theDets, theHelicity, and Surface::toGlobal().

Referenced by TIBRing().

                               {
 
   const GeomDet& det = *theDets.front();
   GlobalVector radial = det.surface().position() - GlobalPoint(0,0,0);
   GlobalVector normal = det.surface().toGlobal( LocalVector(0,0,1));
   if(normal.dot(radial)<=0)normal*=-1;
 //   edm::LogInfo(TkDetLayers) << "BarrelDetRing::computeHelicity: phi(normal) " << normal.phi()
 //        << " phi(radial) " << radial.phi() ;
   if (PhiLess()( normal.phi(), radial.phi())) {
     theHelicity = 1;  // smaller phi angles mean "inner" group
   }
   else {
     theHelicity = 0;  // smaller phi angles mean "outer" group
   }
 }

float TIBRing::computeWindowSize	(	const GeomDet *	det,
		const TrajectoryStateOnSurface &	tsos,
		const MeasurementEstimator &	est
	)		const

private

Definition at line 268 of file TIBRing.cc.

References MeasurementEstimator::maximalLocalDisplacement(), GeomDet::surface(), and x.

Referenced by groupedCompatibleDetsV().

 {
   return est.maximalLocalDisplacement(tsos, det->surface()).x();
 }

void TIBRing::groupedCompatibleDetsV	(	const TrajectoryStateOnSurface &	startingState,
		const Propagator &	prop,
		const MeasurementEstimator &	est,
		std::vector< DetGroup > &	result
	)		const

virtual

Reimplemented from GeometricSearchDet.

Definition at line 133 of file TIBRing.cc.

References Clusterizer1DCommons::add(), LayerCrossingSide::barrelSide(), PeriodicBinFinderInPhi< T >::binIndex(), TIBRing::SubRingCrossings::closestIndex, computeCrossings(), computeWindowSize(), f, TIBRing::SubRingCrossings::isValid_, eostools::move(), TIBRing::SubRingCrossings::nextDistance, TIBRing::SubRingCrossings::nextIndex, DetGroupMerger::orderAndMergeTwoLevels(), Propagator::propagationDirection(), mps_fire::result, searchNeighbors(), theBinFinder, theDets, theHelicity, and svgfig::window().

 {
   vector<DetGroup> closestResult;
   SubRingCrossings  crossings; 
   crossings = computeCrossings( tsos, prop.propagationDirection());
   if(! crossings.isValid_) return;
 
   typedef CompatibleDetToGroupAdder Adder;
   Adder::add( *theDets[theBinFinder.binIndex(crossings.closestIndex)], 
          tsos, prop, est, closestResult);
   
   if(closestResult.empty()){
     Adder::add( *theDets[theBinFinder.binIndex(crossings.nextIndex)], 
            tsos, prop, est, result);
     return;
   }      
 
   DetGroupElement closestGel( closestResult.front().front());
   float window = computeWindowSize( closestGel.det(), closestGel.trajectoryState(), est);
 
   float detWidth = closestGel.det()->surface().bounds().width();
   if (crossings.nextDistance < detWidth + window) {
     vector<DetGroup> nextResult;
     if (Adder::add( *theDets[theBinFinder.binIndex(crossings.nextIndex)], 
             tsos, prop, est, nextResult)) {
       int crossingSide = LayerCrossingSide::barrelSide( tsos, prop);
       if (crossings.closestIndex < crossings.nextIndex) {
     DetGroupMerger::orderAndMergeTwoLevels( std::move(closestResult), std::move(nextResult),
                         result,
                         theHelicity, crossingSide);
       }
       else {
     DetGroupMerger::orderAndMergeTwoLevels( std::move(nextResult), std::move(closestResult),
                         result,
                         theHelicity, crossingSide);
       }
     }
     else {
       result.swap(closestResult);
     } 
   }else{
     result.swap(closestResult);
   }
   
   // only loop over neighbors (other than closest and next) if window is BIG
   if (window > 0.5f*detWidth) {
     searchNeighbors( tsos, prop, est, crossings, window, result);
   } 
 }

void TIBRing::searchNeighbors	(	const TrajectoryStateOnSurface &	tsos,
		const Propagator &	prop,
		const MeasurementEstimator &	est,
		const SubRingCrossings &	crossings,
		float	window,
		std::vector< DetGroup > &	result
	)		const

private

Definition at line 186 of file TIBRing.cc.

References Clusterizer1DCommons::add(), LayerCrossingSide::barrelSide(), PeriodicBinFinderInPhi< T >::binIndex(), TIBRing::SubRingCrossings::closestIndex, bookConverter::max, HLT_25ns10e33_v2_cff::Merger, min(), eostools::move(), neighbor(), TIBRing::SubRingCrossings::nextIndex, theBinFinder, theDets, and theHelicity.

Referenced by groupedCompatibleDetsV().

 {
   typedef CompatibleDetToGroupAdder Adder;
   int crossingSide = LayerCrossingSide::barrelSide( tsos, prop);
   typedef DetGroupMerger Merger;
   
   int negStart = std::min( crossings.closestIndex, crossings.nextIndex) - 1;
   int posStart = std::max( crossings.closestIndex, crossings.nextIndex) + 1;
   
   int quarter = theDets.size()/4;
   for (int idet=negStart; idet >= negStart - quarter+1; idet--) {
     const GeomDet* neighbor = theDets[theBinFinder.binIndex(idet)];
     // if (!overlap( gCrossingPos, *neighbor, window)) break; // mybe not needed?
     // maybe also add shallow crossing angle test here???
     vector<DetGroup> tmp1;
     if (!Adder::add( *neighbor, tsos, prop, est, tmp1)) break;
     vector<DetGroup> tmp2; tmp2.swap(result);
     vector<DetGroup> newResult;
     Merger::orderAndMergeTwoLevels(std::move(tmp1), std::move(tmp2), newResult, theHelicity, crossingSide);
     result.swap(newResult);
   }
   for (int idet=posStart; idet < posStart + quarter-1; idet++) {
     const GeomDet* neighbor = theDets[theBinFinder.binIndex(idet)];
     // if (!overlap( gCrossingPos, *neighbor, window)) break; // mybe not needed?
     // maybe also add shallow crossing angle test here???
     vector<DetGroup> tmp1;
     if (!Adder::add( *neighbor, tsos, prop, est, tmp1)) break;
     vector<DetGroup> tmp2; tmp2.swap(result);
     vector<DetGroup> newResult;
     Merger::orderAndMergeTwoLevels(std::move(tmp2), std::move(tmp1), newResult, theHelicity, crossingSide);
     result.swap(newResult);
   }
 }