1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
#ifndef DataFormats_Common_DataFrameContainer_h
#define DataFormats_Common_DataFrameContainer_h
#include "DataFormats/Common/interface/DataFrame.h"
#include "FWCore/Utilities/interface/thread_safety_macros.h"
#include <boost/iterator/transform_iterator.hpp>
#include <boost/iterator/counting_iterator.hpp>
#include <vector>
#include <algorithm>
#include <cstddef> // for size_t
#include <utility> // for pair
class TestDataFrame;
template <typename DigiCollection>
class TestEcalDigi;
namespace edm {
/** an optitimized container that linearized a "vector of vector".
* It corresponds to a set of fixed size array of 16bit words each belonging
* to a "channel" identified by an 32bit id
*
* FIXME interface to be finalized once use-cases fully identified
*
* although it can be sorted internally it is strongly adviced to
* fill it already sorted....
*
* NOTE: The iterator used by DataFrameContainer can not safely be used across threads, even if only call const methods
*/
class DataFrameContainer {
public:
typedef unsigned int size_type; // for persistency
typedef unsigned int id_type;
typedef unsigned short data_type;
typedef std::vector<id_type> IdContainer;
typedef std::vector<data_type> DataContainer;
typedef std::vector<id_type>::iterator IdIter;
typedef std::vector<data_type>::iterator DataIter;
typedef std::pair<IdIter, DataIter> IterPair;
typedef std::vector<id_type>::const_iterator const_IdIter;
typedef std::vector<data_type>::const_iterator const_DataIter;
typedef std::pair<const_IdIter, const_DataIter> const_IterPair;
struct IterHelp {
typedef DataFrame result_type;
IterHelp(DataFrameContainer const& iv) : v(iv) {}
DataFrame const& operator()(int i) const {
frame.set(v, i);
return frame;
}
private:
DataFrameContainer const& v;
CMS_SA_ALLOW mutable DataFrame frame;
};
typedef boost::transform_iterator<IterHelp, boost::counting_iterator<int> > const_iterator;
DataFrameContainer() : m_subdetId(0), m_stride(0), m_ids(), m_data() {}
explicit DataFrameContainer(size_t istride, int isubdet = 0, size_t isize = 0)
: m_subdetId(isubdet), m_stride(istride), m_ids(isize), m_data(isize * m_stride) {}
void swap(DataFrameContainer& rh) {
std::swap(m_subdetId, rh.m_subdetId);
std::swap(m_stride, rh.m_stride);
m_ids.swap(rh.m_ids);
m_data.swap(rh.m_data);
}
void swap(IdContainer& iic, DataContainer& idc) {
m_ids.swap(iic);
m_data.swap(idc);
}
void reserve(size_t isize) {
m_ids.reserve(isize);
m_data.reserve(isize * m_stride);
}
void resize(size_t isize) {
m_ids.resize(isize);
m_data.resize(isize * m_stride);
}
void sort();
// FIXME not sure what the best way to add one cell to cont
void push_back(id_type iid, data_type const* idata) {
m_ids.push_back(iid);
size_t cs = m_data.size();
m_data.resize(m_data.size() + m_stride);
std::copy(idata, idata + m_stride, m_data.begin() + cs);
}
//make space for it
void push_back(id_type iid) {
m_ids.push_back(iid);
m_data.resize(m_data.size() + m_stride);
}
// overwrite back (very ad hoc interface...)
void set_back(id_type iid, data_type const* idata) {
m_ids.back() = iid;
size_t cs = m_data.size() - m_stride;
std::copy(idata, idata + m_stride, m_data.begin() + cs);
}
void set_back(id_type iid) { m_ids.back() = iid; }
void set_back(data_type const* idata) {
size_t cs = m_data.size() - m_stride;
std::copy(idata, idata + m_stride, m_data.begin() + cs);
}
DataFrame back() { return DataFrame(*this, size() - 1); }
void pop_back() {
m_ids.resize(m_ids.size() - 1);
m_data.resize(m_data.size() - m_stride);
}
//---------------------------------------------------------
IterPair pair(size_t i) { return IterPair(m_ids.begin() + i, m_data.begin() + i * m_stride); }
const_IterPair pair(size_t i) const { return const_IterPair(m_ids.begin() + i, m_data.begin() + i * m_stride); }
DataFrame operator[](size_t i) { return DataFrame(*this, i); }
DataFrame operator[](size_t i) const { return DataFrame(*this, i); }
/// slow interface
/// The iterator returned can not safely be used across threads
const_iterator find(id_type i) const {
const_IdIter p = std::lower_bound(m_ids.begin(), m_ids.end(), i);
return (p == m_ids.end() || (*p) != i)
? end()
: boost::make_transform_iterator(boost::counting_iterator<int>(p - m_ids.begin()), IterHelp(*this));
}
/// The iterator returned can not safely be used across threads
const_iterator begin() const {
return boost::make_transform_iterator(boost::counting_iterator<int>(0), IterHelp(*this));
}
const_iterator end() const {
return boost::make_transform_iterator(boost::counting_iterator<int>(size()), IterHelp(*this));
}
int subdetId() const { return m_subdetId; }
size_type stride() const { return m_stride; }
bool empty() const { return m_ids.empty(); }
size_type size() const { return m_ids.size(); }
data_type operator()(size_t cell, size_t frame) const { return m_data[cell * m_stride + frame]; }
data_type const* frame(size_t cell) const { return &m_data[cell * m_stride]; }
id_type id(size_t cell) const { return m_ids[cell]; }
IdContainer const& ids() const { return m_ids; }
DataContainer const& data() const { return m_data; }
private:
//for testing
friend class ::TestDataFrame;
template <typename DigiCollection>
friend class ::TestEcalDigi;
// subdetector id (as returned by DetId::subdetId())
int m_subdetId;
// can be a enumerator, or a template argument
size_type m_stride;
IdContainer m_ids;
DataContainer m_data;
};
inline DataFrame::DataFrame(DataFrameContainer const& icont, size_type i)
: m_id(icont.id(i)), m_data(icont.frame(i)), m_size(icont.stride()) {}
inline void DataFrame::set(DataFrameContainer const& icont, size_type i) {
m_id = icont.id(i);
m_data = icont.frame(i);
m_size = icont.stride();
}
// Free swap function
inline void swap(DataFrameContainer& lhs, DataFrameContainer& rhs) { lhs.swap(rhs); }
} // namespace edm
#endif // DataFormats_Common_DataFrameContainer_h
|