source: trunk/MagicSoft/Mars/mhist/MHMatrix.cc@ 1772

/* ======================================================================== *\
!
! *
! * This file is part of MARS, the MAGIC Analysis and Reconstruction
! * Software. It is distributed to you in the hope that it can be a useful
! * and timesaving tool in analysing Data of imaging Cerenkov telescopes.
! * It is distributed WITHOUT ANY WARRANTY.
! *
! * Permission to use, copy, modify and distribute this software and its
! * documentation for any purpose is hereby granted without fee,
! * provided that the above copyright notice appear in all copies and
! * that both that copyright notice and this permission notice appear
! * in supporting documentation. It is provided "as is" without express
! * or implied warranty.
! *
!
!
!   Author(s): Thomas Bretz   2002 <mailto:tbretz@astro.uni-wuerzburg.de>
!              Rudy Boeck     2003 <mailto:
!              Wolfgang Wittek2003 <mailto:wittek@mppmu.mpg.de>
!
!   Copyright: MAGIC Software Development, 2000-2003
!
!
\* ======================================================================== */

/////////////////////////////////////////////////////////////////////////////
//
// MHMatrix
//
// This is a histogram container which holds a matrix with one column per
// data variable. The data variable can be a complex rule (MDataChain).
// Each event for wich Fill is called (by MFillH) is added as a new
// row to the matrix.
//
// For example:
//   MHMatrix m;
//   m.AddColumn("MHillas.fSize");
//   m.AddColumn("MMcEvt.fImpact/100");
//   m.AddColumn("HillasSource.fDist*MGeomCam.fConvMm2Deg");
//   MFillH fillm(&m);
//   taskliost.AddToList(&fillm);
//   [...]
//   m.Print();
//
/////////////////////////////////////////////////////////////////////////////
#include "MHMatrix.h"

#include <fstream.h>

#include <TList.h>
#include <TArrayF.h>
#include <TArrayD.h>
#include <TArrayI.h>

#include <TH1.h>
#include <TCanvas.h>
#include <TRandom3.h>

#include "MLog.h"
#include "MLogManip.h"

#include "MFillH.h"
#include "MEvtLoop.h"
#include "MParList.h"
#include "MTaskList.h"

#include "MData.h"
#include "MDataArray.h"

ClassImp(MHMatrix);

const TString MHMatrix::gsDefName  = "MHMatrix";
const TString MHMatrix::gsDefTitle = "Multidimensional Matrix";

// --------------------------------------------------------------------------
//
//  Default Constructor
//
MHMatrix::MHMatrix(const char *name, const char *title)
    : fNumRow(0), fData(NULL)
{
    fName  = name  ? name  : gsDefName.Data();
    fTitle = title ? title : gsDefTitle.Data();
}

// --------------------------------------------------------------------------
//
//  Constructor. Initializes the columns of the matrix with the entries
//  from a MDataArray
//
MHMatrix::MHMatrix(MDataArray *mat, const char *name, const char *title)
    : fNumRow(0), fData(mat)
{
    fName  = name  ? name  : gsDefName.Data();
    fTitle = title ? title : gsDefTitle.Data();
}

// --------------------------------------------------------------------------
//
//  Destructor. Does not deleted a user given MDataArray, except IsOwner
//  was called.
//
MHMatrix::~MHMatrix()
{
    if (TestBit(kIsOwner) && fData)
        delete fData;
}

// --------------------------------------------------------------------------
//
// Add a new column to the matrix. This can only be done before the first
// event (row) was filled into the matrix. For the syntax of the rule
// see MDataChain.
// Returns the index of the new column, -1 in case of failure.
// (0, 1, 2, ... for the 1st, 2nd, 3rd, ...)
//
Int_t MHMatrix::AddColumn(const char *rule)
{
    if (fM.IsValid())
    {
        *fLog << warn << "Warning - matrix is already in use. Can't add a new column... skipped." << endl;
        return -1;
    }

    if (TestBit(kIsLocked))
    {
        *fLog << warn << "Warning - matrix is locked. Can't add new column... skipped." << endl;
        return -1;
    }

    if (!fData)
    {
        fData = new MDataArray;
        SetBit(kIsOwner);
    }

    fData->AddEntry(rule);
    return fData->GetNumEntries()-1;
}

