Example program to test JDETECTOR::JModuleMapper.  
More...
#include <string>
#include <iostream>
#include <iomanip>
#include "TROOT.h"
#include "TFile.h"
#include "TProfile.h"
#include "JDetector/JDetector.hh"
#include "JDetector/JDetectorToolkit.hh"
#include "JDetector/JModuleMapper.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"
 
Go to the source code of this file.
 | 
| int  | main (int argc, char **argv) | 
|   | 
Example program to test JDETECTOR::JModuleMapper. 
- Author
 - mdejong 
 
Definition in file JModuleMapper.cc.
 
◆ main()
      
        
          | int main  | 
          ( | 
          int |           argc,  | 
        
        
           | 
           | 
          char ** |           argv ) | 
        
      
 
Definition at line 24 of file JModuleMapper.cc.
   25{
   27 
   29  string         detectorFile;
   31 
   32  try { 
   33 
   34    JParser<> zap(
"Example program to test module mapping.");
 
   35    
   39    
   40    zap(argc, argv);
   41  }
   42  catch(const exception& error) {
   43    FATAL(error.what() << endl);
 
   44  }
   45 
   46 
   48 
   49 
   51 
   52  try {
   54  }
   57  }
   58 
   59 
   61 
   62  TProfile h1("h1", NULL, 1001,-0.5, 1000.5);
   63 
   65 
   66  for (int i = 1; i <= h1.GetNbinsX(); ++i) {
   67 
   68    const double x = h1.GetBinCenter(i);
 
   69    
   71 
   72    for (JDetector::const_iterator module = 
detector.begin(); module != 
detector.end(); ++module) {
 
   73      h1.Fill(x, (Double_t) mapper.getList(*module).size());
   74    }
   75  }
   76 
   77  out.Write();
   78  out.Close();
   79}
#define make_field(A,...)
macro to convert parameter to JParserTemplateElement object
 
Mapper for directly addressing of associated modules in the detector data structure.
 
Utility class to parse command line options.
 
void load(const std::string &file_name, JDetector &detector)
Load detector from input file.
 
This name space includes all other name spaces (except KM3NETDAQ, KM3NET and ANTARES).
 
Auxiliary class to match modules according maximal distance.