#include "hhypPPPipPimMppMinvAlg.h"

HHypPPPipPimMppMinvAlg


class description - source file - inheritance tree (.pdf)

class HHypPPPipPimMppMinvAlg : public HHypBaseAlgorithm

Inheritance Chart:
HHypBaseAlgorithm
<-
HHypPPPipPimMppMinvAlg

    public:
HHypPPPipPimMppMinvAlg(char* name_i = "0", Option_t* par = "0") HHypPPPipPimMppMinvAlg(const HHypPPPipPimMppMinvAlg&) virtual ~HHypPPPipPimMppMinvAlg() static TClass* Class() virtual Bool_t execute() virtual Bool_t finalize() virtual Bool_t init() virtual TClass* IsA() const HHypPPPipPimMppMinvAlg& operator=(const HHypPPPipPimMppMinvAlg&) virtual Bool_t reinit() virtual void ShowMembers(TMemberInspector& insp, char* parent) virtual void Streamer(TBuffer& b) void StreamerNVirtual(TBuffer& b)

Data Members

    private:
Float_t lower_pi_cut Float_t upper_pi_cut PI0 cuts values from pParams

Class Description


 HHypPPPipPimMppMinvAlg

 This is a SELECTOR removing combinations which do not have
 Mmiss pp > Minv PipPim



HHypPPPipPimMppMinvAlg(char *name_i, Option_t par[]) :HHypBaseAlgorithm(name_i,par)

~HHypPPPipPimMppMinvAlg()

Bool_t execute()

Bool_t init()
   pParams->registerCut("PPPipPimMppMinv_LOWER_CUT");
   pParams->registerCut("PPPipPimMppMinv_UPPER_CUT");

Bool_t reinit()
Here, we set/reset the Pi0 cut for this run
Resolution could be run-dependent!

Bool_t finalize()



Inline Functions


                        TClass* Class()
                        TClass* IsA() const
                           void ShowMembers(TMemberInspector& insp, char* parent)
                           void Streamer(TBuffer& b)
                           void StreamerNVirtual(TBuffer& b)
         HHypPPPipPimMppMinvAlg HHypPPPipPimMppMinvAlg(const HHypPPPipPimMppMinvAlg&)
        HHypPPPipPimMppMinvAlg& operator=(const HHypPPPipPimMppMinvAlg&)


Last update: 05/01/2005 by Tiago Perez


ROOT page - Class index - Class Hierarchy - Top of the page

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.