// --------------------------------------------------------------------------
//
void MHMatrix::AddColumns(MDataArray *matrix)
{
    if (fM.IsValid())
    {
        *fLog << warn << "Warning - matrix is already in use. Can't add new columns... skipped." << endl;
        return;
    }

    if (TestBit(kIsLocked))
    {
        *fLog << warn << "Warning - matrix is locked. Can't add new columns... skipped." << endl;
        return;
    }

    if (fData)
        *fLog << warn << "Warning - columns already added... replacing." << endl;

    if (fData && TestBit(kIsOwner))
    {
        delete fData;
        ResetBit(kIsOwner);
    }

    fData = matrix;
}

// --------------------------------------------------------------------------
//
// Checks whether at least one column is available and PreProcesses all
// data chains.
//
Bool_t MHMatrix::SetupFill(const MParList *plist)
{
    if (!fData)
    {
        *fLog << err << "Error - No Columns initialized... aborting." << endl;
        return kFALSE;
    }

    return fData->PreProcess(plist);
}

// --------------------------------------------------------------------------
//
// If the matrix has not enough rows double the number of available rows.
//
void MHMatrix::AddRow()
{
    fNumRow++;

    if (fM.GetNrows() > fNumRow)
        return;

    if (!fM.IsValid())
    {
        fM.ResizeTo(1, fData->GetNumEntries());
        return;
    }

    TMatrix m(fM);

    fM.ResizeTo(fM.GetNrows()*2, fData->GetNumEntries());

    for (int x=0; x<m.GetNcols(); x++)
        for (int y=0; y<m.GetNrows(); y++)
            fM(y, x) = m(y, x);
}

// --------------------------------------------------------------------------
//
// Add the values correspoding to the columns to the new row
//
Bool_t MHMatrix::Fill(const MParContainer *par)
{
    AddRow();

    for (int col=0; col<fData->GetNumEntries(); col++)
        fM(fNumRow-1, col) = (*fData)(col);

    return kTRUE;
}

// --------------------------------------------------------------------------
//
// Resize the matrix to a number of rows which corresponds to the number of
// rows which have really been filled with values.
//
Bool_t MHMatrix::Finalize()
{
    //
    // It's not a fatal error so we don't need to stop PostProcessing...
    //
    if (fData->GetNumEntries()==0 || fNumRow<1)
        return kTRUE;

    TMatrix m(fM);

    fM.ResizeTo(fNumRow, fData->GetNumEntries());

    for (int x=0; x<fM.GetNcols(); x++)
        for (int y=0; y<fM.GetNrows(); y++)
            fM(y, x) = m(y, x);

    return kTRUE;
}
/*
// --------------------------------------------------------------------------
//
// Draw clone of histogram. So that the object can be deleted
// and the histogram is still visible in the canvas.
// The cloned object are deleted together with the canvas if the canvas is
// destroyed. If you want to handle destroying the canvas you can get a
// pointer to it from this function
//
TObject *MHMatrix::DrawClone(Option_t *opt) const
{
    TCanvas &c = *MH::MakeDefCanvas(fHist);

    //
    // This is necessary to get the expected bahviour of DrawClone
    //
    gROOT->SetSelectedPad(NULL);

    fHist->DrawCopy(opt);

    TString str(opt);
    if (str.Contains("PROFX", TString::kIgnoreCase) && fDimension==2)
    {
        TProfile *p = ((TH2*)fHist)->ProfileX();
        p->Draw("same");
        p->SetBit(kCanDelete);
    }
    if (str.Contains("PROFY", TString::kIgnoreCase) && fDimension==2)
    {
        TProfile *p = ((TH2*)fHist)->ProfileY();
        p->Draw("same");
        p->SetBit(kCanDelete);
    }

    c.Modified();
    c.Update();

    return &c;
}

// --------------------------------------------------------------------------
//
// Creates a new canvas and draws the histogram into it.
// Be careful: The histogram belongs to this object and won't get deleted
// together with the canvas.
//
void MHMatrix::Draw(Option_t *opt)
{
    if (!gPad)
        MH::MakeDefCanvas(fHist);

    fHist->Draw(opt);

    TString str(opt);
    if (str.Contains("PROFX", TString::kIgnoreCase) && fDimension==2)
    {
        TProfile *p = ((TH2*)fHist)->ProfileX();
        p->Draw("same");
        p->SetBit(kCanDelete);
    }
    if (str.Contains("PROFY", TString::kIgnoreCase) && fDimension==2)
    {
        TProfile *p = ((TH2*)fHist)->ProfileY();
        p->Draw("same");
        p->SetBit(kCanDelete);
    }

    gPad->Modified();
    gPad->Update();
}
*/

