l1t Namespace Reference

map containing the conditions More...

Classes
class	AlgorithmEvaluation
class	CaloCluster
class	CaloCondition
class	CaloEmCand
class	CaloMainProcessor
class	CaloParams
class	CaloParamsESProducer
class	CaloRegion
class	CaloStage1Cluster
class	CaloStage1FirmwareFactory
class	CaloStage2JetAlgorithm
class	CaloStage2Nav
class	CaloStage2TowerAlgorithmFirmwareImp1
class	CaloTools
class	CaloTower
class	ConditionEvaluation
class	DataAlreadyPresentException
class	DataInvalidException
class	DataManager
class	DataWriter
class	Description
class	EGamma
class	EtSum
class	FakeInputProducer
class	GenToInputProducer
class	GtBoard
struct	GtConditionCategoryStringToEnum
struct	GtConditionTypeStringToEnum
class	GtInputDump
class	GtProducer
class	GtRecordDump
class	Interval
class	IntervalManager
class	Jet
class	L1Candidate
struct	L1GtBoardTypeStringToEnum
struct	L1GtPsbQuadStringToEnum
class	L1TCaloRCTToUpgradeConverter
class	L1TCaloUpgradeToGCTConverter
class	LUT
class	MuCondition
class	Muon
class	OMDSReader
class	PhysicalEtAdder
class	Stage1Layer2EGammaAlgorithm
class	Stage1Layer2EGammaAlgorithmImpPP
class	Stage1Layer2EtSumAlgorithm
class	Stage1Layer2EtSumAlgorithmImpPP
class	Stage1Layer2FirmwareFactory
class	Stage1Layer2JetAlgorithm
class	Stage1Layer2JetAlgorithmImpHI
class	Stage1Layer2JetAlgorithmImpPP
class	Stage1Layer2MainProcessor
class	Stage1Layer2MainProcessorFirmwareImp1
class	Stage1Layer2Producer
class	Stage1Layer2SingleTrackHI
class	Stage1Layer2TauAlgorithm
class	Stage1Layer2TauAlgorithmImpPP
class	Stage2CaloAnalyzer
class	Stage2Layer1FirmwareFactory
class	Stage2Layer1Producer
class	Stage2Layer2ClusterAlgorithm
class	Stage2Layer2ClusterAlgorithmFirmwareImp1
class	Stage2Layer2EGammaAlgorithm
class	Stage2Layer2EGammaAlgorithmFirmwareImp1
class	Stage2Layer2EtSumAlgorithm
class	Stage2Layer2EtSumAlgorithmFirmwareImp1
class	Stage2Layer2FirmwareFactory
class	Stage2Layer2JetAlgorithm
class	Stage2Layer2JetAlgorithmFirmwareImp1
class	Stage2Layer2JetSumAlgorithm
class	Stage2Layer2JetSumAlgorithmFirmwareImp1
class	Stage2Layer2MainProcessorFirmwareImp1
class	Stage2Layer2Producer
class	Stage2Layer2TauAlgorithm
class	Stage2Layer2TauAlgorithmFirmwareImp1
class	Stage2MainProcessor
class	Stage2MainProcessorFirmwareImp1
class	Stage2PreProcessor
class	Stage2PreProcessorFirmwareImp1
class	Stage2TowerCompressAlgorithm
class	Stage2TowerCompressAlgorithmFirmwareImp1
class	Stage2TowerDecompressAlgorithm
class	Stage2TowerDecompressAlgorithmFirmwareImp1
class	Tau
class	TriggerMenuXmlParser
class	TriggerMenuXmlProducer
class	WriterProxy
class	WriterProxyT

Typedefs
typedef std::map< std::string, L1GtAlgorithm >	AlgorithmMap
	map containing the algorithms More...
typedef BXVector< CaloCluster >	CaloClusterBxCollection
typedef BXVector< CaloEmCand >	CaloEmCandBxCollection
typedef BXVector< CaloRegion >	CaloRegionBxCollection
typedef BXVector < CaloStage1Cluster >	CaloStage1ClusterBxCollection
typedef BXVector< CaloTower >	CaloTowerBxCollection
typedef AlgorithmMap::const_iterator	CItAlgo
	iterators through map containing the algorithms More...
typedef ConditionMap::const_iterator	CItCond
	iterators through map containing the conditions More...
typedef std::map< std::string, GtCondition * >	ConditionMap
typedef BXVector< EGamma >	EGammaBxCollection
typedef BXVector< EtSum >	EtSumBxCollection
typedef AlgorithmMap::iterator	ItAlgo
typedef ConditionMap::iterator	ItCond
typedef BXVector< Jet >	JetBxCollection
typedef BXVector< L1Candidate >	L1CandidateBxCollection
typedef BXVector< Muon >	MuonBxCollection
typedef BXVector< Tau >	TauBxCollection
typedef edmplugin::PluginFactory < l1t::WriterProxy *()>	WriterFactory

Enumerations
enum	GtConditionCategory {   CondNull, CondMuon, CondCalo, CondEnergySum,   CondJetCounts, CondCorrelation, CondCastor, CondHfBitCounts,   CondHfRingEtSums, CondBptx, CondExternal }
	condition categories More...
enum	GtConditionType {   TypeNull, Type1s, Type2s, Type2wsc,   Type2cor, Type3s, Type4s, TypeETM,   TypeETT, TypeHTT, TypeHTM, TypeJetCounts,   TypeCastor, TypeHfBitCounts, TypeHfRingEtSums, TypeBptx,   TypeExternal }
enum	L1GtBoardType {   GTFE, FDL, PSB, GMT,   TCS, TIM, BoardNull }
	board types in GT More...
