shower_btr.C File Reference

#include "TMultiLayerPerceptron.h"

Include dependency graph for shower_btr.C:

Namespaces
namespace	SHOWER_PAR

Functions
void	shower_btr ()

Function Documentation

shower_btr()

void shower_btr

(

)

{    
  using namespace  SHOWER_PAR;
  
  EdbShowerRec  shower;
  
  char fname[128];     
  char nme[64];
  float  a11, a12, a21, a22, bb1, bb2;
  float Zoff;
  
  double x0[10000];
  double y0[10000];
  double z0[10000];
  double tx0[10000];
  double ty0[10000];
  double chi20[10000];
  double P0[10000];
  int   W0[10000];
  int   Flag0[10000];
  int   MCid[10000];
  int   TRid[10000];
  double Esim[10000];
  int   id[10000];
  int   Pid[10000];  
  int Ncand=0;
  int trid(0), nseg, n0;
  
  //SELECTION of the FIRST BASETRACK FOR THE SHOWER RECONSTRUCTION   
  // 
  // Here as an exemple we select BT from the first plate of the brick "data/01_001.cp.root"    
  //
  // this part can be modified as you want
  
  sprintf(fname,"data/01_001.cp.root");
  
  file1 = new TFile(fname ,"READ");
  
  sprintf(nme,"par/01_001.par");    // READ AFFINE TRANSFORMATION    
  shower.ReadAffAndZ(nme,&Zoff,&a11,&a12,&a21,&a22,&bb1,&bb2 );
 
// Get the values for shower reconstruction from cp file   
    TTree *tree = (TTree*)file1->Get("couples");       
    EdbSegP *s  = 0;
    EdbSegCouple *cp;
    
    s = new EdbSegP();
    tree->SetBranchAddress("s.", &s);
    tree->SetBranchAddress("cp", &cp);
    int nentries = int(tree->GetEntries());
 
    for(int i=0;i<nentries;i++){
      tree->GetEntry(i);
      //================================================================
      // CUTS for the first basetrack selection to fill the x0, y0, z0, tx0, ty0
      // here you can add the cuts you want     
      //    if((fabs(s->TX()-0.15)>0.02&&fabs(s->TY()-0.15)>0.02)) continue;
      //  if((fabs(s->TX())>0.05&&fabs(s->TY())>0.05)) continue;
      if (s->MCEvt()!=1)continue;   
      //if (s->MCEvt()==-999)continue;
      //if((fabs(s->TX())>0.1||fabs(s->TY())>0.1)) continue;
      //if(s->W()<25) continue;
      //if(s->Z()<24000) continue;
      //filling
      
      if (DATA==1)
    {  
      x0[Ncand]  =  a11*s->X() + a12*s->Y() + bb1;
      y0[Ncand]  =  a21*s->X() + a22*s->Y() + bb2;
      z0[Ncand]  =  Zoff;
      tx0[Ncand] =  a11*s->TX()+ a12*s->TY() ;
      ty0[Ncand] =  a21*s->TX()+ a22*s->TY();
      TRid[Ncand] = s->MCEvt();  //this has to be a positive number
      Esim[Ncand] = s->P();
      id[Ncand] = s->ID();
      Pid[Ncand] =    Zoff/1290+1; 
      //cout <<s->X()<<" "<<s->Y()<<" "<<Zoff<<" "<<s->TX()<<" "<<s->TY()<<" "<<s->W()<<" "<<Ncand <<endl;
    }
      else
    {     
      x0[Ncand]  =  s->X();
      y0[Ncand]  =  s->Y();
      z0[Ncand]  =  Zoff;
      tx0[Ncand] =  s->TX();
      ty0[Ncand] =  s->TY();
    chi20[Ncand] = s->Chi2();
    W0[Ncand] = s->W();
    P0[Ncand] = s->P();
    Flag0[Ncand] = s->Flag();
      TRid[Ncand] = s->MCEvt();//this has to be a positive number
      Esim[Ncand] = s->P();
      id[Ncand] = s->ID();
      Pid[Ncand] =    Zoff/1290+1; 
      //cout <<s->X()<<" "<<s->Y()<<" "<<Zoff<<" "<<s->TX()<<" "<<s->TY()<<" "<<s->W()<<" "<<Ncand <<endl;
    }
      Ncand++;      
    }
    printf("Ncand: %f\n",Ncand);
    file1->Close();
    
    /* --- Depreciated  
    // Here call of the shower algorithm using x0,y0,z0,tx0,ty0,Pid,id,TRid,Esim as seed 
    // The results will be put in Shower.root file
    shower.rec(PLATE,MAXPLATE,0,Ncand,x0,y0,z0,tx0,ty0,Pid,id,TRid,Esim,piece2,piece2par,DOWN);   
    */ 
    
    // Here call of the shower algorithm using x0,y0,z0,tx0,ty0,chi20,W0,P0,Flag0,Pid,id,TRid,Esim as seed 
    // chi20,W0,P0,Flag0 are not necessary but if not given first segment in shower will not have these values!
    shower.rec(num,MAXPLATE,DATA,Ncand,x0,y0,z0,tx0,ty0,chi20,W0,P0,Flag0,Pid,id,TRid,Esim,piece2,piece2par,UPDOWN);   
    
   
}