// --------------------------------------------------------------------------
//
// Prints the meaning of the columns and the contents of the matrix.
// Becareful, this can take a long time for matrices with many rows.
// Use the option 'size' to print the size of the matrix.
// Use the option 'cols' to print the culumns
// Use the option 'data' to print the contents
//
void MHMatrix::Print(Option_t *o) const
{
    TString str(o);

    *fLog << all << flush;

    if (str.Contains("size", TString::kIgnoreCase))
    {
        *fLog << GetDescriptor() << ": NumColumns=" << fM.GetNcols();
        *fLog << " NumRows=" << fM.GetNrows() << endl;
    }

    if (!fData && str.Contains("cols", TString::kIgnoreCase))
        *fLog << "Sorry, no column information available." << endl;

    if (fData && str.Contains("cols", TString::kIgnoreCase))
        fData->Print();

    if (str.Contains("data", TString::kIgnoreCase))
        fM.Print();
}

// --------------------------------------------------------------------------
//
const TMatrix *MHMatrix::InvertPosDef()
{
    TMatrix m(fM);

    const Int_t rows = m.GetNrows();
    const Int_t cols = m.GetNcols();

    for (int x=0; x<cols; x++)
    {
        Double_t avg = 0;
        for (int y=0; y<rows; y++)
            avg += fM(y, x);

        avg /= rows;

        for (int y=0; y<rows; y++)
            m(y, x) -= avg;
    }

    TMatrix *m2 = new TMatrix(m, TMatrix::kTransposeMult, m);

    Double_t det;
    m2->Invert(&det);
    if (det==0)
    {
        *fLog << err << "ERROR - MHMatrix::InvertPosDef failed (Matrix is singular)." << endl;
        delete m2;
        return NULL;
    }

    // m2->Print();

    return m2;
}

// --------------------------------------------------------------------------
//
// Calculated the distance of vector evt from the reference sample
// represented by the covariance metrix m.
//  - If n<0 the kernel method is applied and
//    -log(sum(epx(-d/h))/n) is returned.
//  - For n>0 the n nearest neighbors are summed and
//    sqrt(sum(d)/n) is returned.
//  - if n==0 all distances are summed
//
Double_t MHMatrix::CalcDist(const TMatrix &m, const TVector &evt, Int_t num) const
{
    if (num==0) // may later be used for another method
    {
        TVector d = evt;
        d *= m;
        return TMath::Sqrt(d*evt);
    }

    const Int_t rows = fM.GetNrows();
    const Int_t cols = fM.GetNcols();

    TArrayD dists(rows);

    //
    // Calculate:  v^T * M * v
    //
    for (int i=0; i<rows; i++)
    {
        TVector col(cols);
        col = TMatrixRow(fM, i);

        TVector d = evt;
        d -= col;

        TVector d2 = d;
        d2 *= m;

        dists[i] = d2*d; // square of distance

        //
        // This corrects for numerical uncertanties in cases of very
        // small distances...
        //
        if (dists[i]<0)
            dists[i]=0;
    }

    TArrayI idx(rows);
    TMath::Sort(dists.GetSize(), dists.GetArray(), idx.GetArray(), kFALSE);

    Int_t from = 0;
    Int_t to   = TMath::Abs(num)<rows ? TMath::Abs(num) : rows;
    //
    // This is a zero-suppression for the case a test- and trainings
    // sample is identical. This would result in an unwanted leading
    // zero in the array. To suppress also numerical uncertanties of
    // zero we cut at 1e-5. Due to Rudy this should be enough. If
    // you encounter problems we can also use (eg) 1e-25
    //
    if (dists[idx[0]]<1e-5)
    {
        from++;
        to ++;
        if (to>rows)
            to = rows;
    }

    if (num<0)
    {
        //
        // Kernel function sum (window size h set according to literature)
        //
        const Double_t h    = TMath::Power(rows, -1./(cols+4));
        const Double_t hwin = h*h*2;

        Double_t res = 0;
        for (int i=from; i<to; i++)
            res += TMath::Exp(-dists[idx[i]]/hwin);

        return -TMath::Log(res/(to-from));
    }
    else
    {
        //
        // Nearest Neighbor sum
        //
        Double_t res = 0;
        for (int i=from; i<to; i++)
            res += dists[idx[i]];

        return TMath::Sqrt(res/(to-from));
    }
}