enum	L1GtPsbQuad {   Free, TechTr, IsoEGQ, NoIsoEGQ,   CenJetQ, ForJetQ, TauJetQ, ESumsQ,   JetCountsQ, MQB1, MQB2, MQF3,   MQF4, MQB5, MQB6, MQF7,   MQF8, MQB9, MQB10, MQF11,   MQF12, CastorQ, HfQ, BptxQ,   GtExternalQ, PsbQuadNull }
	quadruples sent to GT via PSB More...

Functions
bool	compareCorrJets (l1t::Jet m, l1t::Jet n)
bool	compareJets (l1t::Jet i, l1t::Jet j)
int	deltaGctPhi (const CaloRegion &region, const CaloRegion &neighbor)
void	HICaloRingSubtraction (const std::vector< l1t::CaloRegion > &regions, std::vector< l1t::CaloRegion > *subRegions)
	------------— For heavy ion ----------------------------------— More...
void	JetCalibration1 (std::vector< l1t::Jet > *uncalibjets, std::vector< double > jetSF, std::vector< l1t::Jet > *jets, bool applyJetCalibration, double jetLSB)
std::string	l1GtBoardTypeEnumToString (const L1GtBoardType &)
L1GtBoardType	l1GtBoardTypeStringToEnum (const std::string &)
std::string	l1GtConditionCategoryEnumToString (const GtConditionCategory &)
GtConditionCategory	l1GtConditionCategoryStringToEnum (const std::string &)
std::string	l1GtConditionTypeEnumToString (const GtConditionType &)
GtConditionType	l1GtConditionTypeStringToEnum (const std::string &)
std::string	l1GtPsbQuadEnumToString (const L1GtPsbQuad &)
L1GtPsbQuad	l1GtPsbQuadStringToEnum (const std::string &)
void	RegionCorrection (const std::vector< l1t::CaloRegion > &regions, const std::vector< l1t::CaloEmCand > &EMCands, std::vector< l1t::CaloRegion > *subRegions, std::vector< double > regionSubtraction, bool PUSubtract)
	------— New region correction (PUsub, no response correction at the moment) --------— More...
void	slidingWindowJetFinder (const int, const std::vector< l1t::CaloRegion > *regions, std::vector< l1t::Jet > *uncalibjets)

Detailed Description

map containing the conditions

Description: Simple Navigator class for the CaloTowers

Author

: Sam Harper - RAL

Description: Firmware headers

Implementation: Collects concrete algorithm implmentations.

Author

: R. Alex Barbieri MIT Kalanand Mishra, Fermilab

Description: Firmware headers

Implementation: Collects concrete algorithm implmentations.

Author

: R. Alex Barbieri MIT

Description: Firmware headers

Implementation: Concrete firmware implementations

Author

: Jim Brooke - University of Bristol

Description: Firmware headers

Implementation: Concrete firmware implementations

Author

: Jim Brooke - University of Bristol Modified: Adam Elwood - ICL

Description: enums for the L1 GT.

Implementation: Defines various enums for CondFormats L1 GT. For each enum, define the lightweight "maps" for enum string label and enum value

Author

: Vasile Mihai Ghete - HEPHY Vienna

$Date$ $Revision$

Typedef Documentation

typedef std::map<std::string, L1GtAlgorithm> l1t::AlgorithmMap

map containing the algorithms

Definition at line 32 of file TriggerMenuFwd.h.

typedef BXVector<CaloCluster> l1t::CaloClusterBxCollection

Definition at line 65 of file CaloCluster.h.

typedef BXVector<CaloEmCand> l1t::CaloEmCandBxCollection

Definition at line 26 of file CaloEmCand.h.

typedef BXVector<CaloRegion> l1t::CaloRegionBxCollection

Definition at line 47 of file CaloRegion.h.

typedef BXVector<CaloStage1Cluster> l1t::CaloStage1ClusterBxCollection

Definition at line 27 of file CaloStage1Cluster.h.

typedef BXVector<CaloTower> l1t::CaloTowerBxCollection

Definition at line 10 of file CaloTower.h.

typedef AlgorithmMap::const_iterator l1t::CItAlgo

iterators through map containing the algorithms

Definition at line 39 of file TriggerMenuFwd.h.

typedef ConditionMap::const_iterator l1t::CItCond

iterators through map containing the conditions

Definition at line 35 of file TriggerMenuFwd.h.

typedef std::map<std::string, GtCondition*> l1t::ConditionMap

Definition at line 29 of file TriggerMenuFwd.h.

typedef BXVector<EGamma> l1t::EGammaBxCollection

Definition at line 11 of file EGamma.h.

typedef BXVector<EtSum> l1t::EtSumBxCollection

Definition at line 10 of file EtSum.h.

typedef AlgorithmMap::iterator l1t::ItAlgo

Definition at line 40 of file TriggerMenuFwd.h.

typedef ConditionMap::iterator l1t::ItCond

Definition at line 36 of file TriggerMenuFwd.h.

typedef BXVector<Jet> l1t::JetBxCollection

Definition at line 10 of file Jet.h.

typedef BXVector<L1Candidate> l1t::L1CandidateBxCollection

Definition at line 9 of file L1Candidate.h.

typedef BXVector<Muon> l1t::MuonBxCollection

Definition at line 9 of file Muon.h.

typedef BXVector<Tau> l1t::TauBxCollection

Definition at line 10 of file Tau.h.

typedef edmplugin::PluginFactory<l1t::WriterProxy * ()> l1t::WriterFactory

Definition at line 88 of file WriterProxy.h.

Enumeration Type Documentation

enum l1t::GtConditionCategory

condition categories

Enumerator
CondNull
CondMuon
CondCalo
CondEnergySum
CondJetCounts
CondCorrelation
CondCastor
CondHfBitCounts
CondHfRingEtSums
CondBptx
CondExternal

Definition at line 128 of file GtDefinitions.h.

                         {
    CondNull,
    CondMuon,
    CondCalo,
    CondEnergySum,
    CondJetCounts,
    CondCorrelation,
    CondCastor,
    CondHfBitCounts,
    CondHfRingEtSums,
    CondBptx,
    CondExternal
};

