L1TrackJetProducer.cc

Go to the documentation of this file.

// Original Author:  Rishi Patel
// Modifications:    George Karathanasis, georgios.karathanasis@cern.ch, CU Boulder
//         Created:  Wed, 01 Aug 2018 14:01:41 GMT
//
// Track jets are clustered in a two-layer process, first by clustering in phi,
// then by clustering in eta
// Introduction to object (p10-13):
// https://indico.cern.ch/event/791517/contributions/3341650/attachments/1818736/2973771/TrackBasedAlgos_L1TMadrid_MacDonald.pdf

// system include files

#include "DataFormats/Common/interface/Ref.h"
#include "DataFormats/L1TCorrelator/interface/TkJet.h"
#include "DataFormats/L1TCorrelator/interface/TkJetFwd.h"
#include "DataFormats/L1TrackTrigger/interface/TTTypes.h"
#include "DataFormats/L1TrackTrigger/interface/TTTrack.h"
// user include files
#include "FWCore/Framework/interface/Frameworkfwd.h"
#include "FWCore/Framework/interface/stream/EDProducer.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCore/Framework/interface/EventSetup.h"
#include "FWCore/Framework/interface/MakerMacros.h"
#include "FWCore/ParameterSet/interface/ParameterSet.h"
#include "FWCore/Utilities/interface/StreamID.h"
#include "Geometry/Records/interface/TrackerDigiGeometryRecord.h"
#include "Geometry/CommonTopologies/interface/PixelGeomDetUnit.h"
#include "Geometry/CommonTopologies/interface/PixelGeomDetType.h"
#include "Geometry/TrackerGeometryBuilder/interface/TrackerGeometry.h"

#include "DataFormats/L1Trigger/interface/Vertex.h"
#include "L1Trigger/L1TTrackMatch/interface/L1TrackJetProducer.h"
#include "TH1D.h"
#include "TH2D.h"
#include <TMath.h>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <memory>
#include <string>

using namespace std;
using namespace edm;
using namespace l1t;
class L1TrackJetProducer : public stream::EDProducer<> {
public:
  explicit L1TrackJetProducer(const ParameterSet &);
  ~L1TrackJetProducer() override;
  typedef TTTrack<Ref_Phase2TrackerDigi_> L1TTTrackType;
  typedef vector<L1TTTrackType> L1TTTrackCollectionType;

  static void fillDescriptions(ConfigurationDescriptions &descriptions);
  bool trackQualityCuts(int trk_nstub, float trk_chi2, float trk_bendchi2);
  void L2_cluster(vector<Ptr<L1TTTrackType> > L1TrkPtrs_, vector<int> tdtrk_, MaxZBin &mzb);
  virtual EtaPhiBin *L1_cluster(EtaPhiBin *phislice);

private:
  void beginStream(StreamID) override;
  void produce(Event &, const EventSetup &) override;
  void endStream() override;

  // ----------member data ---------------------------

  vector<Ptr<L1TTTrackType> > L1TrkPtrs_;
  vector<int> zBinCount_;
  vector<int> tdtrk_;
  const float trkZMax_;
  const float trkPtMax_;
  const float trkPtMin_;
  const float trkEtaMax_;
  const float trkChi2dofMax_;
  const float trkBendChi2Max_;
  const int trkNPSStubMin_;
  const double minTrkJetpT_;
  const double minJetEtLowPt_;
  const double minJetEtHighPt_;
  int etaBins_;
  int phiBins_;
  int zBins_;
  float d0CutNStubs4_;
  float d0CutNStubs5_;
  const int lowpTJetMinTrackMultiplicity_;
  const int highpTJetMinTrackMultiplicity_;
  bool displaced_;
  float nStubs4DisplacedChi2_;
  float nStubs5DisplacedChi2_;
  float nStubs4DisplacedBend_;
  float nStubs5DisplacedBend_;
  int nDisplacedTracks_;
  float dzPVTrk_;