// --------------------------------------------------------------------------
//
// Calls calc dist. In the case of the first call the covariance matrix
// fM2 is calculated.
//  - If n<0 it is divided by (nrows-1)/h while h is the kernel factor.
//
Double_t MHMatrix::CalcDist(const TVector &evt, Int_t num)
{
    if (!fM2.IsValid())
    {
        const TMatrix *m = InvertPosDef();
        if (!m)
            return -1;

        fM2.ResizeTo(*m);
        fM2 = *m;
        fM2 *= fM.GetNrows()-1;
        delete m;
    }

    return CalcDist(fM2, evt, num);
}

void MHMatrix::Reassign()
{
    TMatrix m = fM;
    fM.ResizeTo(1,1);
    fM.ResizeTo(m);
    fM = m;
}

// --------------------------------------------------------------------------
//
// Implementation of SavePrimitive. Used to write the call to a constructor
// to a macro. In the original root implementation it is used to write
// gui elements to a macro-file.
//
void MHMatrix::StreamPrimitive(ofstream &out) const
{
    Bool_t data = fData && !TestBit(kIsOwner);

    if (data)
    {
        fData->SavePrimitive(out);
        out << endl;
    }

    out << "   MHMatrix " << GetUniqueName();

    if (data || fName!=gsDefName || fTitle!=gsDefTitle)
    {
        out << "(";
        if (data)
            out << "&" << fData->GetUniqueName();
        if (fName!=gsDefName || fTitle!=gsDefTitle)
        {
            if (data)
                out << ", ";
            out << "\"" << fName << "\"";
            if (fTitle!=gsDefTitle)
                out << ", \"" << fTitle << "\"";
        }
    }
    out << ");" << endl;

    if (fData && TestBit(kIsOwner))
        for (int i=0; i<fData->GetNumEntries(); i++)
            out << "   " << GetUniqueName() << ".AddColumn(\"" << (*fData)[i].GetRule() << "\");" << endl;
}

// --------------------------------------------------------------------------
//
const TArrayI MHMatrix::GetIndexOfSortedColumn(Int_t ncol, Bool_t desc) const
{
    TMatrixColumn col(fM, ncol);

    const Int_t n = fM.GetNrows();

    TArrayF array(n);

    for (int i=0; i<n; i++)
        array[i] = col(i);

    TArrayI idx(n);
    TMath::Sort(n, array.GetArray(), idx.GetArray(), desc);

    return idx;
}

// --------------------------------------------------------------------------
//
void MHMatrix::SortMatrixByColumn(Int_t ncol, Bool_t desc)
{
    TArrayI idx = GetIndexOfSortedColumn(ncol, desc);

    const Int_t n = fM.GetNrows();

    TMatrix m(n, fM.GetNcols());
    for (int i=0; i<n; i++)
    {
        TVector vold(n);
        vold = TMatrixRow(fM, idx[i]);

        TMatrixRow rownew(m, i);
        rownew = vold;
    }

    fM = m;
}

// --------------------------------------------------------------------------
//
Bool_t MHMatrix::Fill(MParList *plist, MTask *read)
{
    //
    // Read data into Matrix
    //
    const Bool_t is = plist->IsOwner();
    plist->SetOwner(kFALSE);

    MTaskList tlist;
    plist->Replace(&tlist);

    MFillH fillh(this);

    tlist.AddToList(read);
    tlist.AddToList(&fillh);

    MEvtLoop evtloop;
    evtloop.SetParList(plist);

    if (!evtloop.Eventloop())
        return kFALSE;

    plist->Remove(&tlist);
    plist->SetOwner(is);

    return kTRUE;
}