enum l1t::GtConditionType

condition types TypeNull: null type - for condition constructor only Type1s : one particle Type2s : two particles, same type, no spatial correlations among them Type2wsc : two particles, same type, with spatial correlations among them Type2cor : two particles, different type, with spatial correlations among them Type3s : three particles, same type Type4s : four particles, same type TypeETM, TypeETT, TypeHTT, TypeHTM : ETM, ETT, HTT, HTM TypeJetCounts : JetCounts TypeCastor : CASTOR condition (logical result only; definition in CASTOR) TypeHfBitCounts : HfBitCounts TypeHfRingEtSums : HfRingEtSums TypeBptx: BPTX (logical result only; definition in BPTX system) TypeExternal: external conditions (logical result only; definition in L1 GT external systems)

Enumerator
TypeNull
Type1s
Type2s
Type2wsc
Type2cor
Type3s
Type4s
TypeETM
TypeETT
TypeHTT
TypeHTM
TypeJetCounts
TypeCastor
TypeHfBitCounts
TypeHfRingEtSums
TypeBptx
TypeExternal

Definition at line 99 of file GtDefinitions.h.

                     {
    TypeNull,
    Type1s,
    Type2s,
    Type2wsc,
    Type2cor,
    Type3s,
    Type4s,
    TypeETM,
    TypeETT,
    TypeHTT,
    TypeHTM,
    TypeJetCounts,
    TypeCastor,
    TypeHfBitCounts,
    TypeHfRingEtSums,
    TypeBptx,
    TypeExternal
};

enum l1t::L1GtBoardType

board types in GT

Enumerator
GTFE
FDL
PSB
GMT
TCS
TIM
BoardNull

Definition at line 28 of file GtDefinitions.h.

                   {
    GTFE,
    FDL,
    PSB,
    GMT,
    TCS,
    TIM,
    BoardNull
};

enum l1t::L1GtPsbQuad

quadruples sent to GT via PSB

Enumerator
Free
TechTr
IsoEGQ
NoIsoEGQ
CenJetQ
ForJetQ
TauJetQ
ESumsQ
JetCountsQ
MQB1
MQB2
MQF3
MQF4
MQB5
MQB6
MQF7
MQF8
MQB9
MQB10
MQF11
MQF12
CastorQ
HfQ
BptxQ
GtExternalQ
PsbQuadNull

Definition at line 47 of file GtDefinitions.h.

                 {
    Free,
    TechTr,
    IsoEGQ,
    NoIsoEGQ,
    CenJetQ,
    ForJetQ,
    TauJetQ,
    ESumsQ,
    JetCountsQ,
    MQB1,
    MQB2,
    MQF3,
    MQF4,
    MQB5,
    MQB6,
    MQF7,
    MQF8,
    MQB9,
    MQB10,
    MQF11,
    MQF12,
    CastorQ,
    HfQ,
    BptxQ,
    GtExternalQ,
    PsbQuadNull
};

Function Documentation

bool l1t::compareCorrJets	(	l1t::Jet	m,
		l1t::Jet	n
	)

Definition at line 12 of file JetCalibrationMethods.cc.

References l1t::L1Candidate::hwPt().

Referenced by JetCalibration1().

                                           {
    return (m.hwPt() < n.hwPt() );
  }

bool l1t::compareJets	(	l1t::Jet	i,
		l1t::Jet	j
	)

Definition at line 30 of file JetFinderMethods.cc.

References l1t::L1Candidate::hwPt().

Referenced by slidingWindowJetFinder().

                                       {
    return (i.hwPt() < j.hwPt() );
  }

int l1t::deltaGctPhi	(	const CaloRegion &	region,
		const CaloRegion &	neighbor
	)

Definition at line 19 of file JetFinderMethods.cc.

References funct::abs(), diffTreeTool::diff, l1t::L1Candidate::hwPhi(), and L1CaloRegionDetId::N_PHI.

Referenced by slidingWindowJetFinder().

  {
    int phi1 = region.hwPhi();
    int phi2 = neighbor.hwPhi();
    int diff = phi1 - phi2;
    if (std::abs(phi1 - phi2) == L1CaloRegionDetId::N_PHI-1) { //18 regions in phi
      diff = -diff/std::abs(diff);
    }
    return diff;
  }

void l1t::HICaloRingSubtraction	(	const std::vector< l1t::CaloRegion > &	regions,
		std::vector< l1t::CaloRegion > *	subRegions
	)

------------— For heavy ion ----------------------------------—

Definition at line 18 of file PUSubtractionMethods.cc.

References i, bookConverter::max, and L1CaloRegionDetId::N_ETA.

Referenced by l1t::Stage1Layer2SingleTrackHI::processEvent(), and l1t::Stage1Layer2JetAlgorithmImpHI::processEvent().

  {
    int puLevelHI[L1CaloRegionDetId::N_ETA];
    double r_puLevelHI[L1CaloRegionDetId::N_ETA];
    int etaCount[L1CaloRegionDetId::N_ETA];
    for(unsigned i = 0; i < L1CaloRegionDetId::N_ETA; ++i)
    {
      puLevelHI[i] = 0;
      r_puLevelHI[i] = 0.0;
      etaCount[i] = 0;
    }

    for(std::vector<CaloRegion>::const_iterator region = regions.begin();
    region != regions.end(); region++){
      r_puLevelHI[region->hwEta()] += region->hwPt();
      etaCount[region->hwEta()]++;
    }

    for(unsigned i = 0; i < L1CaloRegionDetId::N_ETA; ++i)
    {
      puLevelHI[i] = floor(r_puLevelHI[i]/etaCount[i] + 0.5);
    }

    for(std::vector<CaloRegion>::const_iterator region = regions.begin(); region!= regions.end(); region++){
      int subPt = std::max(0, region->hwPt() - puLevelHI[region->hwEta()]);
      int subEta = region->hwEta();
      int subPhi = region->hwPhi();

      ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> > *lorentz =
    new ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> >();

      CaloRegion newSubRegion(*lorentz, 0, 0, subPt, subEta, subPhi, 0, 0, 0);
      subRegions->push_back(newSubRegion);
    }
  }

