ClosedRange.h

/**************************************************************************
 * BASF2 (Belle Analysis Framework 2)                                     *
 * Copyright(C) 2013 - Belle II Collaboration                             *
 *                                                                        *
 * Author: The Belle II Collaboration                                     *
 * Contributors: Eugenio Paoloni                                          *
 *                                                                        *
 * This software is provided "as is" without any warranty.                *
 **************************************************************************/
 
#pragma once
 
#include <tracking/trackFindingVXD/filterMap/filterFramework/TBranchLeafType.h>
#include <TBranch.h>
#include <TTree.h>
 
#include <framework/logging/Logger.h>
 
#include <string>
 
namespace Belle2 {
  template< typename MinType, typename MaxType>
  class ClosedRange {
  public:
 
    ClosedRange(MinType min, MaxType max): m_min(min), m_max(max) {};
    ClosedRange(): m_min(0), m_max(0) {};
 
    template< class VariableType >
    inline bool contains(const VariableType& x) const { return m_min <= x && x <= m_max ;};
 
    void persist(TTree* t, const std::string& branchName, const std::string& variableName)
    {
 
      std::string leafList;
      leafList += variableName;
      leafList += "_min/";
      leafList += TBranchLeafType(m_min);
      leafList += ":";
      leafList += variableName;
      leafList += "_max/";
      leafList += TBranchLeafType(m_max);
      TBranch* branch = new TBranch(t, branchName.c_str() , & m_min, leafList.c_str());
      t->GetListOfBranches()->Add(branch);
    }
 
    void setBranchAddress(TTree* t, const std::string& branchName,
                          const std::string& /*variableName*/)
    {
      // sets branch address and checks for validity
      if (t->SetBranchAddress(branchName.c_str(), & m_min) < 0) B2FATAL("ClosedRange: branch address not valid");
    }
 
    MinType getInf(void) const { return m_min; } ;
 
    MaxType getSup(void) const { return m_max; } ;
 
 
    std::string getNameAndReference(std::vector< std::pair<char, void*> >* pointers = nullptr,
                                    const std::string& varname = "X")
    {
      std::string minVal = std::to_string(m_min);
      std::string maxVal = std::to_string(m_max);
      // if pointer to vector is provided fill it
      if (pointers != nullptr) {
        // use the position in the vector as unique identifier
        minVal = "#" + std::to_string(pointers->size());
        (*pointers).push_back({TBranchLeafType(m_min), &m_min});
        maxVal = "#" + std::to_string(pointers->size());
        (*pointers).push_back({TBranchLeafType(m_max), &m_max});
      }
      return ("(" + minVal + " <= " + varname + " <= " + maxVal + ")");
    }
 
  private:
 
    // NOTE: the persit function assumes that these data members (m_min, m_max) are in exactly that
    // order defined! So DO NOT move these declarations!!!!
    MinType m_min;
    MaxType m_max;
 
  };
 
 
}