// --------------------------------------------------------------------------
//
// Return a comma seperated list of all data members used in the matrix.
// This is mainly used in MTask::AddToBranchList
//
TString MHMatrix::GetDataMember() const
{
    return fData ? fData->GetDataMember() : TString("");
}

// --------------------------------------------------------------------------
//
//
void MHMatrix::ReduceNumberOfRows(UInt_t numrows, const TString opt)
{
    UInt_t rows = fM.GetNrows();

    if (rows==numrows)
    {
        *fLog << warn << "Matrix has already the correct number of rows..." << endl;
        return;
    }

    Float_t ratio = (Float_t)numrows/fM.GetNrows();

    if (ratio>=1)
    {
        *fLog << warn << "Matrix cannot be enlarged..." << endl;
        return;
    }

    Double_t sum = 0;

    UInt_t oldrow = 0;
    UInt_t newrow = 0;

    while (oldrow<rows)
    {
        sum += ratio;

        if (newrow<=(unsigned int)sum)
        {
            TVector vold(fM.GetNcols());
            vold = TMatrixRow(fM, oldrow);

            TMatrixRow rownew(fM, newrow);
            rownew = vold;
            newrow++;
        }

        oldrow++;
    }

/*

    TMatrix m(n, fM.GetNcols());
    for (int i=0; i<n; i++)
    {
        TVector vold(n);
        vold = TMatrixRow(fM, idx[i]);

        TMatrixRow rownew(m, i);
        rownew = vold;
    }
*/
}

