JPrintFit.cc File Reference

#include <string>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include "TROOT.h"
#include "TFile.h"
#include "evt/Head.hh"
#include "evt/Evt.hh"
#include "evt/io_ascii.hh"
#include "evt/io_jpp.hh"
#include "JAAnet/JHead.hh"
#include "JAAnet/JHeadToolkit.hh"
#include "JDAQ/JDAQEvent.hh"
#include "JTrigger/JTimeConverter.hh"
#include "JSupport/JParallelFileScanner.hh"
#include "JSupport/JTreeScanner.hh"
#include "JSupport/JMonteCarloFileSupportkit.hh"
#include "JSupport/JSupport.hh"
#include "JFit/JEvt.hh"
#include "JFit/JEvtToolkit.hh"
#include "JFit/JFitParameters.hh"
#include "Jeep/JPrint.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"

Go to the source code of this file.

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

Function Documentation

main()

int main	(	int	argc,
		char **	argv
	)

Auxiliary program to print fit results;.

Definition at line 84 of file JPrintFit.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;
  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['d'] = make_field(debug)               = 2;
 
    zap(argc, argv);
  }
  catch(const exception& error) {
    FATAL(error.what() << endl);
  }
 
 
 
  const int WIDTH = 16;
  
  JTreeScanner<Evt> mc(inputFile);
 
  JPosition3D center(0,0,0);
 
  try {
    center = get<JPosition3D>(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);
    }
      
    JTimeConverter converter;
 
    
    if (mc.getEntries() != 0) {
 
      Evt* event = mc.getEntry(tev->getCounter());
 
      if (event != NULL) {
 
        converter = JTimeConverter(*event, *tev);
 
        if (has_neutrino(*event)) {
 
          JTrack ta = getTrack(get_neutrino(*event));
 
          ta.add(center);
            
          cout << LEFT(WIDTH) << "neutrino" << ' ' << ta << endl;
        }
          
        vector<Trk>::const_iterator track = find_if(event->mc_trks.begin(), event->mc_trks.end(), is_muon);
 
        if (track != event->mc_trks.end()) {
 
          JTrack ta = getTrack(*track);
 
          ta.add(center);
            
          cout << LEFT(WIDTH) << "muon" << ' ' << 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" << ' ' << tb << ' ' << fit.getQ() << ' ' << fit.getE() << endl;
      cout << fit.getHistory() << endl;
    }
  }
}