EdbShowAlg_OI Class Reference

#include <EdbShowAlg.h>

Inheritance diagram for EdbShowAlg_OI:

Collaboration diagram for EdbShowAlg_OI:

Public Member Functions
	ClassDef (EdbShowAlg_OI, 1)
	EdbShowAlg_OI ()
void	Execute ()
void	Finalize ()
void	Initialize ()
virtual	~EdbShowAlg_OI ()
Public Member Functions inherited from EdbShowAlg
void	AddRecoShowerArray (EdbShowerP *shower)
	ClassDef (EdbShowAlg, 1)
Double_t	DeltaR_NoPropagation (EdbSegP *s, EdbSegP *stest)
Double_t	DeltaR_WithoutPropagation (EdbSegP *s, EdbSegP *stest)
Double_t	DeltaR_WithPropagation (EdbSegP *s, EdbSegP *stest)
Double_t	DeltaTheta (EdbSegP *s1, EdbSegP *s2)
Double_t	DeltaThetaComponentwise (EdbSegP *s1, EdbSegP *s2)
Double_t	DeltaThetaSingleAngles (EdbSegP *s1, EdbSegP *s2)
	EdbShowAlg ()
	EdbShowAlg (TString AlgName, Int_t AlgValue)
virtual void	Execute ()
virtual void	Finalize ()
TString	GetAlgName () const
Int_t	GetAlgValue () const
Double_t	GetMinimumDist (EdbSegP *seg1, EdbSegP *seg2)
TObjArray *	GetRecoShowerArray () const
Int_t	GetRecoShowerArrayN () const
EdbShowerP *	GetShower (Int_t i) const
Double_t	GetSpatialDist (EdbSegP *s1, EdbSegP *s2)
void	Help ()
virtual void	Initialize ()
Bool_t	IsInConeTube (EdbSegP *sTest, EdbSegP *sStart, Double_t CylinderRadius, Double_t ConeAngle)
void	Print ()
void	PrintAll ()
void	PrintMore ()
void	PrintParameters ()
void	PrintParametersShort ()
void	SetActualAlgParameterset (Int_t ActualAlgParametersetNr)
void	SetEdbPVRec (EdbPVRec *Ali)
void	SetEdbPVRecPIDNumbers (Int_t FirstPlate_eAliPID, Int_t LastPlate_eAliPID, Int_t MiddlePlate_eAliPID, Int_t NumberPlate_eAliPID)
void	SetInBTArray (TObjArray *InBTArray)
void	SetParameter (Int_t parNr, Float_t par)
void	SetParameters (Float_t *par)
void	SetRecoShowerArray (TObjArray *RecoShowerArray)
void	SetRecoShowerArrayN (Int_t RecoShowerArrayN)
void	SetUseAliSub (Bool_t UseAliSub)
void	Transform_eAli (EdbSegP *InitiatorBT, Float_t ExtractSize)
void	UpdateShowerIDs ()
void	UpdateShowerMetaData ()
virtual	~EdbShowAlg ()

Private Member Functions
Bool_t	FindPrecedingBTs (EdbSegP *s, EdbSegP *InBT, EdbPVRec *gAli, EdbShowerP *shower)

Additional Inherited Members
Protected Member Functions inherited from EdbShowAlg
void	Set0 ()
Protected Attributes inherited from EdbShowAlg
Int_t	eActualAlgParametersetNr
TString	eAlgName
Int_t	eAlgValue
EdbPVRec *	eAli
EdbPVRec *	eAli_Sub
Int_t	eAli_SubNpat
Int_t	eAliNpat
Int_t	eFirstPlate_eAliPID
TObjArray *	eInBTArray
Int_t	eInBTArrayN
Int_t	eLastPlate_eAliPID
Int_t	eMiddlePlate_eAliPID
Int_t	eNumberPlate_eAliPID
Int_t	eParaN
TString	eParaString [10]
Float_t	eParaValue [10]
EdbShowerP *	eRecoShower
TObjArray *	eRecoShowerArray
Int_t	eRecoShowerArrayN
Int_t	eUseAliSub

