#ifndef ROOT_THStack
#define ROOT_THStack
#ifndef ROOT_TH1
#include "TH1.h"
#endif
#ifndef ROOT_TObjArray
#include "TObjArray.h"
#endif
class TBrowser;
class THStack : public TNamed {
private:
   THStack& operator=(const THStack&); 
protected:
   TList      *fHists;      
   TObjArray  *fStack;      
   TH1        *fHistogram;  
   Double_t    fMaximum;    
   Double_t    fMinimum;    
   void BuildStack();
public:
   THStack();
   THStack(const char *name, const char *title);
   THStack(const TH1* hist, Option_t *axis="x", 
           const char *name=0, const char *title=0,
           Int_t firstbin=-1, Int_t lastbin=-1, 
           Int_t firstbin2=-1, Int_t lastbin2=-1, 
           Option_t* proj_option="", Option_t* draw_option="");
   THStack(const THStack &hstack);
   virtual ~THStack();
   virtual void     Add(TH1 *h, Option_t *option="");
   virtual void     Browse(TBrowser *b);
   virtual Int_t    DistancetoPrimitive(Int_t px, Int_t py);
   virtual void     Draw(Option_t *chopt="");
   TH1             *GetHistogram() const;
   TList           *GetHists()  const { return fHists; }
   TObjArray       *GetStack();
   virtual Double_t GetMaximum(Option_t *option="");
   virtual Double_t GetMinimum(Option_t *option="");
   TAxis           *GetXaxis() const;
   TAxis           *GetYaxis() const;
   virtual void     ls(Option_t *option="") const;
   virtual void     Modified();
   virtual void     Paint(Option_t *chopt="");
   virtual void     Print(Option_t *chopt="") const;
   virtual void     RecursiveRemove(TObject *obj);
   virtual void     SavePrimitive(ostream &out, Option_t *option = "");
   virtual void     SetMaximum(Double_t maximum=-1111); 
   virtual void     SetMinimum(Double_t minimum=-1111); 
   ClassDef(THStack,1)  
};
#endif
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.