// ------------------------------------------------------------------------
//
// Define the reference matrix
//   refcolumn  number of the column containing the variable, for which a
//              target distribution may be given;
//              if refcolumn is negative the target distribution will be set 
//              equal to the real distribution; the events in the reference
//              matrix will then be simply a random selection of the events 
//              in the original matrix.
//   thsh       histogram containing the target distribution of the variable
//   nmaxevts   maximum number of events in the reference matrix
//
Bool_t MHMatrix::DefRefMatrix(const Int_t refcolumn, const TH1F *thsh, 
                              const Int_t nmaxevts)
{
   if (!fM.IsValid()) 
   {
     *fLog << "MHMatrix::DefRefMatrix; matrix not initialized" << endl;
     return kFALSE;
   }

    const TH1F *fHthsh;    // target distribution
    TH1F *fHthd;     // normalization factors
    TH1F *fHth;      // distribution before
    TH1F *fHthaft;   // distribution after renormalization 

    Int_t frefcol;    // number of the column (count from 0) containing 
                      // the variable for which the target distribution is given
    Int_t   fnbins;   // histogram parameters for thsh
    Float_t ffrombin; //
    Float_t ftobin;   //
    Float_t fdbin;    //

    TArrayF fnormfac; // array of normalization factors
    TMatrix fMnew;    // matrix fM having the requested distribution
                      // and the requested number of rows;
                      // this is the matrix to be used in the g/h separation


   //===================================================================
   //---------------------------------------------------------
   // Calculate normalization factors
   //

   fHthsh = thsh;

   Int_t   fNrows  = fM.GetNrows();
   Int_t   fNcols  = fM.GetNcols();

   // print characteristics
   //
   //Int_t   fColLwb = fM.GetColLwb();
   //Int_t   fRowLwb = fM.GetRowLwb();
   //*fLog << "MHMatrix::CalcNormFactors; Event matrix (input): " << endl;
   //*fLog << "          fNrows, fNcols, fColLwb, fRowLwb = " << fNrows << ",  "
   //      << fNcols << ",  " << fColLwb << ",  " << fRowLwb << endl;

   
   //---------------------------------------------------------
   //
   // if refcol < 0 : select reference events randomly
   //                 i.e. set the normaliztion factotrs equal to 1.0

   if (refcolumn<0) 
   {
     frefcol = -refcolumn;
   }
   else
   {
     frefcol = refcolumn;
   }
   

   //---------------------------------------------------------

   if (fHthsh == NULL)
   {
     *fLog << "MHMatrix::DefRefMatrix; target distribution has to be defined"
           << endl;
     return kFALSE;
   }

   fnbins   = fHthsh->GetNbinsX();
   ffrombin = fHthsh->GetBinLowEdge(1);
   ftobin   = fHthsh->GetBinLowEdge(fnbins+1);
   fdbin    = (ftobin-ffrombin)/fnbins;
   //*fLog << "CalcNormFactors; Reference column (count from 0) = "
   //      << frefcol << endl;
   //*fLog << "CalcNormFactors; Histo params : " << fnbins << ",  " << ffrombin
   //      <<",  "<< ftobin << endl;


   //---------------------------------------------------------
   // ===== set up the real histogram
   //
   fHth = new TH1F("th", "data at input", fnbins, ffrombin, ftobin);
   for (Int_t j=1; j<=fNrows; j++)  
   {
     fHth->Fill(fM(j-1,frefcol));   
     //*fLog << "j, frefcol, fM(j-1,frefcol) = " << j << ",  " << frefcol
     //      << ",  " << fM(j-1,frefcol) << endl;
   }

   // if refcolumn<0 set target distribution equal to the real distribution
   // in order to obtain normalization factors = 1.0
   //if (refcolumn<0) 
   //{
   //  for (Int_t j=1; j<=fnbins; j++) 
   //  {
   //    float cont = fHth-> GetBinContent(j);
   //    fHthsh->SetBinContent(j, cont);
   //  }
   //}

   //---------------------------------------------------------
   // ===== obtain correction factors
   //
   fHthd = new TH1F ("thd", "correction factors", fnbins, ffrombin, ftobin);
   
   Double_t cmax = 0.;
   Float_t a;
   Float_t b;
   Float_t c;
   for (Int_t j=1; j<=fnbins; j++) 
   {
     a = fHth->GetBinContent(j);

     // if refcolumn < 0 set the correction factors equal to 1
     if ( refcolumn>=0.0 )
       b = fHthsh->GetBinContent(j);
     else
       b = a;

     if ( a<0.0  || b<0.0 )
     {
       *fLog << "MHMatrix::DefRefMatrix; renormalization of input matrix is not possible"   << endl;
       *fLog << "          a, b = " << a << ",  " << b << endl;
        return kFALSE;
     }

     if (a == 0.0)
       c = 0.0;
     else
       c = b/a;

     fHthd->SetBinContent(j, c);
     if (cmax < c) cmax = c;
     //*fLog << j << ",  " << a << ",  " << b << ",  " << c << endl;
   }

   //*fLog << "MHMatrix::CalcNormFactors; maximum ratio between histogram and target "
   //      << cmax << endl;

   if (cmax <= 0.0)
   {
     *fLog << "MHMatrix::CalcNormFactors; maximum ratio is LE zero" << endl;
     return kFALSE;
   }

   fnormfac.Set(fnbins);
   Float_t minbin = 1.0;
   for (Int_t j=1; j<=fnbins; j++) 
   {
     float c = (fHthd->GetBinContent(j)) / cmax;
     fnormfac[j-1] = c;
     if (minbin > c  &&  c>0) minbin = c;
     fHthd->SetBinContent(j, c);
   }
   //*fLog << "MHMatrix::CalcNormFactors; maximum weight = 1, minimum non-zero weight = "
   //      << minbin <<endl;


   //---------------------------------------------------------
   //===================================================================


   // ==== compress matrix fM into Mnew
   //
   // get random access
   TArrayF ranx(fNrows);
   TRandom3 *fRnd = new TRandom3(0);

   for (Int_t i=0;i<fNrows;i++) ranx[i] = fRnd->Rndm(i);

   TArrayI ind(fNrows);
   TMath::Sort(fNrows, ranx.GetArray(), ind.GetArray(),kTRUE);

   //*fLog << "MHMatrix::DefRefMatrix;  permuting array " <<endl;
   //for (Int_t i=0; i<10; i++)  cout << ind[i] << " ";
   //*fLog << endl;

   //---------------------------------------------------------
   // go through matrix and keep events depending on content of 
   // reference column
   //
   //*fLog << "MHMatrix::DefRefMatrix;  pass at most " << nmaxevts 
   //      << " events, in random order " << endl;


   //---------------------------------------------------------
   // define  new matrix
   Int_t evtcount = 0;  
   TMatrix Mnew_tmp (fNrows,fNcols);

   TArrayF cumul_weight(fNrows);   // keep track for each bin how many events

   for (Int_t ir=0; ir<fNrows; ir++) cumul_weight[ir]=0;

   //--------------------------------
   // select events
   //
   fHthaft = new TH1F ("thaft","data after selection", fnbins, ffrombin, ftobin);
   for (Int_t ir=0; ir<fNrows; ir++)   
   {
     Int_t indref = (Int_t) ((fM(ind[ir],frefcol)-ffrombin)/fdbin);
     cumul_weight[indref] += fnormfac[indref];
     if (cumul_weight[indref]>0.5)    
     {
       cumul_weight[indref] -= 1.;
       if (evtcount++ <  nmaxevts) 
       {
         fHthaft->Fill(fM(ind[ir],frefcol)); 
         for (Int_t ic=0; ic<fNcols; ic++)  
           Mnew_tmp(evtcount-1,ic) = fM(ind[ir],ic);
       }
       else  break;
     }
   }
   evtcount--;
   //*fLog << "MHMatrix::DefRefMatrix;  passed       " << evtcount 
   //      << " events" << endl;

   //--------------------------------
   // reduce size

   TMatrix Mnew(evtcount, fNcols);
   fM.ResizeTo (evtcount, fNcols);
   fNumRow = evtcount;

   for (Int_t ir=0;ir<evtcount; ir++) 
      for (Int_t ic=0;ic<fNcols;ic++)  
      {
        Mnew(ir,ic) = Mnew_tmp(ir,ic);
        fM(ir,ic)   = Mnew_tmp(ir,ic);
      }

   if (evtcount < nmaxevts)
   {
     *fLog << "MHMatrix::DefRefMatrix; Warning : The reference sample contains less events (" << evtcount << ") than required (" << nmaxevts << ")" << endl;
   }


   //---------------------------------------------------------
   //  test: print new matrix (part)
   *fLog << "MHMatrix::DefRefMatrix;  Event matrix (output) :" << endl;
   *fLog << "MHMatrix::DefRefMatrix;  Nrows, Ncols = " << Mnew.GetNrows()
         << " " << Mnew.GetNcols() << endl;
   for (Int_t ir=0;ir<10; ir++) 
   {
     *fLog <<ir <<" ";
     for (Int_t ic=0;ic<13;ic++) cout<<Mnew(ir,ic)<<" ";
     *fLog <<endl;
   }
   
   //  test print new bin contents
   *fLog << "MHMatrix::DefRefMatrix;  new histogram: " << endl;
   for (Int_t j=1; j<=fnbins; j++) 
   {
     float a = fHthaft->GetBinContent(j);
     if (a>0) *fLog << j << "  "<< a << "   ";
   }
   *fLog <<endl;

   //---------------------------------------------------------
   // ==== plot four histograms 
   TCanvas *th1 = new TCanvas (fName, fName, 1);   
   th1->Divide(2,2);

   th1->cd(1);
   ((TH1F*)fHthsh)->Draw();      // target

   th1->cd(2);
   ((TH1F*)fHth)->Draw();        // real histogram before

   th1->cd(3);
   ((TH1F*)fHthd) -> Draw();     // correction factors

   th1->cd(4);
   ((TH1F*)fHthaft) -> Draw();   // histogram after

   //---------------------------------------------------------
   // --- write onto output file
   //
   //TFile *outfile = new TFile(fileNameout, "RECREATE", "");
   //Mnew.Write(fileNameout);
   //outfile->Close();

   return kTRUE;
}

// --------------------------------------------------------------------------
//
// overload TOject member function read 
// in order to reset the name of the object read
//
Int_t MHMatrix::Read(const char *name)
{
  Int_t ret = TObject::Read(name);
  SetName(name);

  return ret;
}

// --------------------------------------------------------------------------