EdbCouplesTree Class Reference

#include <EdbCouplesTree.h>

Inheritance diagram for EdbCouplesTree:

Collaboration diagram for EdbCouplesTree:

Public Member Functions
void	ApplyCorrections ()
void	Close ()
	EdbCouplesTree ()
Int_t	Fill ()
Int_t	Fill (EdbSegP *s1, EdbSegP *s2, EdbSegP *s=0, EdbSegCouple *cp=0, float xv=0, float yv=0, int pid1=0, int pid2=0)
int	GetCPData (EdbPattern *pat, EdbPattern *p1=0, EdbPattern *p2=0, TIndex2 *trseg=0)
int	GetCPData (TObjArray &cparr)
int	GetCPDataAcceptedMask (EdbPattern *pat)
int	GetEntry (int i)
const char *	GetFileName () const
bool	InitCouplesTree (const char *name="couples", const char *fname=0, Option_t *mode="READ")
TEventList *	InitCutList ()
void	Print ()
int	PutCPData (TObjArray &cparr)
void	RankCouples (TObjArray &cparr)
void	SaveTree ()
bool	WriteTree ()
virtual	~EdbCouplesTree ()

Public Attributes
EdbMask *	eAcceptMask
bool	eApplyCorrections
EdbSegCouple *	eCP
TCut	eCut
EdbMask *	eEraseMask
Int_t	ePid1
Int_t	ePid2
EdbPlateP	ePlate
EdbSegP *	eS
EdbSegP *	eS1
EdbSegP *	eS2
TTree *	eTree
Float_t	eXv
Float_t	eYv

Constructor & Destructor Documentation

EdbCouplesTree()

EdbCouplesTree::EdbCouplesTree

(

)

~EdbCouplesTree()

EdbCouplesTree::~EdbCouplesTree ( )

virtual

{
// most of the members pointers can be the property of other objects
// If the file should be closed - use Close()
  //SafeDelete(eTree);
  //SafeDelete(eS);
  //SafeDelete(eS1);
  //SafeDelete(eS2);
 //SafeDelete(eEraseMask);
}

Member Function Documentation

ApplyCorrections()

void EdbCouplesTree::ApplyCorrections

(

)

---

{
}

Close()

void EdbCouplesTree::Close

(

)

---

{
  if (eTree) {
    TFile *f = (TFile*)(eTree->GetDirectory()->GetFile());
    if (f) {
      //f->Print();
      if(f->IsWritable()) eTree->AutoSave();
      f->Close();
      //SafeDelete(eTree);
      //SafeDelete(f);
    }
     //SafeDelete(eTree);
     //eTree=NULL;
  }
}

Fill() [1/2]

Int_t EdbCouplesTree::Fill

(

)

{
  return eTree->Fill();
}

Fill() [2/2]

Int_t EdbCouplesTree::Fill	(	EdbSegP *	s1,
		EdbSegP *	s2,
		EdbSegP *	s = 0,
		EdbSegCouple *	cp = 0,
		float	xv = 0,
		float	yv = 0,
		int	pid1 = 0,
		int	pid2 = 0
	)

{
  eS1=s1;    eS2=s2;  eS=s; eCP=cp; 
  eXv=xv; eYv=yv; ePid1=pid1; ePid2=pid2;
   //eDZ1 = dz1; eDZ2 = dz2; eFlag=flag;
  return Fill();
}

GetCPData() [1/2]

int EdbCouplesTree::GetCPData	(	EdbPattern *	pat,
		EdbPattern *	p1 = 0,
		EdbPattern *	p2 = 0,
		TIndex2 *	trseg = 0
	)

---

TO CHECK !!!

{
  TEventList *lst = InitCutList();
  if (!lst) return 0;
  int nlst =lst->GetN();
 
  int nseg = 0, nerase=0;
  pat->SetID(0);
 
  int entr=0;
  for(int i=0; i<nlst; i++ ) {
    entr = lst->GetEntry(i);
 
//     if(trseg) {           //exclude segments participating in tracks
//       if( (trseg->Find(ePlate*1000+ePiece,entr) >= 0) )  continue;
//     }
 
    if(eEraseMask) if(eEraseMask->At(entr)) {
      Log(3,"EdbCouplesTree::GetCPData","erase %d\n",entr);
      nerase++;
      continue;
    }
 
    GetEntry(entr);
 
    if(pat) {
      eS->SetZ( eS->Z() + pat->Z() );   
      //ToDo: s->SetVid(ePlate*1000+ePiece,entr);
      eS->SetChi2(eCP->CHI2P());
      pat->AddSegment( *eS  );
      nseg++;
    }
    if(p1)  { 
      eS1->SetZ( eS1->Z() + pat->Z() );
      p1->AddSegment(  *eS1 ); 
      nseg++; 
    }
    if(p2)  { 
      eS2->SetZ( eS2->Z() + pat->Z() );
      p2->AddSegment(  *eS2 ); 
      nseg++; 
    }
  }
 
  SafeDelete(lst);
 
  Log(2,"EdbCouplesTree::GetCPData","select %d of %d segments by cut %s ; %d erased by mask",nlst, (int)(eTree->GetEntries()), eCut.GetTitle(), nerase);
 
  return nseg;
}

