#include <GenericBinFinderInZ.h>

Inheritance diagram for GenericBinFinderInZ< T, G >:

Public Types
typedef std::vector< const G * >::const_iterator	ConstItr

Public Member Functions
int	binIndex (int i) const override
	returns an index in the valid range More...

int	binIndex (T z) const override
	returns an index in the valid range for the bin closest to Z More...

T	binPosition (int ind) const override
	the middle of the bin. More...

	GenericBinFinderInZ ()

	GenericBinFinderInZ (ConstItr first, ConstItr last)

Public Member Functions inherited from BaseBinFinder< T >
	BaseBinFinder ()

virtual	~BaseBinFinder ()

Static Public Member Functions
static double	pi ()

static double	twoPi ()

Private Attributes
std::vector< T >	theBins

std::vector< float >	theBorders

int	theNbins

T	theZOffset

T	theZStep

Detailed Description

template<class T, class G>
class GenericBinFinderInZ< T, G >

A Z bin finder for a non-periodic group of detectors. The template argument G should be something with a surface() method, such as a GeomDet or a GeometricSearchDet

Definition at line 16 of file GenericBinFinderInZ.h.

Member Typedef Documentation

◆ ConstItr

template<class T, class G>

typedef std::vector<const G*>::const_iterator GenericBinFinderInZ< T, G >::ConstItr

Definition at line 18 of file GenericBinFinderInZ.h.

Constructor & Destructor Documentation

◆ GenericBinFinderInZ() [1/2]

template<class T, class G>

GenericBinFinderInZ< T, G >::GenericBinFinderInZ ( )

inline

Definition at line 19 of file GenericBinFinderInZ.h.

19 : theNbins(0), theZStep(0), theZOffset(0) {}

◆ GenericBinFinderInZ() [2/2]

template<class T, class G>

GenericBinFinderInZ< T, G >::GenericBinFinderInZ	(	ConstItr	first,
		ConstItr	last
	)

inline

Definition at line 21 of file GenericBinFinderInZ.h.

                                                      : theNbins(last - first) {
     theBins.reserve(theNbins);
     theBorders.reserve(theNbins - 1);
     for (ConstItr i = first; i < last - 1; i++) {
       theBins.push_back((**i).position().z());
       theBorders.push_back(((**i).position().z() + (**(i + 1)).position().z()) / 2.);
     }
     theBins.push_back((**(last - 1)).position().z());
  
     theZOffset = theBorders.front();
     theZStep = (theBorders.back() - theBorders.front()) / (theNbins - 2);
   }

Member Function Documentation

◆ binIndex() [1/2]

template<class T, class G>

int GenericBinFinderInZ< T, G >::binIndex ( int i ) const

inlineoverridevirtual

returns an index in the valid range

Implements BaseBinFinder< T >.

Definition at line 71 of file GenericBinFinderInZ.h.

71 { return std::min(std::max(i, 0), theNbins - 1); }

◆ binIndex() [2/2]

template<class T, class G>

int GenericBinFinderInZ< T, G >::binIndex ( T z ) const

inlineoverridevirtual

returns an index in the valid range for the bin closest to Z

Implements BaseBinFinder< T >.

Definition at line 35 of file GenericBinFinderInZ.h.

                                    {
     int bin = binIndex(int((z - theZOffset) / theZStep) + 1);
  
     // check left border
     if (bin > 0) {
       if (z < theBorders[bin - 1]) {
         // z is to the left of the left border, the correct bin is left
         for (int i = bin - 1;; i--) {
           if (i <= 0)
             return 0;
           if (z > theBorders[i - 1])
             return i;
         }
       }
     } else
       return 0;
  
     // check right border
     if (bin < theNbins - 1) {
       if (z > theBorders[bin]) {
         // z is to the right of the right border, the correct bin is right
         for (int i = bin + 1;; i++) {
           if (i >= theNbins - 1)
             return theNbins - 1;
           if (z < theBorders[i])
             return i;
         }
       }
     } else
       return theNbins - 1;
  
     // if we arrive here it means that the bin is ok
     return bin;
   }