Skip to content
Snippets Groups Projects
Commit a31beb67 authored by Will Leight's avatar Will Leight
Browse files

Lower the priority of STACO muons

As the STACO algorithm is currently not	well tuned, it produces	mostly fakes.
This update lowers its priority	so that	muons (if any) reconstructed from the same ID candidate by the segment- or calo-tag algs are used instead.
In this	case, the MS track used by the STACO reconstruction will be reconstructed as a standalone muon,	so no information is lost.


Former-commit-id: 24d27206
parent 99e196e0
No related branches found
No related tags found
No related merge requests found
...@@ -22,12 +22,12 @@ namespace MuonCombined { ...@@ -22,12 +22,12 @@ namespace MuonCombined {
inline int authorRank( const xAOD::Muon::Author& a ) { inline int authorRank( const xAOD::Muon::Author& a ) {
if( a == xAOD::Muon::MuidCo ) return 0; if( a == xAOD::Muon::MuidCo ) return 0;
if( a == xAOD::Muon::MuGirl ) return 1; if( a == xAOD::Muon::MuGirl ) return 1;
if( a == xAOD::Muon::STACO ) return 2; if( a == xAOD::Muon::MuTagIMO ) return 2;
if( a == xAOD::Muon::MuTagIMO ) return 3; if( a == xAOD::Muon::MuTag ) return 3;
if( a == xAOD::Muon::MuTag ) return 4; if( a == xAOD::Muon::CaloTag ) return 4;
if( a == xAOD::Muon::CaloTag ) return 5; if( a == xAOD::Muon::CaloLikelihood ) return 5;
if( a == xAOD::Muon::CaloLikelihood ) return 6; if( a == xAOD::Muon::MuidSA ) return 6;
if( a == xAOD::Muon::MuidSA ) return 7; if( a == xAOD::Muon::STACO ) return 7;
return 8; return 8;
} }
...@@ -92,7 +92,7 @@ namespace MuonCombined { ...@@ -92,7 +92,7 @@ namespace MuonCombined {
inline bool operator<( const TagBase& t1, const TagBase& t2 ){ inline bool operator<( const TagBase& t1, const TagBase& t2 ){
int r1 = typeRank(t1.type()); int r1 = typeRank(t1.type());
int r2 = typeRank(t2.type()); int r2 = typeRank(t2.type());
if( r1 != r2 ) return r1 < r2; if( r1 != r2 && t1.author()!=xAOD::Muon::STACO && t2.author()!=xAOD::Muon::STACO) return r1 < r2;
return authorRank(t1.author()) < authorRank(t2.author()); return authorRank(t1.author()) < authorRank(t2.author());
} }
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment