JPrintEvt.cc File Reference

#include <string>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include "TROOT.h"
#include "TFile.h"
#include "km3net-dataformat/offline/Head.hh"
#include "km3net-dataformat/offline/Evt.hh"
#include "km3net-dataformat/definitions/fitparameters.hh"
#include "km3net-dataformat/tools/time_converter.hh"
#include "JAAnet/JHead.hh"
#include "JAAnet/JHeadToolkit.hh"
#include "JAAnet/JAAnetToolkit.hh"
#include "JDAQ/JDAQEventIO.hh"
#include "JSupport/JParallelFileScanner.hh"
#include "JSupport/JTreeScanner.hh"
#include "JSupport/JMonteCarloFileSupportkit.hh"
#include "JSupport/JSupport.hh"
#include "JReconstruction/JEvt.hh"
#include "JReconstruction/JEvtToolkit.hh"
#include "JLang/JVectorize.hh"
#include "Jeep/JPrint.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"

Go to the source code of this file.

Macros
#define	MAKE_ENTRY(A)

Functions
int	main (int argc, char **argv)
	Auxiliary program to print fit results;.

Macro Definition Documentation

MAKE_ENTRY

#define MAKE_ENTRY

(

A

)

Value:

std::make_pair(#A, A)

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Auxiliary program to print fit results;.

Definition at line 155 of file JPrintEvt.cc.

{
  using namespace std;
  using namespace JPP;
  using namespace KM3NETDAQ;
 
  typedef JParallelFileScanner< JTypeList<JDAQEvent, JEvt> >  JParallelFileScanner_t;
  typedef JParallelFileScanner_t::multi_pointer_type          multi_pointer_type;
 
  JParallelFileScanner_t inputFile;
  JLimit_t&              numberOfEvents = inputFile.getLimit();
  JQualitySorter         quality_sorter;
  size_t                 numberOfFits;
  vector<string>         keys;
  set   <string>         option;
  int                    debug;
 
  try {
 
    JParser<> zap("Auxiliary program to print fit results.");
 
    zap['f'] = make_field(inputFile);
    zap['n'] = make_field(numberOfEvents)      = JLimit::max();
    zap['L'] = make_field(quality_sorter)      = JPARSER::initialised();
    zap['N'] = make_field(numberOfFits)        = 1;
    zap['k'] = make_field(keys,   "print optional weights: " << get_keys(getWeight))         = JPARSER::initialised();
    zap['+'] = make_field(option, "print optional data: " << MONTECARLO << ", " << HISTORY)  = JPARSER::initialised();
    zap['d'] = make_field(debug)               = 2;
 
    zap(argc, argv);
  }
  catch(const exception& error) {
    FATAL(error.what() << endl);
  }
 
 
  const int WIDTH = 16;
  
  JTreeScanner<Evt> mc(inputFile);
 
  Vec offset(0,0,0);
 
  try {
    offset = getOffset(getHeader(inputFile));
  } catch(const exception& error) {}
  
    
  while (inputFile.hasNext()) {
 
    cout << "event: " << setw(10) << inputFile.getCounter() << endl;
 
    multi_pointer_type ps = inputFile.next();
 
    JDAQEvent* tev   = ps;
    JEvt*      evt   = ps;
    
    if (quality_sorter.is_valid()) {
      sort(evt->begin(), evt->end(), quality_sorter);
    }
      
    time_converter converter;
 
    cout << "trigger: " << setw(10) << tev->getCounter() << ' ' 
         << tev->getTimesliceStart() << endl;
    
    if (mc.getEntries() != 0) {
 
      Evt* event = mc.getEntry(tev->getCounter());
 
      if (event != NULL) {
 
        converter = time_converter(*event, *tev);
 
        if (option.count(MONTECARLO) != 0) {
 
          if (has_neutrino(*event)) {
 
            JTrack ta = getTrack(get_neutrino(*event));
 
            ta.add(getPosition(offset));
            
            cout << LEFT(WIDTH) << "neutrino" << right << ' ' << ta << endl;
          }
          
 
          for (vector<Trk>::const_iterator i = event->mc_trks.begin(); i != event->mc_trks.end(); ++i) {
 
            JTrack ta = getTrack(*i);
 
            ta.add(getPosition(offset));
          
            cout << LEFT(WIDTH) << (is_muon    (*i) ? "muon"     :
                                    is_electron(*i) ? "electron" :
                                    is_hadron  (*i) ? "hadron"   : "other") << right << ' ' << ta << endl;
          }
        }
      }
    }
 
    cout << "number of fits " << setw(4) << right << evt->size() << endl;
 
    for (size_t i = 0; i != min(evt->size(), numberOfFits); ++i) {
 
      const JFit& fit = (*evt)[i];
      
      JTrack tb = getTrack(fit);
      
      tb.sub(converter.putTime());
      
      cout << LEFT(WIDTH) << "fit" << right          << ' '  
           << tb                                     << ' ' 
           << FIXED(7,2)  << fit.getQ()              << ' '
           << setw(2)     << fit.getHistory().size() << '/' << fit.getStatus();
 
      for (const auto& key : keys) {
        cout << ' ' << SCIENTIFIC(12,3) << getWeight(fit, key, 0.0);
      }
      
      cout << endl;
 
      for (size_t row = 0; row != fit.getDimensionOfErrorMatrix(); ++row) {
        for (size_t col = 0; col <= row; ++col) {
          cout << ' ' << SCIENTIFIC(12,3) << fit.getV(row,col);
        }
        cout << endl;
      }
 
      if (option.count(HISTORY) != 0) {
        cout << fit.getHistory() << endl;
      }
    }
  }
}