void l1t::JetCalibration1	(	std::vector< l1t::Jet > *	uncalibjets,
		std::vector< double >	jetSF,
		std::vector< l1t::Jet > *	jets,
		bool	applyJetCalibration,
		double	jetLSB
	)

Definition at line 16 of file JetCalibrationMethods.cc.

References alpha, compareCorrJets(), reco::btau::jetEta, reco::btau::jetPhi, reco::btau::jetPt, and python.multivaluedict::sort().

Referenced by l1t::Stage1Layer2JetAlgorithmImpPP::processEvent().

  {

    for (std::vector<l1t::Jet>::const_iterator uncalibjet = uncalibjets->begin(); uncalibjet != uncalibjets->end(); ++uncalibjet){

      if (!applyJetCalibration) {
    l1t::Jet corrjets = *uncalibjet;
    jets->push_back(corrjets);
    continue;
      }
    
      int jetPt = (uncalibjet->hwPt())*jetLSB;  // correction factors are parameterized as functions of physical pt
      int jetPhi = uncalibjet->hwPhi();
      int jetEta = uncalibjet->hwEta();
      int jetQual = uncalibjet->hwQual();
      double jpt = 0.0;
      
      double alpha = jetSF[2*jetEta + 0]; //Scale factor (See jetSF_cfi.py)
      double gamma = ((jetSF[2*jetEta + 1])); //Offset
      
      jpt = jetPt*alpha+gamma;
      unsigned int corjetET =(int) (jpt/jetLSB);
      
      ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> > *jetLorentz =
    new ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> >();
      l1t::Jet corrjets(*jetLorentz, corjetET, jetEta, jetPhi, jetQual);
      
      jets->push_back(corrjets);
      
      
    }
    
    std::sort(jets->begin(), jets->end(), compareCorrJets);
    std::reverse(jets->begin(), jets->end());
  }

std::string l1t::l1GtBoardTypeEnumToString

(

const L1GtBoardType &

boardType

)

Definition at line 144 of file GtDefinitions.cc.

References BoardNull, and query::result.

                                                                          {
    char const *result= valueToKey(boardType, l1GtBoardTypeStringToEnumMap);
    if (boardType == l1t::BoardNull) {
        edm::LogInfo("GtDefinitions")
                << "\n  l1t::BoardNull means no valid board type defined!";
    }
    if (!result) {
      edm::LogInfo("GtDefinitions") << "\n  '" << boardType
                  << "' is not a recognized l1t::L1GtBoardType. "
                  << "\n  Return l1t::BoardNull, which means no valid board type defined!";
      return "l1t::BoardNull";
    }
    return result;
}

l1t::L1GtBoardType l1t::l1GtBoardTypeStringToEnum

(

const std::string &

label

)

Definition at line 128 of file GtDefinitions.cc.

References BoardNull, BoardNull, and relativeConstraints::value.

                                                                      {
    l1t::L1GtBoardType value = keyToValue(label.c_str(), l1GtBoardTypeStringToEnumMap);
    if (value == (l1t::L1GtBoardType) - 1) {
        edm::LogInfo("GtDefinitions") << "\n  '" << label
                << "' is not a recognized l1t::L1GtBoardType. \n  Return l1t::BoardNull.";
        value = l1t::BoardNull;
    }

    if (value == l1t::BoardNull) {
        edm::LogInfo("GtDefinitions")
                << "\n  l1t::BoardNull means no valid board type defined!";
    }

    return value;
}

std::string l1t::l1GtConditionCategoryEnumToString

(

const GtConditionCategory &

conditionCategory

)

Definition at line 248 of file GtDefinitions.cc.

References CondNull, and query::result.

                                                                                                {
  char const *result = valueToKey(conditionCategory, l1GtConditionCategoryStringToEnumMap);
  if (conditionCategory == l1t::CondNull)
    edm::LogInfo("GtDefinitions")
            << "\n  Return l1t::CondNull, which means no valid condition category defined!";
    
  if (!result) {
    result = "l1t::CondNull";
    edm::LogInfo("GtDefinitions") << "\n  '" << conditionCategory
            << "' is not a recognized l1t::GtConditionCategory. "
            << "\n  Return l1t::CondNull, which means no valid condition category defined!";
  }

  return result;
}

l1t::GtConditionCategory l1t::l1GtConditionCategoryStringToEnum

(

const std::string &

label

)

Definition at line 229 of file GtDefinitions.cc.

References CondNull, CondNull, and relativeConstraints::value.

                                                                                    {
  l1t::GtConditionCategory value = keyToValue(label.c_str(), l1GtConditionCategoryStringToEnumMap);
  // in case of unrecognized l1t::GtConditionCategory, return l1t::CondNull
  // to be dealt by the corresponding module
  if (value == (l1t::GtConditionCategory) -1) {
    edm::LogInfo("GtDefinitions") << "\n  '" << label
            << "' is not a recognized l1t::GtConditionCategory. \n  Return l1t::CondNull.";

    value = l1t::CondNull;
  }

  if (value == l1t::CondNull) {
      edm::LogInfo("GtDefinitions")
              << "\n  l1t::CondNull means no valid condition category defined!";
  }

  return value;
}

std::string l1t::l1GtConditionTypeEnumToString

(

const GtConditionType &

conditionType

)

Definition at line 215 of file GtDefinitions.cc.

