MdcDigiGroup.h

Go to the documentation of this file.

#ifndef MDC_DIGI_H
#define MDC_DIGI_H
 
/*
 * 2022--05-19 Wang Liangliang
   The original class is defined in
   Mdc/MdcCheckUtil/MdcUtilitySvc/MdcUtilitySvc-00-00-10/MdcUtilitySvc/MdcHitGroup.h
   which was developped by Zhou Hang.
   This modifcation intends to add more flexibility for DotsConnection.
 */
 
 
//#include <CLHEP/Geometry/Point3D.h>
//#include <iostream>
//#include <vector>
#include "MdcRawEvent/MdcDigi.h"
#include "MdcGeomSvc/MdcGeomSvc.h"
 
using namespace std;
using namespace CLHEP;
 
class MdcDigiGroup {
 
    public:
        static const int nGap=3;
 
        // Constructor.
        MdcDigiGroup()
        {
            useflag=0;
            m_totalNearbyHits=0;
            m_onNode=0;
            m_inBigSet=0;
            for(int i=0; i<nGap; i++) {
                fPrevID[i]=-1;
                fNextID[i]=-1;
                fInnerID[i].clear();
                fOuterID[i].clear();
            }
            fAllNeiborID.clear();
            fHitsOfWire.clear();
            m_idxTrkCandiVec.clear();
            fired=false;
            fWire=NULL;
        };
 
        // reset 
        void Reset()
        {
            useflag=0;
            m_totalNearbyHits=0;
            m_onNode=0;
            m_inBigSet=0;
            for(int i=0; i<nGap; i++) {
                fPrevID[i]=-1;
                fNextID[i]=-1;
                fInnerID[i].clear();
                fOuterID[i].clear();
            }
            fAllNeiborID.clear();
            fHitsOfWire.clear();
            m_idxTrkCandiVec.clear();
            fired=false;
        }
 
        // Destructor
        ~MdcDigiGroup(){};
 
    public: // Extractors
        const MdcGeoWire* GetWire(){return fWire;}
        vector<const MdcDigi*> GetHit() {return  fHitsOfWire;}
        bool HasHit(){
            if(fHitsOfWire.size()==0) {return false;}
            else {return  true;}
        }
        bool Used(){
            if(fHitsOfWire.size()==0||useflag==1) {return true;}
            else {return false;}
        }
        int getUseFlag() {return useflag;}
        int GetPrev(int i=0) {
            if(i<nGap) return fPrevID[i];
            else return -99;
        }
        int GetNext(int i=0) {
            if(i<nGap) return fNextID[i];
            else return -99;
        }
        vector<int> GetInner(int i=0) {
            if(i<nGap) return fInnerID[i];
            else {
                vector<int> a;
                return a;
            }
        }
        vector<int> GetOuter(int i=0) {
            if(i<nGap) return fOuterID[i];
            else {
                vector<int> a;
                return a;
            }
        }
        vector<int> GetOuterTot(int i=0) {
            vector<int> a;
            if(i<nGap) for(int j=0; j<=i; j++) a.insert( a.end(), fOuterID[j].begin(), fOuterID[j].end() ); 
            return a;
        }
        vector<int> GetNextAndOuterTot(int i=0) {
            vector<int> a=GetOuterTot(i);
            if(i<nGap) for(int j=0; j<=i; j++) a.push_back( fNextID[j] );   
            return a;
        }
        vector<int> GetNeiborHits(){return fAllNeiborID;}
        vector<int> GetNeiborHits(int i){
            vector<int> a = fAllNeiborID;
            if(i>0&&i<nGap) {
                for(int j=1; j<=i; j++) {
                    a.insert( a.end(), fOuterID[j].begin(), fOuterID[j].end() );
                    a.insert( a.end(), fInnerID[j].begin(), fInnerID[j].end() );
                }
            }
            return a;
        }
        int GetNoNeiborHits() {
            return fInnerID[0].size()+fOuterID[0].size()+(fPrevID[0]<0?0:1)+(fNextID[0]<0?0:1);
        }
        int GetNTypesNeighborHits()
        {
            return (fInnerID[0].size()>0?1:0)+(fOuterID[0].size()>0?1:0)+(fPrevID[0]<0?0:1)+(fNextID[0]<0?0:1);
        }
 
