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

#include <TROOT.h>
class TH2F;
class TH2D;
class TClonesArray;
class AliSegmentation;
class AliMUONResponse;
class TMinuit;
class TMatrixD;
class AliMUONPixel;
#include "AliMUONClusterFinderVS.h"

// Some constants
 static const Int_t kDim = 2000; // array size
 static const Double_t kCouplMin = 1.e-3; // threshold on coupling 

//class AliMUONClusterFinderAZ : public TObject {
class AliMUONClusterFinderAZ : public AliMUONClusterFinderVS {

 public:

  AliMUONClusterFinderAZ(Bool_t draw, Int_t iReco);// Constructor
  virtual ~AliMUONClusterFinderAZ(); // Destructor

  void FindRawClusters(); // the same interface as for old cluster finder
  void EventLoop(Int_t nev, Int_t ch); // first event 
  Bool_t TestTrack(Int_t t); // test if track was selected
  static AliMUONClusterFinderAZ* fgClusterFinder;
  Int_t fnPads[2]; // ! number of pads in the cluster on 2 cathodes
  Float_t fXyq[6][kDim]; // ! pad information
  Int_t fPadIJ[2][kDim]; // ! pad information
  AliSegmentation *fSegmentation[2]; // ! segmentation
  AliMUONResponse *fResponse; // ! response
  Float_t fZpad; // ! z-coordinate of the hit
  Int_t fNpar; // ! number of fit parameters
  Double_t fQtot; // ! total cluster charge
  Int_t fReco; // ! =1 if run reco with writing to TreeR

 protected:

 private:
 
  static TMinuit* fgMinuit; // ! Fitter
  Bool_t fUsed[2][kDim]; // ! flags for used pads
  TH2F *fHist[4]; // ! histograms
  TClonesArray *fMuonDigits; // ! pointer to digits
  Bool_t fDraw; // ! draw flag
  Int_t fnMu; // number of muons passing thru the selected area
  Double_t fxyMu[2][7]; // ! muon information
  TObjArray *fPixArray; // collection of pixels

  // Functions

  void ModifyHistos(void); // modify histograms
  void AddPad(Int_t cath, Int_t digit); // add a pad to the cluster
  Bool_t Overlap(Int_t cath, TObject *dig); // check if the pad from one cathode overlaps with a pad in the cluster on the other cathode
  Bool_t Overlap(Float_t *xy1, Int_t iPad, Float_t *xy12, Int_t iSkip); // check if pads xy1 and iPad overlap and return overlap area
  Bool_t CheckPrecluster(Int_t *nShown); // check precluster to simplify it (if possible)
  void BuildPixArray(); // build array of pixels
  void AjustPixel(Float_t width, Int_t ixy); // ajust size of small pixels
  void AjustPixel(Float_t wxmin, Float_t wymin); // ajust size of large pixels
  Bool_t MainLoop(); // repeat MLEM algorithm until pixels become sufficiently small
  void Mlem(Double_t *coef, Double_t *probi); // use MLEM for cluster finding
  void FindCOG(TH2D *mlem, Double_t *xyc); // find COG position around maximum bin
  Int_t FindNearest(AliMUONPixel *pixPtr0); // find nearest neighbouring pixel to the given one
  void Split(TH2D *mlem, Double_t *coef); // steering function for pixels
  void AddBin(TH2D *mlem, Int_t ic, Int_t jc, Int_t mode, Bool_t* used, TObjArray *pix); // add a bin to the cluster
  TObject* BinToPix(TH2D *mlem, Int_t jc, Int_t ic); // hist. bin-to-pixel
  void AddCluster(Int_t ic, Int_t nclust, TMatrixD *aij_clu_clu, Bool_t *used, Int_t *clustNumb, Int_t &nCoupled); // add a cluster to the group of coupled clusters
  Double_t MinGroupCoupl(Int_t nCoupled, Int_t *clustNumb, TMatrixD *aij_clu_clu, Int_t *minGroup); // find group of cluster with min. coupling to others
  Int_t SelectPad(Int_t nCoupled, Int_t nForFit, Int_t *clustNumb, Int_t *clustFit, TMatrixD *aij_clu_clu); //select pads for fit
  void Merge(Int_t nForFit, Int_t nCoupled, Int_t *clustNumb, Int_t *clustFit, TObjArray **clusters, TMatrixD *aij_clu_clu, TMatrixD *aij_clu_pad); // merge clusters
  Int_t Fit(Int_t nfit, Int_t *clustFit, TObjArray **clusters, Double_t *parOk); // do the fitting 
  void UpdatePads(Int_t nfit, Double_t *par); // subtract fitted charges from pads
  void AddRawCluster(Double_t x, Double_t y, Double_t fmin); // add new raw cluster
  Int_t FindLocalMaxima(Int_t *localMax, Double_t *maxVal); // find local maxima 
  void FlagLocalMax(TH2D *hist, Int_t i, Int_t j, Int_t *isLocalMax); // flag local max
  void FindCluster(Int_t *localMax, Int_t iMax); // find cluster around local max

  ClassDef(AliMUONClusterFinderAZ,0) // cluster finder in MUON arm of ALICE
    };
#endif