DTRangeT0.cc

Go to the documentation of this file.

/*
 *  See header file for a description of this class.
 *
 *  \author Paolo Ronchese INFN Padova
 *
 */
 
//----------------------
// This Class' Header --
//----------------------
#include "CondFormats/DTObjects/interface/DTRangeT0.h"
 
//-------------------------------
// Collaborating Class Headers --
//-------------------------------
#include "CondFormats/DTObjects/interface/DTBufferTree.h"
 
//---------------
// C++ Headers --
//---------------
#include <iostream>
#include <sstream>
 
//-------------------
// Initializations --
//-------------------
 
//----------------
// Constructors --
//----------------
DTRangeT0::DTRangeT0() : dataVersion(" "), dBuf(new DTBufferTree<int, int>) { dataList.reserve(1000); }
 
DTRangeT0::DTRangeT0(const std::string& version) : dataVersion(version), dBuf(new DTBufferTree<int, int>) {
  dataList.reserve(1000);
}
 
DTRangeT0Id::DTRangeT0Id() : wheelId(0), stationId(0), sectorId(0), slId(0) {}
 
DTRangeT0Data::DTRangeT0Data() : t0min(0), t0max(0) {}
 
//--------------
// Destructor --
//--------------
DTRangeT0::~DTRangeT0() {}
 
DTRangeT0Id::~DTRangeT0Id() {}
 
DTRangeT0Data::~DTRangeT0Data() {}
 
//--------------
// Operations --
//--------------
int DTRangeT0::get(int wheelId, int stationId, int sectorId, int slId, int& t0min, int& t0max) const {
  t0min = t0max = 0;
 
  std::vector<int> chanKey;
  chanKey.reserve(4);
  chanKey.push_back(wheelId);
  chanKey.push_back(stationId);
  chanKey.push_back(sectorId);
  chanKey.push_back(slId);
  int ientry;
  //Guarantee const correctness for thread-safety
  const DTBufferTree<int, int>* constDBuf = dBuf;
  int searchStatus = constDBuf->find(chanKey.begin(), chanKey.end(), ientry);
  if (!searchStatus) {
    const DTRangeT0Data& data(dataList[ientry].second);
    t0min = data.t0min;
    t0max = data.t0max;
  }
 
  return searchStatus;
}
 
int DTRangeT0::get(const DTSuperLayerId& id, int& t0min, int& t0max) const {
  return get(id.wheel(), id.station(), id.sector(), id.superLayer(), t0min, t0max);
}
 
const std::string& DTRangeT0::version() const { return dataVersion; }
 
std::string& DTRangeT0::version() { return dataVersion; }
 
void DTRangeT0::clear() {
  dataList.clear();
  initialize();
  return;
}
 
int DTRangeT0::set(int wheelId, int stationId, int sectorId, int slId, int t0min, int t0max) {
  std::vector<int> chanKey;
  chanKey.reserve(4);
  chanKey.push_back(wheelId);
  chanKey.push_back(stationId);
  chanKey.push_back(sectorId);
  chanKey.push_back(slId);
  int ientry;
  int searchStatus = dBuf->find(chanKey.begin(), chanKey.end(), ientry);
 
  if (!searchStatus) {
    DTRangeT0Data& data(dataList[ientry].second);
    data.t0min = t0min;
    data.t0max = t0max;
    return -1;
  } else {
    DTRangeT0Id key;
    key.wheelId = wheelId;
    key.stationId = stationId;
    key.sectorId = sectorId;
    key.slId = slId;
    DTRangeT0Data data;
    data.t0min = t0min;
    data.t0max = t0max;
    ientry = dataList.size();
    dataList.push_back(std::pair<DTRangeT0Id, DTRangeT0Data>(key, data));
    dBuf->insert(chanKey.begin(), chanKey.end(), ientry);
    return 0;
  }
 
  return 99;
}
 
int DTRangeT0::set(const DTSuperLayerId& id, int t0min, int t0max) {
  return set(id.wheel(), id.station(), id.sector(), id.superLayer(), t0min, t0max);
}
 
DTRangeT0::const_iterator DTRangeT0::begin() const { return dataList.begin(); }
 
DTRangeT0::const_iterator DTRangeT0::end() const { return dataList.end(); }
 
std::string DTRangeT0::mapName() const {
  std::stringstream name;
  name << dataVersion << "_map_RangeT0" << this;
  return name.str();
}
 
void DTRangeT0::initialize() {
  dBuf->clear();
 
  int entryNum = 0;
  int entryMax = dataList.size();
  std::vector<int> chanKey;
  chanKey.reserve(4);
  while (entryNum < entryMax) {
    const DTRangeT0Id& chan = dataList[entryNum].first;
 
    chanKey.clear();
    chanKey.push_back(chan.wheelId);
    chanKey.push_back(chan.stationId);
    chanKey.push_back(chan.sectorId);
    chanKey.push_back(chan.slId);
    dBuf->insert(chanKey.begin(), chanKey.end(), entryNum++);
  }
  return;
}