/afs/cern.ch/work/a/aaltunda/public/www/CMSSW_5_3_14/src/TrackingTools/DetLayers/interface/GeneralBinFinderInZforGeometricSearchDet.h

Go to the documentation of this file.

#ifndef GeneralBinFinderInZ_H
#define GeneralBinFinderInZ_H

#include "Utilities/BinningTools/interface/BaseBinFinder.h"
#include "TrackingTools/DetLayers/interface/GeometricSearchDet.h"
#include <cmath>

template <class T>
class GeneralBinFinderInZforGeometricSearchDet : public BaseBinFinder<T> {
public:

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

  GeneralBinFinderInZforGeometricSearchDet(
                      std::vector<const GeometricSearchDet*>::const_iterator first,
                      std::vector<const GeometricSearchDet*>::const_iterator last) :
    theNbins( last-first)
  {
    theBins.reserve(theNbins);
    for (std::vector<const GeometricSearchDet*>::const_iterator i=first; i<last-1; i++) {
      theBins.push_back((**i).position().z());
      theBorders.push_back(((**i).position().z() + 
                            (**(i+1)).position().z()) / 2.);
    }

    theZOffset = theBorders.front(); 
    theZStep = (theBorders.back() - theBorders.front()) / (theNbins-2);
  }

  virtual int binIndex( T z) const {
    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;
  }

  virtual int binIndex( int i) const {
    return std::min( std::max( i, 0), theNbins-1);
  }
   
  virtual T binPosition( int ind) const {
    return theBins[binIndex(ind)];
  }

  static double pi() { return 3.141592653589793238;}
  static double twoPi() { return 2.*pi();}

private:

  int theNbins;
  T theZStep;
  T theZOffset;
  std::vector<float> theBorders;
  std::vector<T> theBins;
};
#endif