#include <iostream>
#include <fstream>
#include <TROOT.h>
#include "TString.h"
#include "TFile.h"
#include "TTree.h"
#include "TMath.h"
#include "string.h"


#include <time.h>

void Time(long i,long nentries);

using namespace std;
void twoDMap()
{
  char rootfile[300];//rootfile name for output

  int num_evt;//define event number
  double max_chan;//maximum channel number in one file
  double evt_chan=20000;//channel in one event

  sprintf(rootfile,"/Users/shishaoxi/research/data/spectra/rootfiles/o2_12.root");//path of input file
  if(access(rootfile,0))
  {
    cout<<endl<<"***File "<<rootfile<<" not found!***"<<endl;
  }
  else
  {
    cout<<endl<<"***File "<<rootfile<<" found!***"<<endl;

  }
  // Declaration of leaf types
  Int_t           num_of_peak;
  Double_t        peak_position[23];   //[num_of_peak]
  Double_t        peak_high[23];   //[num_of_peak]

  // List of branches
  TBranch        *b_num_of_peak;   //!
  TBranch        *b_peak_position;   //!
  TBranch        *b_peak_high;   //!

  TFile *fin = new TFile(rootfile);
  TTree *tree = (TTree*)fin->Get("t");

  // TChain *tree = new TChain("t");
  // tree->Add(rootfile);
  Long64_t nentries = tree->GetEntriesFast();
  tree->SetBranchAddress("num_of_peak", &num_of_peak, &b_num_of_peak);
  tree->SetBranchAddress("peak_position", peak_position, &b_peak_position);
  tree->SetBranchAddress("peak_high", peak_high, &b_peak_high);

  Double_t x;
  Double_t y;
  TFile *fout = new TFile("../rootfiles/histo1.root","RECREATE");//path of output file
  TTree *T777 = new TTree("T777","T777");

  T777->Branch("x",&x,"x/D");
  T777->Branch("y",&y,"y/D");

  for(Long64_t i=0; i<nentries; i++)
  {
    if(i%4000==0)
    {
      Time(i, nentries);
    }
    tree->GetEntry(i);
    // if(i==10) break;
    int num_of_peak_tem = num_of_peak;
    double peak_position_x[23]={0};
    // cout<<"num_of_peak "<<num_of_peak<<" "<<i<<endl;

    x=0;
    y=0;

    for(int j=0; j<num_of_peak_tem; j++)
    {
      peak_position_x[j] = peak_position[j];
    }
    for(int k=0; k<num_of_peak_tem; k++)
    {
      for(int h=0; h<num_of_peak_tem; h++)
      {
        x=peak_position_x[k];
        y=peak_position_x[h];
        T777->Fill();
        // std::cout << "x= " <<x<< '\n';
        // std::cout << "y= " <<y<< '\n';
      }
    }
  }
  fout->Write();
  fout->Close();
  fin->Close();

}
void Time(long i, long nentries)
{
	time_t tim;
	struct tm *at;
	char now[280];
	time(&tim);
	at=localtime(&tim);
	strftime(now,79,"%Y-%m-%d %H:%M:%S",at);
	cout<<now;
	printf(" complete %.1f%s\n",100*(float)i/(float)nentries,"%");
}