createPMTMap.cc

Go to the documentation of this file.

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

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

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


/**
 * \file
 *
 * Auxiliary program to create map for reference PMTs.
 *
 * the option 
 * <pre>
 *     -T "s" 
 * </pre>
 * or
 * <pre>
 *     -T{"s1","s2"} 
 * </pre>
 * has to be used with a vector of strings. This vector contains either the 
 * list of reference PMT identities or the keyword <tt>odd</tt>.
 * If the keyword <tt>odd</tt> is used, all the PMTs with an odd identity are 
 * listed in the output file. The parity is calculated as following: 
 * <pre>
 *      (floor id - 1)*31 + PMT id
 * </pre>
 * \author acreusot
 */

int main(int argc, char **argv)
{
  using namespace std;
  using namespace JPP;
  //using namespace KM3NETDAQ;

  string         detectorFile;
  string         outputFile;
  vector<string> mapType;
  int            debug;

  try {
    JParser<> zap("Auxiliary program to create PMT map files.");
    zap['a'] = make_field(detectorFile);
    zap['o'] = make_field(outputFile);
    zap['T'] = make_field(mapType);
    zap['d'] = make_field(debug)          = 1;
    zap(argc, argv);
  }

  catch(const exception &error) {
    FATAL(error.what() << endl);
  }

  fstream outstr(outputFile.c_str(), ofstream::out);
  JDetector detector;
  try {
    load(detectorFile, detector);
  }
  catch(const JException& error) {
    FATAL(error);
  }
  for (JDetector::const_iterator module = detector.begin(); module != detector.end(); ++module) {
    const int floorId = module->getFloor();
    const int domId = module->getID();
    for (unsigned int t = 0; t < mapType.size(); ++t) {
      if (mapType[t] == "odd") {
        for (unsigned int pmt = 0; pmt < NUMBER_OF_PMTS; ++pmt) {
          const int id = (floorId - 1)*NUMBER_OF_PMTS + pmt;
          if (id % 2 != 0) {
            outstr << domId << ' ' << pmt << endl;
          }
        }
      } else {
        outstr << domId << ' ' << mapType[t] << endl;
      } 
    } 
  }
  outstr.close();

}