  const EDGetTokenT<vector<TTTrack<Ref_Phase2TrackerDigi_> > > trackToken_;
  const edm::EDGetTokenT<std::vector<l1t::Vertex> > PVtxToken_;
  edm::ESGetToken<TrackerTopology, TrackerTopologyRcd> tTopoToken_;

  float zStep_;
  float etaStep_;
  float phiStep_;
};

L1TrackJetProducer::L1TrackJetProducer(const ParameterSet &iConfig)
    : trkZMax_((float)iConfig.getParameter<double>("trk_zMax")),
      trkPtMax_((float)iConfig.getParameter<double>("trk_ptMax")),
      trkPtMin_((float)iConfig.getParameter<double>("trk_ptMin")),
      trkEtaMax_((float)iConfig.getParameter<double>("trk_etaMax")),
      trkChi2dofMax_((float)iConfig.getParameter<double>("trk_chi2dofMax")),
      trkBendChi2Max_((float)iConfig.getParameter<double>("trk_bendChi2Max")),
      trkNPSStubMin_((int)iConfig.getParameter<int>("trk_nPSStubMin")),
      minTrkJetpT_(iConfig.getParameter<double>("minTrkJetpT")),
      minJetEtLowPt_(iConfig.getParameter<double>("minJetEtLowPt")),
      minJetEtHighPt_(iConfig.getParameter<double>("minJetEtHighPt")),
      etaBins_((int)iConfig.getParameter<int>("etaBins")),
      phiBins_((int)iConfig.getParameter<int>("phiBins")),
      zBins_((int)iConfig.getParameter<int>("zBins")),
      d0CutNStubs4_((float)iConfig.getParameter<double>("d0_cutNStubs4")),
      d0CutNStubs5_((float)iConfig.getParameter<double>("d0_cutNStubs5")),
      lowpTJetMinTrackMultiplicity_((int)iConfig.getParameter<int>("lowpTJetMinTrackMultiplicity")),
      highpTJetMinTrackMultiplicity_((int)iConfig.getParameter<int>("highpTJetMinTrackMultiplicity")),
      displaced_(iConfig.getParameter<bool>("displaced")),
      nStubs4DisplacedChi2_((float)iConfig.getParameter<double>("nStubs4DisplacedChi2")),
      nStubs5DisplacedChi2_((float)iConfig.getParameter<double>("nStubs5DisplacedChi2")),
      nStubs4DisplacedBend_((float)iConfig.getParameter<double>("nStubs4Displacedbend")),
      nStubs5DisplacedBend_((float)iConfig.getParameter<double>("nStubs5Displacedbend")),
      nDisplacedTracks_((int)iConfig.getParameter<int>("nDisplacedTracks")),
      dzPVTrk_((float)iConfig.getParameter<double>("MaxDzTrackPV")),
      trackToken_(
          consumes<vector<TTTrack<Ref_Phase2TrackerDigi_> > >(iConfig.getParameter<InputTag>("L1TrackInputTag"))),
      PVtxToken_(consumes<vector<l1t::Vertex> >(iConfig.getParameter<InputTag>("L1PVertexCollection"))),
      tTopoToken_(esConsumes<TrackerTopology, TrackerTopologyRcd>(edm::ESInputTag("", ""))) {
  zStep_ = 2.0 * trkZMax_ / (zBins_ + 1);
  etaStep_ = 2.0 * trkEtaMax_ / etaBins_;  //etaStep is the width of an etabin
  phiStep_ = 2 * M_PI / phiBins_;          

  if (displaced_)
    produces<TkJetCollection>("L1TrackJetsExtended");
  else
    produces<TkJetCollection>("L1TrackJets");
}

L1TrackJetProducer::~L1TrackJetProducer() {}