        int GetNhitsNearby() { return m_totalNearbyHits; }
        int isOnNode() { return m_onNode;}
        int isInBigSet() {return m_inBigSet;}
 
        // --- useful functions
        bool IsOuterEnd()
        {
            return fOuterID[0].size()==0&&fInnerID[0].size()>0; 
        }
        bool isGoodSeed()
        {
            if(IsOuterEnd()) return true;
            //if(GetNTypesNeighborHits()<3) return true;
            if(GetNTypesNeighborHits()==0) return true;
            return false;
        }
        bool isEnd()
        {
            int nTypeNb = GetNTypesNeighborHits();
            if(nTypeNb==1) return true;
            else return false;
        }
        bool isRadialBridge()
        {
            bool flag=false;
            int nTypeNb = GetNTypesNeighborHits();
            if(nTypeNb==2) if(fInnerID[0].size()>0&&fOuterID[0].size()>0) flag=true;
            return flag;
        }
        bool isCircuBridge()
        {
            bool flag=false;
            int nTypeNb = GetNTypesNeighborHits();
            if(nTypeNb==2) if(fPrevID[0]>=0&&fNextID[0]>=0) flag=true;
            return flag;
        }
        bool isCircuEnd()
        {
            bool flag=false;
            int nTypeNb = GetNTypesNeighborHits();
            if(nTypeNb==1&&fInnerID[0].size()==0&&fOuterID[0].size()==0) flag=true;
            return flag;
        }
    public: // Modifiers
        void SetWire(const MdcGeoWire* aWire){fWire=aWire;}
        void AddHit(const MdcDigi* aHit) {fHitsOfWire.push_back(aHit);}
        void AddPrev(int wireID, int gap=0) {
            if(gap<nGap) {
                m_totalNearbyHits++;
                fPrevID[gap]=wireID;
                if(gap==0) fAllNeiborID.push_back(wireID);
            }
        }
        void AddNext(int wireID, int gap=0) {
            if(gap<nGap) {
                m_totalNearbyHits++;
                fNextID[gap]=wireID;
                if(gap==0) fAllNeiborID.push_back(wireID);
            }
        }
        void AddInner(int wireID, int gap=0) {
            if(gap<nGap) {
                m_totalNearbyHits++;
                fInnerID[gap].push_back(wireID);
                if(gap==0) fAllNeiborID.push_back(wireID);
            }
        }
        void AddOuter(int wireID, int gap=0) {
            if(gap<nGap) {
                m_totalNearbyHits++;
                fOuterID[gap].push_back(wireID);
                if(gap==0) fAllNeiborID.push_back(wireID);
            }
        }
        void SetUsedFlag(int flag=1){useflag=flag;}
        void SetOnNode() { m_onNode=1;}
        void SetInBigSet() { m_inBigSet=1;}
 
        void AddTrkCandiIdx(int idx) {m_idxTrkCandiVec.push_back(idx);};
        void RmTrkCandiIdx(int idx) {
            //int nCandi = m_idxTrkCandiVec.size();
            //for(int i=0; i<nCandi; i++) {
            //  if(m_idxTrkCandiVec[i]==idx) {
            //      m_idxTrkCandiVec.erase(m_idxTrkCandiVec.begin()+i);
            //      break;
            //  }
            //}
 
            vector<int>::iterator iter = std::remove(m_idxTrkCandiVec.begin(), m_idxTrkCandiVec.end(), idx);
            m_idxTrkCandiVec.erase(iter, m_idxTrkCandiVec.end());
        }
 
    private:
        const MdcGeoWire* fWire;
        // vector<MdcGeoWire*> fNeiborHitWires;
        int fPrevID[nGap];
        int fNextID[nGap];
        int useflag;// used: 1, unused: 0, not to use: -1
        int m_totalNearbyHits; // nearby hits with nGap
        int m_onNode;// if on a node
        int m_inBigSet;// if in a big hit set (nHits>=3)
        vector<int>  fInnerID[nGap];
        vector<int>  fOuterID[nGap];
        vector<int>  fAllNeiborID;
        vector<const MdcDigi*> fHitsOfWire;// digi
        bool fired;
        vector<int>  m_idxTrkCandiVec;
 
};
 
 
 
#endif