AliTreePlayer.h

Go to the documentation of this file.

#ifndef ALITREEPLAYER_H
#define ALITREEPLAYER_H
/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
 * See cxx source for full Copyright notice                               */
/* $Id$ */




class TPad;
#include "TTreePlayer.h"
#include "TTreeFormula.h"

class AliTreeFormulaF : public TTreeFormula {
public:
  AliTreeFormulaF();
  ~AliTreeFormulaF();
  AliTreeFormulaF(const char *name, const char *formula, TTree *tree, Int_t debug=0);
  virtual Int_t Compile(const char *expression = "");
  virtual char *PrintValue(Int_t mode = 0) const; // { PrintValue(mode, 0, ""); }
  virtual char *PrintValue(Int_t mode, Int_t instance, const char *decform = "9.9") const;
  virtual void        UpdateFormulaLeaves();
  virtual Int_t       GetNdata(){return 1;} // TODO - support for vectors
public:
  TObjArray *fTextArray;       
  TObjArray *fFormatArray;     
  TObjArray *fFormulaArray;    
  mutable TString    fValue;   
  Int_t      fDebug;           
  ClassDef(AliTreeFormulaF,1)  
};


class AliTreePlayer : public TNamed {
public:
  AliTreePlayer() {}
  AliTreePlayer(const char *name, const char *title);
  static TObjArray  * selectMetadata(TTree * tree, TString query, Int_t verbose, TString *idList=NULL);
  static TObjArray  * selectTreeInfo(TTree* tree, TString query,Int_t verbose);
  static Int_t selectWhatWhereOrderBy(TTree * tree, TString what, TString where, TString orderBy,  Int_t firstentry, Int_t nentries, TString outputFormat, TString outputName);
  static TString  printSelectedTreeInfo(TTree*tree, TString infoType,  TString regExpFriend, TString regExpTag, Int_t verbose);
  static TObjArray  * MakeHistograms(TTree * tree, TString hisString, TString defaultCut, Int_t firstEntry, Int_t lastEntry, Int_t chunkSize=-1, Int_t verbose=1);
  static TPad *  DrawHistograms(TPad  * pad, TObjArray * hisArray, TString drawExpression, TObjArray *keepArray=0, Int_t verbose=0);
  static void MakeCacheTree(TTree * tree, TString varList, TString outFile, TString outTree, TCut selection);

  template <typename T> static Long64_t BinarySearchSmaller(Long64_t n, const T *array, T value);
  enum TStatType {kUndef=-1,kEntries, kSum, kMean, kRMS, kMedian, kLTM, kLTMRMS, kMedianLeft,kMedianRight,kMax,kMin};
  static Int_t GetStatType(const TString &stat);
  static void AddStatInfo(TTree* treeLeft,  TTree * treeRight , const TString refQuery, Double_t deltaT,
       const TString statString="median:medianLeft:medianRight:RMS:Mean:LTM0.60:LTMRMS0.60:Max:Min",
       Int_t maxEntries=100000000);
protected:
  ClassDef(AliTreePlayer,1)  // Extension of the TTreePlayer
};


// function gives nearest element smaller than value (different than in the TMath::BinarySearch
// See TMath::BinarySearch
template <typename T> Long64_t AliTreePlayer::BinarySearchSmaller(Long64_t n, const T *array, T value)
{
  const T* pind;
  pind = std::lower_bound(array, array + n, value);
  return ( pind - array - 1);
}

#endif