|
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
|
#ifndef DataFormats_MuonDigiCollection_h
#define DataFormats_MuonDigiCollection_h
/**
* \file
* Declaration of class MuonDigiCollection
*
* \author Stefano ARGIRO
* \date 05 Aug 2005
*/
#include <vector>
#include <map>
#include <iterator>
/**
* \class DigiContainerIteratorAdaptor MuonDigiCollection.h "/MuonDigiCollection.h"
*
* \brief An iterator adaptor for a map<Index, vector<Digi> >
* that when dereferenced returns a
* pair<Index, pair<vector<Digi>::const_iterator,
* vector<Digi>::const_iterator > >
* where the two iterators point to begin and and of the vector
*
* \author Stefano ARGIRO
* \date 05 Aug 2005
*/
template <typename IndexType, typename DigiType>
class DigiContainerIterator {
public:
typedef typename std::vector<DigiType>::const_iterator DigiRangeIterator;
typedef std::map<IndexType, std::vector<DigiType> > BaseContainer;
typedef typename BaseContainer::const_iterator BaseIterator;
typedef std::pair<IndexType, std::pair<DigiRangeIterator, DigiRangeIterator> > value_type;
typedef value_type reference;
typedef void pointer;
typedef typename DigiRangeIterator::difference_type difference_type;
typedef typename DigiRangeIterator::iterator_category iterator_category;
DigiContainerIterator(void) {}
DigiContainerIterator(BaseIterator i) : base_(i) {}
// implicit copy constructor
// implicit assignment operator
// implicit destructor
DigiContainerIterator operator++(int) { return DigiContainerIterator(base_++); }
DigiContainerIterator& operator++(void) {
++base_;
return *this;
}
bool operator==(const DigiContainerIterator& x) const { return x.base_ == base_; }
bool operator!=(const DigiContainerIterator& x) const { return x.base_ != base_; }
value_type operator*(void) const {
return std::make_pair(base_->first, std::make_pair(base_->second.begin(), base_->second.end()));
}
private:
BaseIterator base_;
};
/**
* \class MuonDigiCollection MuonDigiCollection.h "/MuonDigiCollection.h"
*
* \brief A container for a generic type of digis indexed by
* some index, implemented with a map<IndexType, vector<DigiType> >
*
* Example:
*
* \code
* typedef MuonDigiCollection<DTDetId,DTDigi> DTDigiCollection
* \endcode
*
* \note: Requirements
* - IndexType must provide operator <
*
* \author Stefano ARGIRO
* \date 05 Aug 2005
*/
template <typename IndexType, typename DigiType>
class MuonDigiCollection {
public:
MuonDigiCollection() {}
// void swap(MuonDigiCollection<IndexType,DigiType> & rh) { std::swap(data_,rh.data_);}
void swap(MuonDigiCollection& rh) { std::swap(data_, rh.data_); }
typedef typename std::vector<DigiType>::const_iterator const_iterator;
typedef typename std::pair<const_iterator, const_iterator> Range;
/// insert a digi for a given DetUnit @deprecated
void insertDigi(const IndexType& index, const DigiType& digi) {
std::vector<DigiType>& digis = data_[index];
digis.push_back(digi);
}
/// insert a range of digis for a given DetUnit
void put(Range range, const IndexType& index) {
std::vector<DigiType>& digis = data_[index];
digis.reserve(digis.size() + (range.second - range.first));
std::copy(range.first, range.second, std::back_inserter(digis));
}
#ifndef CMS_NOCXX11
/// insert a range of digis for a given DetUnit
template <typename IRange>
void move(IRange range, const IndexType& index) {
std::vector<DigiType>& digis = data_[index];
digis.reserve(digis.size() + (range.second - range.first));
digis.insert(digis.end(), std::make_move_iterator(range.first), std::make_move_iterator(range.second));
}
#endif
/// return the digis for a given DetUnit
Range get(const IndexType& index) const {
typename container::const_iterator it = data_.find(index);
if (it == data_.end()) {
// if data_ is empty there is no other way to get an empty range
static const std::vector<DigiType> empty;
return std::make_pair(empty.end(), empty.end());
}
const std::vector<DigiType>& digis = (*it).second;
return std::make_pair(digis.begin(), digis.end());
}
typedef DigiContainerIterator<IndexType, DigiType> DigiRangeIterator;
DigiRangeIterator begin() const { return data_.begin(); }
DigiRangeIterator end() const { return data_.end(); }
private:
typedef std::map<IndexType, std::vector<DigiType> > container;
container data_;
}; // MuonDigiCollection
template <typename IndexType, typename DigiType>
inline void swap(MuonDigiCollection<IndexType, DigiType>& rh, MuonDigiCollection<IndexType, DigiType>& lh) {
rh.swap(lh);
}
#endif
|