void L1TrackJetProducer::produce(Event &iEvent, const EventSetup &iSetup) {
  unique_ptr<TkJetCollection> L1L1TrackJetProducer(new TkJetCollection);

  // For TTStubs
  const TrackerTopology &tTopo = iSetup.getData(tTopoToken_);

  edm::Handle<vector<TTTrack<Ref_Phase2TrackerDigi_> > > TTTrackHandle;
  iEvent.getByToken(trackToken_, TTTrackHandle);
  vector<TTTrack<Ref_Phase2TrackerDigi_> >::const_iterator iterL1Track;

  edm::Handle<std::vector<l1t::Vertex> > PVtx;
  iEvent.getByToken(PVtxToken_, PVtx);
  float PVz = (PVtx->at(0)).z0();

  L1TrkPtrs_.clear();
  zBinCount_.clear();
  tdtrk_.clear();
  unsigned int this_l1track = 0;
  for (iterL1Track = TTTrackHandle->begin(); iterL1Track != TTTrackHandle->end(); iterL1Track++) {
    edm::Ptr<L1TTTrackType> trkPtr(TTTrackHandle, this_l1track);
    this_l1track++;
    float trk_pt = trkPtr->momentum().perp();
    int trk_nstubs = (int)trkPtr->getStubRefs().size();
    float trk_chi2dof = trkPtr->chi2Red();
    float trk_d0 = trkPtr->d0();
    float trk_bendchi2 = trkPtr->stubPtConsistency();
    float trk_z0 = trkPtr->z0();

    int trk_nPS = 0;
    for (int istub = 0; istub < trk_nstubs; istub++) {  // loop over the stubs
      DetId detId(trkPtr->getStubRefs().at(istub)->getDetId());
      if (detId.det() == DetId::Detector::Tracker) {
        if ((detId.subdetId() == StripSubdetector::TOB && tTopo.tobLayer(detId) <= 3) ||
            (detId.subdetId() == StripSubdetector::TID && tTopo.tidRing(detId) <= 9))
          trk_nPS++;
      }
    }
    if (trk_nPS < trkNPSStubMin_)
      continue;
    if (!trackQualityCuts(trk_nstubs, trk_chi2dof, trk_bendchi2))
      continue;
    if (std::abs(PVz - trk_z0) > dzPVTrk_)
      continue;
    if (std::abs(trk_z0) > trkZMax_)
      continue;
    if (std::abs(trkPtr->momentum().eta()) > trkEtaMax_)
      continue;
    if (trk_pt < trkPtMin_)
      continue;
    L1TrkPtrs_.push_back(trkPtr);
    zBinCount_.push_back(0);

    if ((std::abs(trk_d0) > d0CutNStubs5_ && trk_nstubs >= 5 && d0CutNStubs5_ >= 0) ||
        (trk_nstubs == 4 && std::abs(trk_d0) > d0CutNStubs4_ && d0CutNStubs4_ >= 0))
      tdtrk_.push_back(1);  //displaced track
    else
      tdtrk_.push_back(0);  // not displaced track
  }

  if (!L1TrkPtrs_.empty()) {
    MaxZBin mzb;

    L2_cluster(L1TrkPtrs_, tdtrk_, mzb);
    vector<Ptr<L1TTTrackType> > L1TrackAssocJet;
    if (mzb.clusters != nullptr) {
      for (int j = 0; j < mzb.nclust; ++j) {
        //FILL Two Layer Jets for Jet Collection
        if (mzb.clusters[j].pTtot <= trkPtMin_)
          continue;  //protects against reading bad memory
        if (mzb.clusters[j].numtracks < 1)
          continue;
        if (mzb.clusters[j].numtracks > 5000)
          continue;
        float jetEta = mzb.clusters[j].eta;
        float jetPhi = mzb.clusters[j].phi;
        float jetPt = mzb.clusters[j].pTtot;
        float jetPx = jetPt * cos(jetPhi);
        float jetPy = jetPt * sin(jetPhi);
        float jetPz = jetPt * sinh(jetEta);
        float jetP = jetPt * cosh(jetEta);
        int totalDisptrk = mzb.clusters[j].numtdtrks;
        bool isDispJet = totalDisptrk >= nDisplacedTracks_;
        math::XYZTLorentzVector jetP4(jetPx, jetPy, jetPz, jetP);
        L1TrackAssocJet.clear();
        for (unsigned int itrk = 0; itrk < mzb.clusters[j].trackidx.size(); itrk++) {
          L1TrackAssocJet.push_back(L1TrkPtrs_[mzb.clusters[j].trackidx[itrk]]);
        }

        TkJet trkJet(jetP4, L1TrackAssocJet, mzb.zbincenter, mzb.clusters[j].numtracks, 0, totalDisptrk, 0, isDispJet);
        if (!L1TrackAssocJet.empty()) {
          L1L1TrackJetProducer->push_back(trkJet);
        }
      }
    }

    if (displaced_)
      iEvent.put(std::move(L1L1TrackJetProducer), "L1TrackJetsExtended");
    else
      iEvent.put(std::move(L1L1TrackJetProducer), "L1TrackJets");
    delete[] mzb.clusters;
  }
}

