Muon::SortByIPMuPatHits Class Reference

#include <SortMuPatHits.h>

Collaboration diagram for Muon::SortByIPMuPatHits:

Public Member Functions
	SortByIPMuPatHits (const IMuonIdHelperSvc *idh)
bool	operator() (const MuPatHitPtr &hit1, const MuPatHitPtr &hit2) const
	Sort the mu pat hits using their associated surfaces.
bool	operator() (const MuPatHit *hit1, const MuPatHit *hit2) const

Public Attributes
const IMuonIdHelperSvc *	m_idh {nullptr}
	DistanceAlongParameters distanceCalculator;.

Detailed Description

Definition at line 40 of file SortMuPatHits.h.

Constructor & Destructor Documentation

SortByIPMuPatHits()

Muon::SortByIPMuPatHits::SortByIPMuPatHits ( const IMuonIdHelperSvc * idh )

inline

Definition at line 43 of file SortMuPatHits.h.

: m_idh{idh} {}

Member Function Documentation

operator()() [1/2]

bool Muon::SortByIPMuPatHits::operator() ( const MuPatHit * hit1, const MuPatHit * hit2 ) const

inline

large small overlap

Definition at line 48 of file SortMuPatHits.h.

                                                                          {
            // first, check if both hits are in the same chamber, and at least one is an RPC
 
            const MuPatHit::Info& info1 = hit1->info();
            const MuPatHit::Info& info2 = hit2->info();
            const Identifier& id1 = info1.id;
            const Identifier& id2 = info2.id;
 
            const Trk::Surface& surf1{hit1->measurement().associatedSurface()};
            const Trk::Surface& surf2{hit2->measurement().associatedSurface()};
 
            if (info1.isEndcap && info2.isEndcap) {
                const double absZ1 = std::abs(surf1.center().z());
                const double absZ2 = std::abs(surf2.center().z());
                if (std::abs(absZ1 - absZ2) > std::numeric_limits<float>::epsilon()) { return absZ1 < absZ2; }
            } else if (!info1.isEndcap && !info2.isEndcap) {
                const double perp1 = surf1.center().perp2();
                const double perp2 = surf2.center().perp2();
                if (std::abs(perp1 - perp2) > std::numeric_limits<float>::epsilon()) {return perp1 < perp2; }
            }
             else if (info1.isEndcap || info2.isEndcap) {
                    const MuonStationIndex::StIndex& st1 = info1.stIdx;
                    const MuonStationIndex::StIndex& st2 = info2.stIdx;
                    if (st1 != st2) return st1 < st2;                   
            }
            if (info1.type == info2.type) {
                if (info1.type == MuPatHit::sTGC) {
                    const sTgcIdHelper& id_helper = m_idh->stgcIdHelper();
                    const int type1 =id_helper.channelType(id1);
                    const int type2 =id_helper.channelType(id2);
                    if (type1 != type2) return type1 > type2;
                }
                if (info1.status != info2.status) {
                    return info1.status < info2.status;
                }
                if (info1.measuresPhi == info2.measuresPhi) {
                   return hit1->pull() < hit2->pull();
                }
            }
            // phi measurements larger than eta measurements
            return !info1.measuresPhi;
        }

operator()() [2/2]

bool Muon::SortByIPMuPatHits::operator() ( const MuPatHitPtr & hit1, const MuPatHitPtr & hit2 ) const

inline

Sort the mu pat hits using their associated surfaces.

Definition at line 45 of file SortMuPatHits.h.

                                                                                {
            return operator()(hit1.get(), hit2.get());
        }

Member Data Documentation

m_idh

const IMuonIdHelperSvc* Muon::SortByIPMuPatHits::m_idh {nullptr}

DistanceAlongParameters distanceCalculator;.

Definition at line 93 of file SortMuPatHits.h.

{nullptr};

---

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

• SortMuPatHits.h