ValidationTreeStruct.h

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
 
#pragma once
#include <cmath>
 
namespace Belle2 {
  namespace TOP {
 
    struct ValidationTreeStruct {
      enum {c_numModules = 16}; 
      int expNo = 0; 
      int runNo = 0; 
      int numTracks = 0; 
      float commonT0 = 0;  
      float commonT0Err = 0; 
      float moduleT0[c_numModules] = {0};  
      float moduleT0Err[c_numModules] = {0}; 
      int numTBCalibrated[c_numModules] = {0}; 
      int numT0Calibrated[c_numModules] = {0}; 
      int numActive[c_numModules] = {0}; 
      int numActiveCalibrated[c_numModules] = {0}; 
      float thrEffi[c_numModules] = {0}; 
      float asicShifts[4] = {0}; 
      float svdOffset = 0; 
      float svdSigma = 0; 
      float cdcOffset = 0; 
      float cdcSigma = 0; 
      float fillPatternOffset = 0; 
      float fillPatternFraction = 0; 
      int numMerged = 0; 
      void clear();
 
      void clearNumMerged() {numMerged = 0;}
 
      void merge(const ValidationTreeStruct& other);
 
      void rescaleErrors(double scaleFactor);
 
      void add(float& x, float& e, float x1, float e1);
 
    };
 
 
    inline void ValidationTreeStruct::add(float& x, float& e, float x1, float e1)
    {
      if (e1 == 0) return;
      if (e == 0) {
        x = x1;
        e = e1;
        return;
      }
      e *= e;
      e1 *= e1;
      float s = 1 / e + 1 / e1;
      x = (x / e + x1 / e1) / s;
      e = sqrt(1 / s);
    }
 
  } // TOP
} // Belle2