void L1TrackJetProducer::L2_cluster(vector<Ptr<L1TTTrackType> > L1TrkPtrs_, vector<int> tdtrk_, MaxZBin &mzb) {
  const int nz = zBins_ + 1;
  MaxZBin all_zBins[nz];
  MaxZBin mzbtemp = {};
  for (int z = 0; z < nz; ++z)
    all_zBins[z] = mzbtemp;

  float zmin = -1.0 * trkZMax_;
  float zmax = zmin + 2 * zStep_;

  EtaPhiBin epbins[phiBins_][etaBins_];  // create grid of phiBins
  float phi = -1.0 * M_PI;
  float eta;
  float etamin, etamax, phimin, phimax;

  for (int i = 0; i < phiBins_; ++i) {
    eta = -1.0 * trkEtaMax_;
    for (int j = 0; j < etaBins_; ++j) {
      phimin = phi;
      phimax = phi + phiStep_;
      etamin = eta;
      eta = eta + etaStep_;
      etamax = eta;
      epbins[i][j].phi = (phimin + phimax) / 2.0;
      epbins[i][j].eta = (etamin + etamax) / 2.0;
    }  // for each etabin
    phi = phi + phiStep_;
  }  // for each phibin (finished creating epbins)

  mzb = all_zBins[0];
  int ntracks = L1TrkPtrs_.size();

  // uninitalized arrays
  EtaPhiBin *L1clusters[phiBins_];
  EtaPhiBin L2cluster[ntracks];

  for (int zbin = 0; zbin < zBins_; ++zbin) {
    for (int i = 0; i < phiBins_; ++i) {  //First initialize pT, numtracks, used to 0 (or false)
      for (int j = 0; j < etaBins_; ++j) {
        epbins[i][j].pTtot = 0;
        epbins[i][j].used = false;
        epbins[i][j].numtracks = 0;
        epbins[i][j].numttrks = 0;
        epbins[i][j].numtdtrks = 0;
        epbins[i][j].numttdtrks = 0;
        epbins[i][j].trackidx.clear();
      }  //for each etabin
      L1clusters[i] = epbins[i];
    }  //for each phibin

    for (unsigned int k = 0; k < L1TrkPtrs_.size(); ++k) {
      float trkpt = L1TrkPtrs_[k]->momentum().perp();
      float trketa = L1TrkPtrs_[k]->momentum().eta();
      float trkphi = L1TrkPtrs_[k]->momentum().phi();
      float trkZ = L1TrkPtrs_[k]->z0();

      for (int i = 0; i < phiBins_; ++i) {
        for (int j = 0; j < etaBins_; ++j) {
          L2cluster[k] = epbins[i][j];
          if ((zmin <= trkZ && zmax >= trkZ) &&
              ((epbins[i][j].eta - etaStep_ / 2.0 < trketa && epbins[i][j].eta + etaStep_ / 2.0 >= trketa) &&
               epbins[i][j].phi - phiStep_ / 2.0 < trkphi && epbins[i][j].phi + phiStep_ / 2.0 >= trkphi &&
               (zBinCount_[k] != 2))) {
            zBinCount_.at(k) = zBinCount_.at(k) + 1;
            if (trkpt < trkPtMax_)
              epbins[i][j].pTtot += trkpt;
            else
              epbins[i][j].pTtot += trkPtMax_;
            epbins[i][j].numtdtrks += tdtrk_[k];
            epbins[i][j].trackidx.push_back(k);
            ++epbins[i][j].numtracks;
          }  // if right bin
        }    // for each phibin: j loop
      }      // for each phibin: i loop
    }        // end loop over tracks

    for (int phislice = 0; phislice < phiBins_; ++phislice) {
      L1clusters[phislice] = L1_cluster(epbins[phislice]);
      if (L1clusters[phislice] != nullptr) {
        for (int ind = 0; L1clusters[phislice][ind].pTtot != 0; ++ind) {
          L1clusters[phislice][ind].used = false;
        }
      }
    }

    //Create clusters array to hold output cluster data for Layer2; can't have more clusters than tracks.
    //Find eta-phibin with maxpT, make center of cluster, add neighbors if not already used.
    float hipT = 0;
    int nclust = 0;
    int phibin = 0;
    int imax = -1;
    int index1;  //index of clusters array for each phislice
    float E1 = 0;
    float E0 = 0;
    float E2 = 0;
    int trx1, trx2;
    int tdtrk1, tdtrk2;
    int used1, used2, used3, used4;

    for (phibin = 0; phibin < phiBins_; ++phibin) {  //Find eta-phibin with highest pT
      while (true) {
        hipT = 0;
        for (index1 = 0; L1clusters[phibin][index1].pTtot > 0; ++index1) {
          if (!L1clusters[phibin][index1].used && L1clusters[phibin][index1].pTtot >= hipT) {
            hipT = L1clusters[phibin][index1].pTtot;
            imax = index1;
          }
        }  // for each index within the phibin

        if (hipT == 0)
          break;    // If highest pT is 0, all bins are used
        E0 = hipT;  // E0 is pT of first phibin of the cluster
        E1 = 0;
        E2 = 0;
        trx1 = 0;
        trx2 = 0;
        tdtrk1 = 0;
        tdtrk2 = 0;
        std::vector<unsigned int> trkidx1;
        std::vector<unsigned int> trkidx2;
        L2cluster[nclust] = L1clusters[phibin][imax];
        L1clusters[phibin][imax].used = true;
        // Add pT of upper neighbor
        // E1 is pT of the middle phibin (should be highest pT)
        if (phibin != phiBins_ - 1) {
          used1 = -1;
          used2 = -1;
          for (index1 = 0; L1clusters[phibin + 1][index1].pTtot != 0; ++index1) {
            if (L1clusters[phibin + 1][index1].used)
              continue;

            if (std::abs(L1clusters[phibin + 1][index1].eta - L1clusters[phibin][imax].eta) <= 1.5 * etaStep_) {
              E1 += L1clusters[phibin + 1][index1].pTtot;
              trx1 += L1clusters[phibin + 1][index1].numtracks;
              tdtrk1 += L1clusters[phibin + 1][index1].numtdtrks;
              for (unsigned int itrk = 0; itrk < L1clusters[phibin + 1][index1].trackidx.size(); itrk++) {
                trkidx1.push_back(L1clusters[phibin + 1][index1].trackidx[itrk]);
              }
              if (used1 < 0)
                used1 = index1;
              else
                used2 = index1;
            }  // if cluster is within one phibin
          }    // for each cluster in above phibin

          if (E1 < E0) {  // if E1 isn't higher, E0 and E1 are their own cluster
            L2cluster[nclust].pTtot += E1;
            L2cluster[nclust].numtracks += trx1;
            L2cluster[nclust].numtdtrks += tdtrk1;
            for (unsigned int itrk = 0; itrk < trkidx1.size(); itrk++) {
              L2cluster[nclust].trackidx.push_back(trkidx1[itrk]);
            }

            if (used1 >= 0)
              L1clusters[phibin + 1][used1].used = true;
            if (used2 >= 0)
              L1clusters[phibin + 1][used2].used = true;
            nclust++;
            continue;
          }

          if (phibin != phiBins_ - 2) {  // E2 will be the pT of the third phibin (should be lower than E1)
            used3 = -1;
            used4 = -1;
            for (index1 = 0; L1clusters[phibin + 2][index1].pTtot != 0; ++index1) {
              if (L1clusters[phibin + 2][index1].used)
                continue;
              if (std::abs(L1clusters[phibin + 2][index1].eta - L1clusters[phibin][imax].eta) <= 1.5 * etaStep_) {
                E2 += L1clusters[phibin + 2][index1].pTtot;
                trx2 += L1clusters[phibin + 2][index1].numtracks;
                tdtrk2 += L1clusters[phibin + 2][index1].numtdtrks;
                for (unsigned int itrk = 0; itrk < L1clusters[phibin + 2][index1].trackidx.size(); itrk++)
                  trkidx2.push_back(L1clusters[phibin + 2][index1].trackidx[itrk]);

                if (used3 < 0)
                  used3 = index1;
                else
                  used4 = index1;
              }
            }

            // if indeed E2 < E1, add E1 and E2 to E0, they're all a cluster together
            // otherwise, E0 is its own cluster
            if (E2 < E1) {
              L2cluster[nclust].pTtot += E1 + E2;
              L2cluster[nclust].numtracks += trx1 + trx2;
              L2cluster[nclust].numtdtrks += tdtrk1 + tdtrk2;
              L2cluster[nclust].phi = L1clusters[phibin + 1][used1].phi;
              for (unsigned int itrk = 0; itrk < trkidx1.size(); itrk++) {
                L2cluster[nclust].trackidx.push_back(trkidx1[itrk]);
              }
              for (unsigned int itrk = 0; itrk < trkidx2.size(); itrk++) {
                L2cluster[nclust].trackidx.push_back(trkidx2[itrk]);
              }

              if (used1 >= 0)
                L1clusters[phibin + 1][used1].used = true;
              if (used2 >= 0)
                L1clusters[phibin + 1][used2].used = true;
              if (used3 >= 0)
                L1clusters[phibin + 2][used3].used = true;
              if (used4 >= 0)
                L1clusters[phibin + 2][used4].used = true;
            }
            nclust++;
            continue;
          }  // end Not phiBins-2
          else {
            L2cluster[nclust].pTtot += E1;
            L2cluster[nclust].numtracks += trx1;
            L2cluster[nclust].numtdtrks += tdtrk1;
            L2cluster[nclust].phi = L1clusters[phibin + 1][used1].phi;
            for (unsigned int itrk = 0; itrk < trkidx1.size(); itrk++) {
              L2cluster[nclust].trackidx.push_back(trkidx1[itrk]);
            }

            if (used1 >= 0)
              L1clusters[phibin + 1][used1].used = true;
            if (used2 >= 0)
              L1clusters[phibin + 1][used2].used = true;
            nclust++;
            continue;
          }
        }       //End not last phibin(23)
        else {  //if it is phibin 23
          L1clusters[phibin][imax].used = true;
          nclust++;
        }
      }  // while hipT not 0
    }    // for each phibin

    for (phibin = 0; phibin < phiBins_; ++phibin)
      delete[] L1clusters[phibin];

    // Now merge clusters, if necessary
    for (int m = 0; m < nclust - 1; ++m) {
      for (int n = m + 1; n < nclust; ++n) {
        if (L2cluster[n].eta == L2cluster[m].eta && (std::abs(L2cluster[n].phi - L2cluster[m].phi) < 1.5 * phiStep_ ||
                                                     std::abs(L2cluster[n].phi - L2cluster[m].phi) > 6.0)) {
          if (L2cluster[n].pTtot > L2cluster[m].pTtot) {
            L2cluster[m].phi = L2cluster[n].phi;
          }
          L2cluster[m].pTtot += L2cluster[n].pTtot;
          L2cluster[m].numtracks += L2cluster[n].numtracks;
          L2cluster[m].numtdtrks += L2cluster[n].numtdtrks;
          for (unsigned int itrk = 0; itrk < L2cluster[n].trackidx.size(); itrk++)
            L2cluster[m].trackidx.push_back(L2cluster[n].trackidx[itrk]);

          for (int m1 = n; m1 < nclust - 1; ++m1) {
            L2cluster[m1] = L2cluster[m1 + 1];
          }
          nclust--;
          m = -1;
          break;  //?????
        }         // end if clusters neighbor in eta
      }
    }  // end for (m) loop

    // sum up all pTs in this zbin to find ht
    // Require jet to have at least 2 tracks with a summed eT>50 GeV, or 3 tracks with summed eT>100 GeV
    // in order to count toward HT
    float ht = 0;
    for (int k = 0; k < nclust; ++k) {
      if (L2cluster[k].pTtot > minJetEtLowPt_ && L2cluster[k].numtracks < lowpTJetMinTrackMultiplicity_)
        continue;
      if (L2cluster[k].pTtot > minJetEtHighPt_ && L2cluster[k].numtracks < highpTJetMinTrackMultiplicity_)
        continue;
      if (L2cluster[k].pTtot > minTrkJetpT_)
        ht += L2cluster[k].pTtot;
    }

    // if ht is larger than previous max, this is the new vertex zbin
    all_zBins[zbin].znum = zbin;
    all_zBins[zbin].clusters = new EtaPhiBin[nclust];
    all_zBins[zbin].nclust = nclust;
    all_zBins[zbin].zbincenter = (zmin + zmax) / 2.0;
    for (int k = 0; k < nclust; ++k) {
      all_zBins[zbin].clusters[k].phi = L2cluster[k].phi;
      all_zBins[zbin].clusters[k].eta = L2cluster[k].eta;
      all_zBins[zbin].clusters[k].pTtot = L2cluster[k].pTtot;
      all_zBins[zbin].clusters[k].numtracks = L2cluster[k].numtracks;
      all_zBins[zbin].clusters[k].numtdtrks = L2cluster[k].numtdtrks;
      for (unsigned int itrk = 0; itrk < L2cluster[k].trackidx.size(); itrk++)
        all_zBins[zbin].clusters[k].trackidx.push_back(L2cluster[k].trackidx[itrk]);
    }

    all_zBins[zbin].ht = ht;
    if (ht >= mzb.ht) {
      mzb = all_zBins[zbin];
      mzb.zbincenter = (zmin + zmax) / 2.0;
    }
    // Prepare for next zbin!
    zmin = zmin + zStep_;
    zmax = zmax + zStep_;
  }  // for each zbin
  for (int zbin = 0; zbin < zBins_; ++zbin) {
    if (zbin == mzb.znum)
      continue;
    delete[] all_zBins[zbin].clusters;
  }
}

