61 std::vector<int> chanKey{wheelId, stationId, sectorId};
62 std::vector<int>
const* confPtr;
63 int searchStatus =
dBuf->
find(chanKey.begin(), chanKey.end(), confPtr);
76 std::vector<std::pair<DTCCBId, int>*> tempList;
79 while (d_iter != d_iend)
80 tempList.push_back(
new std::pair<DTCCBId, int>(*d_iter++));
81 std::vector<std::pair<DTCCBId, int>*>::iterator t_iter = tempList.begin();
82 std::vector<std::pair<DTCCBId, int>*>::iterator t_iend = tempList.end();
83 while (t_iter != t_iend) {
84 std::pair<DTCCBId, int>* ptr = *t_iter++;
88 std::vector<int> cfgKeys;
89 cfgKeys.push_back(ptr->second);
90 std::vector<std::pair<DTCCBId, int>*>::iterator n_iter(t_iter);
91 while (n_iter != t_iend) {
92 std::pair<DTCCBId, int>*& pck = *n_iter++;
98 cfgKeys.push_back(pck->second);
103 keyList.push_back(std::pair<
DTCCBId, std::vector<int> >(ccbId, cfgKeys));
124 std::vector<int> chanKey{wheelId, stationId, sectorId};
126 std::vector<int>* confPtr;
127 int searchStatus =
dBuf->
find(chanKey.begin(), chanKey.end(), confPtr);
130 std::vector<std::pair<DTCCBId, int> > tempList;
133 while (iter != iend) {
134 const DTCCBId& ccbId(iter->first);
136 tempList.push_back(*iter);
144 std::vector<int>::const_iterator cfgIter = confKey.begin();
145 std::vector<int>::const_iterator cfgIend = confKey.end();
146 while (cfgIter != cfgIend)
147 dataList.push_back(std::pair<DTCCBId, int>(ccbId, *cfgIter++));
151 dBuf->
insert(chanKey.begin(), chanKey.end(), std::make_unique<std::vector<int> >(confKey));
156 std::vector<int>::const_iterator cfgIter = confKey.begin();
157 std::vector<int>::const_iterator cfgIend = confKey.end();
158 while (cfgIter != cfgIend)
159 dataList.push_back(std::pair<DTCCBId, int>(ccbId, *cfgIter++));
169 std::vector<int> chanKey{wheelId, stationId, sectorId};
175 std::vector<int>::const_iterator iter = confKey.begin();
176 std::vector<int>::const_iterator iend = confKey.end();
179 std::vector<int>* confPtr;
180 int searchStatus =
dBuf->
find(chanKey.begin(), chanKey.end(), confPtr);
183 std::unique_ptr<std::vector<int> > newVector(
new std::vector<int>);
184 confPtr = newVector.get();
188 while (iter != iend) {
190 dataList.push_back(std::pair<DTCCBId, int>(ccbId,
key));
191 confPtr->push_back(
key);
214 std::vector<int> chanKey;
216 while (iter != iend) {
220 chanKey.push_back(
chan.wheelId);
221 chanKey.push_back(
chan.stationId);
222 chanKey.push_back(
chan.sectorId);
223 std::vector<int>* ccbConfPtr;
224 int searchStatus =
dBuf->
find(chanKey.begin(), chanKey.end(), ccbConfPtr);
227 std::unique_ptr<std::vector<int> > newVector(
new std::vector<int>);
228 ccbConfPtr = newVector.get();
231 ccbConfPtr->push_back(iter->second);
std::vector< std::pair< DTCCBId, std::vector< int > > > ccb_config_map
std::vector< std::pair< DTCCBId, int > > dataList
const std::string & version() const
access version
std::vector< DTConfigKey > fullConfigKey
std::vector< std::pair< DTCCBId, int > >::const_iterator const_iterator
Access methods to data.
key
prepare the HTCondor submission files and eventually submit them
ccb_config_map configKeyMap() const
chan
lumi = TPaveText(lowX+0.38, lowY+0.061, lowX+0.45, lowY+0.161, "NDC") lumi.SetBorderSize( 0 ) lumi...
int find(ElementKey fKey, ElementKey lKey, typename DTBufferTreeTrait< Content >::outputTypeOfConstFind &cont) const
int insert(ElementKey fKey, ElementKey lKey, Content cont)
int configKey(int wheelId, int stationId, int sectorId, std::vector< int > &confKey) const
void clear()
reset content
edm::ConstRespectingPtr< DTBufferTreeUniquePtr > dBuf
std::vector< DTConfigKey > fullKey() const
const_iterator end() const
const_iterator begin() const
int setConfigKey(int wheelId, int stationId, int sectorId, const std::vector< int > &confKey)
void setFullKey(const std::vector< DTConfigKey > &)
int appendConfigKey(int wheelId, int stationId, int sectorId, const std::vector< int > &confKey)