OnlineDB/CSCCondDB/interface/CSCChamberMapValues.h - master - githubmirror/cmssw

OnlineDB/CSCCondDB/interface/CSCChamberMapValues.h

76 строк2 KB

Christopher Jones

Move to EventSetupRecordInfiniteIntervalFinder

16 июн 2026, 21:21

16 июн 2026, 21:21419a1ec

#ifndef _CSCCHAMBERMAPVALUES_H
#define _CSCCHAMBERMAPVALUES_H

#include <memory>
#include "FWCore/Framework/interface/SourceFactory.h"
#include "FWCore/Framework/interface/Frameworkfwd.h"
#include "FWCore/Framework/interface/ESProducer.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCore/Framework/interface/MakerMacros.h"
#include "FWCore/Framework/interface/EventSetupRecordInfiniteIntervalFinder.h"
#include "FWCore/Framework/interface/ESHandle.h"
#include "FWCore/Framework/interface/EventSetup.h"
#include "FWCore/ParameterSet/interface/ParameterSet.h"

#include <DataFormats/MuonDetId/interface/CSCDetId.h>
#include "CondFormats/CSCObjects/interface/CSCChamberMap.h"
#include "CondFormats/DataRecord/interface/CSCChamberMapRcd.h"
#include "OnlineDB/CSCCondDB/interface/CSCChamberMapValues.h"
#include "CondFormats/CSCObjects/interface/CSCMapItem.h"
#include "OnlineDB/CSCCondDB/interface/CSCMap1.h"

class CSCChamberMapValues : public edm::ESProducer, public edm::EventSetupRecordInfiniteIntervalFinder {
public:
  explicit CSCChamberMapValues(const edm::ParameterSet &);
  ~CSCChamberMapValues() override;

  typedef std::unique_ptr<CSCChamberMap> ReturnType;

  inline static CSCChamberMap *fillChamberMap();

  ReturnType produceChamberMap(const CSCChamberMapRcd &);

private:
};

#include <fstream>
#include <vector>
#include <iostream>

// to workaround plugin library
inline CSCChamberMap *CSCChamberMapValues::fillChamberMap() {
  CSCChamberMap *mapobj = new CSCChamberMap();
  cscmap1 map;
  CSCMapItem::MapItem item;

  int i, j, k, l;  //i - endcap, j - station, k - ring, l - chamber.
  int r, c;        //r - number of rings, c - number of chambers.
  int count = 0;
  int chamberid;

  /* This is version for 540 chambers. */
  for (i = 1; i <= 2; ++i) {
    for (j = 1; j <= 4; ++j) {
      if (j == 1)
        r = 3;
      //else if(j==4) r=1;
      else
        r = 2;
      for (k = 1; k <= r; ++k) {
        if (j > 1 && k == 1)
          c = 18;
        else
          c = 36;
        for (l = 1; l <= c; ++l) {
          chamberid = i * 100000 + j * 10000 + k * 1000 + l * 10;
          map.chamber(chamberid, &item);
          mapobj->ch_map[chamberid] = item;
          count = count + 1;
        }
      }
    }
  }
  return mapobj;
}

#endif