EtaPhiBin *L1TrackJetProducer::L1_cluster(EtaPhiBin *phislice) {
  EtaPhiBin *clusters = new EtaPhiBin[etaBins_ / 2];
  if (clusters == nullptr)
    edm::LogWarning("L1TrackJetProducer") << "Clusters memory not assigned!\n";

  // Find eta-phibin with maxpT, make center of cluster, add neighbors if not already used
  float my_pt, left_pt, right_pt, right2pt;
  int nclust = 0;
  right2pt = 0;
  for (int etabin = 0; etabin < etaBins_; ++etabin) {
    // assign values for my pT and neighbors' pT
    if (phislice[etabin].used)
      continue;
    my_pt = phislice[etabin].pTtot;
    if (etabin > 0 && !phislice[etabin - 1].used) {
      left_pt = phislice[etabin - 1].pTtot;
    } else
      left_pt = 0;
    if (etabin < etaBins_ - 1 && !phislice[etabin + 1].used) {
      right_pt = phislice[etabin + 1].pTtot;
      if (etabin < etaBins_ - 2 && !phislice[etabin + 2].used) {
        right2pt = phislice[etabin + 2].pTtot;
      } else
        right2pt = 0;
    } else
      right_pt = 0;

    // if I'm not a cluster, move on
    if (my_pt < left_pt || my_pt <= right_pt) {
      // if unused pT in the left neighbor, spit it out as a cluster
      if (left_pt > 0) {
        clusters[nclust] = phislice[etabin - 1];
        phislice[etabin - 1].used = true;
        nclust++;
      }
      continue;
    }

    // I guess I'm a cluster-- should I use my right neighbor?
    // Note: left neighbor will definitely be used because if it
    //       didn't belong to me it would have been used already
    clusters[nclust] = phislice[etabin];
    phislice[etabin].used = true;
    if (left_pt > 0) {
      if (clusters != nullptr) {
        clusters[nclust].pTtot += left_pt;
        clusters[nclust].numtracks += phislice[etabin - 1].numtracks;
        clusters[nclust].numtdtrks += phislice[etabin - 1].numtdtrks;
        for (unsigned int itrk = 0; itrk < phislice[etabin - 1].trackidx.size(); itrk++)
          clusters[nclust].trackidx.push_back(phislice[etabin - 1].trackidx[itrk]);
      }
    }
    if (my_pt >= right2pt && right_pt > 0) {
      if (clusters != nullptr) {
        clusters[nclust].pTtot += right_pt;
        clusters[nclust].numtracks += phislice[etabin + 1].numtracks;
        clusters[nclust].numtdtrks += phislice[etabin + 1].numtdtrks;
        for (unsigned int itrk = 0; itrk < phislice[etabin + 1].trackidx.size(); itrk++)
          clusters[nclust].trackidx.push_back(phislice[etabin + 1].trackidx[itrk]);
        phislice[etabin + 1].used = true;
      }
    }
    nclust++;
  }  // for each etabin

  // Now merge clusters, if necessary
  for (int m = 0; m < nclust - 1; ++m) {
    if (std::abs(clusters[m + 1].eta - clusters[m].eta) < 1.5 * etaStep_) {
      if (clusters[m + 1].pTtot > clusters[m].pTtot) {
        clusters[m].eta = clusters[m + 1].eta;
      }
      clusters[m].pTtot += clusters[m + 1].pTtot;
      clusters[m].numtracks += clusters[m + 1].numtracks;  // Previous version didn't add tracks when merging
      clusters[m].numtdtrks += clusters[m + 1].numtdtrks;
      for (unsigned int itrk = 0; itrk < clusters[m + 1].trackidx.size(); itrk++)
        clusters[m].trackidx.push_back(clusters[m + 1].trackidx[itrk]);

      for (int m1 = m + 1; m1 < nclust - 1; ++m1)
        clusters[m1] = clusters[m1 + 1];
      nclust--;
      m = -1;
    }  // end if clusters neighbor in eta
  }    // end for (m) loop

  for (int i = nclust; i < etaBins_ / 2; ++i)  // zero out remaining unused clusters
    clusters[i].pTtot = 0;
  return clusters;
}

