SUSY Namespace Reference

Classes
class	CrossSectionDB
class	CrossSectionDBPMG

Functions
unsigned int	finalState (const int SUSY_Spart1_pdgId, const int SUSY_Spart2_pdgId)

Function Documentation

finalState()

unsigned int SUSY::finalState	(	const int	SUSY_Spart1_pdgId,
		const int	SUSY_Spart2_pdgId )

Final classification

Definition at line 227 of file SUSYCrossSection.cxx.

{
  std::array<int, NUM_SPARTICLES> n{};
  //Classification of the event follows (gg, sq...):
  int idx = classifyOne(SUSY_Spart1_pdgId);
  if ( (idx>=0) and (idx<std::ssize(n) )){
    ++n[idx];
  }
  int idx2 = classifyOne(SUSY_Spart2_pdgId);
  if ( (idx2>=0) and (idx2<std::ssize(n) )){
    ++n[idx2];
  }
 
  // gluino/squark + X
  auto nanysquark=[&n](int i)->bool {
    return (n[nsquark] == i) or (n[nantisquark] == i);
  };
  if (n[ngluino] == 1 && nanysquark(1)) return 1;
  else if (n[ngluino] == 2) return 2;
  else if (nanysquark(2)) return 3;
  else if (n[nsquark] == 1 && n[nantisquark] == 1) return 4;
 
  else if (n[nsbottom] == 1 && n[nantisbottom] == 1) return 51;
  else if (n[nsbottom2] == 1 && n[nantisbottom2] == 1) return 52;
  else if (n[nstop] == 1 && n[nantistop] == 1) return 61;
  else if (n[nstop2] == 1 && n[nantistop2] == 1) return 62;
 
  else if (n[ngluino] == 1 && n[nchi01] == 1) return 71;
  else if (n[ngluino] == 1 && n[nchi02] == 1) return 72;
  else if (n[ngluino] == 1 && n[nchi03] == 1) return 73;
  else if (n[ngluino] == 1 && n[nchi04] == 1) return 74;
 
  else if (n[ngluino] == 1 && n[nch1plus] == 1) return 75;
  else if (n[ngluino] == 1 && n[nch2plus] == 1) return 76;
  else if (n[ngluino] == 1 && n[nch1minus] == 1) return 77;
  else if (n[ngluino] == 1 && n[nch2minus] == 1) return 78;
 
  else if (nanysquark(1) && n[nchi01] == 1) return 81;
  else if (nanysquark(1) && n[nchi02] == 1) return 82;
  else if (nanysquark(1) && n[nchi03] == 1) return 83;
  else if (nanysquark(1) && n[nchi04] == 1) return 84;
 
  else if (nanysquark(1) && n[nch1plus] == 1) return 85;
  else if (nanysquark(1) && n[nch2plus] == 1) return 86;
  else if (nanysquark(1) && n[nch1minus] == 1) return 87;
  else if (nanysquark(1) && n[nch2minus] == 1) return 88;
 
 
  // Gaugino pair-production
  // chi^{0}_1 + X
  else if (n[nchi01] == 2) return 111;
  else if (n[nchi01] == 1 && n[nchi02] == 1) return 112;
  else if (n[nchi01] == 1 && n[nchi03] == 1) return 113;
  else if (n[nchi01] == 1 && n[nchi04] == 1) return 114;
  else if (n[nchi01] == 1 && n[nch1plus] == 1) return 115;
  else if (n[nchi01] == 1 && n[nch2plus] == 1) return 116;
  else if (n[nchi01] == 1 && n[nch1minus] == 1) return 117;
  else if (n[nchi01] == 1 && n[nch2minus] == 1) return 118;
 
  // chi^{0}_2 + X
  else if (n[nchi02] == 2) return 122;
  else if (n[nchi02] == 1 && n[nchi03] == 1) return 123;
  else if (n[nchi02] == 1 && n[nchi04] == 1) return 124;
  else if (n[nchi02] == 1 && n[nch1plus] == 1) return 125;
  else if (n[nchi02] == 1 && n[nch2plus] == 1) return 126;
  else if (n[nchi02] == 1 && n[nch1minus] == 1) return 127;
  else if (n[nchi02] == 1 && n[nch2minus] == 1) return 128;
 
  // chi^{0}_3 + X
  else if (n[nchi03] == 2) return 133;
  else if (n[nchi03] == 1 && n[nchi04] == 1) return 134;
  else if (n[nchi03] == 1 && n[nch1plus] == 1) return 135;
  else if (n[nchi03] == 1 && n[nch2plus] == 1) return 136;
  else if (n[nchi03] == 1 && n[nch1minus] == 1) return 137;
  else if (n[nchi03] == 1 && n[nch2minus] == 1) return 138;
 
  // chi^{0}_4 + X
  else if (n[nchi04] == 2) return 144;
  else if (n[nchi04] == 1 && n[nch1plus] == 1) return 145;
  else if (n[nchi04] == 1 && n[nch2plus] == 1) return 146;
  else if (n[nchi04] == 1 && n[nch1minus] == 1) return 147;
  else if (n[nchi04] == 1 && n[nch2minus] == 1) return 148;
 
  // chi^{+}_1/2 + chi^{-}_1/2
  else if (n[nch1plus] == 1 && n[nch1minus] == 1) return 157;
  else if (n[nch1plus] == 1 && n[nch2minus] == 1) return 158;
 
  else if (n[nch2plus] == 1 && n[nch1minus] == 1) return 167;
  else if (n[nch2plus] == 1 && n[nch2minus] == 1) return 168;
 
  // slepton
  else if (n[nselecLplus] == 1 && n[nselecLminus] == 1) return 201; // sElectronLPair
  else if (n[nselecRplus] == 1 && n[nselecRminus] == 1) return 202; // sElectronRPair
  else if (n[nselnuL] == 2) return 203; // sElectron neutrino pair
  else if (n[nselecLplus] == 1 && n[nselnuL] == 1) return 204; // sElectron+ sNutrino
  else if (n[nselecLminus] == 1 && n[nselnuL] == 1) return 205; // sElectron- sNutrino
  else if (n[nstau1plus] == 1 && n[nstau1minus] == 1) return 206;
  else if (n[nstau2plus] == 1 && n[nstau2minus] == 1) return 207;
  else if ((n[nstau1plus] == 1 || n[nstau1minus] == 1) && (n[nstau2plus] == 1 || n[nstau2minus] == 1)) return 208;
  else if (n[nstaunuL] == 2) return 209; // sTau neutrino pair
  else if (n[nstau1plus] == 1 && n[nstaunuL] == 1) return 210;
  else if (n[nstau1minus] == 1 && n[nstaunuL] == 1) return 211;
  else if (n[nstau2plus] == 1 && n[nstaunuL] == 1) return 212;
  else if (n[nstau2minus] == 1 && n[nstaunuL] == 1) return 213;
 
  else if (n[nsmuonLplus] == 1 && n[nsmuonLminus] == 1) return 216; // sMuonPair
  else if (n[nsmuonRplus] == 1 && n[nsmuonRminus] == 1) return 217; // sMuonPair
  else if (n[nsmunuL] == 2) return 218; // sMuon neutrino pair
  else if (n[nsmuonLplus] == 1 && n[nsmunuL] == 1) return 219; // sMuon+ sNutrino
  else if (n[nsmuonLminus] == 1 && n[nsmunuL] == 1) return 220; // sMuon- sNutrino
 
  std::cerr << "ERROR. could not determine finalState for:" << std::endl;
  std::cerr << "  SUSY_Spart1_pdgId: " << SUSY_Spart1_pdgId << std::endl;
  std::cerr << "  SUSY_Spart2_pdgId: " << SUSY_Spart2_pdgId << std::endl;
  std::cerr << "Returning 0" << std::endl;
 
  return 0;
}