Constructor & Destructor Documentation

EdbShowAlg_OI()

EdbShowAlg_OI::EdbShowAlg_OI

(

)

{
    // Default Constructor
    Log(2,"EdbShowAlg_OI::EdbShowAlg_OI()","Default Constructor (OfficialImplementation, as it is in libShower module)");
 
// Reset all:
    Set0();
 
    eAlgName="OI";
    eAlgValue=4; // see default.par_SHOWREC for labeling (labeling identical with ShowRec program)
    eParaN =4; // depends on the algorithm, how much parameters it has got.
 
    eParaValue[0]=700.0;
    eParaString[0]="CylinderRadius";  // micrometer
    eParaValue[1]=0.025;
    eParaString[1]="ConeAngle";       // MILLIradiant
    eParaValue[2]=150.0;
    eParaString[2]="DeltaRToPreceedingBT";  // micrometer
    eParaValue[3]=0.13;
    eParaString[3]="DeltaThetaComponentwiseToPreceedingBT";  // radiant
 
// 700  0.025  150  0.13
    Log(2,"EdbShowAlg_OI::EdbShowAlg_OI()","Default Constructor (OfficialImplementation, as it is in libShower module)...done.");
}

~EdbShowAlg_OI()

EdbShowAlg_OI::~EdbShowAlg_OI ( )

virtual

{
    Log(2,"EdbShowAlg_OI::~EdbShowAlg_OI()","Default Destructor called.");
// Default Destructor
}

Member Function Documentation

ClassDef()

EdbShowAlg_OI::ClassDef	(	EdbShowAlg_OI	,
		1
	)

Execute()

void EdbShowAlg_OI::Execute ( )

virtual

WARNING ... Somehow the calculation of "STEP" is not correct, when having data ordered patterns, it might go the wrong direction. Better use GetPatternNext(..,+1) to be sure to get the next pattern with increasing Z positions. To be checked: does it work also on Simulated ORFEO data? To be checked: does it work also on the testbeam data?

newActualPID=ActualPID+STEP; // old, mixes up downstream and upstream directions

Reimplemented from EdbShowAlg.