References query::result, and TypeNull.

                                                                                    {
  const char *result = valueToKey(conditionType, l1GtConditionTypeStringToEnumMap);
  if (conditionType == l1t::TypeNull)
    edm::LogInfo("GtDefinitions") 
      << "\n  Return l1t::TypeNull, which means no valid condition type defined!";
  if (!result) {
    result = "l1t::TypeNull";
    edm::LogInfo("GtDefinitions") << "\n  '" << conditionType
            << "' is not a recognized l1t::GtConditionType. "
            << "\n  Return l1t::TypeNull, which means no valid condition type defined!";
  }
  return result;
}

l1t::GtConditionType l1t::l1GtConditionTypeStringToEnum

(

const std::string &

label

)

Definition at line 195 of file GtDefinitions.cc.

References TypeNull, TypeNull, and relativeConstraints::value.

                                                                            {
    l1t::GtConditionType value = keyToValue(label.c_str(), l1GtConditionTypeStringToEnumMap);

    // in case of unrecognized l1t::GtConditionType, return l1t::TypeNull
    // to be dealt by the corresponding module
    if (value == (l1t::GtConditionType) -1) {
        edm::LogInfo("GtDefinitions")  << "\n  '" << label
                << "' is not a recognized l1t::GtConditionType. \n  Return l1t::TypeNull.";

        value = l1t::TypeNull;
    }

    if (value == l1t::TypeNull) {
        edm::LogInfo("GtDefinitions")
                << "\n  l1t::TypeNull means no valid condition type defined!";
    }

    return value;
}

std::string l1t::l1GtPsbQuadEnumToString

(

const L1GtPsbQuad &

psbQuad

)

Definition at line 180 of file GtDefinitions.cc.

References PsbQuadNull, and query::result.

                                                                    {
  char const*result = valueToKey(psbQuad, l1GtPsbQuadStringToEnumMap);
  if (psbQuad == l1t::PsbQuadNull)
    edm::LogInfo("GtDefinitions") << "\n  l1t::PsbQuadNull means no valid PSB quadruplet defined!";
  if (!result) {
    result = "l1t::PsbQuadNull";
    edm::LogInfo("GtDefinitions") << "\n  '" << psbQuad
                 << "' is not a recognized l1t::L1GtPsbQuad. "
                 << "\n  Return l1t::PsbQuadNull, which means no valid PSB quadruplet defined!";
  }

  return result;
}

l1t::L1GtPsbQuad l1t::l1GtPsbQuadStringToEnum

(

const std::string &

label

)

Definition at line 162 of file GtDefinitions.cc.

References PsbQuadNull, PsbQuadNull, and relativeConstraints::value.

                                                                  {
    l1t::L1GtPsbQuad value = keyToValue(label.c_str(), l1GtPsbQuadStringToEnumMap);
    // in case of unrecognized l1t::L1GtPsbQuad, return l1t::PsbQuadNull
    // to be dealt by the corresponding module
    if (value == -1) {
        edm::LogInfo("GtDefinitions") << "\n  '" << label
                << "' is not a recognized l1t::L1GtPsbQuad. \n  Return l1t::PsbQuadNull.";
        value = l1t::PsbQuadNull;
    }

    if (value == l1t::PsbQuadNull) {
        edm::LogInfo("GtDefinitions")
                << "\n  l1t::PsbQuadNull means no valid PSB quadruplet defined!";
    }

    return value;
}

void l1t::RegionCorrection	(	const std::vector< l1t::CaloRegion > &	regions,
		const std::vector< l1t::CaloEmCand > &	EMCands,
		std::vector< l1t::CaloRegion > *	subRegions,
		std::vector< double >	regionSubtraction,
		bool	PUSubtract
	)

------— New region correction (PUsub, no response correction at the moment) --------—

Definition at line 58 of file PUSubtractionMethods.cc.

References alpha, and l1t::L1Candidate::hwPt().

Referenced by l1t::Stage1Layer2EGammaAlgorithmImpPP::processEvent(), l1t::Stage1Layer2EtSumAlgorithmImpPP::processEvent(), l1t::Stage1Layer2TauAlgorithmImpPP::processEvent(), and l1t::Stage1Layer2JetAlgorithmImpPP::processEvent().

{

   int puMult = 0;
   // ------------ This calulates PUM0 -------------------
   for(std::vector<CaloRegion>::const_iterator notCorrectedRegion = regions.begin();
       notCorrectedRegion != regions.end(); notCorrectedRegion++){
      int regionET = notCorrectedRegion->hwPt();
      // cout << "regionET: " << regionET <<endl;
      if (regionET > 0) {puMult++;}
   }

   for(std::vector<CaloRegion>::const_iterator notCorrectedRegion = regions.begin();
       notCorrectedRegion != regions.end(); notCorrectedRegion++){ 
     
     if(!PUSubtract) {
       CaloRegion newSubRegion= *notCorrectedRegion;
       subRegions->push_back(newSubRegion);
       continue;
     }

      int regionET = notCorrectedRegion->hwPt();
      int regionEta = notCorrectedRegion->hwEta();
      int regionPhi = notCorrectedRegion->hwPhi();

      int regionEtCorr (0);
      // Only non-empty regions are corrected
      if (regionET !=0) {
    int energyECAL2x1=0;
    // Find associated 2x1 ECAL energy (EG are calibrated, 
    // we should not scale them up, it affects the isolation routines)
    // 2x1 regions have the MAX tower contained in the 4x4 region that its position points to.
    // This is to not break isolation.
    for(CaloEmCandBxCollection::const_iterator egCand = EMCands.begin();
        egCand != EMCands.end(); egCand++) {
      int et = egCand->hwPt();
      if(egCand->hwPhi() == regionPhi && egCand->hwEta() == regionEta) {
            energyECAL2x1=et;
            break; // I do not really like "breaks"
      }
    }

    //comment out region corrections (below) at the moment since they're broken

    //double alpha = regionSF[2*regionEta + 0]; //Region Scale factor (See regionSF_cfi)
    //double gamma = 2*((regionSF[2*regionEta + 1])/9); //Region Offset. 
    // It needs to be divided by nine from the jet derived value in the lookup table. 
    // Multiplied by 2 because gamma is given in regionPhysicalET (=regionEt*regionLSB), 
    // while we want regionEt= physicalEt/LSB and LSB=.5.


    //if(!ResponseCorr || regionET<20) {alpha=1;  gamma=0;}
        double alpha=1;  double gamma=0;


    int pumbin = (int) puMult/22; //396 Regions. Bins are 22 wide. Dividing by 22 gives which bin# of the 18 bins.

    double puSub = regionSubtraction[18*regionEta+pumbin]*2;
    // The values in regionSubtraction are MULTIPLIED by 
    // RegionLSB=.5 (physicalRegionEt), so to get back unmultiplied 
    // regionSubtraction we want to multiply the number by 2 
    // (aka divide by LSB). 

    int corrpum0pt (0);
    if(regionET - puSub>0) {
      int pum0pt = (regionET - puSub-energyECAL2x1); //subtract ECAl energy
      
      corrpum0pt = pum0pt*alpha+gamma+energyECAL2x1; 
      //add back in ECAL energy, calibrate regions(not including the ECAL2x1).
      if (corrpum0pt <0 || pum0pt<0) {corrpum0pt=0;} //zero floor
    }
    regionEtCorr = corrpum0pt;  
      }

      ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> > *lorentz =
         new ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> >();
      CaloRegion newSubRegion(*lorentz, 0, 0, regionEtCorr, regionEta, regionPhi, 0, 0, 0);
      subRegions->push_back(newSubRegion);
   }

}