GetCPData() [2/2]

int EdbCouplesTree::GetCPData

(

TObjArray &

cparr

)

---

{
 //read segments into array of EdbSegCouple objects
  TEventList *lst = InitCutList();
  if (!lst) return 0;
  int nlst =lst->GetN();
  int nseg = 0, nerase=0;
  int entr=0;
  for(int i=0; i<nlst; i++ ) {
    entr = lst->GetEntry(i);
 
    if(eEraseMask) if(eEraseMask->At(entr)) {
      Log(3,"EdbCouplesTree::GetCPData","erase %d\n",entr);
      nerase++;
      continue;
    }
  
    GetEntry(entr);
    EdbSegCouple *cp = new EdbSegCouple(*eCP);
    cp->eS = new EdbSegP(*eS);
    cp->eS1 = new EdbSegP(*eS1);
    cp->eS2 = new EdbSegP(*eS2);
    cparr.Add( cp );
 
    nseg++;
  }
   
  SafeDelete(lst);
 
  Log(2,"EdbCouplesTree::GetCPData","select %d of %d segments by cut %s ; %d erased by mask",nlst, (int)(eTree->GetEntries()), eCut.GetTitle(), nerase);
 
  return nseg;
}

GetCPDataAcceptedMask()

int EdbCouplesTree::GetCPDataAcceptedMask

(

EdbPattern *

pat

)

---

TO CHECK !!!

{
  if(!eAcceptMask) return 0;
  int n = eAcceptMask->N();
  pat->SetID(0);
  int nseg=0;
  for(int i=0; i<n; i++ ) {
    if(eAcceptMask->At(i)>0) {
      GetEntry(i);
      if(pat) {
        eS->SetZ( eS->Z() + pat->Z() );   
        //ToDo: s->SetVid(ePlate*1000+ePiece,entr);
        eS->SetChi2(eCP->CHI2P());
        pat->AddSegment( *eS  );
        nseg++;
      }
    }
  }
 
  Log(2,"EdbCouplesTree::GetCPDataAcceptedMask","select %d of %d segments",nseg, (int)(eTree->GetEntries()));
 
  return nseg;
}

GetEntry()

int EdbCouplesTree::GetEntry

(

int

i

)

---

{
  int size = eTree->GetEntry(i);
  if(eApplyCorrections)  ApplyCorrections();
  return size;
}

GetFileName()

const char* EdbCouplesTree::GetFileName ( ) const

inline

{ if(eTree->GetCurrentFile()) return eTree->GetCurrentFile()->GetName(); else return 0;}

InitCouplesTree()

bool EdbCouplesTree::InitCouplesTree	(	const char *	name = "couples",
		const char *	fname = 0,
		Option_t *	mode = "READ"
	)

{
  Log(3,"EdbCouplesTree::InitCouplesTree","%s at file %s as %s",name,fname,mode);
  if(fname) {                                      // if fname==0 - assumed that file is already opened 
    //TFile *f = new TFile(fname, mode);
    //printf("\n ROOT dir before:\n"); gDirectory->ls();  printf("\n");
    TFile *f = TFile::Open(fname, mode);
    //printf("\n ROOT dir after:\n"); gDirectory->ls();  printf("\n");
    if (!f->IsOpen()) return 0;
    f->cd();
  }
  
  if( (strcmp(mode,"READ")==0)) {
    eTree = (TTree*)gDirectory->Get(name);
    if(!eTree) {Log(1,"EdbCouplesTree::InitCouplesTree","ERROR: can not open tree %s",name); return 0;}
    
    eTree->SetBranchAddress("pid1",  &ePid1);
    eTree->SetBranchAddress("pid2",  &ePid2);
    eTree->SetBranchAddress("xv"  ,  &eXv);
    eTree->SetBranchAddress("yv"  ,  &eYv);
    eTree->SetBranchAddress("cp"  ,  &eCP);
    eTree->SetBranchAddress("s1." ,  &eS1);
    eTree->SetBranchAddress("s2." ,  &eS2);
    eTree->SetBranchAddress("s."  ,  &eS);
    return 1;
    if( (strcmp(mode,"UPDATE")==0) ) {
      eTree = (TTree*)gDirectory->Get(name);
      if(eTree) {
    eTree->SetBranchAddress("pid1",  &ePid1);
    eTree->SetBranchAddress("pid2",  &ePid2);
    eTree->SetBranchAddress("xv"  ,  &eXv);
    eTree->SetBranchAddress("yv"  ,  &eYv);
    eTree->SetBranchAddress("cp"  ,  &eCP);
    eTree->SetBranchAddress("s1." ,  &eS1);
    eTree->SetBranchAddress("s2." ,  &eS2);
    eTree->SetBranchAddress("s."  ,  &eS);
    return 1;
      }
    }
  }
  
  const char *fn = fname;
  if(!fn) if(gDirectory->GetFile()) fn=gDirectory->GetFile()->GetName();
  Log(2,"EdbCouplesTree::InitCouplesTree","create new tree %s in %s",name, fn);  
  
  eTree = new TTree(name, "couples tree (s1:s2:s)");
  eTree->SetMaxTreeSize(64000000000LL);   //set 64 Gb file size limit)
  
  eTree->Branch("pid1",  &ePid1,"pid1/I");
  eTree->Branch("pid2",  &ePid2,"pid2/I");
  eTree->Branch("xv"  ,  &eXv,"xv/F");
  eTree->Branch("yv"  ,  &eYv,"yv/F");
  eTree->Branch("cp"  ,  &eCP,32000,99);
  eTree->Branch("s1." ,  &eS1,32000,99);
  eTree->Branch("s2." ,  &eS2,32000,99);
  eTree->Branch("s."  ,  &eS,32000,99);
  
  return 1;
}

