JRangeTest1D.cc File Reference

Auxiliary program for y-range test of 1D histograms. More...

#include <string>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include "TROOT.h"
#include "TFile.h"
#include "TKey.h"
#include "TString.h"
#include "TRegexp.h"
#include "TH1.h"
#include "TProfile.h"
#include "JTools/JRange.hh"
#include "JGizmo/JRootObjectID.hh"
#include "JGizmo/JGizmoToolkit.hh"
#include "Jeep/JColor.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 y-range test of 1D histograms.

Author

mdejong

Definition in file JRangeTest1D.cc.

Function Documentation

int main	(	int	argc,
		char **	argv
	)

Definition at line 29 of file JRangeTest1D.cc.

{
  using namespace std;
  using namespace JPP;

  typedef JRange<Double_t>        JRange_t;
  typedef map<TString, JRange_t>  map_type;

  vector<JRootObjectID>  inputFile;
  JRange_t               X;
  JRange_t               Y;
  bool                   invertX;
  bool                   invertY;
  int                    numberOfOutliers;
  map_type               zmap;
  int                    debug;

  try {

    JParser<> zap("Auxiliary program to test contents of 1D histograms.");

    zap['f'] = make_field(inputFile,  "measurement histogram, e.g: <file name>:<object name>");
    zap['x'] = make_field(X,          "accepted x-range values")   = JRange_t();
    zap['y'] = make_field(Y,          "accepted y-range values")   = JRange_t();
    zap['X'] = make_field(invertX);
    zap['Y'] = make_field(invertY);
    zap['N'] = make_field(numberOfOutliers)                        = 0;
    zap['H'] = make_field(zmap,       "global tests")              = JPARSER::initialised();
    zap['d'] = make_field(debug)                                   = 1;

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


  int number_of_failures = 0;

  for (vector<JRootObjectID>::const_iterator input = inputFile.begin(); input != inputFile.end(); ++input) {

    DEBUG("Input: " << *input << endl);

    TDirectory* dir = getDirectory(*input);

    if (dir == NULL) {
      ERROR("File: " << input->getFullFilename() << " not opened." << endl);
      continue;
    }

    const TRegexp regexp(input->getObjectName());

    TIter iter(dir->GetListOfKeys());

    for (TKey* key; (key = (TKey*) iter.Next()) != NULL; ) {

      const TString tag(key->GetName());

      DEBUG("Key: " << tag << " match = " << tag.Index(regexp) << " (-1 /= OK)" << endl);
        
      // option match

      if (tag.Index(regexp) != -1) {

        TObject* p = key->ReadObj();


        TH1* h1 = NULL;
        
        if (h1 == NULL && dynamic_cast<TProfile*>(p) != NULL) { h1 = dynamic_cast<TProfile*>(p)->ProjectionX(); }
        
        if (h1 == NULL && dynamic_cast<TH1*>(p)      != NULL) { h1 = dynamic_cast<TH1*>(p); }
        
        if (h1 == NULL) {
          FATAL("Object at " << *input << " is not TH1." << endl);
        };


        for (map_type::const_iterator i = zmap.begin(); i != zmap.end(); ++i) {

          const double    value = getResult(i->first, h1);
          const JRange_t& range = i->second;

          DEBUG("Global test " << i->first << ' ' << (range(value) ? "passed" : "failed") << endl);

          ASSERT(range(value));
        }
        

        int number_of_outliers = 0;

        for (Int_t i = 1; i <= h1->GetNbinsX(); ++i) {

          const Double_t x = h1->GetBinCenter (i);
          const Double_t y = h1->GetBinContent(i);
          
          if (X(x) == !invertX) {

            const bool ok = (Y(y) == !invertY);

            DEBUG("Test outlier " << h1->GetName() << " bin (" << i << ") " << y << ' ' << (ok ? "passed" : "failed") << endl);
            
            if (!ok) {
              ++number_of_outliers;
            }
          }
        }

        cout << (number_of_outliers > numberOfOutliers ? RED : GREEN);
        NOTICE("Number of outliers \"" << h1->GetName() << "\" = " << number_of_outliers << endl);
        cout << RESET;

        if (number_of_outliers > numberOfOutliers) {
          ++number_of_failures;
        }
      }
    }
  }

  ASSERT(number_of_failures == 0);

  return 0;
}