{
    Log(2,"EdbShowAlg_OI::Execute()","DOING MAIN SHOWER RECONSTRUCTION HERE");
 
    EdbSegP* InBT;
    EdbSegP* Segment;
    EdbShowerP* RecoShower;
 
    Bool_t    StillToLoop=kTRUE;
    Int_t     ActualPID;
    Int_t     newActualPID;
    Int_t     STEP=-1;
    Int_t     NLoopedPattern=0;
 
    Int_t newZ_next_ascending_Z=0;
    Int_t newPID_next_ascending_Z=0;
 
 
    if (eFirstPlate_eAliPID-eLastPlate_eAliPID<0) STEP=1;
//     cout << "eFirstPlate_eAliPID = " << eFirstPlate_eAliPID << endl;
//     cout << "eLastPlate_eAliPID  = " << eLastPlate_eAliPID << endl;
    if (gEDBDEBUGLEVEL>2) cout << "EdbShowAlg_OI::Execute--- STEP for patternloop direction =  " << STEP << endl;
 
 
//--- Loop over InBTs:
    if (gEDBDEBUGLEVEL>2) cout << "EdbShowAlg_OI::Execute    Loop over InBTs:" << endl;
 
 
// Since eInBTArray is filled in ascending ordering by zpositon
// We use the descending loop to begin with BT with lowest z first.
 
    for (Int_t i=eInBTArrayN-1; i>=0; --i) {
 
// CounterOutPut, only at gEDBDEBUGLEVEL==2
        if (gEDBDEBUGLEVEL==2) if ((i%100)==0) cout << eInBTArrayN <<" Initiator Basetracks (InBT) in total, still to do: " << Form("%06d",i) << "\r\r\r\r\r\r" << flush;
 
//-----------------------------------
// 1) Make local_gAli with cut parameters:
//-----------------------------------
 
// Create new EdbShowerP Object for storage;
// See EdbShowerP why I have to call the Constructor as "unique" ideficable value
        RecoShower = new EdbShowerP(i,eAlgValue,eActualAlgParametersetNr);
 
// Get InitiatorBT from eInBTArray
        InBT=(EdbSegP*)eInBTArray->At(i);
        if (gEDBDEBUGLEVEL>2) InBT->PrintNice();
        Float_t X0=InBT->X();
        Float_t Y0=InBT->Y();
 
// Add InBT to RecoShower:
// This has to be done, since by definition the first BT in the RecoShower is the InBT.
// Otherwise, also the definition of shower axis and transversal profiles is wrong!
        RecoShower -> AddSegment(InBT);
        if (gEDBDEBUGLEVEL>4)  cout << "Segment  (InBT) " << Segment << " was added to RecoShower." <<  endl;
 
// Transform (make size smaller, extract only events having same MC) the  eAli  object:
        Transform_eAli(InBT);
        if (gEDBDEBUGLEVEL>3) eAli_Sub->Print();
 
//-----------------------------------
// 2) Loop over (whole) eAli, check BT for Cuts
// eAli_Sub
//-----------------------------------
        ActualPID= InBT->PID() ;
        newActualPID= InBT->PID() ;
 
        while (StillToLoop) {
            if (gEDBDEBUGLEVEL>3) cout << "EdbShowAlg_OI::Execute--- --- Doing patterloop " << ActualPID << " for patterns Z position=" << eAli_Sub->GetPattern(ActualPID)->Z() << endl;
 
            for (Int_t btloop_cnt=0; btloop_cnt<eAli_Sub->GetPattern(ActualPID)->GetN(); ++btloop_cnt) {
 
                Segment = (EdbSegP*)eAli_Sub->GetPattern(ActualPID)->GetSegment(btloop_cnt);
                if (gEDBDEBUGLEVEL>4) Segment->PrintNice();
 
        // Quick Continue Statements:
                if ( Segment->MCEvt() > 0 ) if ( Segment->MCEvt()!=InBT->MCEvt() ) continue; // MCEvtNr (>0) or BgMCNr (-999)
                if ( Abs(Segment->X()-X0) > 7000 ) continue;
                if ( Abs(Segment->Y()-Y0) > 7000 ) continue;
        // Now apply cut conditions: OI OfficialImplementation Alg  --------------------
                if ( !IsInConeTube(Segment, InBT, eParaValue[0], eParaValue[1]) ) continue;
                if ( !FindPrecedingBTs(Segment, InBT, eAli_Sub, RecoShower)) continue;
        // end of    cut conditions: OI OfficialImplementation Alg  --------------------
 
 
// If we arrive here, Basetrack  Segment  has passed criteria
// and is then added to the RecoShower:
// Check if its not the InBT which is already added:
// Use compare function of EdbSegP, which is safer instead of comparison of adresses
                // (in eAli_Sub, Adresses can be new and then it doesnt work)
                if ( Segment->Compare(InBT) == 0) {
//        cout << "Segment->X()==InBT->X()&&Segment->Y()==InBT->Y()  segments have same coord, so dont add" << endl;
//        cout << "check the compare-function" << endl;
//        cout << "Segment->Compare(InBT) = " <<  Segment->Compare(InBT)     << endl;
//        int EdbSegP::Compare( const TObject *obj ) const
                    ;    // is InBT, do nothing;
                }
                else {
                    RecoShower -> AddSegment(Segment);
                }
                if (gEDBDEBUGLEVEL>4)  cout << "Segment  " << Segment << " was added at  &Segment : " << &Segment  <<  endl;
 
            } // of btloop_cnt
 
 
            if (gEDBDEBUGLEVEL>3) cout << "EdbShowAlg_OI::Execute--- --- ActualPID= " << ActualPID << " at Z= " << eAli_Sub->GetPattern(ActualPID)->Z()  << " done. Reconstructed shower has up to now: " << RecoShower->N()  << " Segments." << endl;
 
// // // // // // // // // // // // // // // // // XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
            // cout << " DETERMINE NEXT PATTERN in ASCENDING (INCREASING) Z  DIRECTION now: " << endl;
            EdbPattern* currentPat = eAli_Sub->GetPattern(ActualPID);
            EdbPattern* newPat_next_ascending_Z = eAli_Sub->GetPatternNext(currentPat->Z(),1);  // in ascending Z
 
            // cout << "What if there is no next ascending Z pattern? Check it here...... " << endl;
            // cout << "newPat_next_ascending_Z = " << newPat_next_ascending_Z << endl;
 
            if ( NULL == newPat_next_ascending_Z ) {
                if (gEDBDEBUGLEVEL>2) {
                    cout << "newPat_next_ascending_Z   is NULL pointer !  So it is nonexisting! (possibly last plate); " << endl;
                    cout << "EdbShowAlg_OI::Execute--- ---Stop Loop since: newPat_next_ascending_Z   is NULL pointer "<<endl;
                }
                StillToLoop=kFALSE;
            }
            else {
                newZ_next_ascending_Z    = newPat_next_ascending_Z->Z();
                newPID_next_ascending_Z  = newPat_next_ascending_Z->PID();
            }
 
            // cout  << "Set new values for the next ascending pattern:   newZ_next_ascending_Z    = " <<   newZ_next_ascending_Z << endl;
            // cout  << "Set new values for the next ascending pattern:   newPID_next_ascending_Z  = " <<   newPID_next_ascending_Z << endl;
            // cout << " NEXT PATTERN in ASCENDING (INCREASING) Z  DIRECTION has PID()= " <<  newPID_next_ascending_Z    << "  and a z-Position of Z= " << newZ_next_ascending_Z  <<    endl;
// // // // // // // // // // // // // // // // // XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
 
//------------
            newActualPID=newPID_next_ascending_Z;
            ++NLoopedPattern;
 
            if (gEDBDEBUGLEVEL>3) {
                cout << "EdbShowAlg_OI::Execute--- --- newActualPID= " << newActualPID << endl;
                cout << "EdbShowAlg_OI::Execute--- --- newActualZ= " << eAli_Sub->GetPattern(newActualPID)->Z()  << endl;
                cout << "EdbShowAlg_OI::Execute--- --- NLoopedPattern= " << NLoopedPattern << endl;
                cout << "EdbShowAlg_OI::Execute--- --- eNumberPlate_eAliPID= " << eNumberPlate_eAliPID << endl;
                cout << "EdbShowAlg_OI::Execute--- --- StillToLoop= " << StillToLoop << endl;
                cout << "EdbShowAlg_OI::Execute--- --- We have to decide, if to loop on for the next pattern... (out of the " << eAli_Sub->Npatterns()  << " patterns)." << endl;
            }
 
            /* NOT NECESSARY ANYMORE SINCE WE DO THE OUT OF BOUNDS CHECK IN ANOTHER WAY .....
             * TO BE  REMOVED ...
            // This if holds in the case of STEP== +1
                if (STEP==1) {
                    if (newActualPID>eLastPlate_eAliPID) StillToLoop=kFALSE;
                    if (newActualPID>eLastPlate_eAliPID) cout << "EdbShowAlg_OI::Execute--- ---Stop Loop since: newActualPID>eLastPlate_eAliPID"<<endl;
                }
            // This if holds in the case of STEP== -1
                if (STEP==-1) {
                    if (newActualPID<eLastPlate_eAliPID) StillToLoop=kFALSE;
                    if (newActualPID<eLastPlate_eAliPID && gEDBDEBUGLEVEL>3) cout << "EdbShowAlg_OI::Execute--- ---Stop Loop since: newActualPID<eLastPlate_eAliPID"<<endl;
                }
                */
 
            // What is the constraint? 0  <= newActualPID <= Npatterns-1, these patterns are valid....
            if (newActualPID<0)
            {   StillToLoop=kFALSE;
                // cout << CStop Loop since: newActualPID<0"<<endl;
            }
            if (newActualPID>=eNumberPlate_eAliPID-1) {
                StillToLoop=kFALSE;
                // cout << "EdbShowAlg_OI::Execute--- ---Stop Loop since: newActualPID>=eNumberPlate_eAliPID-1   [0 <= newActualPID <= Npatterns-1]"<<endl;
            }
 
// This if holds  general, since eNumberPlate_eAliPID is not dependent of the structure of the gAli subject:
            if (NLoopedPattern>eNumberPlate_eAliPID) StillToLoop=kFALSE;
            if (NLoopedPattern>eNumberPlate_eAliPID && gEDBDEBUGLEVEL>3) cout << "EdbShowAlg_OI::Execute--- ---Stop Loop since: NLoopedPattern>eNumberPlate_eAliPID"<<endl;
 
            ActualPID=newActualPID;
        } // of // while (StillToLoop)
 
 
// Obligatory when Shower Reconstruction is finished:
// Set Numbers, plates etc. correct
        RecoShower ->Update();
 
        // Debung Print Information:
        if (gEDBDEBUGLEVEL>2) RecoShower ->PrintBasics();
        if (gEDBDEBUGLEVEL>3) RecoShower ->PrintNice();
        if (gEDBDEBUGLEVEL>3) RecoShower ->PrintSegments();
 
 
//     if (gEDBDEBUGLEVEL>3) cout << "EdbShowAlg_OI::Execute--- Before adding to array delete the histograms...by finalize() of shower."<<endl;
//     RecoShower ->Finalize();
//     if (gEDBDEBUGLEVEL>3) cout << "EdbShowAlg_OI::Execute--- Finalize done..."<<endl;
 
 
// Add Shower Object to Shower Reco Array.
// Not, if its empty or containing only one BT:
// Note, this function add also eRecoShowerArrayN directly.
        if (RecoShower->N()>1) {
      AddRecoShowerArray(RecoShower);
    }
    else {
      // Delete the created shower object. Saves _lots_ of memory and speeds up reconstruction for large #InBTs!
      // TODO Also Include this in the other RecoAlgs ...
      Log(3,"EdbShowAlg_OI::Execute()","InBT # %d RecoShower->N()<=1: Dont add shower to RecoShowerArray. Delete this shower for memory safing.");
      delete RecoShower;
      RecoShower=NULL;
    }
 
    
 
// Set back loop values:
        StillToLoop=kTRUE;
        NLoopedPattern=0;
    } // of  //   for (Int_t i=eInBTArrayN-1; i>=0; --i)
    // Finished Loop over all InBTs here.
 
 
 
    // Set ID of the shower, otherwise all reco showers have ID=0:
    // TO BE DONE: auch in den anderen reco-Algorithmen die ID() nachträglich setzen!
    UpdateShowerIDs();
 
    // Write the MetaData of the Algorithm Values into the showers, that
    // information on reconstruction parameters can be retrieved 
    // (usefull when more parametersets are reconstructed)
    // TO BE DONE::: Also put this in the other Execute Functions TODO
    cout << "================================================================================="<<endl;
    UpdateShowerMetaData();
    cout << "================================================================================="<<endl;
 
    if (gEDBDEBUGLEVEL==2) cout << endl << "Done reco!" << endl;
    cout << "EdbShowAlg_OI::eRecoShowerArray         = " << eRecoShowerArray << endl;
    cout << "EdbShowAlg_OI::eRecoShowerArrayN        = " << eRecoShowerArrayN << endl;
 
    Log(2,"EdbShowAlg_OI::Execute()","DOING MAIN SHOWER RECONSTRUCTION HERE...done.");
    return;
}

