//////////////////////////////////////////////////////////
// versione con 4 ADC  e "filename" anziche' "run_number"
//////////////////////////////////////////////////////////
//
#include<iostream>
#include<cmath>
#include<fstream>
#include<string>
#include<TCanvas.h>
#include <TFile.h>
#include<TApplication.h>
#include<TGraphErrors.h>
#include<TH1D.h>
#include<TF1.h>
#include<TStyle.h>
#include<TAxis.h>
#include<TLatex.h>
#include<TMath.h>
#include<TTree.h>
#include<cstdlib>
#include<stdlib.h>
#include<TRandom.h>
#include "TH2F.h"
#include "TCanvas.h"
#include "TPad.h"
#include<cstring>
#include<ostream>
//#include<libgen.h>   //serve per basename
#include<sstream>  // serve per stringstream
#include<iomanip>
#include "Riostream.h"

char month[200];
using namespace std;

////////// these values depend o the environment and must be changed by hand  ///////////////
string DirDat = "Coincidenze/run0611/";
string DirRoot = "/nfs/";
////////////////////////////////////////////////////////////////////////////////////////////

struct event {
  int adc;
  Long64_t time;
  Double_t energy;
};

bool SortByTime(const event &lhs, const event &rhs) { return lhs.time < rhs.time; }

