wmain.cxx File Reference

#include <iostream>
#include <TFile.h>
#include <TTree.h>
#include "TrigInDetAnalysis/TIDAEvent.h"
#include <map>

Include dependency graph for wmain.cxx:

Go to the source code of this file.

Functions
int	main ()

Detailed Description

Author

mark sutton

Date

Fri 11 Jan 2019 07:41:26 CET

Copyright (C) 2002-2019 CERN for the benefit of the ATLAS collaboration

Definition in file wmain.cxx.

Function Documentation

main()

int main

(

)

getCoefficientMap(label, EigenIdxList)

input value:

1. label: falvor label in std::string format, could be one of B, C, T, Light
2. EigenIdxList is user defined vector containing all eigenvector index that user interested in. output: Map of format map<string, map<string, float>> containing decomposition coefficient of the list of eigenvectors defined by EigenIdxList.

getCoefficients(label, evIdx)

input value:

1. label: falvor label in std::string format, could be one of B, C, T, Light
2. evIdx: The index of eigenvector user interested in. output value: vector of coefficient values. The order is the same as output given by getListOfOriginalNuisanceParameters()

getListOfOriginalNuisanceParameters(label)

input value:

1. label: falvor label in std::string format, could be one of B, C, T, Light output value: List of original nuisance parameter names.

getNumEigenVectors(label)

input value:

1. label: falvor label in std::string format, could be one of B, C, T, Light return value: number of eigen vectors used for chosen label. Return 0 if error occured.

Definition at line 24 of file wmain.cxx.

{
 
 
  {
    TIDA::Event* h = new TIDA::Event();
    
    std::cout << "\n\nconstructing ..." << std::endl;
 
    TFile f("tree.root", "recreate");
    TTree *tree = new TTree("tree","tree");
 
    //  tree->Branch("Track","Int",&t,6400);
    tree->Branch("TIDA::Event", "TIDA::Event",&h,6400, 1);
 
    std::string ars[3] = { "ars0", "ars1", "ars2" };
 
    std::cout << "\n\nfilling ..." << std::endl;
    
    for ( int i=0; i<3 ; i++ ) {
      
      h->clear();
      
      h->run_number(10);
      h->event_number(i);
 
      std::cout << "\n\nEvent " << i << std::endl;
 
      for ( int j=0 ; j<2 ; j++ ) { 
 
    std::cout << "\n\tRoi " << j << std::endl;
 
    h->addChain( ars[j] );
 
    TIDA::Chain& tc = h->back();
    //  tc.addCombination();
 
    //  TrackCombination& c = h->back().back();
 
    TIDARoiDescriptor roi1( j+1.,  j+1-2.,  j+1+2.,
                j+3.,  j+3-1.1, j+3+1.1, 
                j+2.1, j+2.1-100, j+2.1+100 ); 
 
    for ( int ij=0 ; ij<j+1 ; ij++ ) roi1.push_back( TIDARoiDescriptor( ij, ij-0.2, ij+0.2,
                                        ij, ij-0.2, ij+0.2,
                                        ij, ij-0.2, ij+0.2 ) );
    
    std::cout << "Roi " << roi1 << std::endl;
 
    TIDARoiDescriptor roi2( j+1.,  j+1-2.,  j+1+2.,
                j+3.,  j+3-1.1, j+3+1.1, 
                j+2.1, j+2.1-100, j+2.1+100 ); 
 
    tc.addRoi( roi1 );
 
    tc.addRoi( roi2 );
    
      }
 
      cout << "TIDA::Event " << *h << endl;
 
      tree->Fill();
      
    }
    
    std::cout << "\n\nwriting ..." << std::endl;
 
 
    f.Write();
    f.Close();
 
  }
 
 
  {
    std::cout << "\n\nreading ..." << std::endl;
 
    TIDA::Event* hh = new TIDA::Event();
 
    TFile f("tree.root");
    TTree *tree = (TTree*)f.Get("tree");
    
    //  tree->Branch("Track","Int",&t,6400);
    tree->SetBranchAddress("TIDA::Event", &hh );
    
    for ( int i=0; i<tree->GetEntries() ; i++ ) {
    
      tree->GetEntry(i);
 
      cout << "TIDA::Event " << i << " " << *hh << endl;
      
    }
    
    f.Close();
    
  }
 
  return 0;
}