moreByAbsID_stillUnique Class Reference

#include <DecayTreeComparisons.h>

Public Member Functions
bool	operator() (MINT::const_counted_ptr< DecayTree > a, MINT::const_counted_ptr< DecayTree > b) const

Detailed Description

Definition at line 44 of file DecayTreeComparisons.h.

Member Function Documentation

operator()()

bool moreByAbsID_stillUnique::operator()	(	MINT::const_counted_ptr< DecayTree >	a,
		MINT::const_counted_ptr< DecayTree >	b
	)		const

Definition at line 98 of file DecayTreeComparisons.cpp.

                                                            {

  // sorts by abs ID but is still unique. When two
  // particles have same abs ID, the one with
  // the positive id comes first

  // first handle bad pointers
  if(0 == a && 0==b) return false;
  if(0 == a && 0!=b) return true;
  if(0 !=a  && 0==b) return false;
  
  int abs_a = abs(a->getVal().pdg());
  int abs_b = abs(b->getVal().pdg());

  if(abs_a == abs_b) {
    return a->getVal().pdg() > b->getVal().pdg();
  }else{
    return abs_a > abs_b;
  }
}

---

The documentation for this class was generated from the following files:

• Mint/DecayTreeComparisons.h
• src/Mojito/DecayTrees/DecayTreeComparisons.cpp