IndexGar.h

Go to the documentation of this file.

#ifndef INDEXGAR_H
#define INDEXGAR_H
//#include <vector>
#include <map>
#include <vector>
struct IndexGar{
    int stripX;
    int stripV;
    char gridX, gridV; //    range 0-24. note that its mark is opposite from strip.
    char sheet;
    //                      grid_v = floor(distX/L_XPitch*5.+2.5);
    //                      grid_x = floor(distV/L_VPitch*5.+2.5);
    //int layer; we dont quite work on layer; but sheet
    bool operator<(const IndexGar &index) const{
        //if (this->stripX < index.stripX) return true;
        //else if (this->stripX > index.stripX) return false;
        //else if (...)
        
        return  (this->stripX < index.stripX)  || 
                (this->stripX == index.stripX &&  this->stripV < index.stripV)||
                (this->stripX == index.stripX && this->stripV == index.stripV && this->gridX <  index.gridX)||
                (this->stripX == index.stripX && this->stripV == index.stripV && this->gridX == index.gridX && this->gridV <  index.gridV)||
                (this->stripX == index.stripX && this->stripV == index.stripV && this->gridX == index.gridX && this->gridV == index.gridV && this->sheet  < index.sheet );
        
        //return  (this->stripX < index.stripX)  || (this->stripX == index.stripX && 
        //            (this->stripV < index.stripV)  || (this->stripV == index.stripV &&
        //                ...
        //            )
        //        )
        //have to admit this expression sucks
 
 
        //// just compares from up to down.
        //return  this->stripX < index.stripX ? true : this->stripX != index.stripX ? false :
        //        this->stripV < index.stripV ? true : this->stripV != index.stripV ? false : 
        //        this->gridX  < index.gridX  ? true : this->gridX  != index.gridX  ? false : 
        //        this->gridV  < index.gridV  ? true : this->gridV  != index.gridV  ? false :
        //        this->sheet  < index.sheet  ? true : false;
    } // hope this gets optimized well..
};
typedef std::map<IndexGar, std::vector<int> > HitHistMap;// vector length 2001, last 1 is overflow and underflow.
 
#endif