JEvtMerge.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/JMultipleFileScanner.hh"
#include "JSupport/JTreeScanner.hh"
#include "JSupport/JMonteCarloFileSupportkit.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 JEvtMerge.cc.

Function Documentation

int main	(	int	argc,
		char **	argv
	)

Definition at line 57 of file JEvtMerge.cc.

{
  using namespace std;
  using namespace JPP;

  typedef typename JTYPELIST<Head, MultiHead, Evt, JMeta>::typelist  typelist;
  
  vector<string>          inputFile;
  JFileRecorder<typelist> outputFile;
  int                     debug;

  try {
    
    JParser<> zap("Auxiliary program for time sorting of Monte-Carlo events.");
    
    zap['f'] = make_field(inputFile);
    zap['o'] = make_field(outputFile);
    zap['d'] = make_field(debug)               = 2;

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


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

  const size_t N = inputFile.size();

  typedef JTreeScanner      <Evt>  JScanner_t;
  //typedef JSingleFileScanner<Evt>  JScanner_t;

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

  vector<JScanner_t> in(N);

  for (size_t i = 0; i != N; ++i) {

    in[i].configure(inputFile[i]);

    STATUS("Processing " << inputFile[i] << endl);
  }

#ifdef PRIORITY_QUEUE

  priority_queue<entry_type, deque<entry_type> > buffer;    // multiplex

  for (size_t i = 0; i != N; ++i) {

    if (in[i].hasNext()) {

      buffer.push({i, *in[i].next()});

      --number_of_events;
    }
  }

  while (number_of_events != 0) {                           // process

    STATUS("event: " << setw(10) << number_of_events << '\r'); DEBUG(endl);

    const entry_type& top = buffer.top();

    outputFile.put(top.evt);

    if (in[top.index].hasNext()) {

      buffer.push({top.index, *in[top.index].next()});

      --number_of_events;
    }
      
    buffer.pop();
  }

  while (!buffer.empty()) {                                 // flush

    const entry_type& top = buffer.top();

    outputFile.put(top.evt);
      
    buffer.pop();
  }

#else

  vector<entry_type> buffer;                                // multiplex

  for (size_t i = 0; i != N; ++i) {

    if (in[i].hasNext()) {

      buffer.push_back({i, *in[i].next()});

      --number_of_events;
    }
  }

  make_heap(buffer.begin(), buffer.end());

  while (number_of_events != 0) {                           // process

    STATUS("event: " << setw(10) << number_of_events << '\r'); DEBUG(endl);

    const size_t index = buffer[0].index;

    outputFile.put(buffer[0].evt);
      
    pop_heap(buffer.begin(), buffer.end());

    buffer.pop_back();

    if (in[index].hasNext()) {

      buffer.push_back({index, *in[index].next()});

      push_heap(buffer.begin(), buffer.end());      

      --number_of_events;
    }
  }

  sort_heap(buffer.begin(), buffer.end());                  // flush

  for (vector<entry_type>::const_reverse_iterator top = buffer.rbegin(); top != buffer.rend(); ++top) {
    outputFile.put(top->evt);
  }
#endif
  STATUS(endl);

  for (size_t i = 0; i != N; ++i) {

    JSingleFileScanner<JRemove<typelist, Evt>::typelist> io(inputFile[i]);

    io >> outputFile;
  }

  outputFile.close();

  return 0;
}