29 (*trj).validRecHits(
hits);
31 for (
auto const &
h :
hits) {
32 auto detid =
h->geographicalId().rawId();
39 if (detid)
theCache.insert(std::pair<uint32_t, unsigned int>(detid, idx));
44 if (seed->
nHits()==0){
return true; }
48 auto first = range.first;
49 auto last = range.second;
50 auto detid =
first->geographicalId().rawId();
53 auto itrange =
theCache.equal_range(detid);
54 for (
auto it = itrange.first; it != itrange.second; ++it) {
55 assert(it->first == detid);
60 auto ts =
theVault[it->second].begin();
64 for (; curr !=
last; ++curr) {
72 if (curr ==
last)
return false;
unsigned int nHits() const