//int main(int argc, char *argv[]) {
void maketree() {
  //if(argc<2){
    //cout<<endl;
    //cout<<"Missing Argument: FileName (runXXXX)"<<endl;
    //cout<<endl;
    //return -1;
  //}
  

  //string FileName = argv[1];
  string FileName = "run0611";
  sprintf(month,"JuneOctober22");    //uncomment if using june or october '22 runs, else comment
  //sprintf(month,"February23"); //uncomment if using februray  runs, else comment
  DirDat = DirDat+FileName+"/";
  double tau = 5000;
  //double tau = 10000;
  double Ethr = 50;

  vector<event>data;

  string FileDat = DirDat + FileName+".dat";
  string FileSort = DirDat + FileName+".sort";
  string FileCoinc = DirDat + FileName+".coinc";
  string FileRoot = DirRoot + FileName+".ruut";
  cout << endl;
  cout << "File Name:           " << FileName << endl;
  cout << "Merged File:         " << FileDat << endl;
  cout << "ROOT File:           " << FileRoot << endl;
  cout << "coinc. time (ns):    " << tau << endl;
  cout << "Mult. thresh. (keV): " << Ethr << endl;
  cout << endl;
  cout << "Merging ADC files..." << endl;
  cout << endl;
  cout << "Be patient: I'm working.." << endl;
  cout << endl;
  const int Nadc = 4;

///////////////////////////////////////////////////////////////////////
////////////////////////// MERGING AND SORTING ////////////////////////
///////////////////////////////////////////////////////////////////////

  string file;
  int adc, diagnostic;
  Long64_t TimeStamp;
  Double_t ch;
  ofstream out(FileDat.c_str());
  char *id = new char[10];
  long int NEvents = 0;
  Long64_t nanoseconds;
   double delay[Nadc];
  if ((strcmp(month, "JuneOctober22") == 0) ) delay[Nadc] = {0, 4.0720e4, 0, 4.0720e4};   // June2022 and October2022 delay
  else if ((strcmp(month, "February23") == 0)) delay[Nadc] = {0, 4.0270e4, 0, 4.0270e4};   //February 2023 delay
  event DummyEvent;
  for (int j=0; j<Nadc; j++) {
      sprintf(id, "_ch00%d.dat", j);
      file =  DirDat + FileName + id;
      cout << j <<"    "<<file<<endl;
      string DummyLine;
      int LinesToJump = 5;
      ifstream in(file.c_str());
      if(!in) {cout <<"Error: "<<file<<" not found"<<endl; return -1;}
      for (int q=0; q<LinesToJump; q++) getline(in, DummyLine);
      while (1) {
      in >> TimeStamp >> ch >> diagnostic;
      adc = j;
      if (!in.good()) break;
      if(diagnostic == 0 && ch != 0) {
        NEvents++;
       // nanoseconds = TimeStamp*10;
        nanoseconds = TimeStamp*10+delay[j];
        DummyEvent.adc = adc;
        DummyEvent.time = nanoseconds;
        DummyEvent.energy = ch;
        data.push_back(DummyEvent);
        out<<left<<setw(6)<<adc<<left<<setw(15)<<nanoseconds<<left<<setw(10)<<ch<<endl;
      }
    }
    in.close();
  }
  out.close();
  cout << "Number of Events found: " << NEvents << endl;
  cout << endl;
  cout << "Sorting File according TimeStamp..." << endl;
  sort(data.begin(), data.end(), SortByTime);
  cout << endl;
  cout << "Writing Sorted File " << FileSort << endl;

  //copy(data.rbegin(), data.rend(), ostream_iterator<event> (FileSort.c_str(), "\n"));

  ofstream output (FileSort.c_str());
  for (unsigned int i=0; i<data.size(); i++){
    output << left << setw(6) << data[i].adc;
    output << left << setw(15) << data[i].time;
    output << left << setw(15) << data[i].energy << endl;
  }
  output.close();

///////////////////////////////////////////////////////////////////////
//////////////////////// FINDING  COINCIDENCES ////////////////////////
///////////////////////////////////////////////////////////////////////

  int multiplicity;
  long long time1, time2;
  double ch1, ch2;
  double energy[Nadc];
  long long time[Nadc];
  int id1, id2;
  cout << "  " << endl;
  cout << "LOOKING FOR COINCIDENCES.." << endl;
  cout << "  " << endl;
  ifstream input(FileSort.c_str());
  ofstream out1(FileCoinc.c_str());
  if(!input) {cout <<"Error: "<<FileSort<<" not found"<<endl; return -1;}
  string line;
  int Nlines=-1;
  while(getline(input,line)) ++Nlines;
  input.clear();
  input.seekg(0, ios::beg);
  int nevents = 0;
  int coinc = 1;
  int parz  = (int)(Nlines/10);
  for (int m=0; m<Nadc ; m++) {
    time[m]=0;
    energy[m]=0;
  }
  input >> id1 >> time1 >> ch1;
  nevents++;
  if (nevents%parz==0) cout << (int)(nevents*1e2/Nlines) << "% events processed.." << endl;
  while(nevents <= Nlines) {
    time[id1] = time1;
    energy[id1] = ch1;
    multiplicity = 1;
    coinc = 1;
    while (coinc == 1 && nevents<=Nlines) {
      input >> id2 >> time2 >> ch2;
      nevents++;
      if (nevents%parz==0) cout << (int)(nevents*1e2/Nlines) << "% events processed.." << endl;
      //if (id2 != id1 && time2-time1 < tau)  {
      if (id2 != id1 && time2-time1 < tau && ch1*ch2 > 0)  {
	multiplicity++;
	coinc = 1;
	time[id2] = time2;
	energy[id2] = ch2;
      } else {
	coinc = 0;
      }
    }
    for(int j=0; j<Nadc; j++) {
      out1<<left<<setw(15)<<time[j]<<left<<setw(15)<<energy[j];
    }
    out1<<left<<setw(5)<<multiplicity<<endl;
    for (int m=0; m<Nadc ; m++) {
      time[m]=0;
      energy[m]=0;
    }
    id1 = id2;
    time1 = time2;
    ch1 = ch2;
  }
  input.close();
  out1.close();
  cout << endl;
  cout << "written file " << FileCoinc << " ..." << endl;
  cout << endl;

///////////////////////////////////////////////////////////////////////
////////////////////////// WRITING  ROOT FILE  ////////////////////////
///////////////////////////////////////////////////////////////////////

  Long64_t tempo[10];
  Double_t chan[10];
  Int_t mult;
  TFile *f = new TFile(FileRoot.c_str(),"RECREATE");
  TTree *tree = new TTree("tree","tree");
  char *id_ch = new char[10];
  char *id_t = new char[10];
  for (int j=0; j<Nadc; j++) {
    sprintf(id_ch, "e%d", j);
    sprintf(id_t, "t%d", j);
    tree->Branch(id_t, &tempo[j]);
    tree->Branch(id_ch, &chan[j]);
  }
  tree->Branch("mult",&mult);
  int counter = 0;
  ifstream z(FileCoinc.c_str());
  if(!z) {cout <<"Error: "<<FileCoinc<<" not found"<<endl; return -1;}
  while (getline(z, line)) ++counter;
  z.close();
  cout << "Building ROOT file " << FileRoot << endl;
  cout << "Found " << counter << " events in file " << FileCoinc << endl;
  cout << endl;
  int fraz = (int)(counter/10);
  ifstream in(FileCoinc.c_str());
  if(!in) {cout <<"Error: "<<FileCoinc<<" not found"<<endl; return -1;}
  int nl = 0;
  while (!in.eof()) {
    for (int j=0; j<Nadc; j++) {
      in >> tempo[j] >> chan[j];
    }
    in >> mult;
    nl = nl + 1;
    if (nl%fraz==0) cout << (int)(nl*1e2/counter) << "% events processed.." << endl;
    tree->Fill();
  }
  nl = nl -1;
  in.close();
  f->Write();
  cout << endl;
  cout <<"ROOT file "<<FileRoot<<" completed.."<<endl;
  printf(" Analyzed %d events\n",nl);
  cout<<endl;
  cout<<"remove temporary files.."<<endl;
  string DAT = "rm " + FileDat;
  string SORT = "rm " + FileSort;
  string COINC = "rm " + FileCoinc;
  system(DAT.c_str());
  system(SORT.c_str());
  system(COINC.c_str());
  cout<<endl;
  cout<<"*** DONE ***"<<endl;
  cout<<endl;
}