35 double lheHT = 0, lheHTIncoming = 0;
36 unsigned int lheNj = 0, lheNb = 0, lheNc = 0, lheNuds = 0, lheNglu = 0;
39 const auto & hepeup = lheProd.
hepeup();
40 const auto & pup = hepeup.
PUP;
41 int lep = -1, lepBar = -1, nu = -1, nuBar = -1;
42 for (
unsigned int i = 0,
n = pup.size();
i <
n; ++
i) {
45 if ( (status == 1) && ( ( idabs == 21 ) || (idabs > 0 && idabs < 7) ) ) {
48 if (idabs==5) lheNb++;
49 else if (idabs==4) lheNc++;
50 else if (idabs <= 3 ) lheNuds++;
51 else if (idabs == 21) lheNglu++;
53 double pt = std::hypot( pup[
i][0], pup[i][1] );
55 int mothIdx =
std::max(hepeup.MOTHUP[
i].first-1,0);
56 int mothIdxTwo =
std::max(hepeup.MOTHUP[
i].second-1,0);
57 int mothStatus = hepeup.ISTUP[mothIdx];
58 int mothStatusTwo = hepeup.ISTUP[mothIdxTwo];
59 bool hasIncomingAsMother = mothStatus<0 || mothStatusTwo<0;
60 if (hasIncomingAsMother) lheHTIncoming +=
pt;
61 }
else if (idabs == 12 || idabs == 14 || idabs == 16) {
62 (hepeup.IDUP[
i] > 0 ? nu : nuBar) =
i;
63 }
else if (idabs == 11 || idabs == 13 || idabs == 15) {
64 (hepeup.IDUP[
i] > 0 ? lep : lepBar) =
i;
67 std::pair<int,int>
v(0,0);
68 if (lep != -1 && lepBar != -1)
v = std::make_pair(lep,lepBar);
69 else if (lep != -1 && nuBar != -1)
v = std::make_pair(lep, nuBar);
70 else if (nu != -1 && lepBar != -1)
v = std::make_pair(nu ,lepBar);
71 else if (nu != -1 && nuBar != -1)
v = std::make_pair(nu , nuBar);
72 if (
v.first != -1 &&
v.second != -1) {
73 lheVpt = std::hypot( pup[
v.first][0] + pup[
v.second][0], pup[
v.first][1] + pup[
v.second][1] );
const lhef::HEPEUP & hepeup() const
std::vector< FiveVector > PUP
Abs< T >::type abs(const T &t)
void addColumnValue(const std::string &name, const C &value, const std::string &docString, ColumnType type=defaultColumnType< T >(), int mantissaBits=-1)