Finalize()

void EdbShowAlg_OI::Finalize ( )

virtual

Reimplemented from EdbShowAlg.

{
    return;
}

FindPrecedingBTs()

Bool_t EdbShowAlg_OI::FindPrecedingBTs ( EdbSegP *  s, EdbSegP *  InBT, EdbPVRec *  gAli, EdbShowerP *  shower  )

private

{
    if (gEDBDEBUGLEVEL>3) {
        cout << "EdbShowAlg_OI::FindPrecedingBTs   Find BTs to be connected with the Test BT:" << endl;
        cout << "s_TestBT X,Y,Z " << s->X() << " " <<  s->Y() << " " <<  s->Z() << "  versus InBT  X,Y,Z  " << InBT->X() << " " <<  InBT->Y() << " " <<  InBT->Z() << endl;
    }
 
    EdbSegP* s_TestBT;
    Int_t nentries=shower->N();
    Double_t dZ;
 
// In case the shower is empty we do not have to search for a preceeding BT:
    if (nentries==0) return kTRUE;
 
// We do not test BaseTracks which are before the initiator BaseTrack!
    if (s->Z()<InBT->Z()) {
        if (gEDBDEBUGLEVEL>3) cout << "--- --- EdbShowAlg_OI::FindPrecedingBTs(): s->Z()<InBT->Z()..: We do not test BaseTracks which are before the initiator BaseTrack!  return kFALSE;" << endl;
        return kFALSE;
    }
 
// For the very first Z position we do not test.
// If testBT has Preceeders, only if it it has a BT around (case for e+e- coming from gammma):
// Take 50microns and 80mrad in (dR/dT) around.
// This does not affect the normal results, but helps for
// events which may have a second BT close to InBT (like in e+e-)
    if (s->Z()==InBT->Z()) {
        if (DeltaThetaComponentwise(s, InBT) < 0.08 && DeltaR_WithoutPropagation(s, InBT) < 50.0 ) return kTRUE;
    }
 
    if (gEDBDEBUGLEVEL>3) cout << "--- --- EdbShowAlg_OI::FindPrecedingBTs(): Testing " << nentries << " entries of the shower." << endl;
 
    for (Int_t i=nentries-1; i>=0; --i) {
        s_TestBT = (EdbSegP*)( shower->GetSegment(i) );
 
        if (gEDBDEBUGLEVEL>3) cout << "--- --- EdbShowAlg_OI::FindPrecedingBTs(): Do  s_TestBT->ID()  s->ID()  s_TestBT->MCEvt() s_TestBT->Z()  s->Z() "<< s_TestBT->ID() << " " << s->ID() << "    " << s_TestBT->MCEvt() << "     " << s_TestBT->Z() << "  " <<  s->Z()  <<endl;
        if (gEDBDEBUGLEVEL>3) s_TestBT->PrintNice();
        if (gEDBDEBUGLEVEL>3) s->PrintNice();
 
 
        dZ=TMath::Abs(s_TestBT->Z()-s->Z());
        if (dZ<30) continue;                  // Exclude the case of same Zpositions...
        if (dZ>(3.5*(1300.0+30.0))) continue;     // Exclude the case of more than 3 plates before...  // modified
        // often, experimentally observed, dZ approx 1350 ... so the upper cut really does not
        // look for 3 plates, but only for two ...: seems to work now. (24.Oct.2016)
 
 
        if (gEDBDEBUGLEVEL>3) cout << "--- --- EdbShowAlg_OI::FindPrecedingBTs(): Checking dT,dR and dZ for i:  " << i << "  " << DeltaThetaComponentwise(s, s_TestBT)  << "  " << DeltaR_WithPropagation(s, s_TestBT) << "  "<<dZ << endl;
 
        if (DeltaThetaComponentwise(s, s_TestBT) >  eParaValue[3] ) continue;
        if (DeltaR_WithPropagation(s, s_TestBT) > eParaValue[2]) continue;
 
        if (gEDBDEBUGLEVEL>3) cout << "--- --- EdbShowAlg_OI::FindPrecedingBTs(): Checking dT,dR and dZ for i:  " << i << "  " << DeltaThetaComponentwise(s, s_TestBT)  << "  " << DeltaR_WithPropagation(s, s_TestBT) << "  "<<dZ << "   ok!"<<endl;
        return kTRUE;
    }
//---------------------------------------------
    return kFALSE;
}

Initialize()

void EdbShowAlg_OI::Initialize ( )

virtual

Reimplemented from EdbShowAlg.

{
    return;
}

---

The documentation for this class was generated from the following files:

• /home/antonio/fedra_doxygen/src/libShowRec/EdbShowAlg.h
• /home/antonio/fedra_doxygen/src/libShowRec/EdbShowAlg.cxx