15 typedef Trajectory::RecHitContainer::const_iterator TI;
17 SI
first = range.first, curr = range.first,
last = range.second;
19 for (std::vector<Trajectory>::const_iterator trj =
trajectories->begin(),
21 trj != trjEnd; ++trj) {
24 TI ts = hits.begin(), tc = ts, te = hits.end();
25 for (curr = first; curr <
last; ++curr) {
27 for (TI it = tc; it != te; ++it) {
29 if (comp.
equals(&(*curr), &(**it))) {
30 tc = it; found =
true;
break;
34 for (TI it = ts; it != tc; ++it) {
36 if (comp.
equals(&(*curr), &(**it))) {
37 tc = it; found =
true;
break;
40 if (found ==
false)
break;
43 if (curr == last)
return false;
bool equals(const TrackingRecHit *a, const TrackingRecHit *b) const
recHitContainer::const_iterator const_iterator
std::pair< const_iterator, const_iterator > range
virtual bool good(const TrajectorySeed *seed)
Returns true if the seed is not overlapping with another trajectory.
ConstRecHitContainer RecHitContainer
virtual void done()
Tells the cleaner that the seeds are finished, and so it can clear any cache it has.
const std::vector< Trajectory > * trajectories