TrkDriftCircleMath::SortSegByNumberOfMDTHitsAndChi2 Struct Reference

#include <SortSegBySizeAndChi2.h>

Collaboration diagram for TrkDriftCircleMath::SortSegByNumberOfMDTHitsAndChi2:

Public Member Functions
bool	operator() (const Segment &seg1, const Segment &seg2)

Detailed Description

Definition at line 12 of file SortSegBySizeAndChi2.h.

Member Function Documentation

operator()()

bool TrkDriftCircleMath::SortSegByNumberOfMDTHitsAndChi2::operator() ( const Segment &  seg1, const Segment &  seg2  )

inline

Definition at line 13 of file SortSegBySizeAndChi2.h.

                                                                  {
            // prefer segment with T0 fit
            if (seg1.hasT0Shift() && !seg2.hasT0Shift())
                return true;
            else if (!seg1.hasT0Shift() && seg2.hasT0Shift())
                return false;
 
            // sort by numbers of hits on track
            if (seg1.hitsOnTrack() > seg2.hitsOnTrack())
                return true;
            else if (seg1.hitsOnTrack() < seg2.hitsOnTrack())
                return false;
 
            // take the one with less empty crossed tubes
            if (seg1.emptyTubes().size() < seg2.emptyTubes().size())
                return true;
            else if (seg1.emptyTubes().size() > seg2.emptyTubes().size())
                return false;
 
            // take one with associated clusters
            if (seg1.clusterLayers() > 0 && seg2.clusterLayers() == 0) return true;
            if (seg1.clusterLayers() == 0 && seg2.clusterLayers() > 0) return false;
 
            // if equal sort by number of deltas
            if (seg1.deltas() < seg2.deltas())
                return true;
            else if (seg1.deltas() > seg2.deltas())
                return false;
 
            // finally take the one with best chi2
            return seg1.chi2() < seg2.chi2();
        }

---

The documentation for this struct was generated from the following file:

• SortSegBySizeAndChi2.h