convert_sartre2eictree.C

Go to the documentation of this file. Or view the newest version in sPHENIX GitHub for file convert_sartre2eictree.C

// Code takes a Sartre  HepMC output and converts it to a MILOU ascii output, which is then built into an EICTree.

// 4 final state particles
// Scattered electron (KS=2)
// Scattered proton (KS=1)
// Decay electron and positron (KS=1)
// JPsi (KS=1)
int convert_sartre2eictree()
{
  TString inputFile("18x275_DVMP_1M_ascii.out");
  TString outputFile("18x275_DVMP_1M_ascii_converted.out");
  std::ifstream file(inputFile);


   
    std::ofstream output(outputFile);
    output << "MILOU\n============================================\nI, ievent, linesnum, weight, genprocess, radcorr,        truex, trueQ2, truey, truet, treuphi, phibelgen, phibelres,       phibelrec\n============================================\nI, K(I,1)  K(I,2)  K(I,3)  K(I,4)  K(I,5)             P(I,1)  P(I,2)  P(I,3)  P(I,4)  P(I,5) V(I,1)  V(I,2)  V(I,3)\n============================================\n";
    std::string str; 
    std::string file_contents;
    int event_count = 0;
    int particle_count = 0;
    while (std::getline(file, str))
    {
      file_contents = str;
      if(file_contents.size()==0)
        continue;
      if(file_contents.at(0)=='F')
        {
          // Search for the Q2
          string tmp;            // A string to store the word on each iteration.
          stringstream str_strm(file_contents);
          vector<string> words;     // Create vector to hold our words
          
          int counter = 0;
          while (str_strm >> tmp) {
            if(counter==5)
              {
                if(tmp.find("e")<tmp.length())
                  tmp=tmp.replace(tmp.find("e"),1,"E");
                break;
              }
            counter++;
          }
          output << get_arbitrary_event(event_count++,tmp);
          particle_count = 0;
          if(event_count%100==0)
            {
              cout << "Processing Event " << event_count << endl;
            }
        }
      if(file_contents.at(0)=='P')
        {
          // Found a particle
          // See if it is final state
          int index_jpsi = file_contents.find(" 443 ");
          int index_other = file_contents.find(" 1 0 0 ");
          if(index_jpsi>0||index_other>0)
            {
              output << ++particle_count;
              output << "\t";
              if(particle_count==1)
                {
                  output<< "2\t";
                }
              else
                {
                  output << "1\t";
                }
              string tmp;            // A string to store the word on each iteration.
              stringstream str_strm(file_contents);
              vector<string> words;     // Create vector to hold our words
    
              int counter = 0;
              while (str_strm >> tmp) {
                if(counter==2)
                  {
                    output << tmp;
                    output <<"\t 0 \t 0 \t 0 \t";
                  }
                if(counter>=3&&counter<=7)
                  {
                    if(tmp.find("e")<tmp.length())
                      tmp=tmp.replace(tmp.find("e"),1,"E");
                    output << tmp;
                    output << "\t";
                  }
                counter++;
              }

              output << "0 \t 0 \t 0\n";
            }
        }
      if(particle_count==5)
        {
          output<<" =============== Event finished =============== \n";
          particle_count=0;
        }
    }
    output.close();
    gSystem->Load("$OPT_SPHENIX/eic-smear_root-5.34.36/lib/libeicsmear.so");

    BuildTree(outputFile);

  return 0;
}

std::string get_arbitrary_event(int x,string Q)
{
  std::string alpha;
  stringstream ss;
  ss << "0" << "\t" << x << "           5   1.00000000               0           0   7.56711757E-04   " << Q << "      0.373815268      0.177931070       0.00000000       2.9 2728496       110.619263     -0.310856074\n ============================================\n";
  alpha = ss.str();
  return alpha;
}