|
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
|
// -*- c++ -*-
#ifndef DataFormats_SiPixelCluster_SiPixelClusterShapeData_h
#define DataFormats_SiPixelCluster_SiPixelClusterShapeData_h
#include "DataFormats/Provenance/interface/ProductID.h"
#include "DataFormats/Common/interface/HandleBase.h"
#include "DataFormats/Common/interface/Ref.h"
#include "DataFormats/Common/interface/DetSetVectorNew.h"
#include "DataFormats/SiPixelCluster/interface/SiPixelCluster.h"
#include <utility>
#include <vector>
#include <algorithm>
#include <cassert>
#include <memory>
class PixelGeomDetUnit;
class SiPixelClusterShapeData {
public:
typedef std::vector<std::pair<int, int> >::const_iterator const_iterator;
typedef std::pair<const_iterator, const_iterator> Range;
SiPixelClusterShapeData(
const_iterator begin, const_iterator end, bool isStraight, bool isComplete, bool hasBigPixelsOnlyInside)
: begin_(begin),
end_(end),
isStraight_(isStraight),
isComplete_(isComplete),
hasBigPixelsOnlyInside_(hasBigPixelsOnlyInside) {}
~SiPixelClusterShapeData();
Range size() const { return std::make_pair(begin_, end_); }
bool isStraight() const { return isStraight_; }
bool isComplete() const { return isComplete_; }
bool hasBigPixelsOnlyInside() const { return hasBigPixelsOnlyInside_; }
private:
const_iterator begin_, end_;
const bool isStraight_, isComplete_, hasBigPixelsOnlyInside_;
};
class SiPixelClusterShapeCache {
public:
typedef edm::Ref<edmNew::DetSetVector<SiPixelCluster>, SiPixelCluster> ClusterRef;
struct Field {
Field() : offset(0), size(0), straight(false), complete(false), has(false), filled(false) {}
Field(unsigned off, unsigned siz, bool s, bool c, bool h)
: offset(off), size(siz), straight(s), complete(c), has(h), filled(true) {}
unsigned offset : 24; // room for 2^24/9 = ~1.8e6 clusters, should be enough
unsigned size : 4; // max 9 elements / cluster (2^4-1=15)
unsigned straight : 1;
unsigned complete : 1;
unsigned has : 1;
unsigned filled : 1;
};
SiPixelClusterShapeCache() {}
explicit SiPixelClusterShapeCache(const edm::HandleBase& handle) : productId_(handle.id()) {}
explicit SiPixelClusterShapeCache(const edm::ProductID& id) : productId_(id) {}
~SiPixelClusterShapeCache();
void resize(size_t size) {
data_.resize(size);
sizeData_.reserve(size);
}
void swap(SiPixelClusterShapeCache& other) {
data_.swap(other.data_);
sizeData_.swap(other.sizeData_);
std::swap(productId_, other.productId_);
}
#if !defined(__CINT__) && !defined(__MAKECINT__) && !defined(__REFLEX__)
void shrink_to_fit() {
data_.shrink_to_fit();
sizeData_.shrink_to_fit();
}
template <typename T>
void insert(const ClusterRef& cluster, const T& data) {
static_assert(T::ArrayType::capacity() <= 15, "T::ArrayType::capacity() more than 15, bit field too narrow");
checkRef(cluster);
data_[cluster.index()] =
Field(sizeData_.size(), data.size.size(), data.isStraight, data.isComplete, data.hasBigPixelsOnlyInside);
std::copy(data.size.begin(), data.size.end(), std::back_inserter(sizeData_));
}
bool isFilled(const ClusterRef& cluster) const {
checkRef(cluster);
return data_[cluster.index()].filled;
}
SiPixelClusterShapeData get(const ClusterRef& cluster, const PixelGeomDetUnit* pixDet) const {
checkRef(cluster);
Field f = data_[cluster.index()];
assert(f.filled);
auto beg = sizeData_.begin() + f.offset;
auto end = beg + f.size;
return SiPixelClusterShapeData(beg, end, f.straight, f.complete, f.has);
}
#endif
private:
void checkRef(const ClusterRef& cluster) const;
std::vector<Field> data_;
std::vector<std::pair<int, int> > sizeData_;
edm::ProductID productId_;
};
#endif
|