void l1t::slidingWindowJetFinder	(	const int	jetSeedThreshold,
		const std::vector< l1t::CaloRegion > *	regions,
		std::vector< l1t::Jet > *	uncalibjets
	)

Definition at line 34 of file JetFinderMethods.cc.

References compareJets(), gather_cfg::cout, deltaGctPhi(), reco::btau::jetEta, reco::btau::jetPhi, and python.multivaluedict::sort().

Referenced by l1t::Stage1Layer2EGammaAlgorithmImpPP::processEvent(), l1t::Stage1Layer2JetAlgorithmImpHI::processEvent(), l1t::Stage1Layer2TauAlgorithmImpPP::processEvent(), and l1t::Stage1Layer2JetAlgorithmImpPP::processEvent().

  {
    // std::cout << "Jet Seed: " << jetSeedThreshold << std::endl;
    for(std::vector<CaloRegion>::const_iterator region = regions->begin(); region != regions->end(); region++) {
      double regionET = region->hwPt(); //regionPhysicalEt(*region);
      if (regionET  <= jetSeedThreshold) continue;
      double neighborN_et = 0;
      double neighborS_et = 0;
      double neighborE_et = 0;
      double neighborW_et = 0;
      double neighborNE_et = 0;
      double neighborSW_et = 0;
      double neighborNW_et = 0;
      double neighborSE_et = 0;
      unsigned int nNeighbors = 0;
      for(std::vector<CaloRegion>::const_iterator neighbor = regions->begin(); neighbor != regions->end(); neighbor++) {
    double neighborET = neighbor->hwPt(); //regionPhysicalEt(*neighbor);
    if(deltaGctPhi(*region, *neighbor) == 1 &&
       (region->hwEta()    ) == neighbor->hwEta()) {
      neighborN_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == -1 &&
        (region->hwEta()    ) == neighbor->hwEta()) {
      neighborS_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == 0 &&
        (region->hwEta() + 1) == neighbor->hwEta()) {
      neighborE_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == 0 &&
        (region->hwEta() - 1) == neighbor->hwEta()) {
      neighborW_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == 1 &&
        (region->hwEta() + 1) == neighbor->hwEta()) {
      neighborNE_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == -1 &&
        (region->hwEta() - 1) == neighbor->hwEta()) {
      neighborSW_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == 1 &&
        (region->hwEta() - 1) == neighbor->hwEta()) {
      neighborNW_et = neighborET;
      nNeighbors++;
      continue;
    }
    else if(deltaGctPhi(*region, *neighbor) == -1 &&
        (region->hwEta() + 1) == neighbor->hwEta()) {
      neighborSE_et = neighborET;
      nNeighbors++;
      continue;
    }
      }
      if(regionET > neighborN_et &&
     regionET > neighborNW_et &&
     regionET > neighborW_et &&
     regionET > neighborSW_et &&
     regionET >= neighborNE_et &&
     regionET >= neighborE_et &&
     regionET >= neighborSE_et &&
     regionET >= neighborS_et) {
    unsigned int jetET = regionET +
      neighborN_et + neighborS_et + neighborE_et + neighborW_et +
      neighborNE_et + neighborSW_et + neighborSE_et + neighborNW_et;
    /*
      int jetPhi = region->hwPhi() * 4 +
      ( - 2 * (neighborS_et + neighborSE_et + neighborSW_et)
      + 2 * (neighborN_et + neighborNE_et + neighborNW_et) ) / jetET;
      if(jetPhi < 0) {

      }
      else if(jetPhi >= ((int) N_JET_PHI)) {
      jetPhi -= N_JET_PHI;
      }
      int jetEta = region->hwEta() * 4 +
      ( - 2 * (neighborW_et + neighborNW_et + neighborSW_et)
      + 2 * (neighborE_et + neighborNE_et + neighborSE_et) ) / jetET;
      if(jetEta < 0) jetEta = 0;
      if(jetEta >= ((int) N_JET_ETA)) jetEta = N_JET_ETA - 1;
    */
    // Temporarily use the region granularity -- we will try to improve as above when code is debugged
    int jetPhi = region->hwPhi();
    int jetEta = region->hwEta();

    bool neighborCheck = (nNeighbors == 8);
    // On the eta edge we only expect 5 neighbors
    if (!neighborCheck && (jetEta == 0 || jetEta == 21) && nNeighbors == 5)
      neighborCheck = true;

    if (!neighborCheck) {
      std::cout << "phi: " << jetPhi << " eta: " << jetEta << " n: " << nNeighbors << std::endl;
      assert(false);
    }

    //first iteration, eta cut defines forward
    //const bool forward = (jetEta <= 4 || jetEta >= 17);
    const bool forward = (jetEta < 4 || jetEta > 17);
    int jetQual = 0;
    if(forward)
      jetQual |= 0x2;

    ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> > *jetLorentz =
      new ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> >();
    l1t::Jet theJet(*jetLorentz, jetET, jetEta, jetPhi, jetQual);
    //l1t::Jet theJet(0, jetET, jetEta, jetPhi);

    uncalibjets->push_back(theJet);
      }
    }

    // // separate loops for the central jets at the edges of HF, composed of 6 regions only.
    // for(std::vector<CaloRegion>::const_iterator region = regions->begin(); region != regions->end(); region++) {
    //   double regionET = region->hwPt();
    //   // look at only the left eta wall
    //   if (region->hwEta() != 4) continue;
    //   if (regionET  < jetSeedThreshold) continue;
    //   double neighborN_et = 0;
    //   double neighborS_et = 0;
    //   double neighborE_et = 0;
    //   //double neighborW_et = 0;
    //   double neighborNE_et = 0;
    //   //double neighborSW_et = 0;
    //   //double neighborNW_et = 0;
    //   double neighborSE_et = 0;
    //   unsigned int nNeighbors = 0;
    //   for(std::vector<CaloRegion>::const_iterator neighbor = regions->begin(); neighbor != regions->end(); neighbor++) {

    //  double neighborET = neighbor->hwPt(); //regionPhysicalEt(*neighbor);
    //  if(deltaGctPhi(*region, *neighbor) == 1 &&
    //     (region->hwEta()    ) == neighbor->hwEta()) {
    //    neighborN_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  else if(deltaGctPhi(*region, *neighbor) == -1 &&
    //      (region->hwEta()    ) == neighbor->hwEta()) {
    //    neighborS_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  else if(deltaGctPhi(*region, *neighbor) == 0 &&
    //      (region->hwEta() + 1) == neighbor->hwEta()) {
    //    neighborE_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  // else if(deltaGctPhi(*region, *neighbor) == 0 &&
    //  //  (region->hwEta() - 1) == neighbor->hwEta()) {
    //  //   neighborW_et = neighborET;
    //  //   nNeighbors++;
    //  //   continue;
    //  // }
    //  else if(deltaGctPhi(*region, *neighbor) == 1 &&
    //      (region->hwEta() + 1) == neighbor->hwEta()) {
    //    neighborNE_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  // else if(deltaGctPhi(*region, *neighbor) == -1 &&
    //  //  (region->hwEta() - 1) == neighbor->hwEta()) {
    //  //   neighborSW_et = neighborET;
    //  //   nNeighbors++;
    //  //   continue;
    //  // }
    //  // else if(deltaGctPhi(*region, *neighbor) == 1 &&
    //  //  (region->hwEta() - 1) == neighbor->hwEta()) {
    //  //   neighborNW_et = neighborET;
    //  //   nNeighbors++;
    //  //   continue;
    //  // }
    //  else if(deltaGctPhi(*region, *neighbor) == -1 &&
    //      (region->hwEta() + 1) == neighbor->hwEta()) {
    //    neighborSE_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //   }
    //   if(regionET > neighborN_et &&
    //   //regionET > neighborNW_et &&
    //   //regionET > neighborW_et &&
    //   //regionET > neighborSW_et &&
    //   regionET >= neighborNE_et &&
    //   regionET >= neighborE_et &&
    //   regionET >= neighborSE_et &&
    //   regionET >= neighborS_et) {
    //  unsigned int jetET = regionET +
    //    neighborN_et + neighborS_et + neighborE_et + /*neighborW_et +*/
    //    neighborNE_et + /*neighborSW_et +*/ neighborSE_et;// + neighborNW_et;
    //  /*
    //    int jetPhi = region->hwPhi() * 4 +
    //    ( - 2 * (neighborS_et + neighborSE_et + neighborSW_et)
    //    + 2 * (neighborN_et + neighborNE_et + neighborNW_et) ) / jetET;
    //    if(jetPhi < 0) {

    //    }
    //    else if(jetPhi >= ((int) N_JET_PHI)) {
    //    jetPhi -= N_JET_PHI;
    //    }
    //    int jetEta = region->hwEta() * 4 +
    //    ( - 2 * (neighborW_et + neighborNW_et + neighborSW_et)
    //    + 2 * (neighborE_et + neighborNE_et + neighborSE_et) ) / jetET;
    //    if(jetEta < 0) jetEta = 0;
    //    if(jetEta >= ((int) N_JET_ETA)) jetEta = N_JET_ETA - 1;
    //  */
    //  // Temporarily use the region granularity -- we will try to improve as above when code is debugged
    //  int jetPhi = region->hwPhi();
    //  int jetEta = region->hwEta();

    //  bool neighborCheck = (nNeighbors == 5);
    //  // On the eta edge we only expect 5 neighbors
    //  // if (!neighborCheck && (jetEta == 0 || jetEta == 21) && nNeighbors == 5)
    //  //   neighborCheck = true;

    //  if (!neighborCheck) {
    //    std::cout << "phi: " << jetPhi << " eta: " << jetEta << " n: " << nNeighbors << std::endl;
    //    assert(false);
    //  }

    //  const bool forward = false; //by definition
    //  int jetQual = 0;
    //  if(forward)
    //    jetQual |= 0x2;

    //  ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> > *jetLorentz =
    //    new ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> >();
    //  l1t::Jet theJet(*jetLorentz, jetET, jetEta, jetPhi, jetQual);
    //  //l1t::Jet theJet(0, jetET, jetEta, jetPhi);

    //  jets->push_back(theJet);
    //   }
    // }

    // // separate loops for the central jets at the edges of HF, composed of 6 regions only.
    // for(std::vector<CaloRegion>::const_iterator region = regions->begin(); region != regions->end(); region++) {
    //   double regionET = region->hwPt();
    //   // look at only the right eta wall
    //   if (region->hwEta() != 17) continue;
    //   if (regionET  < jetSeedThreshold) continue;
    //   double neighborN_et = 0;
    //   double neighborS_et = 0;
    //   //double neighborE_et = 0;
    //   double neighborW_et = 0;
    //   //double neighborNE_et = 0;
    //   double neighborSW_et = 0;
    //   double neighborNW_et = 0;
    //   //double neighborSE_et = 0;
    //   unsigned int nNeighbors = 0;
    //   for(std::vector<CaloRegion>::const_iterator neighbor = regions->begin(); neighbor != regions->end(); neighbor++) {

    //  double neighborET = neighbor->hwPt(); //regionPhysicalEt(*neighbor);
    //  if(deltaGctPhi(*region, *neighbor) == 1 &&
    //     (region->hwEta()    ) == neighbor->hwEta()) {
    //    neighborN_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  else if(deltaGctPhi(*region, *neighbor) == -1 &&
    //      (region->hwEta()    ) == neighbor->hwEta()) {
    //    neighborS_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  // else if(deltaGctPhi(*region, *neighbor) == 0 &&
    //  //  (region->hwEta() + 1) == neighbor->hwEta()) {
    //  //   neighborE_et = neighborET;
    //  //   nNeighbors++;
    //  //   continue;
    //  // }
    //  else if(deltaGctPhi(*region, *neighbor) == 0 &&
    //      (region->hwEta() - 1) == neighbor->hwEta()) {
    //    neighborW_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  // else if(deltaGctPhi(*region, *neighbor) == 1 &&
    //  //  (region->hwEta() + 1) == neighbor->hwEta()) {
    //  //   neighborNE_et = neighborET;
    //  //   nNeighbors++;
    //  //   continue;
    //  // }
    //  else if(deltaGctPhi(*region, *neighbor) == -1 &&
    //      (region->hwEta() - 1) == neighbor->hwEta()) {
    //    neighborSW_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  else if(deltaGctPhi(*region, *neighbor) == 1 &&
    //      (region->hwEta() - 1) == neighbor->hwEta()) {
    //    neighborNW_et = neighborET;
    //    nNeighbors++;
    //    continue;
    //  }
    //  // else if(deltaGctPhi(*region, *neighbor) == -1 &&
    //  //  (region->hwEta() + 1) == neighbor->hwEta()) {
    //  //   neighborSE_et = neighborET;
    //  //   nNeighbors++;
    //  //   continue;
    //  // }
    //   }
    //   if(//regionET > neighborN_et &&
    //   regionET > neighborNW_et &&
    //   regionET > neighborW_et &&
    //   regionET > neighborSW_et &&
    //   //regionET >= neighborNE_et &&
    //   //regionET >= neighborE_et &&
    //   //regionET >= neighborSE_et &&
    //   regionET >= neighborS_et) {
    //  unsigned int jetET = regionET +
    //    neighborN_et + neighborS_et + /*neighborE_et + */neighborW_et +
    //    /*neighborNE_et +*/ neighborSW_et + /*neighborSE_et + */neighborNW_et;
    //  /*
    //    int jetPhi = region->hwPhi() * 4 +
    //    ( - 2 * (neighborS_et + neighborSE_et + neighborSW_et)
    //    + 2 * (neighborN_et + neighborNE_et + neighborNW_et) ) / jetET;
    //    if(jetPhi < 0) {

    //    }
    //    else if(jetPhi >= ((int) N_JET_PHI)) {
    //    jetPhi -= N_JET_PHI;
    //    }
    //    int jetEta = region->hwEta() * 4 +
    //    ( - 2 * (neighborW_et + neighborNW_et + neighborSW_et)
    //    + 2 * (neighborE_et + neighborNE_et + neighborSE_et) ) / jetET;
    //    if(jetEta < 0) jetEta = 0;
    //    if(jetEta >= ((int) N_JET_ETA)) jetEta = N_JET_ETA - 1;
    //  */
    //  // Temporarily use the region granularity -- we will try to improve as above when code is debugged
    //  int jetPhi = region->hwPhi();
    //  int jetEta = region->hwEta();

    //  bool neighborCheck = (nNeighbors == 5);
    //  // On the eta edge we only expect 5 neighbors
    //  // if (!neighborCheck && (jetEta == 0 || jetEta == 21) && nNeighbors == 5)
    //  //   neighborCheck = true;

    //  if (!neighborCheck) {
    //    std::cout << "phi: " << jetPhi << " eta: " << jetEta << " n: " << nNeighbors << std::endl;
    //    assert(false);
    //  }

    //  const bool forward = false; //by definition
    //  int jetQual = 0;
    //  if(forward)
    //    jetQual |= 0x2;

    //  ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> > *jetLorentz =
    //    new ROOT::Math::LorentzVector<ROOT::Math::PxPyPzE4D<double> >();
    //  l1t::Jet theJet(*jetLorentz, jetET, jetEta, jetPhi, jetQual);
    //  //l1t::Jet theJet(0, jetET, jetEta, jetPhi);

    //  jets->push_back(theJet);
    //   }
    // }
 
    //the jets should be sorted, highest pT first.
    // do not truncate the jet list, GT converter handles that
    std::sort(uncalibjets->begin(), uncalibjets->end(), compareJets);
    std::reverse(uncalibjets->begin(), uncalibjets->end());
  }