void L1TrackJetProducer::beginStream(StreamID) {}

void L1TrackJetProducer::endStream() {}

bool L1TrackJetProducer::trackQualityCuts(int trk_nstub, float trk_chi2, float trk_bendchi2) {
  bool PassQuality = false;
  if (trk_bendchi2 < trkBendChi2Max_ && trk_chi2 < trkChi2dofMax_ && trk_nstub >= 4 && !displaced_)
    PassQuality = true;
  if (displaced_ && trk_bendchi2 < nStubs4DisplacedBend_ && trk_chi2 < nStubs4DisplacedChi2_ && trk_nstub == 4)
    PassQuality = true;
  if (displaced_ && trk_bendchi2 < nStubs5DisplacedBend_ && trk_chi2 < nStubs5DisplacedChi2_ && trk_nstub > 4)
    PassQuality = true;
  return PassQuality;
}

void L1TrackJetProducer::fillDescriptions(ConfigurationDescriptions &descriptions) {
  //The following says we do not know what parameters are allowed so do no validation
  // Please change this to state exactly what you do use, even if it is no parameters
  ParameterSetDescription desc;
  desc.setUnknown();
  descriptions.addDefault(desc);
}

//define this as a plug-in
DEFINE_FWK_MODULE(L1TrackJetProducer);