Matching.h File Reference

#include "L1Trigger/L1TMuonEndCap/interface/EmulatorClasses.h"
#include "L1Trigger/L1TMuonEndCap/interface/PhiMemoryImage.h"

Go to the source code of this file.

Functions
MatchingOutput	PhiMatching (SortingOutput Sout)
std::vector< MatchingOutput >	PhiMatching_Hold (std::vector< SortingOutput > Sout)

Function Documentation

MatchingOutput PhiMatching

(

SortingOutput

Sout

)

Is the converted hit in the zone we're looking at now?

Definition at line 16 of file Matching.h.

References rpcdqm::BX, ConvertedHit::BX(), gather_cfg::cout, SortingOutput::Hits(), i, ConvertedHit::Id(), ConvertedHit::IsNeighbor(), convertSQLitetoXML_cfg::output, colinearityKinematic::Phi, ConvertedHit::Phi(), MatchingOutput::setM2(), ConvertedHit::SetNull(), MatchingOutput::SetValues(), align::Strip, groupFilesInBlocks::tt, w, SortingOutput::Winners(), ThOutput2::x, PhOutput::x, and detailsBasic3DVector::z.

Referenced by PhiMatching_Hold().

                                              {

  bool verbose = false;
  
  std::vector<ConvertedHit> Thits = Sout.Hits();
  std::vector<std::vector<Winner>> Winners = Sout.Winners();
  std::vector<int> segment (4,0);
  int phdiff[4] = {15,7,7,7};
  
  ConvertedHit tt; tt.SetNull();
  PhOutput ph_output = { {{{tt}}} };
  ThOutput2 th_output2 = { {{{{-999}}}} };
  ThOutput th_output = { {{{{tt}}}} }; 

    
  for(int z=0;z<4;z++){//zone loop
    
    for(int w=0;w<3;w++){//winner loop
            
      if(Winners[z][w].Rank()){//is there a winner present? 
    
    if(verbose) std::cout<<"\n\nWinner position-"<<Winners[z][w].Strip()<<". Zone = "<<z<<std::endl;
    if(verbose) std::cout<<"Number of possible hits to match = "<<Thits.size()<<"\n";           
    
    //for(std::vector<ConvertedHit>::iterator i = Thits.begin();i != Thits.end();i++){//Possible associated hits
    for(unsigned int i=0;i<Thits.size();i++){//Possible associated hits

      int zmask[4] {1,2,4,8};
      bool inzone = false;
      if(Thits[i].ZoneWord() & zmask[z]) inzone = true;

      bool inBXgroup = false;
      
      switch(Winners[z][w].BXGroup()){
        
      case 1: if(Thits[i].BX() > 3 && Thits[i].BX() < 7) inBXgroup = true;break;
      case 2: if(Thits[i].BX() > 4 && Thits[i].BX() < 8) inBXgroup = true;break;
      case 3: if(Thits[i].BX() > 5 && Thits[i].BX() < 9) inBXgroup = true;break;
      default: inBXgroup = false;
        
      }
      
      int setstation = Thits[i].Station() - 1;
      bool setphi = false;
      
      if(verbose)
        std::cout<<"setstation = "<<setstation<<std::endl;
      
      //if(verbose){
      
      //    std::cout<<"Winners[z][w].Strip(): "<<Winners[z][w].Strip()<<" + 1 - Thits[i].Zhit():"<<Thits[i].Zhit()<<" = "<<(Winners[z][w].Strip() + 1) - Thits[i].Zhit()<<". Thits[i].Phi()>>5 = "<<(Thits[i].Phi() >> 5)<<"\n";
      //}
      
      if((fabs(Winners[z][w].Strip() - (Thits[i].Phi()>>5)) <= phdiff[setstation]) && inBXgroup && inzone){//is close to winner keystrip and in same zone?
        
        if(ph_output.x[z][w][setstation].Phi() == -999){//has this already been set? no
          
          if(verbose) std::cout<<"hasn't been set"<<std::endl;
          
          ph_output.x[z][w][setstation] = (Thits[i]);
          
          if(verbose) std::cout<<"set with strip-"<<Thits[i].Strip()<<", and wire-"<<Thits[i].Wire()<<std::endl;
          setphi = true;
        }
        else{//if yes, find absolute difference between zhit of each hit and keystrip
          
          if(verbose) std::cout<<"has already been set"<<std::endl;
          
          int d1 = fabs((ph_output.x[z][w][setstation].Phi()>>5) - Winners[z][w].Strip());
          int d2 = fabs((Thits[i].Phi()>>5) - Winners[z][w].Strip());
          
          if(verbose) std::cout<<"d1 = "<<d1<<" and d2 = "<<d2<<"\n";
          
          if(d2 < d1){//if new hit is closer then replace phi
        
        if(verbose) std::cout<<"this is closer strip-"<<Thits[i].Strip()<<", and wire-"<<Thits[i].Wire()<<std::endl;
        
        ph_output.x[z][w][setstation] = (Thits[i]);
        
        setphi = true;
        
          }

          if (d2 == d1) {
        if (Thits[i].BX() < ph_output.x[z][w][setstation].BX()) {
          ph_output.x[z][w][setstation] = (Thits[i]);
          setphi = true;
        }
        else if (Thits[i].IsNeighbor() && !ph_output.x[z][w][setstation].IsNeighbor()) {
          ph_output.x[z][w][setstation] = (Thits[i]);
          setphi = true;
        }
        else if ((Thits[i].IsNeighbor() == ph_output.x[z][w][setstation].IsNeighbor()) && (Thits[i].Id() < ph_output.x[z][w][setstation].Id())) {
          ph_output.x[z][w][setstation] = (Thits[i]);
          setphi = true;
        }
          }
        }
        
        
        //if((th_output.x[z][w][setstation][0].Theta() != -999) && (th_output.x[z][w][setstation][0].Id() == Thits[i].Id())){//if same chamber take as well
        //      th_output.x[z][w][setstation][1] = (Thits[i]);
        //      if(verbose) std::cout<<"in here with set th = "<<th_output.x[z][w][setstation][0].Theta()<<" and new th = "<<Thits[i].Theta()<<"\n";
        //  }
        
        if(setphi){//only set if phi was also set
          
          th_output2.x[z][w][setstation][0] = Thits[i].Theta();
          
          /*if(th_output.x[z][w][setstation][0].Theta() == -999){
        th_output.x[z][w][setstation][0] = (Thits[i]);
        }
        else if((th_output.x[z][w][setstation][0].Theta() != -999) && (th_output.x[z][w][setstation][0].Id() == Thits[i].Id())){//if same chamber take as well
        th_output.x[z][w][setstation][1] = (Thits[i]);
        if(verbose) std::cout<<"in here with set th = "<<th_output.x[z][w][setstation][0].Theta()<<" and new th = "<<Thits[i].Theta()<<"\n";
        }*/
          
          //if((th_output.x[z][w][setstation][0].Theta() != -999) && (th_output.x[z][w][setstation][0].Id() == Thits[i].Id())){//if same chamber take as well
          //    th_output.x[z][w][setstation][1] = (Thits[i]);
          //    if(verbose) std::cout<<"in here with set th = "<<th_output.x[z][w][setstation][0].Theta()<<" and new th = "<<Thits[i].Theta()<<"\n";
          //}
          //else{
          //    th_output.x[z][w][setstation][0] = (Thits[i]);
          
          if(Thits[i].Theta2() != -999)
        th_output2.x[z][w][setstation][1] = Thits[i].Theta2();
          //}
          
        }
        
      }
    }
    
      }
      
    }
  }
  
  MatchingOutput output;
  output.SetValues(th_output,ph_output,Thits,Winners,segment);
  output.setM2(th_output2);
  
  return output;
}

std::vector<MatchingOutput> PhiMatching_Hold

(

std::vector< SortingOutput >

Sout

)

Definition at line 173 of file Matching.h.

References gather_cfg::cout, i, convertSQLitetoXML_cfg::output, PhiMatching(), and tmp.

Referenced by L1TMuonEndCapTrackProducer::produce().

                                                                         {
  
  MatchingOutput tmp;
  std::vector<MatchingOutput> output (3,tmp);
  
  if(Sout.size() != 3)
    std::cout<<"Incorrect BX window size for sorting output. Please check to see why.\n";
  
  for(int i=0;i<3;i++){
    output[i] = PhiMatching(Sout[i]);
  }
  
  return output;
}