JMuonPrefit.cc

Go to the documentation of this file.

#include <string>
#include <iostream>
#include <iomanip>

#include "km3net-dataformat/offline/Head.hh"
#include "km3net-dataformat/offline/Evt.hh"

#include "JDAQ/JDAQEventIO.hh"
#include "JDAQ/JDAQTimesliceIO.hh"
#include "JDAQ/JDAQSummarysliceIO.hh"

#include "JTrigger/JTriggerParameters.hh"

#include "JDetector/JDetector.hh"
#include "JDetector/JDetectorToolkit.hh"
#include "JDetector/JModuleRouter.hh"

#include "JSupport/JSupport.hh"
#include "JSupport/JSingleFileScanner.hh"
#include "JSupport/JFileRecorder.hh" 
#include "JSupport/JMeta.hh"

#include "JReconstruction/JEvt.hh"
#include "JReconstruction/JMuonPrefit.hh"
#include "JReconstruction/JMuonPrefitParameters_t.hh"

#include "JLang/JPredicate.hh"
#include "JLang/JComparison.hh"

#include "Jeep/JParser.hh" 
#include "Jeep/JMessage.hh"


/**
 * \file
 *
 * Program to perform linear fits JFIT::JEstimator<JFIT::JLine1Z> covering the solid angle producing JFIT::JEvt data.
 *
 * \author mdejong, gmaggi
 */
int main(int argc, char **argv)
{
  using namespace std;
  using namespace JPP;
  using namespace KM3NETDAQ;
  
  typedef JTYPELIST<JRemove<JAllTypes_t, JDAQTimesliceTypes_t>::typelist, JEvt>::typelist  typelist;
  typedef JSingleFileScanner<JDAQEvent>                                                    JSingleFileScanner_t;

  JSingleFileScanner_t    inputFile;
  JFileRecorder<typelist> outputFile;
  JLimit_t&               numberOfEvents = inputFile.getLimit();
  string                  detectorFile;
  JMuonPrefitParameters_t parameters;
  int                     debug;

  try { 

    JParser<> zap("Program to perform pre-fit of muon trajectory to data.");
    
    zap['f'] = make_field(inputFile);
    zap['o'] = make_field(outputFile)          = "prefit.root";
    zap['a'] = make_field(detectorFile);
    zap['n'] = make_field(numberOfEvents)      = JLimit::max();
    zap['@'] = make_field(parameters)          = JPARSER::initialised();
    zap['d'] = make_field(debug)               = 1;

    zap(argc, argv);    
  }
  catch(const exception& error) {
    FATAL(error.what() << endl);
  }
  
  cout.tie(&cerr);
  
  JDetector detector;

  try {
    load(detectorFile, detector);
  }
  catch(const JException& error) {
    FATAL(error);
  }

  const JModuleRouter router(detector);    

  JMuonPrefit fit(parameters, router, debug);

  outputFile.open();
  outputFile.put(JMeta(argc, argv));

  while (inputFile.hasNext()) {

    STATUS("event: " << setw(10) << inputFile.getCounter() << '\r'); DEBUG(endl);

    const JDAQEvent* tev  = inputFile.next();
    
    JEvt out = fit(*tev);
    

    if (parameters.numberOfPrefits > 0) {


      // apply default sorter

      JEvt::iterator __end = out.end();

      if (parameters.numberOfPrefits < out.size()) {

        advance(__end = out.begin(), parameters.numberOfPrefits);

        partial_sort(out.begin(), __end, out.end(), qualitySorter);

      } else {

        sort(out.begin(), __end, qualitySorter);
      }

      // add downward pointing solutions if available but not yet sufficient

      int nz = parameters.numberOfDZMax - count_if(out.begin(), __end, make_predicate(&JFit::getDZ, parameters.DZMax, JComparison::le()));

      if (nz > 0) {

        JEvt::iterator __p = __end;
        JEvt::iterator __q = __end = partition(__p, out.end(), make_predicate(&JFit::getDZ, parameters.DZMax, JComparison::le()));

        if (nz < distance(__p, __q)) {

          advance(__end = __p, nz);

          partial_sort(__p, __end, __q, qualitySorter);

        } else {
            
          sort(__p, __end, qualitySorter);
        }
      }

      out.erase(__end, out.end());

    } else {

      sort(out.begin(), out.end(), qualitySorter);
    }

    outputFile.put(out);
  }
  STATUS(endl);

  JSingleFileScanner<JRemove<typelist, JEvt>::typelist> io(inputFile);

  io >> outputFile;

  outputFile.close();
}