InitCutList()

TEventList * EdbCouplesTree::InitCutList

(

)

---

{
  if(!eTree)  return  0;
  int nentr = (int)(eTree->GetEntries());  if(nentr<1) return 0;
  eTree->Draw(">>lst", eCut );
  TEventList *lst = (TEventList*)(gDirectory->GetList()->FindObject("lst"));
  if(!lst) {Log(1,"EdbCouplesTree::GetCPData","ERROR!: events list (lst) did not found! In couples tree %d entries",nentr); return 0;}
  return lst;
}

Print()

void EdbCouplesTree::Print

(

)

{
  Log(1,"EdbCouplesTree::Print","s1 s2 s cp:");
  if(eS1) eS1->PrintNice();
  if(eS2) eS2->PrintNice();
  if(eS)  eS->PrintNice();
  if(eCP) eCP->Print();
}

PutCPData()

int EdbCouplesTree::PutCPData

(

TObjArray &

cparr

)

---

{
  int n = cparr.GetEntries();
  for(int i=0; i<n; i++)
  {
    EdbSegCouple *cp = (EdbSegCouple *)cparr.UncheckedAt(i);
    if(cp) {
      eCP = cp;
      eS  = cp->eS;
      eS1 = cp->eS1;
      eS2 = cp->eS2;
      Fill();
    }
  }
  return n;
}

RankCouples()

void EdbCouplesTree::RankCouples

(

TObjArray &

cparr

)

---

{
  // rank couples if in cparr the same segment's pointer appare in several combinations
  EdbSegCouple::SetSortFlag(0);    // sort by CHI2P
  cparr.UnSort();
  cparr.Sort();
 
  int ncp = cparr.GetEntries();
 
  for(int i=0; i<ncp; i++) {
    EdbSegCouple *sc = (EdbSegCouple*)(cparr.UncheckedAt(i));
    sc->eS1->SetFlag(0);
    sc->eS2->SetFlag(0);
  }
 
  for(int i=0; i<ncp; i++) {
    EdbSegCouple *sc = (EdbSegCouple*)(cparr.UncheckedAt(i));
    sc->eS1->SetFlag( sc->eS1->Flag()+1 );
    sc->eS2->SetFlag( sc->eS2->Flag()+1 );
    sc->SetN1(sc->eS1->Flag());
    sc->SetN2(sc->eS2->Flag());
  }
 
  for(int i=0; i<ncp; i++) {
    EdbSegCouple *sc = (EdbSegCouple*)(cparr.UncheckedAt(i));
    sc->SetN1tot(sc->eS1->Flag());
    sc->SetN2tot(sc->eS2->Flag());
  }
 
  Log(2,"EdbCouplesTree::RankCouples","%d couples ok", ncp );
}

SaveTree()

void EdbCouplesTree::SaveTree

(

)

---

{
  if(eTree)
  {
    TFile *f = (TFile*)(eTree->GetDirectory()->GetFile());
    if(f->IsWritable()) eTree->AutoSave();
  }
}

WriteTree()

bool EdbCouplesTree::WriteTree

(

)

{
  if(!eTree)    return 0;
  eTree->Write();
  SafeDelete(eTree);
  return 1;
}

Member Data Documentation

eAcceptMask

EdbMask* EdbCouplesTree::eAcceptMask

eApplyCorrections

bool EdbCouplesTree::eApplyCorrections

eCP

EdbSegCouple* EdbCouplesTree::eCP

eCut

TCut EdbCouplesTree::eCut

eEraseMask

EdbMask* EdbCouplesTree::eEraseMask

ePid1

Int_t EdbCouplesTree::ePid1

ePid2

Int_t EdbCouplesTree::ePid2

ePlate

EdbPlateP EdbCouplesTree::ePlate

eS

EdbSegP * EdbCouplesTree::eS

eS1

EdbSegP* EdbCouplesTree::eS1

eS2

EdbSegP * EdbCouplesTree::eS2

eTree

TTree* EdbCouplesTree::eTree

eXv

Float_t EdbCouplesTree::eXv

eYv

Float_t EdbCouplesTree::eYv

---

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

• src/libEbase/EdbCouplesTree.h
• src/libEbase/EdbCouplesTree.cxx