JEvtSplit.cc File Reference

Auxiliary program for time sorting of Monte-Carlo events. More...

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include "km3net-dataformat/offline/Head.hh"
#include "km3net-dataformat/offline/MultiHead.hh"
#include "km3net-dataformat/offline/Evt.hh"
#include "JLang/JException.hh"
#include "JSupport/JMeta.hh"
#include "JSupport/JSupport.hh"
#include "JSupport/JFileRecorder.hh"
#include "JSupport/JSingleFileScanner.hh"
#include "JSupport/JTreeScanner.hh"
#include "JSupport/JMonteCarloFileSupportkit.hh"
#include "Jeep/JeepToolkit.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"

Go to the source code of this file.

Functions
int	main (int argc, char **argv)

Detailed Description

Auxiliary program for time sorting of Monte-Carlo events.

Author

mdejong

Definition in file JEvtSplit.cc.

Function Documentation

int main	(	int	argc,
		char **	argv
	)

Definition at line 54 of file JEvtSplit.cc.

{
  using namespace std;
  using namespace JPP;

  typedef typename JTYPELIST<Head, MultiHead, Evt, JMeta>::typelist  typelist;

  string    inputFile;
  string    outputFile;
  size_t    numberOfFiles;
  Long64_t  autoflush;
  int       debug;

  try {
    
    JParser<> zap("Auxiliary program for time sorting of Monte-Carlo events.");
    
    zap['f'] = make_field(inputFile);
    zap['o'] = make_field(outputFile, "If number of files > " << 1 
                          << ", file name should contain wild card \'" << FILENAME_WILD_CARD << "\'");
    zap['N'] = make_field(numberOfFiles)       = 1;
    zap['R'] = make_field(autoflush)           = 1000;
    zap['d'] = make_field(debug)               = 2;

    zap(argc, argv);
  }
  catch(const exception& error) {
    FATAL(error.what() << endl);
  }


  if (numberOfFiles == 0) {
    numberOfFiles = 1;
  }

  if (numberOfFiles > 1 && !hasWildCard(outputFile)) {
    FATAL("Output file name should contain wildcard \'" << FILENAME_WILD_CARD << "\'" << endl);
  }

  JTreeScanner<Evt> in(inputFile);
  
  counter_type number_of_events = in.getEntries();

  counter_type ns = (number_of_events + numberOfFiles - 1) / numberOfFiles;
  counter_type ni = 0;

  vector<Evt> buffer;

  for (size_t i = 0; i != numberOfFiles; ++i, ni += ns) {

    const JLimit limit(ni, min(ni + ns, number_of_events));

    const string filename(hasWildCard(outputFile) ? setWildCard(outputFile, to_string(i)) : outputFile);

    STATUS("Processing " << filename << ' ' << limit << "." << flush);

    buffer.clear();

    for (in.setLimit(limit); in.hasNext(); ) {
      buffer.push_back(*in.next());
    }

    STATUS("." << flush);

    sort(buffer.begin(), buffer.end(), JCompare_t());

    STATUS("." << flush);

    JFileRecorder<typelist> out(filename.c_str());

    out.open();
    
    dynamic_cast<JTreeWriterObjectOutput<Evt>&>(*out).getTreeWriter().SetAutoFlush(autoflush);

    out.put(JMeta(argc, argv));

    for (const auto& evt : buffer) {
      out.put(evt);
    }

    if (i == 0) {

      JSingleFileScanner<JRemove<typelist, Evt>::typelist> io(inputFile);
 
      io >> out;
    }

    out.close();

    STATUS("OK" << endl);
  }

  return 0;
}