1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877
|
//STARTHEADER
// $Id: PseudoJet.cc 3083 2013-04-06 12:15:17Z cacciari $
//
// Copyright (c) 2005-2011, Matteo Cacciari, Gavin P. Salam and Gregory Soyez
//
//----------------------------------------------------------------------
// This file is part of FastJet.
//
// FastJet is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// The algorithms that underlie FastJet have required considerable
// development and are described in hep-ph/0512210. If you use
// FastJet as part of work towards a scientific publication, please
// include a citation to the FastJet paper.
//
// FastJet is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with FastJet. If not, see <http://www.gnu.org/licenses/>.
//----------------------------------------------------------------------
//ENDHEADER
#include "fastjet/Error.hh"
#include "fastjet/PseudoJet.hh"
#include "fastjet/ClusterSequence.hh"
#ifndef __FJCORE__
#include "fastjet/ClusterSequenceAreaBase.hh"
#endif // __FJCORE__
#include "fastjet/CompositeJetStructure.hh"
#include<valarray>
#include<iostream>
#include<sstream>
#include<cmath>
#include<algorithm>
#include <cstdarg>
FASTJET_BEGIN_NAMESPACE // defined in fastjet/internal/base.hh
using namespace std;
//----------------------------------------------------------------------
// another constructor...
PseudoJet::PseudoJet(const double px_in, const double py_in, const double pz_in, const double E_in) {
_E = E_in ;
_px = px_in;
_py = py_in;
_pz = pz_in;
this->_finish_init();
// some default values for the history and user indices
_reset_indices();
}
//----------------------------------------------------------------------
/// do standard end of initialisation
void PseudoJet::_finish_init () {
_kt2 = this->px()*this->px() + this->py()*this->py();
_phi = pseudojet_invalid_phi;
// strictly speaking, _rap does not need initialising, because
// it's never used as long as _phi == pseudojet_invalid_phi
// (and gets set when _phi is requested). However ATLAS
// 2013-03-28 complained that they sometimes have NaN's in
// _rap and this interferes with some of their internal validation.
// So we initialise it; penalty is about 0.3ns per PseudoJet out of about
// 10ns total initialisation time (on a intel Core i7 2.7GHz)
_rap = pseudojet_invalid_rap;
}
//----------------------------------------------------------------------
void PseudoJet::_set_rap_phi() const {
if (_kt2 == 0.0) {
_phi = 0.0; }
else {
_phi = atan2(this->py(),this->px());
}
if (_phi < 0.0) {_phi += twopi;}
if (_phi >= twopi) {_phi -= twopi;} // can happen if phi=-|eps<1e-15|?
if (this->E() == abs(this->pz()) && _kt2 == 0) {
// Point has infinite rapidity -- convert that into a very large
// number, but in such a way that different 0-pt momenta will have
// different rapidities (so as to lift the degeneracy between
// them) [this can be relevant at parton-level]
double MaxRapHere = MaxRap + abs(this->pz());
if (this->pz() >= 0.0) {_rap = MaxRapHere;} else {_rap = -MaxRapHere;}
} else {
// get the rapidity in a way that's modestly insensitive to roundoff
// error when things pz,E are large (actually the best we can do without
// explicit knowledge of mass)
double effective_m2 = max(0.0,m2()); // force non tachyonic mass
double E_plus_pz = _E + abs(_pz); // the safer of p+, p-
// p+/p- = (p+ p-) / (p-)^2 = (kt^2+m^2)/(p-)^2
_rap = 0.5*log((_kt2 + effective_m2)/(E_plus_pz*E_plus_pz));
if (_pz > 0) {_rap = - _rap;}
}
}
//----------------------------------------------------------------------
// return a valarray four-momentum
valarray<double> PseudoJet::four_mom() const {
valarray<double> mom(4);
mom[0] = _px;
mom[1] = _py;
mom[2] = _pz;
mom[3] = _E ;
return mom;
}
//----------------------------------------------------------------------
// Return the component corresponding to the specified index.
// taken from CLHEP
double PseudoJet::operator () (int i) const {
switch(i) {
case X:
return px();
case Y:
return py();
case Z:
return pz();
case T:
return e();
default:
ostringstream err;
err << "PseudoJet subscripting: bad index (" << i << ")";
throw Error(err.str());
}
return 0.;
}
//----------------------------------------------------------------------
// return the pseudorapidity
double PseudoJet::pseudorapidity() const {
if (px() == 0.0 && py() ==0.0) return MaxRap;
if (pz() == 0.0) return 0.0;
double theta = atan(perp()/pz());
if (theta < 0) theta += pi;
return -log(tan(theta/2));
}
//----------------------------------------------------------------------
// return "sum" of two pseudojets
PseudoJet operator+ (const PseudoJet & jet1, const PseudoJet & jet2) {
//return PseudoJet(jet1.four_mom()+jet2.four_mom());
return PseudoJet(jet1.px()+jet2.px(),
jet1.py()+jet2.py(),
jet1.pz()+jet2.pz(),
jet1.E() +jet2.E() );
}
//----------------------------------------------------------------------
// return difference of two pseudojets
PseudoJet operator- (const PseudoJet & jet1, const PseudoJet & jet2) {
//return PseudoJet(jet1.four_mom()-jet2.four_mom());
return PseudoJet(jet1.px()-jet2.px(),
jet1.py()-jet2.py(),
jet1.pz()-jet2.pz(),
jet1.E() -jet2.E() );
}
//----------------------------------------------------------------------
// return the product, coeff * jet
PseudoJet operator* (double coeff, const PseudoJet & jet) {
//return PseudoJet(coeff*jet.four_mom());
// the following code is hopefully more efficient
PseudoJet coeff_times_jet(jet);
coeff_times_jet *= coeff;
return coeff_times_jet;
}
//----------------------------------------------------------------------
// return the product, coeff * jet
PseudoJet operator* (const PseudoJet & jet, double coeff) {
return coeff*jet;
}
//----------------------------------------------------------------------
// return the ratio, jet / coeff
PseudoJet operator/ (const PseudoJet & jet, double coeff) {
return (1.0/coeff)*jet;
}
//----------------------------------------------------------------------
/// multiply the jet's momentum by the coefficient
void PseudoJet::operator*=(double coeff) {
_px *= coeff;
_py *= coeff;
_pz *= coeff;
_E *= coeff;
_kt2*= coeff*coeff;
// phi and rap are unchanged
}
//----------------------------------------------------------------------
/// divide the jet's momentum by the coefficient
void PseudoJet::operator/=(double coeff) {
(*this) *= 1.0/coeff;
}
//----------------------------------------------------------------------
/// add the other jet's momentum to this jet
void PseudoJet::operator+=(const PseudoJet & other_jet) {
_px += other_jet._px;
_py += other_jet._py;
_pz += other_jet._pz;
_E += other_jet._E ;
_finish_init(); // we need to recalculate phi,rap,kt2
}
//----------------------------------------------------------------------
/// subtract the other jet's momentum from this jet
void PseudoJet::operator-=(const PseudoJet & other_jet) {
_px -= other_jet._px;
_py -= other_jet._py;
_pz -= other_jet._pz;
_E -= other_jet._E ;
_finish_init(); // we need to recalculate phi,rap,kt2
}
//----------------------------------------------------------------------
bool operator==(const PseudoJet & a, const PseudoJet & b) {
if (a.px() != b.px()) return false;
if (a.py() != b.py()) return false;
if (a.pz() != b.pz()) return false;
if (a.E () != b.E ()) return false;
if (a.user_index() != b.user_index()) return false;
if (a.cluster_hist_index() != b.cluster_hist_index()) return false;
if (a.user_info_ptr() != b.user_info_ptr()) return false;
if (a.structure_ptr() != b.structure_ptr()) return false;
return true;
}
//----------------------------------------------------------------------
// check if the jet has zero momentum
bool operator==(const PseudoJet & jet, const double val) {
if (val != 0)
throw Error("comparing a PseudoJet with a non-zero constant (double) is not allowed.");
return (jet.px() == 0 && jet.py() == 0 &&
jet.pz() == 0 && jet.E() == 0);
}
//----------------------------------------------------------------------
/// transform this jet (given in lab) into a jet in the rest
/// frame of prest
//
// NB: code adapted from that in herwig f77 (checked how it worked
// long ago)
PseudoJet & PseudoJet::boost(const PseudoJet & prest) {
if (prest.px() == 0.0 && prest.py() == 0.0 && prest.pz() == 0.0)
return *this;
double m_local = prest.m();
assert(m_local != 0);
double pf4 = ( px()*prest.px() + py()*prest.py()
+ pz()*prest.pz() + E()*prest.E() )/m_local;
double fn = (pf4 + E()) / (prest.E() + m_local);
_px += fn*prest.px();
_py += fn*prest.py();
_pz += fn*prest.pz();
_E = pf4;
_finish_init(); // we need to recalculate phi,rap,kt2
return *this;
}
//----------------------------------------------------------------------
/// transform this jet (given in the rest frame of prest) into a jet
/// in the lab frame;
//
// NB: code adapted from that in herwig f77 (checked how it worked
// long ago)
PseudoJet & PseudoJet::unboost(const PseudoJet & prest) {
if (prest.px() == 0.0 && prest.py() == 0.0 && prest.pz() == 0.0)
return *this;
double m_local = prest.m();
assert(m_local != 0);
double pf4 = ( -px()*prest.px() - py()*prest.py()
- pz()*prest.pz() + E()*prest.E() )/m_local;
double fn = (pf4 + E()) / (prest.E() + m_local);
_px -= fn*prest.px();
_py -= fn*prest.py();
_pz -= fn*prest.pz();
_E = pf4;
_finish_init(); // we need to recalculate phi,rap,kt2
return *this;
}
//----------------------------------------------------------------------
/// returns true if the momenta of the two input jets are identical
bool have_same_momentum(const PseudoJet & jeta, const PseudoJet & jetb) {
return jeta.px() == jetb.px()
&& jeta.py() == jetb.py()
&& jeta.pz() == jetb.pz()
&& jeta.E() == jetb.E();
}
//----------------------------------------------------------------------
void PseudoJet::set_cached_rap_phi(double rap_in, double phi_in) {
_rap = rap_in; _phi = phi_in;
if (_phi >= twopi) _phi -= twopi;
if (_phi < 0) _phi += twopi;
}
//----------------------------------------------------------------------
void PseudoJet::reset_momentum_PtYPhiM(double pt_in, double y_in, double phi_in, double m_in) {
assert(phi_in < 2*twopi && phi_in > -twopi);
double ptm = (m_in == 0) ? pt_in : sqrt(pt_in*pt_in+m_in*m_in);
double exprap = exp(y_in);
double pminus = ptm/exprap;
double pplus = ptm*exprap;
double px_local = pt_in*cos(phi_in);
double py_local = pt_in*sin(phi_in);
reset_momentum(px_local,py_local,0.5*(pplus-pminus),0.5*(pplus+pminus));
set_cached_rap_phi(y_in,phi_in);
}
//----------------------------------------------------------------------
/// return a pseudojet with the given pt, y, phi and mass
PseudoJet PtYPhiM(double pt, double y, double phi, double m) {
assert(phi < 2*twopi && phi > -twopi);
double ptm = (m == 0) ? pt : sqrt(pt*pt+m*m);
double exprap = exp(y);
double pminus = ptm/exprap;
double pplus = ptm*exprap;
double px = pt*cos(phi);
double py = pt*sin(phi);
PseudoJet mom(px,py,0.5*(pplus-pminus),0.5*(pplus+pminus));
mom.set_cached_rap_phi(y,phi);
return mom;
//return PseudoJet(pt*cos(phi), pt*sin(phi), ptm*sinh(y), ptm*cosh(y));
}
//----------------------------------------------------------------------
// return kt-distance between this jet and another one
double PseudoJet::kt_distance(const PseudoJet & other) const {
//double distance = min(this->kt2(), other.kt2());
double distance = min(_kt2, other._kt2);
double dphi = abs(phi() - other.phi());
if (dphi > pi) {dphi = twopi - dphi;}
double drap = rap() - other.rap();
distance = distance * (dphi*dphi + drap*drap);
return distance;
}
//----------------------------------------------------------------------
// return squared cylinder (eta-phi) distance between this jet and another one
double PseudoJet::plain_distance(const PseudoJet & other) const {
double dphi = abs(phi() - other.phi());
if (dphi > pi) {dphi = twopi - dphi;}
double drap = rap() - other.rap();
return (dphi*dphi + drap*drap);
}
//----------------------------------------------------------------------
/// returns other.phi() - this.phi(), i.e. the phi distance to
/// other, constrained to be in range -pi .. pi
double PseudoJet::delta_phi_to(const PseudoJet & other) const {
double dphi = other.phi() - phi();
if (dphi > pi) dphi -= twopi;
if (dphi < -pi) dphi += twopi;
return dphi;
}
string PseudoJet::description() const{
// the "default" case of a PJ which does not belong to any cluster sequence
if (!_structure())
return "standard PseudoJet (with no associated clustering information)";
// for all the other cases, the description comes from the structure
return _structure()->description();
}
//----------------------------------------------------------------------
//
// The following methods access the associated jet structure (if any)
//
//----------------------------------------------------------------------
//----------------------------------------------------------------------
// check whether this PseudoJet has an associated parent
// ClusterSequence
bool PseudoJet::has_associated_cluster_sequence() const{
return (_structure()) && (_structure->has_associated_cluster_sequence());
}
//----------------------------------------------------------------------
// get a (const) pointer to the associated ClusterSequence (NULL if
// inexistent)
const ClusterSequence* PseudoJet::associated_cluster_sequence() const{
if (! has_associated_cluster_sequence()) return NULL;
return _structure->associated_cluster_sequence();
}
//----------------------------------------------------------------------
// check whether this PseudoJet has an associated parent
// ClusterSequence that is still valid
bool PseudoJet::has_valid_cluster_sequence() const{
return (_structure()) && (_structure->has_valid_cluster_sequence());
}
//----------------------------------------------------------------------
// If there is a valid cluster sequence associated with this jet,
// returns a pointer to it; otherwise throws an Error.
//
// Open question: should these errors be upgraded to classes of their
// own so that they can be caught? [Maybe, but later]
const ClusterSequence * PseudoJet::validated_cs() const {
return validated_structure_ptr()->validated_cs();
}
//----------------------------------------------------------------------
// set the associated structure
void PseudoJet::set_structure_shared_ptr(const SharedPtr<PseudoJetStructureBase> &structure_in){
_structure = structure_in;
}
//----------------------------------------------------------------------
// return true if there is some strusture associated with this PseudoJet
bool PseudoJet::has_structure() const{
return _structure();
}
//----------------------------------------------------------------------
// return a pointer to the structure (of type
// PseudoJetStructureBase*) associated with this PseudoJet.
//
// return NULL if there is no associated structure
const PseudoJetStructureBase* PseudoJet::structure_ptr() const {
if (!_structure()) return NULL;
return _structure();
}
//----------------------------------------------------------------------
// return a non-const pointer to the structure (of type
// PseudoJetStructureBase*) associated with this PseudoJet.
//
// return NULL if there is no associated structure
//
// Only use this if you know what you are doing. In any case,
// prefer the 'structure_ptr()' (the const version) to this method,
// unless you really need a write access to the PseudoJet's
// underlying structure.
PseudoJetStructureBase* PseudoJet::structure_non_const_ptr(){
if (!_structure()) return NULL;
return _structure();
}
//----------------------------------------------------------------------
// return a pointer to the structure (of type
// PseudoJetStructureBase*) associated with this PseudoJet.
//
// throw an error if there is no associated structure
const PseudoJetStructureBase* PseudoJet::validated_structure_ptr() const {
if (!_structure())
throw Error("Trying to access the structure of a PseudoJet which has no associated structure");
return _structure();
}
//----------------------------------------------------------------------
// return a reference to the shared pointer to the
// PseudoJetStructureBase associated with this PseudoJet
const SharedPtr<PseudoJetStructureBase> & PseudoJet::structure_shared_ptr() const {
return _structure;
}
//----------------------------------------------------------------------
// check if it has been recombined with another PseudoJet in which
// case, return its partner through the argument. Otherwise,
// 'partner' is set to 0.
//
// false is also returned if this PseudoJet has no associated
// ClusterSequence
bool PseudoJet::has_partner(PseudoJet &partner) const{
return validated_structure_ptr()->has_partner(*this, partner);
}
//----------------------------------------------------------------------
// check if it has been recombined with another PseudoJet in which
// case, return its child through the argument. Otherwise, 'child'
// is set to 0.
//
// false is also returned if this PseudoJet has no associated
// ClusterSequence, with the child set to 0
bool PseudoJet::has_child(PseudoJet &child) const{
return validated_structure_ptr()->has_child(*this, child);
}
//----------------------------------------------------------------------
// check if it is the product of a recombination, in which case
// return the 2 parents through the 'parent1' and 'parent2'
// arguments. Otherwise, set these to 0.
//
// false is also returned if this PseudoJet has no parent
// ClusterSequence
bool PseudoJet::has_parents(PseudoJet &parent1, PseudoJet &parent2) const{
return validated_structure_ptr()->has_parents(*this, parent1, parent2);
}
//----------------------------------------------------------------------
// check if the current PseudoJet contains the one passed as
// argument
//
// false is also returned if this PseudoJet has no associated
// ClusterSequence.
bool PseudoJet::contains(const PseudoJet &constituent) const{
return validated_structure_ptr()->object_in_jet(constituent, *this);
}
//----------------------------------------------------------------------
// check if the current PseudoJet is contained the one passed as
// argument
//
// false is also returned if this PseudoJet has no associated
// ClusterSequence
bool PseudoJet::is_inside(const PseudoJet &jet) const{
return validated_structure_ptr()->object_in_jet(*this, jet);
}
//----------------------------------------------------------------------
// returns true if the PseudoJet has constituents
bool PseudoJet::has_constituents() const{
return (_structure()) && (_structure->has_constituents());
}
//----------------------------------------------------------------------
// retrieve the constituents.
vector<PseudoJet> PseudoJet::constituents() const{
return validated_structure_ptr()->constituents(*this);
}
//----------------------------------------------------------------------
// returns true if the PseudoJet has support for exclusive subjets
bool PseudoJet::has_exclusive_subjets() const{
return (_structure()) && (_structure->has_exclusive_subjets());
}
//----------------------------------------------------------------------
// return a vector of all subjets of the current jet (in the sense
// of the exclusive algorithm) that would be obtained when running
// the algorithm with the given dcut.
//
// Time taken is O(m ln m), where m is the number of subjets that
// are found. If m gets to be of order of the total number of
// constituents in the jet, this could be substantially slower than
// just getting that list of constituents.
//
// an Error is thrown if this PseudoJet has no currently valid
// associated ClusterSequence
std::vector<PseudoJet> PseudoJet::exclusive_subjets (const double & dcut) const {
return validated_structure_ptr()->exclusive_subjets(*this, dcut);
}
//----------------------------------------------------------------------
// return the size of exclusive_subjets(...); still n ln n with same
// coefficient, but marginally more efficient than manually taking
// exclusive_subjets.size()
//
// an Error is thrown if this PseudoJet has no currently valid
// associated ClusterSequence
int PseudoJet::n_exclusive_subjets(const double & dcut) const {
return validated_structure_ptr()->n_exclusive_subjets(*this, dcut);
}
//----------------------------------------------------------------------
// return the list of subjets obtained by unclustering the supplied
// jet down to n subjets (or all constituents if there are fewer
// than n).
//
// requires n ln n time
//
// an Error is thrown if this PseudoJet has no currently valid
// associated ClusterSequence
std::vector<PseudoJet> PseudoJet::exclusive_subjets_up_to (int nsub) const {
return validated_structure_ptr()->exclusive_subjets_up_to(*this, nsub);
}
//----------------------------------------------------------------------
// Same as exclusive_subjets_up_to but throws an error if there are
// fewer than nsub particles in the jet
std::vector<PseudoJet> PseudoJet::exclusive_subjets (int nsub) const {
vector<PseudoJet> subjets = exclusive_subjets_up_to(nsub);
if (int(subjets.size()) < nsub) {
ostringstream err;
err << "Requested " << nsub << " exclusive subjets, but there were only "
<< subjets.size() << " particles in the jet";
throw Error(err.str());
}
return subjets;
}
//----------------------------------------------------------------------
// return the dij that was present in the merging nsub+1 -> nsub
// subjets inside this jet.
//
// an Error is thrown if this PseudoJet has no currently valid
// associated ClusterSequence
double PseudoJet::exclusive_subdmerge(int nsub) const {
return validated_structure_ptr()->exclusive_subdmerge(*this, nsub);
}
//----------------------------------------------------------------------
// return the maximum dij that occurred in the whole event at the
// stage that the nsub+1 -> nsub merge of subjets occurred inside
// this jet.
//
// an Error is thrown if this PseudoJet has no currently valid
// associated ClusterSequence
double PseudoJet::exclusive_subdmerge_max(int nsub) const {
return validated_structure_ptr()->exclusive_subdmerge_max(*this, nsub);
}
// returns true if a jet has pieces
//
// By default a single particle or a jet coming from a
// ClusterSequence have no pieces and this methos will return false.
bool PseudoJet::has_pieces() const{
return ((_structure()) && (_structure->has_pieces(*this)));
}
// retrieve the pieces that make up the jet.
//
// By default a jet does not have pieces.
// If the underlying interface supports "pieces" retrieve the
// pieces from there.
std::vector<PseudoJet> PseudoJet::pieces() const{
return validated_structure_ptr()->pieces(*this);
// if (!has_pieces())
// throw Error("Trying to retrieve the pieces of a PseudoJet that has no support for pieces.");
//
// return _structure->pieces(*this);
}
//----------------------------------------------------------------------
// the following ones require a computation of the area in the
// associated ClusterSequence (See ClusterSequenceAreaBase for details)
//----------------------------------------------------------------------
#ifndef __FJCORE__
//----------------------------------------------------------------------
// if possible, return a valid ClusterSequenceAreaBase pointer; otherwise
// throw an error
const ClusterSequenceAreaBase * PseudoJet::validated_csab() const {
const ClusterSequenceAreaBase *csab = dynamic_cast<const ClusterSequenceAreaBase*>(validated_cs());
if (csab == NULL) throw Error("you requested jet-area related information, but the PseudoJet does not have associated area information.");
return csab;
}
//----------------------------------------------------------------------
// check if it has a defined area
bool PseudoJet::has_area() const{
//if (! has_associated_cluster_sequence()) return false;
if (! has_structure()) return false;
return (validated_structure_ptr()->has_area() != 0);
}
//----------------------------------------------------------------------
// return the jet (scalar) area.
// throw an Error if there is no support for area in the associated CS
double PseudoJet::area() const{
return validated_structure_ptr()->area(*this);
}
//----------------------------------------------------------------------
// return the error (uncertainty) associated with the determination
// of the area of this jet.
// throws an Error if there is no support for area in the associated CS
double PseudoJet::area_error() const{
return validated_structure_ptr()->area_error(*this);
}
//----------------------------------------------------------------------
// return the jet 4-vector area
// throws an Error if there is no support for area in the associated CS
PseudoJet PseudoJet::area_4vector() const{
return validated_structure_ptr()->area_4vector(*this);
}
//----------------------------------------------------------------------
// true if this jet is made exclusively of ghosts
// throws an Error if there is no support for area in the associated CS
bool PseudoJet::is_pure_ghost() const{
return validated_structure_ptr()->is_pure_ghost(*this);
}
#endif // __FJCORE__
//----------------------------------------------------------------------
//
// end of the methods accessing the information in the associated
// Cluster Sequence
//
//----------------------------------------------------------------------
//----------------------------------------------------------------------
/// provide a meaningful error message for InexistentUserInfo
PseudoJet::InexistentUserInfo::InexistentUserInfo() : Error("you attempted to perform a dynamic cast of a PseudoJet's extra info, but the extra info pointer was null")
{}
//----------------------------------------------------------------------
// sort the indices so that values[indices[0..n-1]] is sorted
// into increasing order
void sort_indices(vector<int> & indices,
const vector<double> & values) {
IndexedSortHelper index_sort_helper(&values);
sort(indices.begin(), indices.end(), index_sort_helper);
}
//----------------------------------------------------------------------
/// given a vector of values with a one-to-one correspondence with the
/// vector of objects, sort objects into an order such that the
/// associated values would be in increasing order
template<class T> vector<T> objects_sorted_by_values(
const vector<T> & objects,
const vector<double> & values) {
assert(objects.size() == values.size());
// get a vector of indices
vector<int> indices(values.size());
for (size_t i = 0; i < indices.size(); i++) {indices[i] = i;}
// sort the indices
sort_indices(indices, values);
// copy the objects
vector<T> objects_sorted(objects.size());
// place the objects in the correct order
for (size_t i = 0; i < indices.size(); i++) {
objects_sorted[i] = objects[indices[i]];
}
return objects_sorted;
}
//----------------------------------------------------------------------
/// return a vector of jets sorted into decreasing kt2
vector<PseudoJet> sorted_by_pt(const vector<PseudoJet> & jets) {
vector<double> minus_kt2(jets.size());
for (size_t i = 0; i < jets.size(); i++) {minus_kt2[i] = -jets[i].kt2();}
return objects_sorted_by_values(jets, minus_kt2);
}
//----------------------------------------------------------------------
/// return a vector of jets sorted into increasing rapidity
vector<PseudoJet> sorted_by_rapidity(const vector<PseudoJet> & jets) {
vector<double> rapidities(jets.size());
for (size_t i = 0; i < jets.size(); i++) {rapidities[i] = jets[i].rap();}
return objects_sorted_by_values(jets, rapidities);
}
//----------------------------------------------------------------------
/// return a vector of jets sorted into decreasing energy
vector<PseudoJet> sorted_by_E(const vector<PseudoJet> & jets) {
vector<double> energies(jets.size());
for (size_t i = 0; i < jets.size(); i++) {energies[i] = -jets[i].E();}
return objects_sorted_by_values(jets, energies);
}
//----------------------------------------------------------------------
/// return a vector of jets sorted into increasing pz
vector<PseudoJet> sorted_by_pz(const vector<PseudoJet> & jets) {
vector<double> pz(jets.size());
for (size_t i = 0; i < jets.size(); i++) {pz[i] = jets[i].pz();}
return objects_sorted_by_values(jets, pz);
}
//-------------------------------------------------------------------------------
// helper functions to build a jet made of pieces
//-------------------------------------------------------------------------------
// build a "CompositeJet" from the vector of its pieces
//
// In this case, E-scheme recombination is assumed to compute the
// total momentum
PseudoJet join(const vector<PseudoJet> & pieces){
// compute the total momentum
//--------------------------------------------------
PseudoJet result; // automatically initialised to 0
for (unsigned int i=0; i<pieces.size(); i++)
result += pieces[i];
// attach a CompositeJetStructure to the result
//--------------------------------------------------
CompositeJetStructure *cj_struct = new CompositeJetStructure(pieces);
result.set_structure_shared_ptr(SharedPtr<PseudoJetStructureBase>(cj_struct));
return result;
}
// build a "CompositeJet" from a single PseudoJet
PseudoJet join(const PseudoJet & j1){
return join(vector<PseudoJet>(1,j1));
}
// build a "CompositeJet" from two PseudoJet
PseudoJet join(const PseudoJet & j1, const PseudoJet & j2){
vector<PseudoJet> pieces;
pieces.push_back(j1);
pieces.push_back(j2);
return join(pieces);
}
// build a "CompositeJet" from 3 PseudoJet
PseudoJet join(const PseudoJet & j1, const PseudoJet & j2, const PseudoJet & j3){
vector<PseudoJet> pieces;
pieces.push_back(j1);
pieces.push_back(j2);
pieces.push_back(j3);
return join(pieces);
}
// build a "CompositeJet" from 4 PseudoJet
PseudoJet join(const PseudoJet & j1, const PseudoJet & j2, const PseudoJet & j3, const PseudoJet & j4){
vector<PseudoJet> pieces;
pieces.push_back(j1);
pieces.push_back(j2);
pieces.push_back(j3);
pieces.push_back(j4);
return join(pieces);
}
FASTJET_END_NAMESPACE
|