18 const std::size_t sz =
data_.size();
21 const std::size_t szm1 = sz - 1;
22 for (std::size_t
i = 0;
i < szm1; ++
i)
32 data_.push_back(std::pair<uint32_t, uint32_t>(detId, index));
41 "In HcalIndexLookup::lookup:"
42 " collection is not sorted");
43 std::pair<uint32_t, uint32_t>
search(detId, 0U);
48 if (it->first == detId)
55 const std::size_t sz =
data_.size();
58 for (std::size_t
i = 0;
i < sz; ++
i)
std::vector< T >::const_iterator search(const cond::Time_t &val, const std::vector< T > &container)
std::vector< std::pair< uint32_t, uint32_t > > data_
unsigned largestIndex() const
U second(std::pair< T, U > const &p)
void add(unsigned transformedId, unsigned index)
__host__ __device__ constexpr RandomIt lower_bound(RandomIt first, RandomIt last, const T &value, Compare comp={})
unsigned find(unsigned detId) const
static const unsigned InvalidIndex