21 CastorRawGains::Container::const_iterator
23 CastorRawGains::Container::const_iterator
result = container.begin ();
24 for (; result != container.end (); result++) {
25 if (result->rawId () ==
id)
break;
38 std::vector<Item>::const_iterator cell;
43 std::cerr <<
"CastorRawGains::getValues-> container is not sorted. Please sort it to search effectively" << std::endl;
46 if (cell ==
mItems.end() || cell->rawId () !=
target.rawId ())
53 for (std::vector<Item>::const_iterator item =
mItems.begin (); item !=
mItems.end (); item++) {
54 result.push_back (
DetId (item->rawId ()));
CastorRawGain * addItem(DetId fId)
add new (empty) item
constexpr uint32_t rawId() const
get the raw id
void find(edm::Handle< EcalRecHitCollection > &hits, DetId thisDet, std::vector< EcalRecHitCollection::const_iterator > &hit, bool debug=false)
U second(std::pair< T, U > const &p)
std::vector< DetId > getAllChannels() const
get list of all available channels
std::vector< Item > Container
bool sorted() const
check if data are sorted
void sort()
sort values by channelId
const CastorRawGain * getValues(DetId fId) const
get value
void addValues(DetId fId, const CastorRawGain &fValues)
fill values