ROOT tinkering

new file:   ELoss/Eloss_17F
	new file:   ELoss/Eloss_27Al
	new file:   ELoss/Eloss_alpha
	new file:   ELoss/Eloss_p
	modified:   MakeVertex.C
	deleted:    MakeVertex.C:Zone.Identifier
	deleted:    MakeVertex.h:Zone.Identifier

.gitignore

@@ -4,10 +4,26 @@ EventBuilder*
 *.pcm
 *.root
 *.exe
-
+*.txt
+*.err
+*.seq
+*.png
 Mapper
 AnasenMS
 
 data/
 data_proton/
-root_data/
+Sudarshan/
+Analyzer_C_ACLiC_dict0713aaa966_dictContent.h
+.gitignore
+Analyzer_C_ACLiC_dict5411fecd5c_dictUmbrella.h
+gainmatch.C
+gainmatch.h
+MakePlotsQQQ.C
+MakePlotsQQQ.h
+MakePlotsSX3.C
+MakePlotsSX3.h
+qqq_gains_det3.dat
+qqq_relative_gains.dat
+Armory/CorrelateQQQ.h
+QQQStage2.C

.vscode/c_cpp_properties.json

@@ -59,7 +59,19 @@
             "includePath": [
                 "${workspaceFolder}/**",
                 "/usr/include/x86_64-linux-gnu/qt6/**",
-                "/usr/local/cern/root/include/**",
+                "/usr/local/cern/root/include/**"
+            ],
+            "defines": [],
+            "compilerPath": "/usr/bin/gcc",
+            "cStandard": "c17",
+            "cppStandard": "gnu++17",
+            "intelliSenseMode": "linux-gcc-x64"
+        },
+        {
+            "name": "VigneshROG",
+            "includePath": [
+                "${workspaceFolder}/**",
+                "/home/vsitaraman/root/include/**"
             ],
             "defines": [],
             "compilerPath": "/usr/bin/gcc",

.vscode/settings.json

@@ -100,7 +100,32 @@
     "PCPulser_All_new.C": "cpp",
     "PosCal_2.C": "cpp",
     "AutoFit.C": "cpp",
-    "Fitting.C": "cpp"
+    "Fitting.C": "cpp",
+    "PCGainMatch.C": "cpp",
+    "Analyzer1.C": "cpp",
+    "FitHistogramsWithTSpectrum_Sequential_Improved.C": "cpp",
+    "PlotAndFitCentroids.C": "cpp",
+    "MatchAndPlotCentroids.C": "cpp",
+    "GainMatch.C": "cpp",
+    "GainMatchSX3.C": "cpp",
+    "RelBack_Fix_new.C": "cpp",
+    "SiRelativeGains_Step1_new.C": "cpp",
+    "charconv": "cpp",
+    "format": "cpp",
+    "GainMatchSX3Front.C": "cpp",
+    "GainMatchSX3Front1.C": "cpp",
+    "Calibration.C": "cpp",
+    "GainMatchQQQ.C": "cpp",
+    "UTF-8gainmatch.C": "cpp",
+    "MakePlotsQQQ.C": "cpp",
+    "MakePlotsSX3.C": "cpp",
+    "QQQ_Calibcheck.C": "cpp",
+    "QQQ_Calcheck.C": "cpp",
+    "makeplots.C": "cpp",
+    "GlobalMinimizeQQQ.C": "cpp",
+    "QQQStage2.C": "cpp",
+    "inspect.C": "cpp"
   },
-  "github-enterprise.uri": "https://fsunuc.physics.fsu.edu"
+  "github-enterprise.uri": "https://fsunuc.physics.fsu.edu",
+  "C_Cpp.default.compilerPath": "/usr/bin/gcc"
 }

Analysis.C

@@ -16,5 +16,5 @@ void Analysis(int start, int end) {
 
 // Define a macro with the same name as the script
 void Analysis() {
-    Analysis(150, 194); // Adjust the range if needed
+    Analysis(72, 194); // Adjust the range if needed
 }

Analyzer.C

@@ -1,26 +1,31 @@
 #define Analyzer_cxx
 
 #include "Analyzer.h"
+#include "Armory/ClassSX3.h"
+#include "Armory/ClassPW.h"
+
 #include <TH2.h>
 #include <TStyle.h>
 #include <TCanvas.h>
 #include <TMath.h>
+#include "TVector3.h"
 
+#include <fstream>
+#include <iostream>
+#include <sstream>
+#include <map>
 #include <utility>
 #include <algorithm>
 
-#include "Armory/ClassSX3.h"
-#include "Armory/ClassPW.h"
-
-#include "TVector3.h"
-
 TH2F *hsx3IndexVE;
 TH2F *hqqqIndexVE;
 TH2F *hpcIndexVE;
 
+TH2F *hpcIndexVE_GM;
 TH2F *hsx3Coin;
 TH2F *hqqqCoin;
 TH2F *hpcCoin;
+TH2F *hAVCcoin;
 
 TH2F *hqqqPolar;
 TH2F *hsx3VpcIndex;
@@ -28,53 +33,203 @@ TH2F *hqqqVpcIndex;
 TH2F *hqqqVpcE;
 TH2F *hsx3VpcE;
 TH2F *hanVScatsum;
+TH2F *hanVScatsum_a[24];
+TH1F *hPC_E[48];
+TH1F *hCat4An;
+TH1F *hCat0An;
+TH1F *hAnodehits;
+TH2F *hNosvAe;
+
 int padID = 0;
 
 SX3 sx3_contr;
 PW pw_contr;
 PW pwinstance;
 TVector3 hitPos;
+// TVector3 anodeIntersection;
+std::map<int, std::pair<double, double>> slopeInterceptMap;
+// SX3 Calibration Arrays
+const int MAX_DET = 24;
+const int MAX_UP = 4;
+const int MAX_DOWN = 4;
+const int MAX_BK = 4;
+double backGain[MAX_DET][MAX_BK] = {{0}};
+bool backGainValid[MAX_DET][MAX_BK] = {{false}};
+double frontGain[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+bool frontGainValid[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{false}}}};
+
+// QQQ Calibration Arrays
+const int MAX_QQQ = 4;
+const int MAX_RING = 16;
+const int MAX_WEDGE = 16;
+double qqqGain[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqGainValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+double qqqCalib[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqCalibValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+
 bool HitNonZero;
+bool sx3ecut;
+bool qqqEcut;
 
 TH1F *hZProj;
+TH1F *hPCZProj;
 
 void Analyzer::Begin(TTree * /*tree*/)
 {
   TString option = GetOption();
 
   hsx3IndexVE = new TH2F("hsx3IndexVE", "SX3 index vs Energy; sx3 index ; Energy", 24 * 12, 0, 24 * 12, 400, 0, 5000);
-  hsx3IndexVE->SetNdivisions(-612, "x");
   hqqqIndexVE = new TH2F("hqqqIndexVE", "QQQ index vs Energy; QQQ index ; Energy", 4 * 2 * 16, 0, 4 * 2 * 16, 400, 0, 5000);
-  hqqqIndexVE->SetNdivisions(-1204, "x");
-  hpcIndexVE = new TH2F("hpcIndexVE", "PC index vs Energy; PC index ; Energy", 2 * 24, 0, 2 * 24, 400, 0, 4000);
-  hpcIndexVE->SetNdivisions(-1204, "x");
+  hpcIndexVE = new TH2F("hpcIndexVE", "PC index vs Energy; PC index ; Energy", 2 * 24, 0, 2 * 24, 400, 0, 16000);
+  hpcIndexVE_GM = new TH2F("hpcIndexVE_GM", "PC index vs Energy; PC index ; Energy", 2 * 24, 0, 2 * 24, 400, 0, 16000);
  
   hsx3Coin = new TH2F("hsx3Coin", "SX3 Coincident", 24 * 12, 0, 24 * 12, 24 * 12, 0, 24 * 12);
   hqqqCoin = new TH2F("hqqqCoin", "QQQ Coincident", 4 * 2 * 16, 0, 4 * 2 * 16, 4 * 2 * 16, 0, 4 * 2 * 16);
   hpcCoin = new TH2F("hpcCoin", "PC Coincident", 2 * 24, 0, 2 * 24, 2 * 24, 0, 2 * 24);
+  hAVCcoin = new TH2F("hAVCcoin", "Anode vs Cathode Coincident", 24, 0, 24, 24, 0, 24);
 
   hqqqPolar = new TH2F("hqqqPolar", "QQQ Polar ID", 16 * 4, -TMath::Pi(), TMath::Pi(), 16, 10, 50);
 
   hsx3VpcIndex = new TH2F("hsx3Vpcindex", "sx3 vs pc; sx3 index; pc index", 24 * 12, 0, 24 * 12, 48, 0, 48);
-  hsx3VpcIndex->SetNdivisions(-612, "x");
-  hsx3VpcIndex->SetNdivisions(-12, "y");
   hqqqVpcIndex = new TH2F("hqqqVpcindex", "qqq vs pc; qqq index; pc index", 4 * 2 * 16, 0, 4 * 2 * 16, 48, 0, 48);
-  hqqqVpcIndex->SetNdivisions(-612, "x");
-  hqqqVpcIndex->SetNdivisions(-12, "y");
  
   hqqqVpcE = new TH2F("hqqqVpcEnergy", "qqq vs pc; qqq energy; pc energy", 400, 0, 5000, 800, 0, 16000);
-  hqqqVpcE->SetNdivisions(-612, "x");
-  hqqqVpcE->SetNdivisions(-12, "y");
  
   hsx3VpcE = new TH2F("hsx3VpcEnergy", "sx3 vs pc; sx3 energy; pc energy", 400, 0, 5000, 800, 0, 16000);
-  hsx3VpcE->SetNdivisions(-612, "x");
-  hsx3VpcE->SetNdivisions(-12, "y");
  
-  hZProj = new TH1F("hZProj", "Z Projection", 200, -600, 600);
+  hZProj = new TH1F("hZProj", "Z Projection", 1200, -600, 600);
+  hPCZProj = new TH1F("hPCZProj", "PC Z Projection", 600, -300, 300);
 
-  hanVScatsum = new TH2F("hanVScatsum", "Anode vs Cathode Sum; Anode E; Cathode E", 400, 0, 10000, 400, 0, 16000);
+  hanVScatsum = new TH2F("hanVScatsum", "Anode vs Cathode Sum; Anode E; Cathode E", 400, 0, 16000, 400, 0, 20000);
+  hCat4An = new TH1F("hCat4An", "Number of Cathodes/Anode", 24, 0, 24);
+  hCat0An = new TH1F("hCat0An", "Number of Cathodes without Anode", 24, 0, 24);
+  hAnodehits = new TH1F("hAnodehits", "Number of Anode hits", 24, 0, 24);
+  hNosvAe = new TH2F("hnosvAe", "Number of Cathodes/Anode vs Anode Energy", 20, 0, 20, 400, 0, 16000);
+  // for (int i = 0; i < 24; i++)
+  // {
+  //   TString histName = Form("hAnodeVsCathode_%d", i);
+  //   TString histTitle = Form("Anode %d vs Cathode Sum; Anode E; Cathode Sum E", i);
+  //   hanVScatsum_a[i] = new TH2F(histName, histTitle, 400, 0, 16000, 400, 0, 20000);
+  // }
+  // for (int i = 0; i < 48; i++)
+  // {
+  //   TString histName = Form("hCathode_%d", i);
+  //   TString histTitle = Form("Cathode_E_%d;", i);
+  //   hPC_E[i] = new TH1F(histName, histTitle, 3200, 0, 32000);
+  // }
   sx3_contr.ConstructGeo();
   pw_contr.ConstructGeo();
+
+  std::ifstream inputFile("slope_intercept_results.txt");
+
+  if (inputFile.is_open())
+  {
+    std::string line;
+    int index;
+    double slope, intercept;
+    while (std::getline(inputFile, line))
+    {
+      std::stringstream ss(line);
+      ss >> index >> slope >> intercept;
+      // wires 37, 39, 44 have fit data that is incorrect or not present, they have thus been set to 1,0 (slope, intercept) for convenience
+      // wire 19 the 4th point was genereated using the slope of the line produced uising the other 3 points from the wire 1 vs wire 19 plot
+      if (index >= 0 && index <= 47)
+      {
+        slopeInterceptMap[index] = std::make_pair(slope, intercept);
+      }
+    }
+    inputFile.close();
+  }
+  else
+  {
+    std::cerr << "Error opening slope_intercept.txt" << std::endl;
+  }
+
+  std::string filename = "sx3_GainMatchback.txt";
+
+  std::ifstream infile(filename);
+  if (!infile.is_open())
+  {
+    std::cerr << "Error opening " << filename << "!" << std::endl;
+    return;
+  }
+
+  int id, bk;
+  double gain;
+  while (infile >> id >> bk >> gain)
+  {
+    backGain[id][bk] = gain;
+    if (backGain[id][bk] > 0)
+      backGainValid[id][bk] = true;
+    else
+      backGainValid[id][bk] = false;
+  }
+
+  infile.close();
+  std::cout << "Loaded back gains from " << filename << std::endl;
+
+  std::string filename1 = "sx3_GainMatchfront.txt";
+
+  std::ifstream infile1(filename1);
+  if (!infile1.is_open())
+  {
+    std::cerr << "Error opening " << filename1 << "!" << std::endl;
+    return;
+  }
+
+  int idf, bkf, uf, df;
+  double fgain;
+  while (infile1 >> idf >> bkf >> uf >> df >> fgain)
+  {
+    frontGain[idf][bkf][uf][df] = fgain;
+    frontGainValid[idf][bkf][uf][df] = true;
+  }
+
+  // QQQ Gain Matching and Calibration
+  //  ----------------------- Load QQQ Gains
+  {
+    std::string filename = "qqq_GainMatch.txt";
+    std::ifstream infile(filename);
+    if (!infile.is_open())
+    {
+      std::cerr << "Error opening " << filename << "!" << std::endl;
+    }
+    else
+    {
+      int det, ring, wedge;
+      double gainw, gainr;
+      while (infile >> det >> ring >> wedge >> gainw >> gainr)
+      {
+        qqqGain[det][ring][wedge] = gainw;
+        // qqqrGain[det][ring][wedge] = gainr;
+        qqqGainValid[det][ring][wedge] = (gainw > 0);
+        // qqqrGainValid[det][ring][wedge] = (gainr > 0);
+      }
+      infile.close();
+      std::cout << "Loaded QQQ gains from " << filename << std::endl;
+    }
+  }
+  // ----------------------- Load QQQ Calibrations
+  {
+    std::string filename = "qqq_Calib.txt";
+    std::ifstream infile(filename);
+    if (!infile.is_open())
+    {
+      std::cerr << "Error opening " << filename << "!" << std::endl;
+    }
+    else
+    {
+      int det, ring, wedge;
+      double slope;
+      while (infile >> det >> ring >> wedge >> slope)
+      {
+        qqqCalib[det][ring][wedge] = slope;
+        qqqCalibValid[det][ring][wedge] = (slope > 0);
+      }
+      infile.close();
+      std::cout << "Loaded QQQ calibrations from " << filename << std::endl;
+    }
+  }
 }
 
 Bool_t Analyzer::Process(Long64_t entry)
@@ -112,20 +267,26 @@ Bool_t Analyzer::Process(Long64_t entry)
 
   // ########################################################### Raw data
   //  //======================= SX3
-
+  sx3ecut = false;
   std::vector<std::pair<int, int>> ID; // first = id, 2nd = index
   for (int i = 0; i < sx3.multi; i++)
   {
     ID.push_back(std::pair<int, int>(sx3.id[i], i));
-
     hsx3IndexVE->Fill(sx3.index[i], sx3.e[i]);
 
+    if (sx3.e[i] > 100)
+    {
+      sx3ecut = true;
+    }
+
     for (int j = i + 1; j < sx3.multi; j++)
     {
       hsx3Coin->Fill(sx3.index[i], sx3.index[j]);
     }
 
     for (int j = 0; j < pc.multi; j++)
+    {
+      if (pc.index[j] < 24 && pc.e[j] > 100)
       {
         hsx3VpcIndex->Fill(sx3.index[i], pc.index[j]);
         //  if( sx3.ch[index] > 8 ){
@@ -133,6 +294,7 @@ Bool_t Analyzer::Process(Long64_t entry)
         //   }
       }
     }
+  }
 
   if (ID.size() > 0)
   {
@@ -204,20 +366,27 @@ Bool_t Analyzer::Process(Long64_t entry)
         }
       }
 
-      sx3_contr.CalSX3Pos(sx3ID[0].first, sx3ChUp, sx3ChDn, sx3ChBk, sx3EUp, sx3EDn);
-      hitPos = sx3_contr.GetHitPos();
-      HitNonZero = true;
+      // sx3_contr.CalSX3Pos(sx3ID[0].first, sx3ChUp, sx3ChDn, sx3ChBk, sx3EUp, sx3EDn);
+      // hitPos = sx3_contr.GetHitPos();
+      // HitNonZero = true;
       // hitPos.Print();
     }
   }
 
   // //======================= QQQ
+
+  qqqEcut = false;
   for (int i = 0; i < qqq.multi; i++)
   {
     // for( int j = 0; j < pc.multi; j++){
     // if(pc.index[j]==4){
     hqqqIndexVE->Fill(qqq.index[i], qqq.e[i]);
     // }
+    // printf("QQQ ID : %d, ch : %d, e : %d \n", qqq.id[i], qqq.ch[i], qqq.e[i]);
+    if (qqq.e[i] > 100)
+    {
+      qqqEcut = true;
+    }
     // }
     for (int j = 0; j < qqq.multi; j++)
     {
@@ -226,41 +395,73 @@ Bool_t Analyzer::Process(Long64_t entry)
       hqqqCoin->Fill(qqq.index[i], qqq.index[j]);
     }
 
-    for (int j = i + 1; j < qqq.multi; j++)
-    {
     for (int k = 0; k < pc.multi; k++)
     {
       if (pc.index[k] < 24 && pc.e[k] > 50)
       {
         hqqqVpcE->Fill(qqq.e[i], pc.e[k]);
         //  hpcIndexVE->Fill( pc.index[i], pc.e[i] );
-          hqqqVpcIndex->Fill(qqq.index[i], pc.index[j]);
+        hqqqVpcIndex->Fill(qqq.index[i], pc.index[k]);
       }
+    }
+
     // }
-      }
+
+    for (int j = i + 1; j < qqq.multi; j++)
+    {
       // if( qqq.used[i] == true ) continue;
 
       // if( qqq.id[i] == qqq.id[j] && (16 - qqq.ch[i]) * (16 - qqq.ch[j]) < 0  ){ // must be same detector and wedge and ring
       if (qqq.id[i] == qqq.id[j])
       { // must be same detector
 
+        if (qqq.e[i] > 100)
+          qqqEcut = true;
+        if (qqq.id[i] == qqq.id[j])
+        {
           int chWedge = -1;
           int chRing = -1;
-        if (qqq.ch[i] < qqq.ch[j])
+          float eWedgeRaw = 0.0;
+          float eWedge = 0.0;
+          float eWedgeMeV = 0.0;
+          float eRingRaw = 0.0;
+          float eRing = 0.0;
+          float eRingMeV = 0.0;
+          // plug in gains
+          if (qqq.ch[i] < 16 && qqq.ch[j] >= 16 && /*qqqrGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16] &&*/ qqqGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16])
           {
-          chRing = qqq.ch[j] - 16;
             chWedge = qqq.ch[i];
+            eWedgeRaw = qqq.e[i];
+            eWedge = qqq.e[i] * qqqGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+            // printf("Wedge E: %.2f  Gain: %.4f \n", eWedge, qqqGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16]);
+            chRing = qqq.ch[j] - 16;
+            eRingRaw = qqq.e[j];
+            eRing = qqq.e[j]; //* qqqrGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i]-16];
+          }
+          else if (qqq.ch[j] < 16 && qqq.ch[i] >= 16 /* && qqqrGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16] */ && qqqGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16])
+          {
+            chWedge = qqq.ch[j];
+            eWedge = qqq.e[j] * qqqGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16];
+            eWedgeRaw = qqq.e[j];
+            chRing = qqq.ch[i] - 16;
+            eRing = qqq.e[i]; // * qqqrGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+            eRingRaw = qqq.e[i];
           }
           else
+            continue;
+          // plug in calibrations
+          if (qqqCalibValid[qqq.id[i]][chRing][chWedge])
           {
-          chRing = qqq.ch[i];
-          chWedge = qqq.ch[j] - 16;
+            eWedgeMeV = eWedge * qqqCalib[qqq.id[i]][chRing][chWedge] / 1000;
+            eRingMeV = eRing * qqqCalib[qqq.id[i]][chRing][chWedge] / 1000;
           }
+          else
+            continue;
 
           // printf(" ID : %d , chWedge : %d, chRing : %d \n", qqq.id[i], chWedge, chRing);
 
           double theta = -TMath::Pi() / 2 + 2 * TMath::Pi() / 16 / 4. * (qqq.id[i] * 16 + chWedge + 0.5);
-        double rho = 10. + 40. / 16. * (chRing + 0.5);
+          double rho = 50. + 40. / 16. * (chRing + 0.5);
           // if(qqq.e[i]>50){
           hqqqPolar->Fill(theta, rho);
           // }
@@ -277,131 +478,295 @@ Bool_t Analyzer::Process(Long64_t entry)
         }
       }
     }
+  }
     // //======================= PC
 
-  ID.clear();
-  int counter = 0;
-  std::vector<std::pair<int, double>> E;
-  E.clear();
-  for (int i = 0; i < pc.multi; i++)
-  {
-
-    if (pc.e[i] > 100)
-      ID.push_back(std::pair<int, int>(pc.id[i], i));
-    if (pc.e[i] > 100)
-      E.push_back(std::pair<int, double>(pc.index[i], pc.e[i]));
-
-    hpcIndexVE->Fill(pc.index[i], pc.e[i]);
-
-    for (int j = i + 1; j < pc.multi; j++)
-    {
-      hpcCoin->Fill(pc.index[i], pc.index[j]);
-    }
-  }
-  //  for( size_t i = 0; i < E.size(); i++) printf("%zu | %d %d \n", i, E[i].first, E[i].second );
+    // Calculate the crossover points and put them into an array
 
     pwinstance.ConstructGeo();
-  Coord Crossover[24][24];
+    Coord Crossover[24][24][2];
     TVector3 a, c, diff;
     double a2, ac, c2, adiff, cdiff, denom, alpha, beta;
     int index = 0;
     for (int i = 0; i < pwinstance.An.size(); i++)
     {
       a = pwinstance.An[i].first - pwinstance.An[i].second;
+
       for (int j = 0; j < pwinstance.Ca.size(); j++)
       {
+        // Ok so this method uses what is essentially the solution of 2 equations to find the point of intersection between the anode and cathode wires
+        // here a and c are the vectors of the anode and cathode wires respectively
+        // diff is the perpendicular vector between the anode and cathode wires
+        // The idea behind this is to then find the scalars alpha and beta that give a ratio between 0 and -1,
+
         c = pwinstance.Ca[j].first - pwinstance.Ca[j].second;
         diff = pwinstance.An[i].first - pwinstance.Ca[j].first;
         a2 = a.Dot(a);
-      ac = a.Dot(c);
         c2 = c.Dot(c);
+        ac = a.Dot(c);
         adiff = a.Dot(diff);
         cdiff = c.Dot(diff);
         denom = a2 * c2 - ac * ac;
         alpha = (ac * cdiff - c2 * adiff) / denom;
         beta = (a2 * cdiff - ac * adiff) / denom;
-      Crossover[i][j].x = pwinstance.An[i].first.X() + alpha * a.X();
-      Crossover[i][j].y = pwinstance.An[i].first.Y() + alpha * a.Y();
-      Crossover[i][j].z = pwinstance.An[i].first.Z() + alpha * a.Z();
-      if (i == 23)
+
+        Crossover[i][j][0].x = pwinstance.An[i].first.X() + alpha * a.X();
+        Crossover[i][j][0].y = pwinstance.An[i].first.Y() + alpha * a.Y();
+        Crossover[i][j][0].z = pwinstance.An[i].first.Z() + alpha * a.Z();
+        if (Crossover[i][j][0].z < -190 || Crossover[i][j][0].z > 190)
         {
-        if (abs(i - j) < 7 || abs(i - j) > 17)
-        {
-          if (alpha < 0 && alpha > -1)
-          {
-            printf("Anode and cathode indices and coord : %d %d %f %f %f %f\n", i, j, pwinstance.Ca[j].first.X(), pwinstance.Ca[j].first.Y(), pwinstance.Ca[j].first.Z(), alpha);
-            printf("Crossover wires, points and alpha are : %f %f %f %f \n", Crossover[i][j].x, Crossover[i][j].y, Crossover[i][j].z, alpha);
+          Crossover[i][j][0].z = 9999999;
+        }
+        // placeholder variable Crossover[i][j][1].x has nothing to do with the geometry of the crossover and is being used to store the alpha value-
+        //-so that it can be used to sort "good" hits later
+        Crossover[i][j][1].x = alpha;
+        Crossover[i][j][1].y = 0;
+        // if(i==0){
+        // printf("CID, Crossover z and alpha are :  %d %f %f \n",  j, Crossover[i][j][0].z, Crossover[i][j][1].x /*this is alpha*/);
+        // }
+        //   }
+        // }
       }
     }
+    // printf("Anode and cathode indices, alpha, denom, andiff, cndiff : %d %d %f %f %f %f\n", i, j, alpha, denom, adiff, cdiff);
+
+    // anodeIntersection.Clear();
+    for (int i = 0; i < pc.multi; i++)
+    {
+
+      if (pc.e[i] > 100)
+      {
+        hpcIndexVE->Fill(pc.index[i], pc.e[i]); // non gain matched energy
       }
+
+      // Gain Matching of PC wires
+      if (pc.index[i] >= 0 && pc.index[i] < 48)
+      {
+        // printf("index: %d, Old cathode energy: %d \n", pc.index[i],pc.e[i]);
+        auto it = slopeInterceptMap.find(pc.index[i]);
+        if (it != slopeInterceptMap.end())
+        {
+          double slope = it->second.first;
+          double intercept = it->second.second;
+          // printf("slope: %f, intercept:%f\n" ,slope, intercept);
+          pc.e[i] = slope * pc.e[i] + intercept;
+          // printf("index: %d, New cathode energy: %d \n",pc.index[i], pc.e[i]);
+        }
+        hpcIndexVE_GM->Fill(pc.index[i], pc.e[i]);
+        // hPC_E[pc.index[i]]->Fill(pc.e[i]); // gain matched energy per channel
       }
     }
 
-  if (E.size() >= 3)
-  {
-
+    std::vector<std::pair<int, double>> anodeHits = {};
+    std::vector<std::pair<int, double>> cathodeHits = {};
+    std::vector<std::pair<int, double>> corrcatMax = {};
+    std::vector<std::pair<int, double>> corrcatnextMax = {};
+    std::vector<std::pair<int, double>> commcat = {};
     int aID = 0;
     int cID = 0;
-
     float aE = 0;
     float cE = 0;
-    // if( ID[0].first < 1 ) {
-    //   aID = pc.ch[ID[0].second];
-    //   cID = pc.ch[ID[1].second];
-    // }else{
-    //   cID = pc.ch[ID[0].second];
-    //   aID = pc.ch[ID[1].second];
+    float aESum = 0;
+    float cESum = 0;
+    float aEMax = 0;
+    float cEMax = 0;
+    float aEnextMax = 0;
+    float cEnextMax = 0;
+    int aIDMax = 0;
+    int cIDMax = 0;
+    int aIDnextMax = 0;
+    int cIDnextMax = 0;
+
+    // Define the excluded SX3 and QQQ channels
+    // std::unordered_set<int> excludeSX3 = {34, 35, 36, 37, 61, 62, 67, 73, 74, 75, 76, 77, 78, 79, 80, 93, 97, 100, 103, 108, 109, 110, 111, 112};
+    // std::unordered_set<int> excludeQQQ = {0, 17, 109, 110, 111, 112, 113, 119, 127, 128};
+    // inCuth=false;
+    // inCutl=false;
+    // inPCCut=false;
+    for (int i = 0; i < pc.multi; i++)
+    {
+      if (pc.e[i] > 100 /*&& pc.multi < 7*/)
+      {
+        // creating a vector of pairs of anode and cathode hits
+        if (pc.index[i] < 24)
+        {
+          anodeHits.push_back(std::pair<int, double>(pc.index[i], pc.e[i]));
+        }
+        else if (pc.index[i] >= 24)
+        {
+          cathodeHits.push_back(std::pair<int, double>(pc.index[i] - 24, pc.e[i]));
+        }
+
+        for (int j = i + 1; j < pc.multi; j++)
+        {
+          // if(PCCoinc_cut1->IsInside(pc.index[i], pc.index[j]) || PCCoinc_cut2->IsInside(pc.index[i], pc.index[j])){
+          //   // hpcCoin->Fill(pc.index[i], pc.index[j]);
+          //   inPCCut = true;
           // }
-    // printf("anode= %d, cathode = %d\n", aID, cID);
+          hpcCoin->Fill(pc.index[i], pc.index[j]);
+        }
+      }
+    }
+    // sorting the anode and cathode hits in descending order of energy
+    std::sort(anodeHits.begin(), anodeHits.end(), [](const std::pair<int, double> &a, const std::pair<int, double> &b)
+              { return a.second > b.second; });
+    std::sort(cathodeHits.begin(), cathodeHits.end(), [](const std::pair<int, double> &a, const std::pair<int, double> &b)
+              { return a.second > b.second; });
 
-    for (int k = 0; k < qqq.multi; k++)
+    bool SiPCflag;
+
+    corrcatMax.clear();
+    if (anodeHits.size() >= 1 && cathodeHits.size() > 1)
     {
-      if (qqq.index[k] == 75 && pc.index[k] == 2 && pc.e[k] > 100)
+      if (((TMath::TanH(hitPos.Y() / hitPos.X())) > (TMath::TanH(a.Y() / a.X()) - TMath::PiOver4())) || ((TMath::TanH(hitPos.Y() / hitPos.X())) < (TMath::TanH(a.Y() / a.X()) + TMath::PiOver4())))
       {
 
-        int multi_an = 0;
-        for (int l = 0; l < E.size(); l++)
+        for (const auto &anode : anodeHits)
         {
-          if (E[l].first < 24)
+          aID = anode.first;
+          aE = anode.second;
+          aESum += aE;
+          if (aE > aEMax)
           {
-            multi_an++;
+            aEMax = aE;
+            aIDMax = aID;
+          }
+          if (aE > aEnextMax && aE < aEMax)
+          {
+            aEnextMax = aE;
+            aIDnextMax = aID;
+          }
+          // for(const auto &cat : cathodeHits){
+          //   hAVCcoin->Fill(aID, cat.first);
+          // }
+        }
+
+        // std::cout << " Anode iD : " << aIDMax << " Energy : " << aEMax << std::endl;
+
+        // printf("aID : %d, aE : %f, cE : %f\n", aID, aE, cE);
+        for (const auto &cathode : cathodeHits)
+        {
+          cID = cathode.first;
+          cE = cathode.second;
+          // std::cout << "Cathode ID : " << cID << " Energy : " << cE << std::endl;
+
+          hAVCcoin->Fill(aIDMax, cID);
+
+          // This section of code is used to find the cathodes are correlated with the max and next max anodes, as well as to figure out if there are any common cathodes
+          // the anodes are correlated with the cathodes +/-3 from the anode number in the reverse order
+
+          for (int j = -4; j < 3; j++)
+          {
+            if ((aIDMax + 24 + j) % 24 == 23 - cID)
+            /* the 23-cID is used to accomodate for the fact that the order of the cathodes was reversed relative top the physical geometry */
+            // if (Crossover[aIDMax][cID][0].z != 9999999)
+            {
+              corrcatMax.push_back(std::pair<int, double>(cID, cE));
+              cESum += cE;
+              // printf("Max Anode : %d Correlated Cathode : %d Anode Energy : %f z value : %f \n", aIDMax, cID, cESum, Crossover[aIDMax][cID][1].z /*prints alpha*/);
+              // std::cout << " Cathode iD : " << cID << " Energy : " << cE << std::endl;
+            }
+          }
+        }
       }
     }
 
-        if (multi_an >= 1)
+    TVector3 anodeIntersection;
+    anodeIntersection.Clear();
+    // Implementing a method for PC reconstruction using a single Anode event
+    // if (anodeHits.size() == 1)
     {
-          for (int l = 0; l < E.size(); l++)
+      float x, y, z = 0;
+      for (const auto &corr : corrcatMax)
       {
-            if (E[l].first < 24 && E[l].first != 19 && E[l].first != 12)
+        if (cESum > 0)
         {
-              aE = E[l].second;
-            }
-            else if (E[l].first > 24)
-            {
-              cE = E[l].second;
-            }
-          }
-        }
-      }
-    }
-    hanVScatsum->Fill(aE, cE);
-
-    if (ID[0].first < 1)
-    {
-      aID = pc.ch[ID[0].second];
-      cID = pc.ch[ID[1].second];
+          x += (corr.second) / cESum * Crossover[aIDMax][corr.first][0].x;
+          y += (corr.second) / cESum * Crossover[aIDMax][corr.first][0].y;
+          z += (corr.second) / cESum * Crossover[aIDMax][corr.first][0].z;
+          // printf("Max Anode : %d Correlated Cathode : %d cathode Energy : %f cESum Energy : %f z value : %f \n", aIDMax, corr.first, corr.second, cESum, Crossover[aIDMax][corr.first][1].z /*prints alpha*/);
         }
         else
         {
-      cID = pc.ch[ID[0].second];
-      aID = pc.ch[ID[1].second];
+          printf("Warning: No valid cathode hits to correlate with anode %d! \n", aIDMax);
+        }
+        // printf("EventID : %llu, Max Anode : %d Cathode: %d PC X and Y : (%f, %f) \n", entry, aIDMax, cID, Crossover[aIDMax][cID][0].x, Crossover[aIDMax][cID][0].y);
+        // for (int i = 0; i < sx3.multi; i++)
+        // {
+        //   printf("EventID : %llu, HitPos X, Y, Z:  %f %f %f SX3ID : %d %d \n", entry, hitPos.X(), hitPos.Y(), hitPos.Z(), sx3.id[i], sx3.ch[i]);
+        // }
+
+        // for (int i = 0; i < qqq.multi; i++)
+        // {
+        //   printf("Max Anode : %d Cathode: %d PC X and Y : %f %f \n", aIDMax, cID, Crossover[aIDMax][cID][0].x, Crossover[aIDMax][cID][0].y);
+        //   printf("HitPos X, Y, Z, QQQID : %f %f %f %d \n", hitPos.X(), hitPos.Y(), hitPos.Z(), qqq.id[i]);
+        // }
+      }
+      anodeIntersection = TVector3(x, y, z);
+      // std::cout << "Anode Intersection " << anodeIntersection.Z() << " " << x << " " << y << " " << z << std::endl;
     }
 
-    if (HitNonZero)
+    if (anodeIntersection.Z() != 0)
     {
-      pw_contr.CalTrack(hitPos, aID, cID);
-      hZProj->Fill(pw_contr.GetZ0());
+      hPCZProj->Fill(anodeIntersection.Z());
     }
+    // Filling the PC Z projection histogram
+    // std::cout << anodeIntersection.Z() << std::endl;
+    // hPCZProj->Fill(anodeIntersection.Z());
+
+    // }
+
+    // inCuth = false;
+    // inCutl = false;
+    // inPCCut = false;
+    // for(int j=i+1;j<pc.multi;j++){
+    //   if(PCCoinc_cut1->IsInside(pc.index[i], pc.index[j]) || PCCoinc_cut2->IsInside(pc.index[i], pc.index[j])){
+    //     // hpcCoin->Fill(pc.index[i], pc.index[j]);
+    //     inPCCut = true;
+    //   }
+    //   hpcCoin->Fill(pc.index[i], pc.index[j]);
+    // }
+
+    // Check if the accumulated energies are within the defined ranges
+    // if (AnCatSum_high && AnCatSum_high->IsInside(aESum, cESum)) {
+    //     inCuth = true;
+    // }
+    // if (AnCatSum_low && AnCatSum_low->IsInside(aESum, cESum)) {
+    //     inCutl = true;
+    // }
+
+    // Fill histograms based on the cut conditions
+    // if (inCuth && inPCCut) {
+    //     hanVScatsum_hcut->Fill(aESum, cESum);
+    // }
+    // if (inCutl && inPCCut) {
+    //     hanVScatsum_lcut->Fill(aESum, cESum);
+    // }
+    // for(auto anode : anodeHits){
+
+    // float aE = anode.second;
+    // aESum += aE;
+    // if(inPCCut){
+    hanVScatsum->Fill(aEMax, cESum);
+    // }
+
+    // if (sx3ecut)
+    // {
+    hCat4An->Fill(corrcatMax.size());
+    hNosvAe->Fill(corrcatMax.size(), aEMax);
+    hAnodehits->Fill(anodeHits.size());
+    // }
+
+    // }
+    if (anodeHits.size() < 1)
+    {
+      hCat0An->Fill(cathodeHits.size());
+    }
+
+    if (HitNonZero && anodeIntersection.Z() != 0)
+    {
+      pw_contr.CalTrack2(hitPos, anodeIntersection);
+      hZProj->Fill(pw_contr.GetZ0());
     }
 
     // ########################################################### Track constrcution
@@ -414,80 +779,99 @@ Bool_t Analyzer::Process(Long64_t entry)
   void Analyzer::Terminate()
   {
 
-  gStyle->SetOptStat("neiou");
-  TCanvas *canvas = new TCanvas("cANASEN", "ANASEN", 2000, 2000);
-  canvas->Divide(3, 3);
+    // gStyle->SetOptStat("neiou");
+    // TCanvas *canvas = new TCanvas("cANASEN", "ANASEN", 2000, 2000);
+    // canvas->Divide(3, 3);
 
-  // hsx3VpcIndex->Draw("colz");
+    // // hsx3VpcIndex->Draw("colz");
 
-  //=============================================== pad-1
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-1
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  hsx3IndexVE->Draw("colz");
+    // hsx3IndexVE->Draw("colz");
 
-  //=============================================== pad-2
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-2
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  hqqqIndexVE->Draw("colz");
+    // hqqqIndexVE->Draw("colz");
 
-  //=============================================== pad-3
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-3
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  hpcIndexVE->Draw("colz");
+    // hpcIndexVE->Draw("colz");
 
-  //=============================================== pad-4
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-4
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  hsx3Coin->Draw("colz");
+    // hsx3Coin->Draw("colz");
 
-  //=============================================== pad-5
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-5
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  canvas->cd(padID)->SetLogz(true);
+    // canvas->cd(padID)->SetLogz(true);
 
-  hqqqCoin->Draw("colz");
+    // hqqqCoin->Draw("colz");
 
-  //=============================================== pad-6
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-6
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  hpcCoin->Draw("colz");
+    // hpcCoin->Draw("colz");
 
-  //=============================================== pad-7
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-7
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  // hsx3VpcIndex ->Draw("colz");
-  hsx3VpcE->Draw("colz");
+    // // hsx3VpcIndex ->Draw("colz");
+    // hsx3VpcE->Draw("colz");
 
-  //=============================================== pad-8
-  padID++;
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
+    // //=============================================== pad-8
+    // padID++;
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
 
-  // hqqqVpcIndex ->Draw("colz");
+    // // hqqqVpcIndex ->Draw("colz");
 
-  hqqqVpcE->Draw("colz");
-  //=============================================== pad-9
-  padID++;
+    // hqqqVpcE->Draw("colz");
+    // //=============================================== pad-9
+    // padID++;
 
-  // canvas->cd(padID)->DrawFrame(-50, -50, 50, 50);
-  // hqqqPolar->Draw("same colz pol");
+    // // canvas->cd(padID)->DrawFrame(-50, -50, 50, 50);
+    // // hqqqPolar->Draw("same colz pol");
 
-  canvas->cd(padID);
-  canvas->cd(padID)->SetGrid(1);
-  //  hZProj->Draw();
-  hanVScatsum->Draw("colz");
+    // canvas->cd(padID);
+    // canvas->cd(padID)->SetGrid(1);
+    // //  hZProj->Draw();
+    // hanVScatsum->Draw("colz");
+
+    // // TFile *outRoot = new TFile("Histograms.root", "RECREATE");
+
+    // // if (!outRoot->IsOpen())
+    // // {
+    // //   std::cerr << "Error opening file for writing!" << std::endl;
+    // //   return;
+    // // }
+
+    // // // Loop through histograms and write them to the ROOT file
+    // // for (int i = 0; i < 48; i++)
+    // // {
+    // //   if (hPC_E[i] != nullptr)
+    // //   {
+    // //     hPC_E[i]->Write(); // Write histogram to file
+    // //   }
+    // // }
+
+    // // outRoot->Close();
   }

Analyzer.h

@@ -18,6 +18,7 @@ public :
    Det sx3;
    Det qqq;
    Det pc ;
+   Det misc;
 
    ULong64_t       evID;
    UInt_t          run;
@@ -40,6 +41,13 @@ public :
    TBranch        *b_pcCh;   //!
    TBranch        *b_pcE;   //!
    TBranch        *b_pcT;   //!
+   TBranch        *b_miscMulti;   //!
+   TBranch        *b_miscID;   //!
+   TBranch        *b_miscCh;   //!
+   TBranch        *b_miscE;   //!
+   TBranch        *b_miscT;   //!
+   TBranch       *b_miscTf;   //!
+
 
    Analyzer(TTree * /*tree*/ =0) : fChain(0) { }
    virtual ~Analyzer() { }
@@ -92,6 +100,13 @@ void Analyzer::Init(TTree *tree){
    fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
    fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
    fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+   fChain->SetBranchAddress("miscMulti", &misc.multi, &b_miscMulti);
+   fChain->SetBranchAddress("miscID",    &misc.id, &b_miscID);
+   fChain->SetBranchAddress("miscCh",    &misc.ch, &b_miscCh);
+   fChain->SetBranchAddress("miscE",     &misc.e, &b_miscE);
+   fChain->SetBranchAddress("miscT",     &misc.t, &b_miscT);
+   // fChain->SetBranchAddress("miscF",     &misc.tf, &b_miscTf);
+
 
 }
 

Analyzer1.C

@@ -0,0 +1,402 @@
+#define Analyzer1_cxx
+
+#include "Analyzer1.h"
+#include <TH2.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+
+#include <utility>
+#include <algorithm>
+
+#include "Armory/ClassSX3.h"
+#include "Armory/ClassPW.h"
+
+#include "TVector3.h"
+
+TH2F * hsx3IndexVE;
+TH2F * hqqqIndexVE;
+TH2F * hpcIndexVE;
+
+TH2F * hsx3Coin;
+TH2F * hqqqCoin;
+TH2F * hpcCoin;
+
+TH2F * hqqqPolar;
+TH2F * hsx3VpcIndex;
+TH2F * hqqqVpcIndex;
+TH2F * hqqqVpcE;
+TH2F * hsx3VpcE;
+TH2F * hanVScatsum;
+int padID = 0;
+
+SX3 sx3_contr;
+PW pw_contr;
+TVector3 hitPos;
+bool HitNonZero;
+
+TH1F * hZProj;
+
+void Analyzer1::Begin(TTree * /*tree*/){
+  TString option = GetOption();
+
+  hsx3IndexVE = new TH2F("hsx3IndexVE", "SX3 index vs Energy; sx3 index ; Energy",  24*12, 0,  24*12, 400, 0, 5000); hsx3IndexVE->SetNdivisions( -612, "x");
+  hqqqIndexVE = new TH2F("hqqqIndexVE", "QQQ index vs Energy; QQQ index ; Energy", 4*2*16, 0, 4*2*16, 400, 0, 5000); hqqqIndexVE->SetNdivisions( -1204, "x");
+  hpcIndexVE = new TH2F("hpcIndexVE",   "PC index vs Energy; PC index ; Energy",     2*24, 0,   2*24, 400, 0, 4000); hpcIndexVE->SetNdivisions( -1204, "x");
+
+
+  hsx3Coin = new TH2F("hsx3Coin", "SX3 Coincident",  24*12, 0,  24*12,  24*12, 0, 24*12);
+  hqqqCoin = new TH2F("hqqqCoin", "QQQ Coincident", 4*2*16, 0, 4*2*16, 4*2*16, 0, 4*2*16);
+  hpcCoin  = new TH2F("hpcCoin",  "PC Coincident",    2*24, 0,   2*24,   2*24, 0, 2*24);
+
+  hqqqPolar = new TH2F("hqqqPolar", "QQQ Polar ID", 16*4, -TMath::Pi(), TMath::Pi(),16, 10, 50);
+
+  hsx3VpcIndex = new TH2F("hsx3Vpcindex", "sx3 vs pc; sx3 index; pc index",  24*12, 0, 24*12, 48, 0, 48);
+  hsx3VpcIndex->SetNdivisions( -612, "x");
+  hsx3VpcIndex->SetNdivisions( -12, "y");
+  hqqqVpcIndex = new TH2F("hqqqVpcindex", "qqq vs pc; qqq index; pc index",  4*2*16, 0, 4*2*16, 48, 0, 48);
+  hqqqVpcIndex->SetNdivisions( -612, "x");
+  hqqqVpcIndex->SetNdivisions( -12, "y");
+
+  hqqqVpcE = new TH2F("hqqqVpcEnergy", "qqq vs pc; qqq energy; pc energy", 400, 0, 5000, 400, 0, 5000);
+  hqqqVpcE->SetNdivisions( -612, "x");
+  hqqqVpcE->SetNdivisions( -12, "y");
+  
+  hsx3VpcE = new TH2F("hsx3VpcEnergy", "sx3 vs pc; sx3 energy; pc energy", 400, 0, 5000, 400, 0, 5000);
+  hsx3VpcE->SetNdivisions( -612, "x");
+  hsx3VpcE->SetNdivisions( -12, "y");
+
+  hZProj = new TH1F("hZProj", "Z Projection", 1200, -600, 600);
+
+  hanVScatsum = new TH2F("hanVScatsum", "Anode vs Cathode Sum; Anode E; Cathode E", 400,0 , 10000, 400, 0 , 16000);
+
+  sx3_contr.ConstructGeo();
+  pw_contr.ConstructGeo();
+
+}
+
+
+
+
+Bool_t Analyzer1::Process(Long64_t entry){
+
+  // if ( entry > 100 ) return kTRUE;
+
+  hitPos.Clear();
+  HitNonZero = false;
+
+  // if( entry > 1) return kTRUE;
+  // printf("################### ev : %llu \n", entry);
+
+  b_sx3Multi->GetEntry(entry);
+  b_sx3ID->GetEntry(entry);
+  b_sx3Ch->GetEntry(entry);
+  b_sx3E->GetEntry(entry);
+  b_sx3T->GetEntry(entry);
+  b_qqqMulti->GetEntry(entry);
+  b_qqqID->GetEntry(entry);
+  b_qqqCh->GetEntry(entry);
+  b_qqqE->GetEntry(entry);
+  b_qqqT->GetEntry(entry);
+  b_pcMulti->GetEntry(entry);
+  b_pcID->GetEntry(entry);
+  b_pcCh->GetEntry(entry);
+  b_pcE->GetEntry(entry);
+  b_pcT->GetEntry(entry);
+
+  sx3.CalIndex();
+  qqq.CalIndex();
+  pc.CalIndex();
+
+  // sx3.Print();
+
+  //########################################################### Raw data
+  // //======================= SX3
+
+  std::vector<std::pair<int, int>> ID; // first = id, 2nd = index
+  for( int i = 0; i < sx3.multi; i ++){
+    ID.push_back(std::pair<int, int>(sx3.id[i], i));
+
+    hsx3IndexVE->Fill( sx3.index[i], sx3.e[i] );
+
+    for( int j = i+1; j < sx3.multi; j++){
+      hsx3Coin->Fill( sx3.index[i], sx3.index[j]);
+    }
+
+    for( int j = 0; j < pc.multi; j++){
+      hsx3VpcIndex->Fill( sx3.index[i], pc.index[j] );
+      //  if( sx3.ch[index] > 8 ){
+      //    hsx3VpcE->Fill( sx3.e[i], pc.e[j] );
+      //   }
+    }
+  }
+
+
+  if( ID.size() > 0 ){
+    std::sort(ID.begin(), ID.end(),  [](const std::pair<int, int> & a, const std::pair<int, int> & b) {
+      return a.first < b.first;
+    } );
+    // printf("##############################\n");
+    // for( size_t i = 0; i < ID.size(); i++) printf("%zu | %d %d \n", i, ID[i].first, ID[i].second );
+
+    std::vector<std::pair<int, int>> sx3ID; 
+    sx3ID.push_back(ID[0]);
+    bool found = false;
+    for( size_t i = 1; i < ID.size(); i++){
+      if( ID[i].first == sx3ID.back().first) {
+        sx3ID.push_back(ID[i]);
+        if( sx3ID.size() >= 3) {
+          found = true;
+        } 
+      }else{
+        if( !found ){
+          sx3ID.clear();
+          sx3ID.push_back(ID[i]);
+        }
+      }
+    }
+
+    // printf("---------- sx3ID Multi : %zu \n", sx3ID.size());
+
+    if( found ){
+      int sx3ChUp, sx3ChDn, sx3ChBk;
+      float sx3EUp, sx3EDn;
+      // printf("------ sx3 ID : %d, multi: %zu\n", sx3ID[0].first, sx3ID.size());
+      for( size_t i = 0; i < sx3ID.size(); i++ ){
+        int index = sx3ID[i].second;
+        // printf(" %zu | index %d | ch : %d, energy : %d \n", i, index, sx3.ch[index], sx3.e[index]);
+
+
+        if( sx3.ch[index] < 8 ){
+          if( sx3.ch[index] % 2 == 0) {
+            sx3ChDn = sx3.ch[index];
+            sx3EDn = sx3.e[index];
+          }else{
+            sx3ChUp = sx3.ch[index];
+            sx3EUp = sx3.e[index];
+          }
+        }else{
+          sx3ChBk = sx3.ch[index];
+        }
+         for( int j = 0; j < pc.multi; j++){
+      // hsx3VpcIndex->Fill( sx3.index[i], pc.index[j] );
+            if( sx3.ch[index] > 8 ){
+              hsx3VpcE->Fill( sx3.e[i], pc.e[j] );
+          //  hpcIndexVE->Fill( pc.index[i], pc.e[i] );
+            }
+          }
+      }
+
+      sx3_contr.CalSX3Pos(sx3ID[0].first, sx3ChUp, sx3ChDn, sx3ChBk, sx3EUp, sx3EDn);
+      hitPos = sx3_contr.GetHitPos();
+      HitNonZero = true;
+      // hitPos.Print();
+    }
+
+  }
+  
+
+  // //======================= QQQ
+  for( int i = 0; i < qqq.multi; i ++){
+    // for( int j = 0; j < pc.multi; j++){
+        // if(pc.index[j]==4){
+          hqqqIndexVE->Fill( qqq.index[i], qqq.e[i] );
+        // }
+    // }
+    for( int j = 0; j < qqq.multi; j++){
+      if ( j == i ) continue;
+      hqqqCoin->Fill( qqq.index[i], qqq.index[j]);
+    }
+
+
+    for( int j = i + 1; j < qqq.multi; j++){
+      for( int k = 0; k < pc.multi; k++){
+        if(pc.index[k]<24 && pc.e[k]>50 ){
+          hqqqVpcE->Fill( qqq.e[i], pc.e[k] );
+          //  hpcIndexVE->Fill( pc.index[i], pc.e[i] );
+                hqqqVpcIndex->Fill( qqq.index[i], pc.index[j] );
+
+        }
+      // }
+      }
+      // if( qqq.used[i] == true ) continue;
+      
+      //if( qqq.id[i] == qqq.id[j] && (16 - qqq.ch[i]) * (16 - qqq.ch[j]) < 0  ){ // must be same detector and wedge and ring
+      if( qqq.id[i] == qqq.id[j]  ){ // must be same detector 
+        
+        int chWedge = -1;
+        int chRing  =  -1;
+        if( qqq.ch[i] < qqq.ch[j]){
+          chRing = qqq.ch[j] - 16;
+          chWedge = qqq.ch[i];
+        }else{
+          chRing = qqq.ch[i];
+          chWedge = qqq.ch[j] - 16;
+        }
+
+        // printf(" ID : %d , chWedge : %d, chRing : %d \n", qqq.id[i], chWedge, chRing);
+
+        double theta = -TMath::Pi()/2 + 2*TMath::Pi()/16/4.*(qqq.id[i]*16 + chWedge +0.5);
+        double rho   = 10.+40./16.*(chRing+0.5);
+        // if(qqq.e[i]>50){
+        hqqqPolar->Fill( theta, rho);
+        // }
+        // qqq.used[i] = true;
+        // qqq.used[j] = true;
+
+        if( !HitNonZero ){
+        double x = rho * TMath::Cos(theta);
+        double y = rho * TMath::Sin(theta);
+        hitPos.SetXYZ(x, y, 23 + 75 + 30);
+        HitNonZero = true;
+        }
+      }
+    }
+  
+   
+  }
+  // //======================= PC
+
+  ID.clear();
+  int counter=0;
+  std::vector<std::pair<int, double>> E; 
+  E.clear();
+  for( int i = 0; i < pc.multi; i ++){
+
+    if( pc.e[i] > 100 ) ID.push_back(std::pair<int, int>(pc.id[i], i));
+    if( pc.e[i] > 100 ) E.push_back(std::pair<int, double>(pc.index[i], pc.e[i]));
+
+    hpcIndexVE->Fill( pc.index[i], pc.e[i] );
+
+    for( int j = i+1; j < pc.multi; j++){
+      hpcCoin->Fill( pc.index[i], pc.index[j]);
+    
+    }
+
+  }
+  //  for( size_t i = 0; i < E.size(); i++) printf("%zu | %d %d \n", i, E[i].first, E[i].second ); 
+
+  if( E.size()>=3 ){
+
+    int aID = 0;
+    int cID = 0;
+
+    float aE = 0;
+    float cE = 0;
+    bool multi_an =false;
+    // if( ID[0].first < 1 ) {
+    //   aID = pc.ch[ID[0].second];
+    //   cID = pc.ch[ID[1].second];
+    // }else{
+    //   cID = pc.ch[ID[0].second];
+    //   aID = pc.ch[ID[1].second];
+    // }
+    // printf("anode= %d, cathode = %d\n", aID, cID);
+
+  // for( int k = 0; k < qqq.multi; k++){
+  //   if(qqq.index[k]==75 && pc.index[k]==2 && pc.e[k]>100){
+      for(int l=0;l<E.size();l++){
+        if(E[l].first<24 ){
+          if(!multi_an){
+            aE = E[l].second;
+          }
+          multi_an=true;
+        }
+        else if (E[l].first>=24){
+          cE = E[l].second + cE;
+        }
+      }
+    // }
+  // }
+    hanVScatsum->Fill(aE,cE);
+      
+    if( ID[0].first < 1 ) {
+      aID = pc.ch[ID[0].second];
+      cID = pc.ch[ID[1].second];
+    }else{
+      cID = pc.ch[ID[0].second];
+      aID = pc.ch[ID[1].second];
+    }
+
+    if( HitNonZero){
+      pw_contr.CalTrack( hitPos, aID, cID);
+      hZProj->Fill(pw_contr.GetZ0());
+    }
+
+  
+  }
+  
+
+
+  //########################################################### Track constrcution
+
+
+  //############################## DO THE KINEMATICS
+
+
+  return kTRUE;
+}
+
+void Analyzer1::Terminate(){
+
+  gStyle->SetOptStat("neiou");
+  TCanvas * canvas = new TCanvas("cANASEN", "ANASEN", 2000, 2000); 
+  canvas->Divide(3,3);
+
+  //hsx3VpcIndex->Draw("colz");
+
+  //=============================================== pad-1
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hsx3IndexVE->Draw("colz");
+
+  //=============================================== pad-2
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hqqqIndexVE->Draw("colz");
+
+  //=============================================== pad-3
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hpcIndexVE->Draw("colz");
+
+  //=============================================== pad-4
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hsx3Coin->Draw("colz");
+
+  //=============================================== pad-5
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  canvas->cd(padID)->SetLogz(true);
+
+  hqqqCoin->Draw("colz");
+
+  //=============================================== pad-6
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hpcCoin->Draw("colz");
+
+  //=============================================== pad-7
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  // hsx3VpcIndex ->Draw("colz"); 
+  hsx3VpcE->Draw("colz") ;
+
+  //=============================================== pad-8
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  // hqqqVpcIndex ->Draw("colz");  
+
+  hqqqVpcE ->Draw("colz");
+  //=============================================== pad-9
+  padID ++; 
+
+  // canvas->cd(padID)->DrawFrame(-50, -50, 50, 50);
+  // hqqqPolar->Draw("same colz pol");
+
+ canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+//  hZProj->Draw();
+  hanVScatsum->Draw("colz");
+
+}

Analyzer1.h

@@ -1,5 +1,5 @@
-#ifndef gainmatch_h
-#define gainmatch_h
+#ifndef Analyzer1_h
+#define Analyzer1_h
 
 #include <TROOT.h>
 #include <TChain.h>
@@ -8,7 +8,7 @@
 
 #include "Armory/ClassDet.h"
 
-class gainmatch : public TSelector {
+class Analyzer1 : public TSelector {
 public :
    TTree          *fChain;   //!pointer to the analyzed TTree or TChain
 
@@ -41,8 +41,8 @@ public :
    TBranch        *b_pcE;   //!
    TBranch        *b_pcT;   //!
 
-   gainmatch(TTree * /*tree*/ =0) : fChain(0) { }
-   virtual ~gainmatch() { }
+   Analyzer1(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~Analyzer1() { }
    virtual Int_t   Version() const { return 2; }
    virtual void    Begin(TTree *tree);
    virtual void    SlaveBegin(TTree *tree);
@@ -57,13 +57,13 @@ public :
    virtual void    SlaveTerminate();
    virtual void    Terminate();
 
-   ClassDef(gainmatch,0);
+   ClassDef(Analyzer1,0);
 };
 
 #endif
 
-#ifdef gainmatch_cxx
-void gainmatch::Init(TTree *tree){
+#ifdef Analyzer1_cxx
+void Analyzer1::Init(TTree *tree){
 
    // Set branch addresses and branch pointers
    if (!tree) return;
@@ -95,20 +95,20 @@ void gainmatch::Init(TTree *tree){
 
 }
 
-Bool_t gainmatch::Notify(){
+Bool_t Analyzer1::Notify(){
 
    return kTRUE;
 }
 
-void gainmatch::SlaveBegin(TTree * /*tree*/){
+void Analyzer1::SlaveBegin(TTree * /*tree*/){
 
    TString option = GetOption();
 
 }
 
-void gainmatch::SlaveTerminate(){
+void Analyzer1::SlaveTerminate(){
 
 }
 
 
-#endif // #ifdef gainmatch_cxx
+#endif // #ifdef Analyzer_cxx

Armory/#ClassPW.h#

@@ -1,283 +0,0 @@
-#ifndef ClassPW_h
-#define ClassPW_h
-
-#include <cstdio>
-#include <TMath.h>
-#include <TVector3.h>
-
-struct PWHitInfo{
-  std::pair<short, short>   nearestWire; // anode, cathode
-  std::pair<double, double> nearestDist; // anode, cathode
-
-  std::pair<short, short>   nextNearestWire; // anode, cathode
-  std::pair<double, double> nextNearestDist; // anode, cathode
-
-  void Clear(){
-    nearestWire.first = -1;
-    nearestWire.second = -1;
-    nearestDist.first = 999999999;
-    nearestDist.second = 999999999;
-    nextNearestWire.first = -1;
-    nextNearestWire.second = -1;
-    nextNearestDist.first = 999999999;
-    nextNearestDist.second = 999999999;
-  }
-};
-
-//!########################################################
-class PW{ // proportional wire
-public: 
-  PW(){ ClearHitInfo();};
-  ~PW(){};
-
-  PWHitInfo GetHitInfo() const {return hitInfo;}
-  std::pair<short, short>   GetNearestID()          const {return hitInfo.nearestWire;}
-  std::pair<double, double> GetNearestDistance()    const {return hitInfo.nearestDist;}
-  std::pair<short, short>   Get2ndNearestID()       const {return hitInfo.nextNearestWire;}
-  std::pair<double, double> Get2ndNearestDistance() const {return hitInfo.nextNearestDist;}
-
-  TVector3 GetTrackPos() const {return trackPos;}
-  TVector3 GetTrackVec() const {return trackVec;}
-  double GetTrackTheta() const {return trackVec.Theta();}
-  double GetTrackPhi()   const {return trackVec.Phi();}
-  double GetZ0();
-
-  int GetNumWire() const {return nWire;}
-  double GetDeltaAngle() const {return dAngle;}
-  double GetAnodeLength() const {return anodeLength;}
-  double GetCathodeLength() const {return cathodeLength;}
-  TVector3 GetAnodeDn(short id) const {return An[id].first;}
-  TVector3 GetAnodeUp(short id) const {return An[id].second;}
-  TVector3 GetCathodeDn(short id) const {return Ca[id].first;}
-  TVector3 GetCathodeUp(short id) const {return Ca[id].second;}
-
-  TVector3 GetAnodneMid(short id)  const {return (An[id].first + An[id].second) * 0.5; }
-  double   GetAnodeTheta(short id) const {return (An[id].first - An[id].second).Theta();}
-  double   GetAnodePhi(short id)   const {return (An[id].first - An[id].second).Phi();}
-
-  TVector3 GetCathodneMid(short id)  const {return (Ca[id].first + Ca[id].second) * 0.5; }
-  double   GetCathodeTheta(short id) const {return (Ca[id].first - Ca[id].second).Theta();}
-  double   GetCathodePhi(short id)   const {return (Ca[id].first - Ca[id].second).Phi();}
-
-  void ClearHitInfo();
-  void ConstructGeo();
-  void FindWireID(TVector3 pos, TVector3 direction, bool verbose = false);
-  void CalTrack(TVector3 sx3Pos, int anodeID, int cathodeID, bool verbose = false);
-  void CalTrack2(TVector3 sx3Pos, PWHitInfo hitInfo, double sigmaA = 0, double sigmaC = 0, bool verbose = false);
-
-  void Print(){
-    printf("     The nearest | Anode: %2d(%5.2f) Cathode: %2d(%5.2f)\n", hitInfo.nearestWire.first, 
-                                                                         hitInfo.nearestDist.first, 
-                                                                         hitInfo.nearestWire.second, 
-                                                                         hitInfo.nearestDist.second);
-
-    printf(" The 2nd nearest | Anode: %2d(%5.2f) Cathode: %2d(%5.2f)\n", hitInfo.nextNearestWire.first, 
-                                                                         hitInfo.nextNearestDist.first, 
-                                                                         hitInfo.nextNearestWire.second, 
-                                                                         hitInfo.nextNearestDist.second);
-  }
-
-private:
-
-  PWHitInfo hitInfo;
-
-  TVector3 trackPos;
-  TVector3 trackVec;
-
-  const int nWire = 24;
-  const int wireShift = 3;
-  const float zLen = 380; //mm
-  const float radiusA = 37;
-  const float radiusC = 43;
-
-  double dAngle;
-  double anodeLength;
-  double cathodeLength;
-
-  std::vector<std::pair<TVector3,TVector3>> An; // the anode wire position vector in space 
-  std::vector<std::pair<TVector3,TVector3>> Ca; // the cathode wire position vector in space 
-
-  double Distance(TVector3 a1, TVector3 a2, TVector3 b1, TVector3 b2){
-    TVector3 na = a1 - a2;
-    TVector3 nb = b1 - b2;
-    TVector3 nd = (na.Cross(nb)).Unit();
-    return TMath::Abs(nd.Dot(a1-b2));
-  } 
-
-};
-
-inline void PW::ClearHitInfo(){
-  hitInfo.Clear();
-}
-
-inline void PW::ConstructGeo(){
-
-  An.clear();
-  Ca.clear();
-
-  std::pair<TVector3, TVector3> p1; // anode
-  std::pair<TVector3, TVector3> q1; // cathode
-
-  //anode and cathode start at pos-Y axis and count in right-Hand
-  //anode wire shift is right-hand.
-  //cathode wire shift is left-hand.
-
-  for(int i = 0; i < nWire; i++ ){
-    // Anode rotate right-hand
-    p1.first.SetXYZ( radiusA * TMath::Cos( TMath::TwoPi() / nWire * (i)  + TMath::PiOver2()),
-                    radiusA * TMath::Sin( TMath::TwoPi() / nWire * (i)  + TMath::PiOver2()),
-                    zLen/2);
-    p1.second.SetXYZ( radiusA * TMath::Cos( TMath::TwoPi() / nWire * (i + wireShift) + TMath::PiOver2()),
-                      radiusA * TMath::Sin( TMath::TwoPi() / nWire * (i + wireShift) + TMath::PiOver2()),
-                    -zLen/2);
-    An.push_back(p1);
-
-    // Cathod rotate left-hand
-    q1.first.SetXYZ( radiusC * TMath::Cos( TMath::TwoPi() / nWire * (i)  + TMath::PiOver2()),
-                    radiusC * TMath::Sin( TMath::TwoPi() / nWire * (i)  + TMath::PiOver2()),
-                    zLen/2);
-    q1.second.SetXYZ( radiusC * TMath::Cos( TMath::TwoPi() / nWire * (i - wireShift) + TMath::PiOver2()),
-                      radiusC * TMath::Sin( TMath::TwoPi() / nWire * (i - wireShift) + TMath::PiOver2()),
-                      -zLen/2);
-    Ca.push_back(q1);
-  }
-
-  dAngle = wireShift * TMath::TwoPi() / nWire;
-  anodeLength = TMath::Sqrt( zLen*zLen + TMath::Power(2* radiusA * TMath::Sin(dAngle/2),2) );
-  cathodeLength = TMath::Sqrt( zLen*zLen + TMath::Power(2* radiusC * TMath::Sin(dAngle/2),2) );
-}
-
-inline void PW::FindWireID(TVector3 pos, TVector3 direction, bool verbose ){
-
-  hitInfo.Clear();
-  double phi = direction.Phi();
-
-  for( int i = 0; i < nWire; i++){
-
-    double disA = 99999999;
-    double phiS = An[i].first.Phi()  - TMath::PiOver4();
-    double phiL = An[i].second.Phi() + TMath::PiOver4();
-    // printf("A%2d: %f %f | %f\n", i, phiS * TMath::RadToDeg(), phiL * TMath::RadToDeg(), phi * TMath::RadToDeg());
-    if( phi > 0 && phiS > phiL )  phiL = phiL + TMath::TwoPi();
-    if( phi < 0 && phiS > phiL )  phiS = phiS - TMath::TwoPi();
-
-    if( phiS < phi && phi < phiL) {
-      disA = Distance( pos, pos + direction, An[i].first, An[i].second);
-      if( disA < hitInfo.nearestDist.first ){
-        hitInfo.nearestDist.first = disA;
-        hitInfo.nearestWire.first = i;
-      }
-    }
-
-    double disC = 99999999;
-    phiS = Ca[i].second.Phi()- TMath::PiOver4();
-    phiL = Ca[i].first.Phi() + TMath::PiOver4();
-    // printf("C%2d: %f %f\n", i, phiS * TMath::RadToDeg(), phiL * TMath::RadToDeg());
-    if( phi > 0 && phiS > phiL ) phiL = phiL + TMath::TwoPi();
-    if( phi < 0 && phiS > phiL ) phiS = phiS - TMath::TwoPi();
-
-    if(phiS < phi && phi < phiL) {
-      disC = Distance( pos, pos + direction, Ca[i].first, Ca[i].second);
-      if( disC < hitInfo.nearestDist.second ){
-        hitInfo.nearestDist.second = disC;
-        hitInfo.nearestWire.second = i;
-      }
-    }
-
-    if(verbose) printf(" %2d | %8.2f, %8.2f\n", i, disA, disC);
-  }
-
-  //==== find the 2nd nearest wire
-  short anode1 = hitInfo.nearestWire.first;
-  short aaa1 = anode1 - 1; if( aaa1 < 0 ) aaa1 += nWire;
-  short aaa2 = (anode1 + 1) % nWire; 
-
-  double haha1 = Distance( pos, pos + direction, An[aaa1].first, An[aaa1].second);
-  double haha2 = Distance( pos, pos + direction, An[aaa2].first, An[aaa2].second);
-  if( haha1 < haha2){
-    hitInfo.nextNearestWire.first = aaa1;
-    hitInfo.nextNearestDist.first = haha1;
-  }else{
-    hitInfo.nextNearestWire.first = aaa2;
-    hitInfo.nextNearestDist.first = haha2;
-  }
-
-  short cathode1 = hitInfo.nearestWire.second;
-  short ccc1 = cathode1 - 1; if( ccc1 < 0 ) ccc1 += nWire;
-  short ccc2 = (cathode1 + 1) % nWire; 
-
-  haha1 = Distance( pos, pos + direction, Ca[ccc1].first, Ca[ccc1].second);
-  haha2 = Distance( pos, pos + direction, Ca[ccc2].first, Ca[ccc2].second);
-  if( haha1 < haha2){
-    hitInfo.nextNearestWire.second = ccc1;
-    hitInfo.nextNearestDist.second = haha1;
-  }else{
-    hitInfo.nextNearestWire.second = ccc2;
-    hitInfo.nextNearestDist.second = haha2;
-  }
-
-  if( verbose ) Print();
-}
-
-inline void PW::CalTrack(TVector3 sx3Pos, int anodeID, int cathodeID, bool verbose){
-
-  trackPos = sx3Pos;
-
-  TVector3 n1 = (An[anodeID].first - An[anodeID].second).Cross((sx3Pos - An[anodeID].second)).Unit();
-  TVector3 n2 = (Ca[cathodeID].first - Ca[cathodeID].second).Cross((sx3Pos - Ca[cathodeID].second)).Unit();
-
-  // if the handiness of anode and cathode revered, it should be n2 cross n1
-  trackVec = (n2.Cross(n1)).Unit();
-
-  if( verbose ) printf("Theta, Phi = %f, %f \n", trackVec.Theta() *TMath::RadToDeg(), trackVec.Phi()*TMath::RadToDeg()); 
-
-}
-
-inline void PW::CalTrack2(TVector3 sx3Pos, PWHitInfo hitInfo, double sigmaA, double sigmaC, bool verbose){
-
-  trackPos = sx3Pos;
-
-  double p1 = TMath::Abs(hitInfo.nearestDist.first + gRandom->Gaus(0, sigmaA));
-  double p2 = TMath::Abs(hitInfo.nextNearestDist.first + gRandom->Gaus(0, sigmaA));
-  double fracA = p1 / (p1 + p2);
-  short anodeID1 = hitInfo.nearestWire.first;
-  short anodeID2 = hitInfo.nextNearestWire.first;
-  TVector3 shiftA1 = (An[anodeID2].first - An[anodeID1].first) * fracA;
-  TVector3 shiftA2 = (An[anodeID2].second - An[anodeID1].second) * fracA;
-
-  double q1 = TMath::Abs(hitInfo.nearestDist.second + gRandom->Gaus(0, sigmaC));
-  double q2 = TMath::Abs(hitInfo.nextNearestDist.second + gRandom->Gaus(0, sigmaC));
-  double fracC = q1 / (q1 + q2);
-  short cathodeID1 = hitInfo.nearestWire.second;
-  short cathodeID2 = hitInfo.nextNearestWire.second;
-  TVector3 shiftC1 = (Ca[cathodeID2].first - Ca[cathodeID1].first) * fracC;
-  TVector3 shiftC2 = (Ca[cathodeID2].second - Ca[cathodeID1].second) * fracC;
-
-  TVector3 a1 = An[anodeID1].first + shiftA1;
-  TVector3 a2 = An[anodeID1].second + shiftA2;
-
-  TVector3 c1 = Ca[cathodeID1].first + shiftC1;
-  TVector3 c2 = Ca[cathodeID1].second + shiftC2;
-
-  TVector3 n1 = (a1 - a2).Cross((sx3Pos - a2)).Unit();
-  TVector3 n2 = (c1 - c2).Cross((sx3Pos - c2)).Unit();
-
-  // if the handiness of anode and cathode revered, it should be n2 cross n1
-  trackVec = (n2.Cross(n1)).Unit();
-
-  if( verbose ) printf("Theta, Phi = %f, %f \n", trackVec.Theta() *TMath::RadToDeg(), trackVec.Phi()*TMath::RadToDeg()); 
-
-}
-
-inline double PW::GetZ0(){
-
-  double x = trackPos.X();
-  double y = trackPos.Y();
-  double rho = TMath::Sqrt(x*x + y*y);
-  double theta = trackVec.Theta();
-  
-  return trackPos.Z() - rho / TMath::Tan(theta);
-
-}
-
-#endif 

Armory/ANASEN_model.C

@@ -42,7 +42,7 @@ void ANASEN_model(int anodeID1 = -1, int anodeID2 = -1, int cathodeID1 = -1, int
   //--- making ANASEN
   const int nWire = 24;
   const int wireShift = 3;
-  const int zLen = 300; //mm
+  const int zLen = 350; //mm
   const int radiusA = 38;
   const int radiusC = 43;
 
@@ -103,8 +103,8 @@ void ANASEN_model(int anodeID1 = -1, int anodeID2 = -1, int cathodeID1 = -1, int
                                                        new TGeoRotation("rot1", 360/nSX3 * (i + 0.5), 0., 0.)));
   }
 
-  const int qqqR1 = 10;
-  const int qqqR2 = 50;
+  const int qqqR1 = 50;
+  const int qqqR2 = 100;
   TGeoVolume *qqq = geom->MakeTubs("qqq", Al, qqqR1, qqqR2, 0.5, 5, 85);
   qqq->SetLineColor(7);
   for( int i = 0; i < 4; i++){
@@ -119,3 +119,5 @@ void ANASEN_model(int anodeID1 = -1, int anodeID2 = -1, int cathodeID1 = -1, int
   geom->SetVisLevel(4);
   worldBox->Draw("ogle");
 }
+
+

Armory/ClassPW.h

@@ -2,6 +2,7 @@
 #define ClassPW_h
 
 #include <cstdio>
+#include <iostream>
 #include <TMath.h>
 #include <TVector3.h>
 #include <TRandom.h>
@@ -61,6 +62,14 @@ public:
   double GetTrackPhi() const { return trackVec.Phi(); }
   double GetZ0();
 
+  inline std::tuple<std::pair<TVector3, TVector3>, double, double, double>  GetPseudoWire(const std::vector<std::tuple<int,double,double>>& cluster, std::string type);
+
+  inline std::tuple<TVector3,double,double,double,double,double,double,double> 
+  FindCrossoverProperties(const std::vector<std::tuple<int,double,double>>& a_cluster, const std::vector<std::tuple<int,double,double>>& c_cluster);
+
+  inline std::vector<std::vector<std::tuple<int,double,double>>>
+  Make_Clusters(std::unordered_map<int,std::tuple<int,double,double>> wireEvents);
+	
   int GetNumWire() const { return nWire; }
   double GetDeltaAngle() const { return dAngle; }
   double GetAnodeLength() const { return anodeLength; }
@@ -82,7 +91,8 @@ public:
   void ConstructGeo();
   void FindWireID(TVector3 pos, TVector3 direction, bool verbose = false);
   void CalTrack(TVector3 sx3Pos, int anodeID, int cathodeID, bool verbose = false);
-  void CalTrack2(TVector3 sx3Pos, PWHitInfo hitInfo, double sigmaA = 0, double sigmaC = 0, bool verbose = false);
+  //void CalTrack2(TVector3 sx3Pos, TVector3 anodeInt, bool verbose = false);
+  void CalTrack2(TVector3 sx3Pos, PWHitInfo hitInfo, double sigmaA, double sigmaC, bool verbose);
 
   void Print()
   {
@@ -105,7 +115,8 @@ private:
 
   const int nWire = 24;
   const int wireShift = 3;
-  const float zLen = 380; // mm
+  //const float zLen = 380; // mm
+  const float zLen = 348.6; // mm
   const float radiusA = 37;
   const float radiusC = 43;
 
@@ -154,19 +165,177 @@ inline void PW::ConstructGeo()
                      -zLen / 2);
     An.push_back(p1);
 
-    // Cathod rotate left-hand
-    q1.first.SetXYZ(radiusC * TMath::Cos(TMath::TwoPi() / nWire * (i) + TMath::PiOver2()),
-                    radiusC * TMath::Sin(TMath::TwoPi() / nWire * (i) + TMath::PiOver2()),
+    // Cathod rotate left-hand with the 3 wire offset accounted for (+1 from the calculated offset from the PC coincidence spectrum)
+    q1.first.SetXYZ(radiusC * TMath::Cos(TMath::TwoPi() / nWire * (i + wireShift + 1) + TMath::PiOver2()),
+                    radiusC * TMath::Sin(TMath::TwoPi() / nWire * (i + wireShift + 1) + TMath::PiOver2()),
                     zLen / 2);
-    q1.second.SetXYZ(radiusC * TMath::Cos(TMath::TwoPi() / nWire * (i - wireShift) + TMath::PiOver2()),
-                     radiusC * TMath::Sin(TMath::TwoPi() / nWire * (i - wireShift) + TMath::PiOver2()),
+    q1.second.SetXYZ(radiusC * TMath::Cos(TMath::TwoPi() / nWire * (i + 1) + TMath::PiOver2()),
+                     radiusC * TMath::Sin(TMath::TwoPi() / nWire * (i + 1) + TMath::PiOver2()),
                      -zLen / 2);
     Ca.push_back(q1);
   }
+  // correcting for the fact that the order of the cathode wires is reversed
+  std::reverse(Ca.begin(), Ca.end());
+  // adjusting for the 3 wire offset, the rbegin and rend are used as the rotation of the wires is done in the opposite direction i.e. 1,2,3 -> 3,1,2
+  // NOT NECESSARY ANY MORE, HAS BEEN IMCORPORATED INTO THE WIREOFFSET IN THE BEGINNING
+  // std::rotate(Ca.rbegin(), Ca.rbegin() + 4, Ca.rend());
 
   dAngle = wireShift * TMath::TwoPi() / nWire;
   anodeLength = TMath::Sqrt(zLen * zLen + TMath::Power(2 * radiusA * TMath::Sin(dAngle / 2), 2));
-  cathodeLength = TMath::Sqrt(zLen * zLen + TMath::Power(2 * radiusC * TMath::Sin(dAngle / 2), 2));
+  cathodeLength = TMath::Sqrt(zLen * zLen + TMath::Power(2 * radiusC * TMath::Sin(dAngle / 2), 2)); //chord length subtending an angle alpha is 2rsin(alpha/2)
+}
+
+inline std::vector<std::vector<std::tuple<int,double,double>>>
+PW::Make_Clusters(std::unordered_map<int,std::tuple<int,double,double>> wireEvents) {
+   std::vector<std::vector<std::tuple<int,double,double>>> wireClusters;
+   std::vector<std::tuple<int,double,double>> wireCluster;
+	//TODO: Write a macro once, call it twice
+    int wirecount=0;
+	while(wirecount < 24) {
+		if(wireEvents.find(wirecount)==wireEvents.end()) {
+				wirecount++;
+				continue;
+		}
+		wireCluster.clear();
+		int ctr2=wirecount;
+		do {
+			wireCluster.emplace_back(wireEvents[ctr2]);
+			ctr2+=1;
+			if(ctr2==24 || ctr2-wirecount == 7) break; //loose logic, needs to be looked at.
+		} while(wireEvents.find(ctr2)!=wireEvents.end());
+		wireClusters.push_back(std::move(wireCluster));
+		wirecount = ctr2; //we already dealt with wires until the last value of ctr2
+	}
+
+	if(wireClusters.size() > 1) { //Deal with wraparound if required
+		auto first_cluster = wireClusters.front(); //front and back provide references to the elements themselves. less copy, can modify etc
+		auto last_cluster = wireClusters.back();
+		if(std::get<0>(last_cluster.back())==23 && std::get<0>(first_cluster.front())==0) {
+			last_cluster.insert(last_cluster.end(),first_cluster.begin(),first_cluster.end());
+		}
+		wireClusters.erase(wireClusters.begin()); //canonically, erase() needs an iterator, hence begin() not front()
+		//TODO: Can also deal with 'gaps' of missing wires similarly. end of one segment and beginning of another segment will be separated by missing wire --> combine the two
+		//TODO: Also needs some development regarding the time-correlation. Don't put wires in the same cluster if they aren't time coincident
+	}
+	return wireClusters;
+
+  /*if(aClusters.size()>1 || cClusters.size() > 1) {
+  	std::cout << " ============== " << std::endl;
+  }
+  if(aClusters.size()>1 && cClusters.size() >=1) {
+  	std::cout << aClusters.size() << " new anode clusters ----> " << std::endl;
+  	int cc=1;
+  	for(auto ac : aClusters) {
+  		std::cout << "  Cluster " << cc << std::endl;
+	  	double first_ts = std::get<2>(ac.at(0));
+  		for(auto item : ac) {
+	  		std::cout << "  \t" << std::get<0>(item) << " " << std::get<1>(item) << " " << std::get<2>(item)-first_ts << std::endl;
+  		}
+  		std::cout << "  ------" << std::endl;
+  		cc++;
+  	}
+  } 	
+
+  if(cClusters.size()>=1 ) {
+  	std::cout << cClusters.size() << " new cathode clusters ----> " << std::endl;
+  	int cc=1;
+  	for(auto ac : cClusters) {
+  		std::cout << "  Cluster " << cc << std::endl;
+	  	double first_ts = std::get<2>(ac.at(0));
+  		for(auto item : ac) {
+	  		std::cout << "  \t" << std::get<0>(item) << " " << std::get<1>(item) << " " << std::get<2>(item)-first_ts << std::endl;
+  		}
+  		std::cout << "  ------" << std::endl;
+  		cc++;
+  	}
+  } 	*/
+}
+
+inline std::tuple<std::pair<TVector3, TVector3>, double, double, double>
+PW::GetPseudoWire(const std::vector<std::tuple<int,double,double>>& cluster, std::string type) {
+	std::pair<TVector3,TVector3> avgvec = std::pair(TVector3(0,0,0),TVector3(0,0,0));
+	double sumEnergy = 0;
+	double maxEnergy = 0;
+	double tsMaxEnergy = 0;
+	if(type=="ANODE") {
+		//if(cluster.size()>1) std::cout << " -------anodes" << std::endl;
+		for( auto wire : cluster) {
+			avgvec.first += std::get<1>(wire)*TVector3(An.at(std::get<0>(wire)).first.X(), An.at(std::get<0>(wire)).first.Y(), 0) ;
+			avgvec.second += std::get<1>(wire)*TVector3(An.at(std::get<0>(wire)).second.X(), An.at(std::get<0>(wire)).second.Y(), 0);
+			sumEnergy += std::get<1>(wire);
+			if(std::get<1>(wire) > maxEnergy) {
+				maxEnergy = std::get<1>(wire);
+				tsMaxEnergy = std::get<2>(wire);
+			}
+			/*if(cluster.size()>1) {
+				std::cout << "\t\t ch:" << std::get<0>(wire) << " " << std::get<1>(wire) << " " << std::get<2>(wire) << std::endl;
+				std::cout << "\t\t w1(r,phi,z):" << An.at(std::get<0>(wire)).first.Perp() << " " << An.at(std::get<0>(wire)).first.Phi()*180/M_PI << " " << An.at(std::get<0>(wire)).first.Z() << std::endl;
+				std::cout << "\t\t w2(r,phi,z):" << An.at(std::get<0>(wire)).second.Perp() << " " << An.at(std::get<0>(wire)).second.Phi()*180/M_PI << " " << An.at(std::get<0>(wire)).second.Z() << std::endl;			
+			}*/
+		}
+		avgvec.first = avgvec.first*(1.0/sumEnergy);
+		avgvec.second = avgvec.second*(1.0/sumEnergy);
+		double phi1 = avgvec.first.Phi();
+		double phi2 = avgvec.second.Phi();
+		avgvec.first.SetXYZ(radiusA*TMath::Cos(phi1), radiusA*TMath::Sin(phi1), zLen/2);
+		avgvec.second.SetXYZ(radiusA*TMath::Cos(phi2), radiusA*TMath::Sin(phi2), -zLen/2);
+		/*if(cluster.size()>1) {
+			std::cout << "\t\t avg1(r,phi,z):" << avgvec.first.Perp() << " " << avgvec.first.Phi()*180/M_PI << " " << avgvec.first.Z() << std::endl;			
+			std::cout << "\t\t avg2(r,phi,z):" << avgvec.second.Perp() << " " << avgvec.second.Phi()*180/M_PI << " " << avgvec.second.Z() << std::endl;			
+		}*/	
+	} else if(type =="CATHODE") {
+		for( auto wire : cluster) {
+			avgvec.first += std::get<1>(wire)*TVector3(Ca.at(std::get<0>(wire)).first.X(), Ca.at(std::get<0>(wire)).first.Y(), 0) ;
+			avgvec.second += std::get<1>(wire)*TVector3(Ca.at(std::get<0>(wire)).second.X(), Ca.at(std::get<0>(wire)).second.Y(), 0);
+			sumEnergy += std::get<1>(wire);
+			if(std::get<1>(wire) > maxEnergy) {
+				maxEnergy = std::get<1>(wire);
+				tsMaxEnergy = std::get<2>(wire);
+			}
+		}
+		avgvec.first = avgvec.first*(1.0/sumEnergy);
+		avgvec.second = avgvec.second*(1.0/sumEnergy);
+		double phi1 = avgvec.first.Phi();
+		double phi2 = avgvec.second.Phi();
+		avgvec.first.SetXYZ(radiusC*TMath::Cos(phi1), radiusC*TMath::Sin(phi1), zLen/2);
+		avgvec.second.SetXYZ(radiusC*TMath::Cos(phi2), radiusC*TMath::Sin(phi2), -zLen/2);	
+	}
+	return std::tuple(avgvec, sumEnergy, maxEnergy, tsMaxEnergy); 
+}
+
+inline std::tuple<TVector3,double,double,double,double,double,double,double> PW::FindCrossoverProperties(const std::vector<std::tuple<int,double,double>>& a_cluster,
+																				 const std::vector<std::tuple<int,double,double>>& c_cluster) {
+	//std::pair<TVector3, TVector3> apwire = GetPseudoWire(a_cluster,"ANODE",anodeSumE);
+	//std::pair<TVector3, TVector3> cpwire = GetPseudoWire(c_cluster,"CATHODE",cathodeSumE);
+	auto [apwire, apSumE, apMaxE, apTSMaxE] = GetPseudoWire(a_cluster,"ANODE");
+	auto [cpwire, cpSumE, cpMaxE, cpTSMaxE] = GetPseudoWire(c_cluster,"CATHODE");
+
+	TVector3 crossover;
+	crossover.Clear();
+  	TVector3 a, c, diff;
+  	double a2, ac, c2, adiff, cdiff, denom, alpha=0;
+
+	if(apSumE && cpSumE) {
+    	a = apwire.first - apwire.second;
+		c = cpwire.first - cpwire.second;
+      	diff = apwire.first - cpwire.first;
+      	a2 = a.Dot(a);
+      	c2 = c.Dot(c);
+      	ac = a.Dot(c);
+      	adiff = a.Dot(diff);
+      	cdiff = c.Dot(diff);
+      	denom = a2 * c2 - ac * ac;
+      	alpha = (ac * cdiff - c2 * adiff) / denom;
+		crossover = apwire.first + alpha*a;		
+		if(crossover.z() < -190 || crossover.Z() > 190 ) {
+			alpha = 9999999;
+			apSumE=-1; cpSumE=-1;
+			apMaxE=-1; cpMaxE=-1;
+			apTSMaxE=-1; cpTSMaxE=-1;
+		}
+	}
+	//std::cout << apSumE << " " << cpSumE << " " << " " <<  crossover.Perp() << std::endl;
+	return std::tuple(crossover,alpha,apSumE,cpSumE,apMaxE,cpMaxE,apTSMaxE,cpTSMaxE);
 }
 
 inline void PW::FindWireID(TVector3 pos, TVector3 direction, bool verbose)
@@ -278,6 +447,7 @@ inline void PW::CalTrack(TVector3 sx3Pos, int anodeID, int cathodeID, bool verbo
     printf("Theta, Phi = %f, %f \n", trackVec.Theta() * TMath::RadToDeg(), trackVec.Phi() * TMath::RadToDeg());
 }
 
+
 inline void PW::CalTrack2(TVector3 sx3Pos, PWHitInfo hitInfo, double sigmaA, double sigmaC, bool verbose)
 {
 
@@ -315,6 +485,18 @@ inline void PW::CalTrack2(TVector3 sx3Pos, PWHitInfo hitInfo, double sigmaA, dou
     printf("Theta, Phi = %f, %f \n", trackVec.Theta() * TMath::RadToDeg(), trackVec.Phi() * TMath::RadToDeg());
 }
 
+/*inline TVector3 PW::CalTrack3(TVector3 siPos, TVector3 anodeInt, bool verbose)
+{
+
+  TVector3 v = anodeInt-siPos;
+  double t_minimum = -1.0*(siPos.X()*v.X()+siPos.Y()*v.Y())/(v.X()*v.X()+v.Y()*v.Y());
+  TVector3 vector_closest_to_z = siPos + t_minimum*v;
+
+  return vector_closest_to_z;
+  if (verbose)
+    printf("X slope = %f and Y slope = %f \n", mx, my);
+}*/
+
 inline double PW::GetZ0()
 {
 
@@ -323,7 +505,7 @@ inline double PW::GetZ0()
   double rho = TMath::Sqrt(x * x + y * y);
   double theta = trackVec.Theta();
 
-  return trackPos.Z() - rho / TMath::Tan(theta);
+  return trackVec.Z();
 }
 
 #endif

Armory/HistPlotter.h

@@ -0,0 +1,414 @@
+#ifndef HISTPLOTTER_H
+#define HISTPLOTTER_H
+#include <TCanvas.h>
+#include <TROOT.h>
+#include <TSystem.h>
+#include <TStyle.h>
+#include <iostream>
+#include <TFile.h>
+#include <TMemFile.h>
+#include <TH1.h>
+#include <TH2.h>
+#include <TCutG.h>
+#include <signal.h>
+#include <cstdlib>
+#include <utility>
+#include <fstream>
+#include <sstream>
+#include <unordered_map>
+#include <set>
+#include <TGraphErrors.h>
+
+class HistPlotter {
+private:
+    long long barrier_count, barrier_limit; //meant to keep track of how often to call FillN() on histograms
+    enum {TFILE, TMEMFILE} filetype;
+    std::unordered_map<std::string,TObject*> oMap; //!< Maps std::string to all TH1, TH2 objects in the class
+    std::unordered_map<std::string,TObject*> cutsMap; //!< Maps std::string to TCutG objects held by the class
+    std::set<std::string> folderList; //!< List of all folder names used to nest objects
+    std::unordered_map<TObject*,std::string> foldersForObjects; //!< Map that returns the folder corresponding to the object whose pointer is specified
+    TFile *ofile=nullptr; //!< TFile pointer for the output file
+    TMemFile *omfile=nullptr; //!< TFile pointer for the output memfile
+
+    //Caches to permit FillN() calls
+    std::unordered_map<std::string, std::vector<double>> onedimcache;
+    std::unordered_map<std::string, std::pair<std::vector<double>, std::vector<double>>> twodimcache;
+    inline void FillN_All_Histograms();
+public:
+    HistPlotter(std::string outfile, std::string type);
+    inline void FlushToDisk(); //!< Writes all objects to file before closing, nesting objects in folders as is found necessary
+    inline void PrintObjects(); //!< Dump objects to std::cout for inspection
+    inline void ReadCuts(std::string); 
+    inline TCutG* FindCut(std::string cut) {
+        return static_cast<TCutG*>(cutsMap.at(cut));
+    }
+    inline void set_barrier_limit(long long limit) { barrier_limit = limit; }
+    inline void barrier_increment() {
+        barrier_count++;
+        if(barrier_count == barrier_limit) {
+            FillN_All_Histograms();
+            barrier_count=0;
+        }
+    }
+    /*! \fn void FindCut()
+        \brief        
+            - Searches for a cut by name 'cut' in the internal list of cuts 'cutsMap'. Ugly fails (via unresolved at()) if such a cut isn't found.            
+        \param filename - name of the plainxtext file containing the cut file locations and identifiers
+        \return Pointer to the TCutG object that matches the name. Very useful to use this as plotter.FindCut("protonbarrelpid")->IsInside(deltaE, E) for instance.
+    */
+
+    inline void SetNewTitle(std::string name, std::string title) {
+        auto result = oMap.find(name); //result is an iterator
+        if(result==oMap.end()) return; //no warnings, could be changed in future
+        else
+        	static_cast<TNamed*>(oMap.at(name))->SetTitle(title.c_str()); // set new title
+	}
+
+    //Smart functions that create a new histogram if it doesn't exist.
+    inline void FillGraph(const std::string &name, float valuex, float valuey, float errx=0, float erry=0);
+    inline void Fill1D(const std::string& name,int nbinsx, float xlow, float xhigh, float value);
+    inline void Fill2D(const std::string& name,int nbinsx, float xlow, float xhigh
+                ,int nbinsy, float ylow, float yhigh, float valuex, float valuey);
+    inline void Fill1D(const std::string& name,int nbinsx, float xlow, float xhigh, float value, const std::string& folder);
+    inline void Fill2D(const std::string& name,int nbinsx, float xlow, float xhigh
+                ,int nbinsy, float ylow, float yhigh, float valuex, float valuey, const std::string& folder);
+    //TObject* findObject(std::string key);
+};
+
+HistPlotter::HistPlotter(std::string outfile, std::string type="") {
+    /*!
+        \brief Constructor. Opens a TFile instance with the specified filename
+        \param outfile : std::string that holds the desired output ROOT filename
+        \return None
+    */
+    if(type=="" || type == "TFILE") {
+        ofile = new TFile(outfile.c_str(),"recreate");
+        filetype = TFILE;
+    } else if(type =="TMEMFILE") {
+        omfile = new TMemFile(outfile.c_str(),"recreate");
+        filetype=TMEMFILE;
+    } else {
+        std::cout << "Unknown type "<< type << " specified for HistPlotter (use \"TFILE\" or \"TMEMFILE\"), using default \"TFILE\"  " << std::endl;
+        ofile = new TFile(outfile.c_str(),"recreate");
+        filetype = TFILE;
+    }
+    barrier_count=0;
+    barrier_limit=1000;
+}
+
+void HistPlotter::FillN_All_Histograms() {
+    for(auto it=oMap.begin(); it!=oMap.end(); it++ ) {
+        //it->first is std::string 'name', it->second is the TObject
+        if(it->second->InheritsFrom("TH1F")) {
+            //FillN(size, array-of-doubles, array-of-weights); //we set array-of-weights to (1,1,1,.. (size)
+            static_cast<TH1F*>(it->second)->FillN(onedimcache[it->first].size(), //size
+                                                  onedimcache[it->first].data(), //array
+                                                  std::vector<double>(onedimcache[it->first].size(),1.0).data()); //weight of ones
+            onedimcache[it->first].clear();
+        }  else if(it->second->InheritsFrom("TH2F")) {
+            //FillN(size, array-of-doubles, array-of-weights); //we set array-of-weights to (1,1,1,.. (size))
+            static_cast<TH2F*>(it->second)->FillN(twodimcache[it->first].first.size(), //size
+                                                  twodimcache[it->first].first.data(), //x array
+                                                  twodimcache[it->first].second.data(), //y array
+                                                  std::vector<double>(twodimcache[it->first].first.size(),1.0).data()); //weight of ones
+           twodimcache[it->first].first.clear();
+           twodimcache[it->first].second.clear();
+        }
+    }
+    std::cout << "." << std::endl;
+}
+void HistPlotter::FlushToDisk() {
+    /*! \fn void FlushToDisk()
+        \brief         Function that can be used at any point to exit smoothly by saving all ROOT objects in memory
+        to the output file before closing it. Obeys the binding of histograms to separate folders, if so specified.
+        \return No return -- void
+    */
+    if(filetype==TMEMFILE && omfile) {
+        std::cout << "Not flushing a TMemfile .. exiting .." << std::endl;
+        delete omfile;
+        return;
+    }
+    if(ofile->IsZombie() || !ofile) {
+        std::cerr << "Output file is zombie, finishing up without writing to disk!" << std::endl;
+        return;
+    }
+    FillN_All_Histograms();
+    for(auto it=oMap.begin(); it!=oMap.end(); it++ ) {
+        //omap maps: name(first) to object address(second).
+        // foldersForObjects maps: object address(first) to foldername(second)
+        auto result = foldersForObjects.find(it->second); //returns <TObject* histogram,std::string foldername> pair if found
+        if(result!=foldersForObjects.end()) { //we try to create folder if needed and cd to it
+            ofile->mkdir(result->second.c_str(),"",kTRUE); // args: name, title, returnExistingDirectory
+            ofile->cd(result->second.c_str());
+        } else {
+            ofile->cd(); //toplevel for all default histograms. Default setting
+        }
+        it->second->Write();
+    }
+
+    //Create a directory for all cuts, and save all cuts in them
+    ofile->mkdir("gCUTS","",kTRUE);
+    ofile->cd("gCUTS");
+    for(auto it=cutsMap.begin(); it!=cutsMap.end(); it++) {
+        (static_cast<TNamed*>(it->second))->SetName(it->first.c_str());
+        it->second->Write();
+    }
+    ofile->Close();
+    std::cout << "Wrote " << oMap.size() << " histograms to TFile " << std::string(ofile->GetName()) << std::endl;
+}
+
+void HistPlotter::FillGraph(const std::string& name, float valuex, float valuey, float errx, float erry) {
+    /*! \fn void FillGraph()
+        \brief
+        - Creates a TGraphError in memory with name 'name' if it doesn't exist, and fills it with valuex, valuey
+        - Writes present state to disk and fails with return value -1 if the name clashes with another object that's not of type TGraph*
+
+        \param name name of the TGraph
+        \param valuex The xvalue
+        \param valuey The yvalue
+        \param errx The x error
+        \param erry The y error
+        \return No return void
+    */
+    auto result = oMap.find(name); 
+    if(result==oMap.end()) {
+        TGraphErrors *tempG = new TGraphErrors();
+        tempG->SetName(name.c_str());
+        oMap.insert(std::make_pair(name,static_cast<TObject*>(tempG)));
+    }
+    if(!oMap.at(name)->InheritsFrom("TGraphErrors")) {
+        std::cerr << "Object " << name << " refers to something other than a TGraph*, not filling it hence!" << std::endl;
+        std::cerr << "Abort.." << std::endl;
+        FlushToDisk();
+        exit(-1);
+    }
+    // static_cast<TGraphErrors*>(oMap.at(name))->AddPointError(valuex,valuey,errx,erry);
+}
+
+void HistPlotter::Fill1D(const std::string& name, int nbinsx, float xlow, float xhigh, float value) {
+    /*! \fn void Fill1D()
+        \brief  
+        - Creates a TH1F in memory with name 'name' if it doesn't exist, and fills it with valuex, valuey
+        - Writes present state to disk and fails with return value -1 if the name clashes with another object that's not of type TH1*
+
+        \param name name of the TH1F histogram
+        \param nbinsx Number of bins in the histogram
+        \param xlow Lower limit on x-axis
+        \param xhigh Upper limit on x-axis
+        \param value The bin corresponding to value in (nbinsx, xlow, xhigh) is incremented by 1
+        \return No return void
+    */
+    auto result = oMap.find(name); //result is an iterator
+    if(result==oMap.end()) {
+        TH1F* temp1D = new TH1F(name.c_str(), name.c_str(), nbinsx, xlow, xhigh);
+        oMap.insert(std::make_pair(name,static_cast<TObject*>(temp1D)));
+        onedimcache.insert(std::make_pair(name, std::vector<double>()));
+        onedimcache[name].reserve(16384);
+    } else if(foldersForObjects.find(oMap.at(name))!=foldersForObjects.end()) { //shouldn't have a folder associated with it
+            std::cerr << "Object " << name << " already registered at " << foldersForObjects[oMap[name]] <<  ", choose a different name for the histogram to be stored in toplevel .." << std::endl;
+    }
+
+    //Check if the string 'name' maps to a 1D hist. If there's any other object by this name raise issue
+    if(!oMap.at(name)->InheritsFrom("TH1F")) {
+        std::cerr << "Object " << name << " refers to something other than a TH1*, not filling it hence!" << std::endl;
+        std::cerr << "Abort.." << std::endl;
+        FlushToDisk();
+        exit(-1);
+    }
+    onedimcache[name].emplace_back(value);
+    //static_cast<TH1F*>(oMap.at(name))->Fill(value);
+}
+
+void HistPlotter::Fill1D(const std::string& name, int nbinsx, float xlow, float xhigh, float value, const std::string& foldername) {
+    /*! \fn void Fill1D()
+        \brief        
+      -  Creates a TH1F in memory with name 'name' if it doesn't exist, and fills it with valuex, valuey
+      -  Writes present state to disk and fails with return value -1 if the name clashes with another object that's not of type TH1*
+      -  Remembers the foldername this particular histogram maps to, if provided. If not, defaults to toplevel.
+
+        \param name name of the TH1F histogram
+        \param nbinsx Number of bins in the histogram
+        \param xlow Lower limit on x-axis
+        \param xhigh Upper limit on x-axis
+        \param value The bin corresponding to value in (nbinsx, xlow, xhigh) is incremented by 1
+        \param foldername Name of the folder to put this histogram into. Defaults to toplevel if left empty
+        \return No return -- void
+    */
+
+    auto result = oMap.find(name); //result is an iterator
+    if(result==oMap.end()) {
+        TH1F* temp1D = new TH1F(name.c_str(), name.c_str(), nbinsx, xlow, xhigh);
+        oMap.insert(std::make_pair(name,static_cast<TObject*>(temp1D)));
+        onedimcache.insert(std::make_pair(name, std::vector<double>()));
+        onedimcache[name].reserve(16384);
+        if(foldername!="") {
+            if(folderList.find(foldername)==folderList.end()) {
+                folderList.insert(foldername);
+            }
+            foldersForObjects.insert(std::make_pair(static_cast<TObject*>(temp1D),foldername));
+        }
+    } else {
+        //object is present in map, but we enforce unique names
+        //it must already have a folder attached to it
+        if(foldersForObjects.find(oMap.at(name))==foldersForObjects.end()) {
+            std::cerr << "Object " << name << " already registered at toplevel, choose a different name for the histogram to be stored in " << foldername << " folder .." << std::endl;
+        } else if(foldersForObjects[oMap[name]]!=foldername) {
+            std::cerr << "Object " << name << " already registered at " << foldersForObjects[oMap[name]] <<  ", choose a different name for the histogram to be stored in " << foldername << " folder .." << std::endl;
+        }
+    }
+    //Check if the string 'name' maps to a 1D hist. If there's any other object by this name raise issue
+    if(!oMap.at(name)->InheritsFrom("TH1F")) {
+        std::cerr << "Object " << name << " refers to something other than a TH1*, not filling it hence!" << std::endl;
+        std::cerr << "Abort.." << std::endl;
+        FlushToDisk();
+        exit(-1);
+    }
+    onedimcache[name].emplace_back(value);
+    //static_cast<TH1F*>(oMap.at(name))->Fill(value);
+}
+
+void HistPlotter::Fill2D(const std::string& name, int nbinsx, float xlow, float xhigh, int nbinsy, float ylow, float yhigh, float valuex, float valuey) {
+    /*! \fn void Fill2D()
+        \brief        
+      -  Creates a TH2F in memory with name 'name' if it doesn't exist, and fills it with valuex, valuey
+      -  Writes present state to disk and fails with return value -1 if the name clashes with another object that's not of type TH2*
+        \param name name of the TH1F histogram
+        \param nbinsx Number of xbins in the histogram
+        \param xlow Lower limit on x-axis
+        \param xhigh Upper limit on x-axis
+        \param nbinsy Number of ybins in the histogram
+        \param ylow Lower limit on y-axis
+        \param yhigh Upper limit on y-axis
+        \param valuex
+        \param valuey The bin corresponding to (valuex, valuey) in (nbinsx, xlow, xhigh, ybinsx, ylow, yhigh) is incremented by 1
+        \return No return -- void
+    */
+
+    auto result = oMap.find(name); //result is an iterator
+    if(result==oMap.end()) {
+        TH2F* temp2D = new TH2F(name.c_str(), name.c_str(), nbinsx, xlow, xhigh, nbinsy, ylow, yhigh);
+        oMap.insert(std::make_pair(name,static_cast<TObject*>(temp2D)));
+        twodimcache.insert(std::make_pair(name, std::make_pair(std::vector<double>(),std::vector<double>())));
+        twodimcache[name].first.reserve(16384);
+        twodimcache[name].second.reserve(16384);
+    } else if(foldersForObjects.find(oMap.at(name))!=foldersForObjects.end()) { //shouldn't have a folder associated with it
+        std::cerr << "Object " << name << " already registered at " << foldersForObjects[oMap[name]] <<  ", choose a different name for the histogram to be stored in toplevel .." << std::endl;
+    }
+
+    //Check if the string 'name' maps to a 1D hist. If there's any other object by this name raise issue
+    if(!oMap.at(name)->InheritsFrom("TH2F")) {
+        std::cerr << "Object " << name << " refers to something other than a TH2*, not filling it hence!" << std::endl;
+        std::cerr << "Abort.." << std::endl;
+        FlushToDisk();
+        exit(-1);
+    }
+    twodimcache[name].first.emplace_back(valuex);
+    twodimcache[name].second.emplace_back(valuey);
+    //static_cast<TH2F*>(oMap.at(name))->Fill(valuex,valuey);
+}
+
+void HistPlotter::Fill2D(const std::string& name, int nbinsx, float xlow, float xhigh, int nbinsy, float ylow, float yhigh, float valuex, float valuey, const std::string& foldername) {
+    /*! \fn void Fill2D()
+        \brief        
+      -  Creates a TH2F in memory with name 'name' if it doesn't exist, and fills it with valuex, valuey
+      -  Writes present state to disk and fails with return value -1 if the name clashes with another object that's not of type TH2*
+      -  Remembers the foldername this particular histogram maps to, if provided. If not defaults to toplevel
+
+        \param name name of the TH1F histogram
+        \param nbinsx Number of xbins in the histogram
+        \param xlow Lower limit on x-axis
+        \param xhigh Upper limit on x-axis
+        \param nbinsy Number of ybins in the histogram
+        \param ylow Lower limit on y-axis
+        \param yhigh Upper limit on y-axis
+        \param valuex
+        \param valuey The bin corresponding to (valuex, valuey) in (nbinsx, xlow, xhigh, ybinsx, ylow, yhigh) is incremented by 1
+        \param foldername Name of the folder to put this histogram into. Defaults to toplevel if left empty
+        \return No return -- void
+    */
+
+    auto result = oMap.find(name); //result is an iterator
+    if(result==oMap.end()) {
+        TH2F* temp2D = new TH2F(name.c_str(), name.c_str(), nbinsx, xlow, xhigh, nbinsy, ylow, yhigh);
+        oMap.insert(std::make_pair(name,static_cast<TObject*>(temp2D)));
+        twodimcache.insert(std::make_pair(name, std::make_pair(std::vector<double>(),std::vector<double>())));
+        twodimcache[name].first.reserve(16384);
+        twodimcache[name].second.reserve(16384);
+        if(foldername!="") {
+            if(folderList.find(foldername)==folderList.end()) {
+                folderList.insert(foldername);
+            }
+            foldersForObjects.insert(std::make_pair(static_cast<TObject*>(temp2D),foldername));
+        }
+    } else {
+        //object is present in map, but we enforce unique names
+        //it must already have a folder attached to it
+        if(foldersForObjects.find(oMap.at(name))==foldersForObjects.end()) {
+            std::cerr << "Object " << name << " already registered at toplevel, choose a different name for the histogram to be stored in " << foldername << " folder .." << std::endl;
+        } else if(foldersForObjects[oMap.at(name)]!=foldername) {
+            std::cerr << "Object " << name << " already registered at " << foldersForObjects[oMap[name]] <<  ", choose a different name for the histogram to be stored in " << foldername << " folder .." << std::endl;
+        }
+    }
+
+    //Check if the string 'name' maps to a 1D hist. If there's any other object by this name raise issue
+    if(!oMap.at(name)->InheritsFrom("TH2F")) {
+        std::cerr << "Object " << name << " refers to something other than a TH2*, not filling it hence!" << std::endl;
+        std::cerr << "Abort.." << std::endl;
+        FlushToDisk();
+        exit(-1);
+    }
+    twodimcache[name].first.emplace_back(valuex);
+    twodimcache[name].second.emplace_back(valuey);
+    //static_cast<TH2F*>(oMap.at(name))->Fill(valuex,valuey);
+}
+
+void HistPlotter::ReadCuts(std::string filename) {
+    /*! \fn void ReadCuts()
+        \brief  Reads a list of cuts from a file. The file must have the format below, two columns
+                   - Column#1 - path to a file that contains a single TCutG object named "CUTG", the default name in ROOT.
+                   - Column#2 - The identifier name you plan to use in the code, like 'protonbarrelpid' or something, that will be searched by FindCut()
+        \param filename name of the plainxtext file containing the cut file locations and identifiers
+        \return No return -- void
+    */
+
+    std::ifstream infile;
+    infile.open(filename);
+    std::string cutfilename, cutname;
+    for(std::string line; std::getline(infile, line); ) {
+        if(line.size()!=0 && line[0]=='#')
+            ; //don't do anything with '#' lines
+        else {
+            std::stringstream ss(line);
+            ss>>cutfilename>>cutname;
+
+            TFile f(cutfilename.c_str());
+            if(f.IsZombie()) {
+                std::cerr << "Cannot open cutfile " << cutfilename << " .. skipping.." << std::endl;
+                continue;
+            }
+            TCutG *cut = (TCutG*)(f.Get("CUTG"));
+            cutsMap.insert(std::make_pair(cutname,static_cast<TObject*>(cut)));
+            f.Close();
+        } //else
+    }//for loop
+    infile.close();
+}
+
+void HistPlotter::PrintObjects() {
+    /*
+        void PrintObjects()
+        Prints the contents of the unordered_maps oMap and cutsMap to facilitate debugging
+
+    */
+    std::cout << "Type | Name " << std::endl;
+    std::cout << "---- | --------------------- " << std::endl;
+    for(auto it=oMap.begin(); it!=oMap.end(); it++ ) {
+        std::cout << it->second->ClassName() << " | "<< it->first << std::endl;
+    }
+    for(auto it=cutsMap.begin(); it!=cutsMap.end(); it++ ) {
+        std::cout << it->second->ClassName() << " | "<< it->first << std::endl;
+    }
+    std::cout << "---- | --------------------- " << std::endl;
+}
+
+#endif

Armory/Hit.h

@@ -0,0 +1,52 @@
+#ifndef Hit_H
+#define Hit_H
+
+#include <vector>
+
+class Hit{
+public:
+  unsigned short sn;
+  uint8_t ch;
+  unsigned short energy;
+  unsigned short energy2;
+  unsigned long long timestamp;
+  unsigned short fineTime;
+  bool pileUp;
+
+  unsigned short traceLength;
+  std::vector<short> trace;
+
+  Hit(){
+    Clear();
+  }
+
+  void Clear(){
+    sn = 0;
+    ch = 0;
+    energy = 0;
+    energy2 = 0;
+    timestamp = 0;
+    fineTime = 0;
+    traceLength = 0;
+    pileUp = false;
+    trace.clear();
+  }
+
+  void Print(){
+    printf("(%5d, %2d) %6d %16llu, %6d, %d, %5ld\n", sn, ch, energy, timestamp, fineTime, pileUp, trace.size());
+  }
+
+  void PrintTrace(){
+    for( unsigned short i = 0; i < traceLength; i++){
+      printf("%3u | %6d \n", i, trace[i]);
+    }
+  }
+
+  // Define operator< for sorting
+  bool operator<(const Hit& other) const {
+    return timestamp < other.timestamp;
+  }
+
+};
+
+#endif

Armory/LICENSE

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

Armory/Makefile

@@ -10,7 +10,7 @@ COPTS	=	-fPIC -DLINUX -g -O0 -Wall -std=c++17 -lpthread
 
 ROOTLIBS = `root-config --cflags --glibs`
 
-ALL = Mapper AnasenMS
+ALL = Mapper EventBuilder#AnasenMS
 
 #########################################################################
 
@@ -26,3 +26,8 @@ Mapper	:	Mapper.cpp  ../mapping.h ClassDet.h
 AnasenMS : constant.h Isotope.h ClassTransfer.h ClassSX3.h ClassPW.h ClassAnasen.h anasenMS.cpp 
 		@echo "--------- making ANASEN Monte Carlo"
 		$(CC) $(COPTS) -o AnasenMS anasenMS.cpp $(ROOTLIBS)
+
+EventBuilder : EventBuilder.cpp ClassData.h fsuReader.h Hit.h
+		@echo "--------- making EventBuilder"
+		$(CC) $(COPTS) -o EventBuilder EventBuilder.cpp $(ROOTLIBS) 
+

Armory/SX3Geom.h

@@ -0,0 +1,183 @@
+#ifndef SX3Geom_h
+#define SX3Geom_h
+#include <vector>
+
+const double DEFAULT_NULL=-987654321.;
+
+class sx3_geometry_scalefactors {
+public:
+    //If sx3 has L, R being the left and right extremities, we choose add, stretch here such that
+    // x_mm = (x_raw+add)*stretch; so add=abs(L), stretch=75/(abs(L)+R)
+    float add[4];
+    float stretch[4];
+};
+
+class qqq5_finegains {
+public:
+    std::array<std::pair<float,float>,32> front;
+    //front.at(30).first = slope at clkpos 0, ring 30 for E front layer
+    //front.at(30).second = intercept for the same as above
+    std::array<std::pair<float,float>,4> back;
+};
+class sx3_fbgains {
+public:
+    //Order of indices is [pad][strip]
+    float padoffsets[4][4];
+    float padgains[4][4];
+
+    float stripLoffsets[4][4];
+    float stripLgains[4][4];
+
+    float stripRoffsets[4][4];
+    float stripRgains[4][4];
+};
+
+std::array<sx3_fbgains,24> sx3_xtalk_gains; //every sx3 needs to be gainmatched as a frontL-back, frontR-back pair (pad strip pair)
+std::array<sx3_geometry_scalefactors,24> sx3gs;
+
+class sx3 {
+public:
+    //TODO: Convert to std::array
+    //Holds all information in an event, including ped subtraction+scaling. back[2].at(0) will have the largest energy seen in ch2, if any
+    std::vector<float> back[4];
+    std::vector<float> frontL[4];
+    std::vector<float> frontR[4];
+
+    double ts = DEFAULT_NULL;
+    //Easy lookup of final calibrated event. Only filled for valid cases, assumed for now to be 1L, 1R, 1B
+    float frontX=DEFAULT_NULL;
+    float frontXmm=DEFAULT_NULL;
+    float frontE=DEFAULT_NULL;
+    float backE=DEFAULT_NULL;
+    int stripF=DEFAULT_NULL;
+    int stripB=DEFAULT_NULL;
+    float frontEL=DEFAULT_NULL;
+    float frontER=DEFAULT_NULL;
+
+    float phi=DEFAULT_NULL; //
+
+    std::set<int> valid_front_chans;
+    std::set<int> valid_back_chans;
+    std::set<int> unmatched_front_chans; //every front channel is unmatched and invalid at first. when it gets matched, it gets removed and sent to valid
+
+    bool foundevent=false;
+    bool valid=false;//valid will be set to false in all cases where we have ambiguity
+    int flags=-1;//flags settable to different types of values to indicate different invalid situations
+
+    void fillevent(const std::string& position, const int subchannel, const float value); //make 'const' what functions don't need to change, helps with performance
+    void validate(const sx3_fbgains&, const sx3_geometry_scalefactors&);
+    void validate();
+};
+
+
+void sx3::fillevent(const std::string& positionstring, const int subchannel, const float value) {
+    assert(subchannel>=0 && subchannel<4);
+    if(positionstring=="FRONT_L") {
+        frontL[subchannel].push_back(value);
+        unmatched_front_chans.insert(subchannel);
+    } else if(positionstring=="FRONT_R") {
+        frontR[subchannel].push_back(value);
+        unmatched_front_chans.insert(subchannel);
+    } else if(positionstring=="BACK") {
+        back[subchannel].push_back(value);
+        valid_back_chans.insert(subchannel);
+    } else {
+        std::cout << "Unknown string "+positionstring+" encountered in sx3::fillevent \n" << std::endl;
+    }
+    if(frontL[subchannel].size()!=0 && frontR[subchannel].size()!=0 ) {
+        unmatched_front_chans.erase(subchannel);
+        valid_front_chans.insert(subchannel); //std::set, so no duplication will happen
+    }
+}
+
+
+//void sx3::validate(const sx3_fbgains& fbgains, const sx3_geometry_scalefactors& sx3gs) {
+void sx3::validate() {
+    if(valid_front_chans.size()!=0 && valid_back_chans.size()!=0) {
+        valid=true;
+        float maxFE=0;
+        float maxBE=0;
+        //float zpos=0;
+        int bchan=-1;
+        int fchan=-1;
+/*            	for(auto cc: valid_front_chans) {
+            		std::cout << "fc" << cc << std::endl;// " " << frontL[cc].at(0) << " " << frontR[cc].at(0) << std::endl;
+            	}
+            	for(auto cc: valid_back_chans) {
+            		std::cout << "bc" << cc << std::endl; //" " << back[cc].at(0) << std::endl;
+            	}
+*/
+        for(auto chan: valid_front_chans) {
+            if(frontL[chan].size()>1) {
+                printf("\nmultihit sx3 at Lsubchan:%d, ts:%1.13g\n",chan,ts);
+                for(const auto& e: frontL[chan]) printf("e: %f\t",e);
+                std::sort(frontL[chan].begin(), frontL[chan].end(), std::greater<float>());
+                flags += (-1000);
+            }
+            if(frontR[chan].size()>1) {
+                printf("\nmultihit sx3 at Rsubchan:%d, ts:%1.13g\n",chan,ts);
+                for(const auto& e: frontR[chan]) printf("e: %f\t",e);
+                std::sort(frontR[chan].begin(), frontR[chan].end(), std::greater<float>());
+                flags += (-2000);
+            }
+            //assign position using max L+R value
+            /*printf("chan:%d sizeL: %d sizeR: %d\n",chan, frontL[chan].size(), frontR[chan].size()); fflush(stdout);
+			printf("foo\n");
+			std::cout << "\nL:" << std::endl;
+			for(auto thing: frontL[chan]) std::cout << thing << " " << std::flush;
+			std::cout << "\nR:" << std::endl;
+			for(auto thing: frontR[chan]) std::cout << thing << " " << std::flush;*/
+            if(frontL[chan].at(0) + frontR[chan].at(0)> maxFE) {
+                maxFE = frontL[chan].at(0) + frontR[chan].at(0);
+                //zpos = (frontL[chan].at(0)-frontR[chan].at(0))/maxFE;
+                fchan = chan;
+            }
+        }
+        for(auto chan: valid_back_chans) {
+            if(back[chan].size()>1) {
+                printf("\nmultihit sx3 at Bsubchan:%d, ts:%1.13g\n",chan,ts);
+                for(const auto& e: back[chan]) printf("e: %f\t",e);
+                std::sort(back[chan].begin(), back[chan].end(), std::greater<float>());
+                flags += (-3000);
+            }
+            if(back[chan].size() ==0 ) {
+            	printf("foo\n");
+            	//continue;
+            }
+            if(back[chan].at(0) > maxBE) {
+                maxBE = back[chan].at(0);
+                bchan = chan;
+            }
+        }
+        /*
+        	Cross-talk corrections are important when evaluating 'energy' signals from strips/pads.
+        	They can cause unexpected behavior when used universally for all EL, ER cases, so we split scenarios in two.
+        		- Positions along each strip (frontX) *are not* corrected for crosstalk.
+        		- Total F and B energies (frontE, backE) *are*.
+        	Sudarsan B, 31 Oct 2024
+        */
+        float Eleft = frontL[fchan].at(0);
+        float Eright = frontR[fchan].at(0);
+        frontEL = Eleft;
+        frontER = Eright;
+        frontX = (Eleft-Eright)/(Eleft+Eright);
+        //frontXmm = (frontX+sx3gs.add[fchan])*sx3gs.stretch[fchan]; //convert to mm
+
+        //frontE = Eleft*fbgains.stripLgains[bchan][fchan] + fbgains.stripLoffsets[bchan][fchan]
+         //        + Eright*fbgains.stripRgains[bchan][fchan]  + fbgains.stripRoffsets[bchan][fchan];
+        //backE = back[bchan].at(0)*fbgains.padgains[bchan][fchan]+fbgains.padoffsets[bchan][fchan];
+        frontE = Eleft+Eright;
+        backE = maxBE;
+        stripF=fchan;
+        stripB=bchan;
+
+        flags = 0;
+    } else if(valid_front_chans.size()!=0 && valid_back_chans.size()==0) {
+        flags = -10;
+    } else if(valid_front_chans.size()==0 && valid_back_chans.size()!=0) {
+        flags = -20;
+    }
+}
+
+typedef sx3 sx3det;
+#endif

Armory/anasenMS_root.cpp

@@ -0,0 +1,309 @@
+// add includes at top
+#include <TApplication.h>
+#include <TSystem.h>
+#include <TFile.h>
+#include <TTree.h>
+#include <TEveManager.h>
+#include <TEvePointSet.h>
+#include <TEveGeoNode.h>
+#include <TGeoManager.h>
+#include <vector>
+#include <mutex>
+
+#include "TRandom.h"
+#include "TFile.h"
+#include "TTree.h"
+#include "TH1.h"
+#include "TH2.h"
+#include "TStyle.h"
+#include "TCanvas.h"
+#include "TBenchmark.h"
+
+#include "ClassTransfer.h"
+#include "ClassAnasen.h"
+
+// expose to ROOT
+int Run(int nEvents=1000, const char* outFile=nullptr){
+  // Ensure TEve exists (create after geometry has been built if possible)
+  if(!gEve) TEveManager::Create();
+
+  // if a geometry has already been loaded by ANASEN_model.C, make sure it
+  // shows up in the TEve scene.  TEveManager::Create() normally pulls in
+  // gGeoManager, but we do it explicitly to be safe.  We must wrap the
+  // top node/volume in a TEveGeoTopNode (not pass a raw TGeoVolume).
+  if(gGeoManager){
+    // create a TEve wrapper around the top node
+    TEveGeoTopNode *top = new TEveGeoTopNode(gGeoManager, gGeoManager->GetTopNode());
+    gEve->AddElement(top);
+  }
+
+  // Reaction
+  TransferReaction transfer;
+
+  transfer.SetA(24,12, 0);
+  transfer.SetIncidentEnergyAngle(10, 0, 0);
+  transfer.Seta( 4, 2);
+  transfer.Setb( 1, 1);
+
+  //TODO add alpha source
+
+  std::vector<float> ExAList = {0};
+  std::vector<float> ExList = {0, 1, 2};
+
+  double vertexXRange[2] = {   -5,    5}; // mm
+  double vertexYRange[2] = {   -5,    5}; 
+  double vertexZRange[2] = { -100,  100}; 
+
+  double sigmaSX3_W = -1; // mm, < 0 use mid-point
+  double sigmaSX3_L = 3; // mm, < 0 use mid-point
+  double sigmaPW_A  = 0; // from 0 to 1.
+  double sigmaPW_C  = 0; // from 0 to 1.
+
+  //###################################################
+
+  printf("------------ Vertex :\n");
+  printf("X : %7.2f - %7.2f mm\n", vertexXRange[0], vertexXRange[1]);
+  printf("Y : %7.2f - %7.2f mm\n", vertexYRange[0], vertexYRange[1]);
+  printf("Z : %7.2f - %7.2f mm\n", vertexZRange[0], vertexZRange[1]);
+  printf("------------ Uncertainty :\n");
+  printf(" SX3 horizontal : %.1f\n", sigmaSX3_W);
+  printf(" SX3   vertical : %.1f\n", sigmaSX3_L);
+  printf("          Anode : %.1f mm\n", sigmaPW_A);
+  printf("        Cathode : %.1f mm\n", sigmaPW_C);
+  printf("        num_eve : %d \n",nEvents);
+  transfer.CalReactionConstant();
+
+  int nExA = ExAList.size();
+  int nEx  = ExList.size();
+
+  ANASEN * anasen = new ANASEN();
+  SX3 * sx3 = anasen->GetSX3();    
+  PW * pw = anasen->GetPW(); 
+
+  TString saveFileName = "SimAnasen1.root";
+  printf("\e[32m#################################### building Tree in %s\e[0m\n", saveFileName.Data());
+  TFile * saveFile = new TFile(saveFileName, "recreate");
+  TTree * tree = new TTree("tree", "tree");
+
+  double KEA;
+  tree->Branch("beamKEA",     &KEA, "beamKEA/D");
+
+  double thetaCM, phiCM;
+  tree->Branch("thetaCM", &thetaCM, "thetaCM/D");
+  tree->Branch("phiCM",     &phiCM, "phiCM/D");
+
+  double thetab, phib, Tb;
+  double thetaB, phiB, TB;
+  tree->Branch("thetab", &thetab, "thetab/D");
+  tree->Branch("phib",     &phib, "phib/D");
+  tree->Branch("Tb",         &Tb, "Tb/D");
+  tree->Branch("thetaB", &thetaB, "thetaB/D");
+  tree->Branch("phiB",     &phiB, "phiB/D");
+  tree->Branch("TB",         &TB, "TB/D");
+
+  int ExAID;
+  double ExA;
+  tree->Branch("ExAID", &ExAID, "ExAID/I");
+  tree->Branch("ExA",     &ExA, "ExA/D");
+
+  int ExID;
+  double Ex;
+  tree->Branch("ExID", &ExID, "ExID/I");
+  tree->Branch("Ex",     &Ex, "Ex/D");
+
+  double vertexX, vertexY, vertexZ;
+  tree->Branch("vX",     &vertexX, "VertexX/D");
+  tree->Branch("vY",     &vertexY, "VertexY/D");
+  tree->Branch("vZ",     &vertexZ, "VertexZ/D");
+
+  double sx3X, sx3Y, sx3Z;
+  tree->Branch("sx3X",     &sx3X, "sx3X/D");
+  tree->Branch("sx3Y",     &sx3Y, "sx3Y/D");
+  tree->Branch("sx3Z",     &sx3Z, "sx3Z/D");
+
+  int anodeID[2], cathodeID[2];
+  tree->Branch("aID", anodeID, "anodeID/I");
+  tree->Branch("cID", cathodeID, "cathodeID/I");
+
+  double anodeDist[2], cathodeDist[2];
+  tree->Branch("aDist",   anodeDist, "anodeDist/D");
+  tree->Branch("cDist",  cathodeDist, "cathodeDist/D");
+
+  int sx3ID, sx3Up, sx3Dn, sx3Bk;
+  double sx3ZFrac;
+  tree->Branch("sx3ID",   &sx3ID, "sx3ID/I");
+  tree->Branch("sx3Up",   &sx3Up, "sx3Up/I");
+  tree->Branch("sx3Dn",   &sx3Dn, "sx3Dn/I");
+  tree->Branch("sx3Bk",   &sx3Bk, "sx3Bk/I");
+  tree->Branch("sx3ZFrac", &sx3ZFrac, "sx3ZFrac/D");
+
+  double reTheta, rePhi;
+  tree->Branch("reTheta", &reTheta, "reconstucted_theta/D");
+  tree->Branch("rePhi",     &rePhi, "reconstucted_phi/D");
+
+  double reTheta1, rePhi1;
+  tree->Branch("reTheta1", &reTheta1, "reconstucted_theta1/D");
+  tree->Branch("rePhi1",     &rePhi1, "reconstucted_phi1/D");
+
+  double z0;
+  tree->Branch("z0",     &z0, "reconstucted_Z/D");
+
+
+  //========timer
+  TBenchmark clock;
+  bool shown ;   
+  clock.Reset();
+  clock.Start("timer");
+  shown = false;
+
+  // Create a point set to show hits
+  TEvePointSet *pts = new TEvePointSet("hits");
+  pts->SetMarkerStyle(20);
+  pts->SetMarkerColor(kRed);
+  gEve->AddElement(pts);
+
+  // Optionally open output file/tree
+  TFile *fout = nullptr;
+  TTree *tout = nullptr;
+  std::vector<double> vx, vy, vz;
+  if(outFile){
+    fout = TFile::Open(outFile,"RECREATE");
+    tout = new TTree("evt","events");
+    tout->Branch("x",&vx);
+    tout->Branch("y",&vy);
+    tout->Branch("z",&vz);
+  }
+
+  // Simulation loop (replace with your sim code that fills vx,vy,vz per event)
+
+  for( int i = 0; i < nEvents ; i++){
+
+    ExAID = gRandom->Integer(nExA);
+    ExA = ExAList[ExAID];
+    transfer.SetExA(ExA);
+
+    ExID = gRandom->Integer(nEx);
+    Ex = ExList[ExID];
+    transfer.SetExB(Ex);
+
+    transfer.CalReactionConstant();
+
+    thetaCM = TMath::ACos(2 * gRandom->Rndm() - 1) ; 
+    phiCM   = (gRandom->Rndm() - 0.5) * TMath::TwoPi();
+
+    //==== Calculate reaction
+    TLorentzVector * output = transfer.Event(thetaCM, phiCM);
+    TLorentzVector Pb = output[2];
+    TLorentzVector PB = output[3];
+
+    thetab = Pb.Theta() * TMath::RadToDeg();
+    thetaB = PB.Theta() * TMath::RadToDeg();
+
+    Tb = Pb.E() - Pb.M();
+    TB = PB.E() - PB.M();
+
+    phib = Pb.Phi() * TMath::RadToDeg();
+    phiB = PB.Phi() * TMath::RadToDeg();
+
+    vertexX = (vertexXRange[1]- vertexXRange[0])*gRandom->Rndm() +  vertexXRange[0];
+    vertexY = (vertexYRange[1]- vertexYRange[0])*gRandom->Rndm() +  vertexYRange[0];
+    vertexZ = (vertexZRange[1]- vertexZRange[0])*gRandom->Rndm() +  vertexZRange[0];
+
+    TVector3 vertex(vertexX, vertexY, vertexZ);
+
+    TVector3 dir(1, 0, 0);
+    dir.SetTheta(thetab * TMath::DegToRad());
+    dir.SetPhi(phib * TMath::DegToRad());
+
+   
+    pw->FindWireID(vertex, dir, false);
+    sx3->FindSX3Pos(vertex, dir, false);   
+
+    PWHitInfo hitInfo = pw->GetHitInfo();
+
+    anodeID[0]   = hitInfo.nearestWire.first;
+    cathodeID[0] = hitInfo.nearestWire.second;
+    anodeID[1]   = hitInfo.nextNearestWire.first;
+    cathodeID[1] = hitInfo.nextNearestWire.second;
+
+    anodeDist[0]   = hitInfo.nearestDist.first;
+    cathodeDist[0] = hitInfo.nearestDist.second;
+    anodeDist[1]   = hitInfo.nextNearestDist.first;
+    cathodeDist[1] = hitInfo.nextNearestDist.second;
+
+    sx3ID = sx3->GetID();
+    if( sx3ID >= 0 ){
+      sx3Up    = sx3->GetChUp();
+      sx3Dn    = sx3->GetChDn();
+      sx3Bk    = sx3->GetChBk();
+      sx3ZFrac = sx3->GetZFrac();
+
+      //Introduce uncertaity
+      // TVector3 hitPos = sx3->GetHitPos();
+      TVector3 hitPos = sx3->GetHitPosWithSigma(sigmaSX3_W, sigmaSX3_L);
+
+      sx3X = hitPos.X();
+      sx3Y = hitPos.Y();
+      sx3Z = hitPos.Z();
+      
+      pw->CalTrack(hitPos, anodeID[0], cathodeID[0], false);
+      reTheta = pw->GetTrackTheta() * TMath::RadToDeg();
+      rePhi = pw->GetTrackPhi() * TMath::RadToDeg();
+
+      pw->CalTrack2(hitPos, hitInfo, sigmaPW_A, sigmaPW_C, false);
+      reTheta1 = pw->GetTrackTheta() * TMath::RadToDeg();
+      rePhi1 = pw->GetTrackPhi() * TMath::RadToDeg();
+
+      z0 = pw->GetZ0();
+
+    }else{
+      sx3Up = -1;
+      sx3Dn = -1;
+      sx3Bk = -1;
+      sx3ZFrac = TMath::QuietNaN();
+      
+      sx3X = TMath::QuietNaN();
+      sx3Y = TMath::QuietNaN();
+      sx3Z = TMath::QuietNaN();
+
+      // for( int i = 0; i < 12; i++){
+      //   sx3Index[i] = -1;
+      // }
+  
+      reTheta = TMath::QuietNaN();
+      rePhi = TMath::QuietNaN();  
+
+      reTheta1 = TMath::QuietNaN();
+      rePhi1 = TMath::QuietNaN();
+
+      z0 = TMath::QuietNaN();
+
+    }
+    // -----------------------------------------------------------------------
+
+
+  }
+
+  // update TEve
+  pts->Reset();
+  for(size_t i=0;i<vx.size(); ++i) pts->SetNextPoint(vx[i], vy[i], vz[i]);
+  gEve->Redraw3D();
+  gSystem->ProcessEvents();
+
+  // write to tree
+  if(tout){ tout->Fill(); fout->Flush(); }
+
+  if(fout) fout->Close();
+  return 0;
+}
+
+// optional main to keep standalone build working
+#ifndef __CLING__
+int main(int argc, char** argv){
+  TApplication app("app",&argc,argv);
+  // if you want to import geometry here when running standalone:
+  // TGeoManager::Import("yourGeom.root");
+  Run(500, "sim_out.root");
+  return 0;
+}
+#endif

Armory/fsuReader.h

@@ -0,0 +1,795 @@
+#include "ClassData.h"
+#include "Hit.h"
+#include <algorithm>
+#include <filesystem>
+
+// #include "AggSeparator.h"
+
+class FSUReader{
+
+  public:
+    FSUReader();
+    FSUReader(std::string fileName, uInt dataSize = 100, int verbose = 1);
+    FSUReader(std::vector<std::string> fileList, uInt dataSize = 100, int verbose = 1);
+    ~FSUReader();
+
+    void OpenFile(std::string fileName, uInt dataSize, int verbose = 1);
+    bool IsOpen() const{return inFile == nullptr ? false : true;}
+    bool IsEndOfFile() const { 
+      // printf("%s : %d | %ld |%ld\n", __func__, feof(inFile), ftell(inFile), inFileSize);
+      if(fileList.empty() ) {
+        if( (uLong )ftell(inFile) >= inFileSize){
+          return true;
+        }else{
+          return false;
+        }
+      }else{
+        if( fileID + 1 == (int) fileList.size() && ((uLong)ftell(inFile) >= inFileSize) ) {
+          return true;
+        }else{
+          return false;
+        }
+      }
+    }
+
+    void ScanNumBlock(int verbose = 1, uShort saveData = 0); // saveData = 0 (no save), 1 (no trace), 2 (with trace);
+    int  ReadNextBlock(bool traceON = false, int verbose = 0, uShort saveData = 0); // saveData = 0 (no save), 1 (no trace), 2 (with trace);
+    int  ReadBlock(unsigned int ID, int verbose = 0);
+
+    unsigned int GetFilePos() const {return filePos;}
+    unsigned long GetTotNumBlock() const{ return totNumBlock;}
+    std::vector<unsigned int> GetBlockTimestamp() const {return blockTimeStamp;}
+
+    Data * GetData() const{return data;}
+
+    std::string GetFileName() const{return fileName;}
+    int GetDPPType()   const{return DPPType;}
+    int GetSN()        const{return sn;}
+    int GetTick2ns()   const{return tick2ns;}
+    int GetNumCh()     const{return numCh;}
+    int GetFileOrder() const{return order;}  
+    int GetChMask()    const{return chMask;}
+    unsigned long GetFileByteSize() const {return inFileSize;}
+
+    void ClearHitList() { hit.clear();}
+    ulong GetHitListLength() const {return hit.size();}
+    std::vector<Hit> GetHitVector() const {return hit;}
+    void SortHit(int verbose = false);
+    Hit GetHit(int id) const {
+      if( id < 0 ) id = hit.size() + id;
+      return hit[id];
+    }
+
+    void ClearHitCount() {hitCount = 0;}
+    ulong GetHitCount() const{return hitCount;}
+
+    std::vector<Hit> ReadBatch(unsigned int batchSize = 1000000, bool verbose = false); // output the sorted Hit
+
+    // std::string SaveHit(std::vector<Hit> hitList, bool isAppend = false);
+    // std::string SaveHit2NewFile(std::string saveFolder = "./", std::string indexStr = "");
+    // void SortAndSaveTS(unsigned int batchSize = 1000000, bool verbose = false);
+    // off_t GetTSFileSize() const {return tsFileSize;}
+
+    //TODO 
+    //void SplitFile(unsigned long hitSizePreFile);
+
+    void PrintHit(ulong numHit = -1, ulong startIndex = 0) {
+      for( ulong i = startIndex; i < std::min(numHit, hitCount); i++){
+        printf("%10zu ", i); hit[i].Print();
+      }
+    }
+
+    static void PrintHitListInfo(std::vector<Hit> * hitList, std::string name){
+      size_t n = hitList->size();
+      size_t s = sizeof(Hit);
+      printf("============== %s, size : %zu | %.2f MByte\n", name.c_str(), n, n*s/1024./1024.);
+      if( n > 0 ){
+        printf("t0 : %15llu ns\n", hitList->front().timestamp);
+        printf("t1 : %15llu ns\n", hitList->back().timestamp);
+        printf("dt : %15.3f ms\n", (hitList->back().timestamp - hitList->front().timestamp)/1e6);
+      }
+    }
+
+    void PrintHitListInfo(){
+      size_t n = hit.size();
+      size_t s = sizeof(Hit);
+      printf("============== reader.hit, size : %zu | %.2f MByte\n", n, n*s/1024./1024.);
+      if( n > 0 ){
+        printf("t0 : %15llu ns\n", hit.at(0).timestamp);
+        printf("t1 : %15llu ns\n", hit.back().timestamp);
+        printf("dt : %15.3f ms\n", (hit.back().timestamp - hit.front().timestamp)/1e6);
+      }
+    }
+
+
+    //void SaveAsCAENCoMPASSFormat();
+
+  private:
+
+    FILE * inFile;
+    Data * data;
+
+    std::string fileName;
+    std::vector<std::string> fileList;
+    short fileID;
+    unsigned long inFileSize;
+    unsigned int  filePos;
+    unsigned long totNumBlock;
+    unsigned int  blockID;
+
+    bool isDualBlock;
+
+    uShort sn;
+    uShort DPPType;
+    uShort tick2ns;
+    uShort order;
+    uShort chMask;
+    uShort numCh;
+
+    std::vector<unsigned int> blockPos;
+    std::vector<unsigned int > blockTimeStamp;
+
+    unsigned long hitCount;
+
+    std::vector<Hit> hit;
+
+    unsigned int word[1]; /// 4 byte
+    size_t dummy;
+    char * buffer;
+
+    off_t  tsFileSize;
+
+};
+
+inline FSUReader::~FSUReader(){
+  delete data;
+
+  if( inFile  ) fclose(inFile);
+
+}
+
+inline FSUReader::FSUReader(){
+  inFile = nullptr;
+  data = nullptr;
+
+  blockPos.clear();
+  blockTimeStamp.clear();
+  hit.clear();
+
+  fileList.clear();
+  fileID = -1;
+
+}
+
+inline FSUReader::FSUReader(std::string fileName, uInt dataSize, int verbose){
+  inFile = nullptr;
+  data = nullptr;
+
+  blockPos.clear();
+  blockTimeStamp.clear();
+  hit.clear();
+
+  fileList.clear();
+  fileID = -1;
+  OpenFile(fileName, dataSize, verbose);
+}
+
+inline FSUReader::FSUReader(std::vector<std::string> fileList, uInt dataSize, int verbose){
+  inFile = nullptr;
+  data = nullptr;
+
+  blockPos.clear();
+  blockTimeStamp.clear();
+  hit.clear();
+  //The files are the same DPPType and sn
+  this->fileList = fileList;
+  fileID = 0;
+  OpenFile(fileList[fileID], dataSize, verbose);
+
+}
+
+inline void FSUReader::OpenFile(std::string fileName, uInt dataSize, int verbose){
+
+  /// File format must be YYY...Y_runXXX_AAA_BBB_TT_CCC.fsu
+  /// YYY...Y  = prefix
+  /// XXX = runID, 3 digits
+  /// AAA = board Serial Number, 3 digits
+  /// BBB = DPPtype, 3 digits
+  ///  TT = tick2ns, any digits
+  /// CCC = over size index, 3 digits
+
+  if( inFile != nullptr ) fclose(inFile);
+
+  inFile = fopen(fileName.c_str(), "r");
+
+  if( inFile == NULL ){
+    printf("FSUReader::Cannot open file : %s \n", fileName.c_str());
+    this->fileName = "";
+    return;
+  }
+
+  this->fileName = fileName;
+
+  fseek(inFile, 0L, SEEK_END);
+  inFileSize = ftell(inFile);
+  if(verbose) printf("%s | file size : %ld Byte = %.2f MB\n", fileName.c_str() , inFileSize, inFileSize/1024./1024.);
+  fseek(inFile, 0L, SEEK_SET);
+  filePos = 0;
+
+  if( fileID > 0 ) return;
+
+  totNumBlock = 0;
+  blockID = 0;
+  blockPos.clear();
+  blockTimeStamp.clear();
+
+  hitCount = 0;
+  hit.clear();
+
+  //check is the file is *.fsu or *.fsu.X
+  size_t found = fileName.find_last_of('.');
+  std::string ext = fileName.substr(found + 1);
+
+  if( ext.find("fsu") != std::string::npos ) {
+    if(verbose > 1) printf("It is an raw data *.fsu format\n");
+    isDualBlock = false;
+    chMask = -1;
+  }else{
+    chMask = atoi(ext.c_str());
+    isDualBlock = true;
+    if(verbose > 1) printf("It is a splitted dual block data *.fsu.X format, dual channel mask : %d \n", chMask);
+  }
+
+  std::string fileNameNoExt;
+  found = fileName.find_last_of(".fsu");
+  size_t found2 = fileName.find_last_of('/');
+  if( found2 == std::string::npos ){
+    fileNameNoExt = fileName.substr(0, found-4);
+  }else{
+    fileNameNoExt = fileName.substr(found2+1, found-4);
+  }
+
+  // Split the string by underscores
+  std::istringstream iss(fileNameNoExt);
+  std::vector<std::string> tokens;
+  std::string token;
+
+  while (std::getline(iss, token, '_')) { tokens.push_back(token); }
+  sn = atoi(tokens[2].c_str());
+  tick2ns = atoi(tokens[4].c_str());
+  order = atoi(tokens[5].c_str());
+
+  DPPType = 0;
+  if( fileName.find("PHA") != std::string::npos ) DPPType = DPPTypeCode::DPP_PHA_CODE;
+  if( fileName.find("PSD") != std::string::npos ) DPPType = DPPTypeCode::DPP_PSD_CODE;
+  if( fileName.find("QDC") != std::string::npos ) DPPType = DPPTypeCode::DPP_QDC_CODE;
+  if( DPPType == 0 ){
+    fclose(inFile);
+    inFile = nullptr;
+    printf("Cannot find DPPType in the filename. Abort.");
+    return ;
+  }
+
+  numCh = (DPPType == DPPTypeCode::DPP_QDC_CODE ? 64 : 16);
+
+  data = new Data(numCh, dataSize);
+  data->tick2ns = tick2ns;
+  data->boardSN = sn;
+  data->DPPType = DPPType;
+
+}
+
+inline int FSUReader::ReadNextBlock(bool traceON, int verbose, uShort saveData){
+  if( inFile == NULL ) return -1;
+  if( feof(inFile) || filePos >= inFileSize) {
+    if( fileID >= 0 && fileID + 1  < (short) fileList.size() ){
+      printf("-------------- next file\n");
+      fileID ++;
+      OpenFile(fileList[fileID], data->GetDataSize(), 1 );
+    }else{
+      return -1;
+    }
+  }
+  
+  dummy = fread(word, 4, 1, inFile);
+  fseek(inFile, -4, SEEK_CUR);
+
+  if( dummy != 1) {
+    printf("fread error, should read 4 bytes, but read %ld x 4 byte, file pos: %ld / %ld byte\n", 
+            dummy, ftell(inFile), inFileSize);
+    return -10;
+  }
+  short header = ((word[0] >> 28 ) & 0xF);
+
+  Hit temp;
+
+  if( header == 0xA ) { ///normal header
+ 
+    unsigned int aggSize = (word[0] & 0x0FFFFFFF) * 4; ///byte
+    if( aggSize > inFileSize - ftell(inFile)) aggSize = inFileSize - ftell(inFile);
+    buffer = new char[aggSize];
+    dummy = fread(buffer, aggSize, 1, inFile);
+    filePos = ftell(inFile);
+    if( dummy != 1) {
+      printf("fread error, should read %d bytes, but read %ld x %d byte, file pos: %ld / %ld byte \n", 
+             aggSize, dummy, aggSize, ftell(inFile), inFileSize);
+      return -30;
+    }
+
+    data->DecodeBuffer(buffer, aggSize, !traceON, verbose); // data will own the buffer
+    //printf(" word Index = %u | filePos : %u | ", data->GetWordIndex(), filePos);
+
+  }else if( (header & 0xF ) == 0x8 ) { /// dual channel header
+
+    unsigned int dualSize = (word[0] & 0x7FFFFFFF) * 4; ///byte    
+    buffer = new char[dualSize];
+    dummy = fread(buffer, dualSize, 1, inFile);
+    filePos = ftell(inFile);
+
+    data->buffer = buffer;
+    data->DecodeDualBlock(buffer, dualSize, DPPType, chMask, !traceON, verbose);
+
+  }else{
+    printf("incorrect header.\n trminate.");
+    return -20;
+  }
+
+  unsigned int eventCout  = 0;
+
+  for( int ch = 0; ch < data->GetNChannel(); ch++){
+    if( data->NumEventsDecoded[ch] == 0 ) continue;
+
+    hitCount += data->NumEventsDecoded[ch];
+    eventCout += data->NumEventsDecoded[ch];
+
+    if( saveData ){
+      int start = data->GetDataIndex(ch) - data->NumEventsDecoded[ch] + 1;
+      if( start < 0 ) start = start + data->GetDataSize();
+
+      for( int i = start; i < start + data->NumEventsDecoded[ch]; i++ ){
+        int k  = i % data->GetDataSize();
+        
+        temp.sn = sn;
+        temp.ch = ch;
+        temp.energy    = data->GetEnergy(ch, k);
+        temp.energy2   = data->GetEnergy2(ch, k);
+        temp.timestamp = data->GetTimestamp(ch, k);
+        temp.fineTime  = data->GetFineTime(ch, k);
+        temp.pileUp    = data->GetPileUp(ch, k);
+        if( saveData > 1 ) {
+          temp.traceLength = data->Waveform1[ch][k].size();
+          temp.trace = data->Waveform1[ch][k];
+        }else{
+          temp.traceLength = 0;
+          if( temp.trace.size() > 0 ) temp.trace.clear();
+        }
+
+        hit.push_back(temp);
+      }
+    }
+  }
+
+  data->ClearTriggerRate();
+  data->ClearNumEventsDecoded();
+  data->ClearBuffer(); // this will clear the buffer.
+  return 0;
+}
+
+inline int FSUReader::ReadBlock(unsigned int ID, int verbose){
+  if( totNumBlock == 0 )return -1;
+  if( ID >= totNumBlock )return -1;
+
+  data->ClearData();
+
+  fseek( inFile, 0L, SEEK_SET);
+
+  if( verbose ) printf("Block index: %u, File Pos: %u byte\n", ID, blockPos[ID]);
+
+  fseek(inFile, blockPos[ID], SEEK_CUR);
+  filePos = blockPos[ID];
+  blockID = ID;
+  return ReadNextBlock(false, verbose, false);
+
+}
+
+inline void FSUReader::SortHit(int verbose){
+  if( verbose) printf("\nQuick Sort hit array according to time...");
+  std::sort(hit.begin(), hit.end(), [](const Hit& a, const Hit& b) {
+    return a.timestamp < b.timestamp;
+  });
+  if( verbose) printf(".......done.\n");
+}
+
+inline void FSUReader::ScanNumBlock(int verbose, uShort saveData){
+  if( inFile == nullptr ) return;
+  if( feof(inFile) ) return;
+
+  blockID = 0;
+  blockPos.push_back(0);
+
+  data->ClearData();
+  rewind(inFile);
+  filePos = 0;
+
+  bool isTraceOn = saveData < 2 ? false : true;
+
+  while( ReadNextBlock(isTraceOn, verbose - 1, saveData) == 0 ){
+    blockPos.push_back(filePos);
+    blockTimeStamp.push_back(data->aggTime);
+    blockID ++;
+    if(verbose && blockID % 10000 == 0) printf("%u, %.2f%% %u/%lu\n\033[A\r", blockID, filePos*100./inFileSize, filePos, inFileSize);
+  }
+
+  totNumBlock = blockID;
+  if(verbose) {
+    printf("\nScan complete: number of data Block : %lu\n", totNumBlock);
+    printf(  "                      number of hit : %lu", hitCount);
+    if( hitCount > 1e6 ) printf(" = %.3f million", hitCount/1e6); 
+    printf("\n");
+    if( saveData )printf(  "              size of the hit array : %lu\n", hit.size());
+
+    if( saveData ){
+      size_t sizeT = sizeof(hit[0]) * hit.size();
+      printf("size of hit array : %lu byte = %.2f kByte, = %.2f MByte\n", sizeT, sizeT/1024., sizeT/1024./1024.);
+    }
+  } 
+
+  if( fileList.size() > 0  ){
+    fileID = 0;
+    OpenFile(fileList[fileID], data->GetDataSize(), 0);
+  }
+
+  rewind(inFile);
+  blockID = 0;  
+  filePos = 0;
+
+  //check is the hitCount == hit.size();
+  if( saveData ){
+    if( hitCount != hit.size()){
+      printf("!!!!!! the Data::dataSize is not big enough. !!!!!!!!!!!!!!!\n");
+    }else{
+      SortHit(verbose+1);
+    }
+  }
+}
+
+inline std::vector<Hit> FSUReader::ReadBatch(unsigned int batchSize, bool verbose){
+
+  // printf("%s sn:%d. filePos : %lu\n", __func__, sn, ftell(inFile));
+
+  std::vector<Hit> hitList_A;
+  if( IsEndOfFile() ) {
+    hitList_A = hit;
+    hit.clear();  
+    return hitList_A;
+  }
+
+  if( hit.size() == 0 ){
+    int res = 0;
+    do{
+      res = ReadNextBlock(true, 0, 3);
+    }while ( hit.size() < batchSize && res == 0);
+    SortHit();
+    uLong t0_B = hit.at(0).timestamp;
+    uLong t1_B = hit.back().timestamp;
+    if( verbose ) {
+      printf(" hit in memeory : %7zu | %u | %lu \n", hit.size(), filePos, inFileSize);
+      printf("t0 : %15lu ns\n", t0_B);
+      printf("t1 : %15lu ns\n", t1_B);
+      printf("dt : %15.3f ms\n", (t1_B - t0_B)/1e6);
+    }
+
+    hitList_A = hit;
+    hit.clear();
+
+  }else{
+
+    hitList_A = hit;
+    hit.clear();
+
+  }
+
+  if( IsEndOfFile() ) return hitList_A; // when file finished for 1st batch read
+
+  int res = 0;
+  do{
+    res = ReadNextBlock(true, 0, 3);
+  }while ( hit.size() < batchSize && res == 0);
+  SortHit();
+  uLong t0_B = hit.at(0).timestamp;
+  uLong t1_B = hit.back().timestamp;
+
+  if( verbose ) {
+    printf(" hit in memeory : %7zu | %u | %lu \n", hit.size(), filePos, inFileSize);
+    printf("t0 : %15lu\n", t0_B);
+    printf("t1 : %15lu\n", t1_B);
+    printf("dt : %15.3f ms\n", (t1_B - t0_B)/1e6);
+  }
+
+  uLong t0_A = hitList_A.at(0).timestamp;
+  uLong t1_A = hitList_A.back().timestamp;
+  ulong ID_A = 0;
+  ulong ID_B = 0;
+
+  if( t0_A >= t0_B) {
+    printf("\033[0;31m!!!!!!!!!!!!!!!!! %s | Need to increase the batch size. \033[0m\n", __func__);
+    return std::vector<Hit> ();
+  }
+
+  if( t1_A > t0_B) { // need to sort between two hitList
+
+    if( verbose ) {
+      printf("############# need to sort \n");
+      printf("=========== sume of A + B : %zu \n", hitList_A.size() + hit.size());
+    }
+
+    std::vector<Hit> hitTemp;
+
+    // find the hit that is >= t0_B, save them to hitTemp
+    for( size_t j = 0; j < hitList_A.size() ; j++){
+      if( hitList_A[j].timestamp < t0_B ) continue;;
+      if( ID_A == 0 ) ID_A = j;
+      hitTemp.push_back(hitList_A[j]);
+    }
+
+    // remove hitList_A element that is >= t0_B
+    hitList_A.erase(hitList_A.begin() + ID_A, hitList_A.end() );
+    
+    // find the hit that is <= t1_A, save them to hitTemp
+    for( size_t j = 0; j < hit.size(); j++){
+      if( hit[j].timestamp > t1_A ) {
+        break;
+      }
+      hitTemp.push_back(hit[j]);
+      ID_B = j + 1;
+    }
+
+    // remove hit elements that is <= t1_A
+    hit.erase(hit.begin(), hit.begin() + ID_B  );
+
+    // sort hitTemp
+    std::sort(hitTemp.begin(), hitTemp.end(), [](const Hit& a, const Hit& b) {
+      return a.timestamp < b.timestamp;
+    });
+
+
+    if( verbose ) {
+      printf("----------------- ID_A : %lu, Drop\n", ID_A);
+      printf("----------------- ID_B : %lu, Drop\n", ID_B);
+      PrintHitListInfo(&hitList_A, "hitList_A");
+      PrintHitListInfo(&hitTemp, "hitTemp");
+      PrintHitListInfo();
+      printf("=========== sume of A + B + Temp : %zu \n", hitList_A.size() + hit.size()  + hitTemp.size());
+      printf("----------------- refill hitList_A \n");
+    }
+
+    for( size_t j = 0; j < hitTemp.size(); j++){
+      hitList_A.push_back(hitTemp[j]);
+    }
+    hitTemp.clear();
+    
+    if( verbose ) {
+      PrintHitListInfo(&hitList_A, "hitList_A");
+      PrintHitListInfo();
+      printf("=========== sume of A + B : %zu \n", hitList_A.size() + hit.size());
+    }
+   
+  }
+
+  return hitList_A;
+
+}
+
+/*
+inline void FSUReader::SortAndSaveTS(unsigned int batchSize, bool verbose){
+
+  int count = 0;
+  std::vector<Hit> hitList_A ;
+
+  do{
+
+    if( verbose ) printf("***************************************************\n");
+
+    int res = 0;
+    do{
+      res = ReadNextBlock(true, 0, 3);
+    }while ( hit.size() < batchSize && res == 0);
+
+    SortHit();
+    uLong t0_B = hit.at(0).timestamp;
+    uLong t1_B = hit.back().timestamp;
+
+    if( verbose ) {
+      printf(" hit in memeory : %7zu | %u | %lu \n", hit.size(), filePos, inFileSize);
+      printf("t0 : %15lu\n", t0_B);
+      printf("t1 : %15lu\n", t1_B);
+    }
+
+    if( count == 0 ) {
+      hitList_A = hit; // copy hit
+    }else{
+
+      uLong t0_A = hitList_A.at(0).timestamp;
+      uLong t1_A = hitList_A.back().timestamp;
+      ulong ID_A = 0;
+      ulong ID_B = 0;
+
+      if( t0_A > t0_B) {
+        printf("Need to increase the batch size. \n");
+        return;
+      }
+
+      if( t1_A > t0_B) { // need to sort between two hitList
+
+        if( verbose ) {
+          printf("############# need to sort \n");
+          printf("=========== sume of A + B : %zu \n", hitList_A.size() + hit.size());
+        }
+
+        std::vector<Hit> hitTemp;
+
+        for( size_t j = 0; j < hitList_A.size() ; j++){
+          if( hitList_A[j].timestamp < t0_B ) continue;
+          if( ID_A == 0 ) ID_A = j;
+          hitTemp.push_back(hitList_A[j]);
+        }
+
+        hitList_A.erase(hitList_A.begin() + ID_A, hitList_A.end() );
+        if( verbose ) {
+          printf("----------------- ID_A : %lu, Drop\n", ID_A);
+          PrintHitListInfo(hitList_A, "hitList_A");
+        }
+  
+      
+        for( size_t j = 0; j < hit.size(); j++){
+          if( hit[j].timestamp > t1_A ) {
+            ID_B = j;
+            break;
+          }
+          hitTemp.push_back(hit[j]);
+        }
+
+        std::sort(hitTemp.begin(), hitTemp.end(), [](const Hit& a, const Hit& b) {
+          return a.timestamp < b.timestamp;
+        });
+
+        hit.erase(hit.begin(), hit.begin() + ID_B  );
+
+        if( verbose ) {
+          PrintHitListInfo(hitTemp, "hitTemp");
+          printf("----------------- ID_B : %lu, Drop\n", ID_B);
+          PrintHitListInfo(hit, "hit");
+          printf("=========== sume of A + B + Temp : %zu \n", hitList_A.size() + hit.size()  + hitTemp.size());
+          printf("----------------- refill hitList_A \n");
+        }
+        ulong ID_Temp = 0;
+        for( size_t j = 0; j < hitTemp.size(); j++){
+          hitList_A.push_back(hitTemp[j]);
+          if( hitList_A.size() >= batchSize ) {
+            ID_Temp = j+1;
+            break;
+          }
+        }
+
+        hitTemp.erase(hitTemp.begin(), hitTemp.begin() + ID_Temp );
+        for( size_t j = 0 ; j < hit.size(); j ++){
+          hitTemp.push_back(hit[j]);
+        }
+        SaveHit(hitList_A, count <= 1 ? false : true);
+
+        if( verbose ) {
+          PrintHitListInfo(hitList_A, "hitList_A");
+          PrintHitListInfo(hitTemp, "hitTemp");
+          printf("----------------- replace hitList_A by hitTemp \n");
+        }
+
+        hitList_A.clear();
+        hitList_A = hitTemp;
+        hit.clear();
+
+        if( verbose ) {
+          PrintHitListInfo(hitList_A, "hitList_A");
+          printf("===========================================\n");
+        }
+
+      }else{ // save hitList_A, replace hitList_A 
+        
+        SaveHit(hitList_A, count <= 1? false : true);
+        hitList_A.clear();
+        hitList_A = hit;
+        if( verbose ) PrintHitListInfo(hitList_A, "hitList_A");
+
+      }
+    }
+
+    ClearHitList();
+    count ++;
+  }while(filePos < inFileSize);  
+
+  SaveHit(hitList_A, count <= 1 ? false : true);
+
+  printf("================= finished.\n");
+}
+*/
+
+/*
+inline std::string FSUReader::SaveHit(std::vector<Hit> hitList, bool isAppend){
+
+  std::string outFileName;
+  if( fileList.empty() ) {
+    outFileName =  fileName + ".ts" ;
+  }else{
+    outFileName =  fileList[0] + ".ts" ;
+  }
+  uint64_t hitSize = hitList.size();
+
+  FILE * outFile ;
+  if( isAppend ) {
+    outFile = fopen(outFileName.c_str(), "rb+"); //read/write bineary
+
+    rewind(outFile);
+    fseek( outFile, 4, SEEK_CUR);
+    uint64_t org_hitSize;
+    fread(&org_hitSize, 8, 1, outFile);
+
+    rewind(outFile);
+    fseek( outFile, 4, SEEK_CUR);
+
+    org_hitSize += hitSize;
+
+    fwrite(&org_hitSize, 8, 1, outFile);
+    fseek(outFile, 0, SEEK_END);
+
+  }else{
+    outFile = fopen(outFileName.c_str(), "wb"); //overwrite binary
+    uint32_t header = 0xAA000000;
+    header += sn;
+    fwrite( &header, 4, 1, outFile );
+    fwrite( &hitSize, 8, 1, outFile);
+  }
+
+
+  for( ulong i = 0; i < hitSize; i++){
+
+    if( i% 10000 == 0 ) printf("Saving %lu/%lu Hit (%.2f%%)\n\033[A\r", i, hitSize, i*100./hitSize);
+
+    uint16_t flag = hitList[i].ch + (hitList[i].pileUp << 8) ;
+
+    if( DPPType == DPPTypeCode::DPP_PSD_CODE ) flag += ( 1 << 15);
+    if( hitList[i].traceLength > 0 ) flag += (1 << 14);
+
+    // fwrite( &(hit[i].ch), 1, 1, outFile);
+    fwrite( &flag, 2, 1, outFile);
+    fwrite( &(hitList[i].energy), 2, 1, outFile);
+    if( DPPType == DPPTypeCode::DPP_PSD_CODE ) fwrite( &(hitList[i].energy2), 2, 1, outFile);
+    fwrite( &(hitList[i].timestamp), 6, 1, outFile);
+    fwrite( &(hitList[i].fineTime), 2, 1, outFile);
+    if( hitList[i].traceLength > 0 ) fwrite( &(hitList[i].traceLength), 2, 1, outFile);
+    
+    for( uShort j = 0; j < hitList[i].traceLength; j++){
+      fwrite( &(hitList[i].trace[j]), 2, 1, outFile);
+    }
+    
+  }
+
+  off_t tsFileSize = ftello(outFile);  // unsigned int =  Max ~4GB
+  fclose(outFile);
+
+  printf("Saved to %s, size: ", outFileName.c_str());
+  if( tsFileSize < 1024 ) {
+    printf(" %ld Byte", tsFileSize);
+  }else if( tsFileSize < 1024*1024 ) {
+    printf(" %.2f kB", tsFileSize/1024.);
+  }else if( tsFileSize < 1024*1024*1024){
+    printf(" %.2f MB", tsFileSize/1024./1024.);
+  }else{
+    printf(" %.2f GB", tsFileSize/1024./1024./1024.);
+  }
+  printf("\n");
+
+  return outFileName;
+
+}
+*/
+
+

Armory/macro.h

@@ -0,0 +1,56 @@
+#ifndef MACRO_H
+#define MACRO_H
+
+#define MaxNPorts 4   //for optical link
+#define MaxNBoards 4  //for both optical link and usb
+
+#define MaxNDigitizer MaxNPorts * MaxNBoards
+
+#define MaxRegChannel 16 
+#define MaxNChannels 64
+#define MaxRecordLength 0x3fff * 8 
+#define MaxSaveFileSize  1024 * 1024 * 1024 * 2
+
+#define MaxDisplayTraceTimeLength 20000 //ns
+#define ScopeUpdateMiliSec  200 // msec
+#define MaxNumberOfTrace  5   // in an event
+
+#define SETTINGSIZE 2048
+
+#define DAQLockFile "DAQLock.dat"
+#define PIDFile  "pid.dat"
+
+#include <sys/time.h> /** struct timeval, select() */
+
+inline unsigned int getTime_us(){
+  unsigned int time_us;
+  struct timeval t1;
+  struct timezone tz;
+  gettimeofday(&t1, &tz);
+  time_us = (t1.tv_sec) * 1000 * 1000 + t1.tv_usec;
+  return time_us;
+}
+
+#include <chrono>
+inline unsigned long long getTime_ns(){
+  std::chrono::high_resolution_clock::time_point currentTime = std::chrono::high_resolution_clock::now();
+  std::chrono::nanoseconds nanoseconds = std::chrono::duration_cast<std::chrono::nanoseconds>(currentTime.time_since_epoch());
+  return nanoseconds.count();
+}
+
+typedef unsigned short uShort;
+typedef unsigned int uInt;
+typedef unsigned long  uLong;
+typedef unsigned long long ullong;
+
+#define DebugMode 0 //process check, when 1, print out all function call
+
+// if DebugMode is 1, define DebugPrint() to be printf(), else, DebugPrint() define nothing
+#if DebugMode
+#define DebugPrint(fmt, ...) printf(fmt "::%s\n",##__VA_ARGS__, __func__);
+#else
+#define DebugPrint(fmt, ...)
+#endif
+
+
+#endif

Armory/run_script.C

@@ -0,0 +1,4 @@
+.L ANASEN_model.C
+.L anasenMS_root.cpp+
+ANASEN_model();
+Run(10);

Armory/test_run.C

@@ -0,0 +1,7 @@
+.L ANASEN_model.C
+.L anasenMS_root.cpp+
+
+void test_run(){
+    ANASEN_model();
+    Run(10);
+}

Armory/vis_helpers.h

@@ -0,0 +1,34 @@
+// vis_helpers.h  (or paste into anasenMS.cpp)
+#include <TEvePointSet.h>
+#include <TFile.h>
+#include <TTree.h>
+#include <vector>
+#include <mutex>
+
+static TEvePointSet* gVisPts = nullptr;
+static std::mutex gVisMutex;
+
+// Call from your ROOT session after creating TEve objects:
+void SetVisPointSet(TEvePointSet* pts){ gVisPts = pts; }
+
+// Call this from your sim loop to update visualization and optionally write data:
+void PushEventAndRecord(const std::vector<double>& x,
+                        const std::vector<double>& y,
+                        const std::vector<double>& z,
+                        TTree* outTree = nullptr)
+{
+  if(outTree){
+    outTree->SetBranchAddress("x",(void*)&x);
+    outTree->SetBranchAddress("y",(void*)&y);
+    outTree->SetBranchAddress("z",(void*)&z);
+    outTree->Fill();
+    outTree->GetCurrentFile()->Flush();
+  }
+
+  if(!gVisPts) return;
+  std::lock_guard<std::mutex> lk(gVisMutex);
+  gVisPts->Reset();
+  for(size_t i=0;i<x.size(); ++i) gVisPts->SetNextPoint(x[i], y[i], z[i]);
+  gEve->Redraw3D();
+  gSystem->ProcessEvents();
+}

Armory/vis_inproc.cpp

@@ -0,0 +1,65 @@
+//In-ROOT sim data
+
+// vis_inproc.cpp
+#include <TApplication.h>
+#include <TGeoManager.h>
+#include <TEveManager.h>
+#include <TEvePointSet.h>
+#include <TSystem.h>
+#include <TRandom3.h>
+#include <thread>
+#include <chrono>
+#include <vector>
+#include <iostream>
+
+void runSimulationAndUpdate(TEvePointSet* pts){
+  TRandom3 rnd(0);
+  for(int ev=0; ev<10000; ++ev){
+    pts->Reset();
+    int n = 100;
+    for(int i=0;i<n;++i){
+      double x = rnd.Uniform(-50,50);
+      double y = rnd.Uniform(-50,50);
+      double z = rnd.Uniform(-50,50);
+      pts->SetNextPoint(x,y,z);
+    }
+    gEve->Redraw3D();
+    gSystem->ProcessEvents();
+    std::this_thread::sleep_for(std::chrono::milliseconds(100));
+  }
+}
+
+void StartVis(const char* geomfile=nullptr){
+  int argc=0; char** argv=nullptr;
+  TApplication app("app",&argc,argv);
+  if(geomfile) TGeoManager::Import(geomfile);
+  TEveManager::Create();
+  TEvePointSet *pts = new TEvePointSet("hits");
+  gEve->AddElement(pts);
+  // runSimulationAndUpdate(pts);  // or leave update API to caller
+  app.Run();
+}
+
+int main(int argc, char** argv){
+  TApplication app("app",&argc,argv);
+
+  if(argc>1) TGeoManager::Import(argv[1]);
+
+  TEveManager::Create();
+
+  TEvePointSet *pts = new TEvePointSet("hits");
+  pts->SetMarkerStyle(20);
+  pts->SetMarkerSize(1.2);
+  pts->SetMarkerColor(kRed);
+  gEve->AddElement(pts);
+
+  // Option A: run simulation in same thread but yield to event loop inside the sim
+  runSimulationAndUpdate(pts);
+
+  // Option B: run sim in a separate thread (only if sim avoids ROOT globals)
+  // std::thread simThread(runSimulationAndUpdate, pts);
+  // simThread.detach();
+
+  app.Run();
+  return 0;
+}

BatchProcess.sh

@@ -0,0 +1,6 @@
+#!/bin/bash
+#parallel -j 6 echo ./ProcessRun.sh {1} 2000 0 ::: {020..400}
+
+#parallel --results log/log_{}.txt --ctag -j 6 ./ProcessRun.sh {1} 2000 0 ::: {020..400} # for 17F
+
+parallel --results log/log_{}.txt --ctag -j 6 ./ProcessRun.sh {1} 2000 0 ::: {001..021}  

Calibration.C

@@ -0,0 +1,270 @@
+
+#define Calibration_cxx
+
+#include <TH2.h>
+#include <TF1.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+#include <TCutG.h>
+#include <fstream>
+#include <utility>
+#include <algorithm>
+#include "Armory/HistPlotter.h"
+#include "TVector3.h"
+#include "Calibration.h"
+
+TH2F *hQQQFVB;
+HistPlotter *plotter;
+int padID = 0;
+
+TCutG *cut;
+std::map<std::tuple<int, int, int>, std::vector<std::pair<double, double>>> dataPoints;
+
+bool qqqEcut = false;
+
+// Gain Arrays
+const int MAX_QQQ = 4;
+const int MAX_RING = 16;
+const int MAX_WEDGE = 16;
+double qqqwGain[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+// double qqqrGain[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqwGainValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+// bool qqqrGainValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+
+void Calibration::Begin(TTree * /*tree*/)
+{
+    plotter = new HistPlotter("Calib.root", "TFILE");
+    // ----------------------- Load QQQ Gains
+    {
+        std::string filename = "qqq_GainMatch.txt";
+        std::ifstream infile(filename);
+        if (!infile.is_open())
+        {
+            std::cerr << "Error opening " << filename << "!" << std::endl;
+        }
+        else
+        {
+            int det, ring, wedge;
+            double gainw, gainr;
+            while (infile >> det >> ring >> wedge >> gainw >> gainr)
+            {
+                qqqwGain[det][ring][wedge] = gainw;
+                // qqqrGain[det][ring][wedge] = gainr;
+                qqqwGainValid[det][ring][wedge] = (gainw > 0);
+                // qqqrGainValid[det][ring][wedge] = (gainr > 0);
+            }
+            infile.close();
+            std::cout << "Loaded QQQ gains from " << filename << std::endl;
+        }
+    }
+    for (int det = 0; det < MAX_QQQ; det++)
+    {
+        for (int ring = 0; ring < MAX_RING; ring++)
+        {
+            for (int wedge = 0; wedge < MAX_WEDGE; wedge++)
+            {
+                TString hname = Form("hCal_qqq%d_ring%d_wedge%d", det, ring, wedge);
+                TString htitle = Form("QQQ det%d ring%d wedge%d; Energy (arb); Counts", det, ring, wedge);
+                // hQQQSpectra[det][ring][wedge] = new TH1F(hname, htitle, 4000, 0, 16000);
+            }
+        }
+    }
+}
+
+Bool_t Calibration::Process(Long64_t entry)
+{
+    b_qqqMulti->GetEntry(entry);
+    b_qqqID->GetEntry(entry);
+    b_qqqCh->GetEntry(entry);
+    b_qqqE->GetEntry(entry);
+    b_qqqT->GetEntry(entry);
+
+    qqq.CalIndex();
+
+    for (int i = 0; i < qqq.multi; i++)
+    {
+        for (int j = i + 1; j < qqq.multi; j++)
+        {
+            if (qqq.e[i] > 100)
+                qqqEcut = true;
+            if (qqq.id[i] == qqq.id[j])
+            {
+                int chWedge = -1;
+                int chRing = -1;
+                float eWedgeRaw = 0.0;
+                float eWedge = 0.0;
+                float eRingRaw = 0.0;
+                float eRing = 0.0;
+                if (qqq.ch[i] < 16 && qqq.ch[j] >= 16 && /*qqqrGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16] &&*/ qqqwGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16])
+                {
+                    chWedge = qqq.ch[i];
+                    eWedgeRaw = qqq.e[i];
+                    eWedge = qqq.e[i] * qqqwGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+                    // printf("Wedge E: %.2f  Gain: %.4f \n", eWedge, qqqGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16]);
+                    chRing = qqq.ch[j] - 16;
+                    eRingRaw = qqq.e[j];
+                    eRing = qqq.e[j];// * qqqrGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16];
+                }
+                else if (qqq.ch[j] < 16 && qqq.ch[i] >= 16 && /*qqqrGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16] &&*/ qqqwGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16])
+                {
+                    chWedge = qqq.ch[j];
+                    eWedge = qqq.e[j] * qqqwGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16];
+                    eWedgeRaw = qqq.e[j];
+
+                    chRing = qqq.ch[i] - 16;
+                    eRing = qqq.e[i];// * qqqrGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+                    eRingRaw = qqq.e[i];
+                }
+                else
+                    continue;
+
+                // hQQQFVB->Fill(eWedge, eRing);
+                plotter->Fill2D(Form("hRaw_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 400, 0, 16000, 400, 0, 16000, eWedgeRaw, eRingRaw, "ERaw");
+                plotter->Fill2D(Form("hGM_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 400, 0, 16000, 400, 0, 16000, eWedge, eRing, "EGM");
+                plotter->Fill2D("hRawQQQ", 4000, 0, 16000, 4000, 0, 16000, eWedgeRaw, eRingRaw);
+                plotter->Fill2D("hGMQQQ", 4000, 0, 16000, 4000, 0, 16000, eWedge, eRing);
+
+                TString histName = Form("hQQQFVB_id%d_r%d_w%d", qqq.id[i], chRing, chWedge);
+                // TH2F *hist2d = (TH2F *)gDirectory->Get(histName);
+                // if (!hist2d)
+                // {
+                //     hist2d = new TH2F(histName, Form("QQQ Det%d R%d W%d;Wedge E;Ring E", qqq.id[i], chRing, chWedge), 400, 0, 16000, 400, 0, 16000);
+                // }
+
+                // hist2d->Fill(eWedge, eRing);
+                // if (cut && cut->IsInside(eWedge, eRing))
+                const double MIN_ADC = 1500.0;
+                const double MAX_ADC = 3000.0;
+
+                // if (eWedge >= MIN_ADC && eWedge <= MAX_ADC &&
+                //     eRing >= MIN_ADC && eRing <= MAX_ADC)
+                double ratio = (eWedge > 0.0) ? (eRing / eWedge) : 0.0;
+
+                double maxslope = 1.5;
+
+                bool validPoint = false;
+                if (ratio < maxslope && ratio > 1. / maxslope)
+                {
+                    // Accumulate data for gain matching
+                    dataPoints[{qqq.id[i], chRing, chWedge}].emplace_back(eWedge, eRing);
+                }
+            }
+        }
+    }
+
+    return kTRUE;
+}
+
+void Calibration::Terminate()
+{
+    const double AM241_PEAK = 5485.56;
+    const double P_PEAK = 7000; // keV
+
+    double calibArray[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+    bool calibValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+
+    std::ofstream outFile("qqq_Calib.txt");
+    if (!outFile.is_open())
+    {
+        std::cerr << "Error opening qqq_Calib.txt!" << std::endl;
+        return;
+    }
+
+    //----------------------------------------------------------------------
+    // 1. Create per–channel 1D spectra in ADC from stored gain-matched data
+    //----------------------------------------------------------------------
+
+    std::map<std::tuple<int, int, int>, TH1F *> spectra;
+
+    for (auto &kv : dataPoints)
+    {
+        int det, ring, wedge;
+        std::tie(det, ring, wedge) = kv.first;
+
+        TString hname = Form("hSpec_d%d_r%d_w%d", det, ring, wedge);
+        TH1F *h = new TH1F(hname, hname, 4000, 0, 16000);
+
+        for (auto &p : kv.second)
+        {
+            double eWedge = p.first; // already gain-matched ADC
+            double eRing = p.second;
+
+            // Use ring ADC for calibration (cleaner alpha peak)
+            h->Fill(eRing);
+        }
+
+        spectra[kv.first] = h;
+    }
+
+    //----------------------------------------------------------------------
+    // 2. Fit Am-241 peak and extract keV/ADC calibration slope
+    //----------------------------------------------------------------------
+
+    for (auto &kv : spectra)
+    {
+        int det, ring, wedge;
+        std::tie(det, ring, wedge) = kv.first;
+        TH1F *h = kv.second;
+
+        if (!h || h->GetEntries() < 50)
+            continue;
+
+        int binMax = h->GetMaximumBin();
+        double adcPeak = h->GetXaxis()->GetBinCenter(binMax);
+
+        if (adcPeak <= 0)
+            continue;
+
+        // double slope_keV = AM241_PEAK / adcPeak; // keV per ADC
+        double slope_keV = P_PEAK / adcPeak; // keV per ADC
+
+        calibArray[det][ring][wedge] = slope_keV;
+        calibValid[det][ring][wedge] = true;
+
+        outFile << det << " " << wedge << " " << ring << " "
+                << slope_keV << "\n";
+
+        // printf("QQQ DET=%d R=%d W=%d  ADCpeak=%.1f  slope_keV=%.6f\n",det, ring, wedge, adcPeak, slope_keV);
+    }
+
+    outFile.close();
+    std::cout << "Wrote QQQ calibration file qqq_Calib.txt\n";
+
+    //----------------------------------------------------------------------
+    // 3. Build fully calibrated 2D combined histogram
+    //----------------------------------------------------------------------
+
+    TH2F *hCal = new TH2F("hCal",
+                          "All QQQ Calibrated;Wedge Energy (keV);Ring Energy (keV)",
+                          800, 0, 7000,
+                          800, 0, 7000);
+
+    for (auto &kv : dataPoints)
+    {
+        int det, ring, wedge;
+        std::tie(det, ring, wedge) = kv.first;
+
+        if (!calibValid[det][ring][wedge])
+            continue;
+
+        double slope = calibArray[det][ring][wedge];
+
+        for (auto &p : kv.second)
+        {
+            double eWGM = p.first; // gain matched ADC
+            double eRGM = p.second;
+
+            double eWkeV = eWGM * slope / 1000;
+            double eRkeV = eRGM * slope / 1000;
+
+            hCal->Fill(eWkeV, eRkeV);
+            plotter->Fill2D("hCalQQQ", 4000, 0, 10, 4000, 0, 10, eWkeV, eRkeV);
+            plotter->Fill2D(Form("hRCal_qqq%d", det), 16, 0, 15, 400, 0, 24, ring, eRkeV, "RingCal");
+            plotter->Fill2D(Form("hWCal_qqq%d", det), 16, 0, 15, 400, 0, 24, wedge, eWkeV, "WedgeCal");
+        }
+    }
+
+    plotter->FlushToDisk();
+    std::cout << "Calibrated 2D QQQ histogram saved.\n";
+}

Calibration.h

@@ -0,0 +1,114 @@
+#ifndef Calibration_h
+#define Calibration_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TFile.h>
+#include <TSelector.h>
+
+#include "Armory/ClassDet.h"
+
+class Calibration : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+// Fixed size dimensions of array or collections stored in the TTree if any.
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+
+   Calibration(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~Calibration() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(Calibration,0);
+};
+
+#endif
+
+#ifdef Calibration_cxx
+void Calibration::Init(TTree *tree){
+
+   // Set branch addresses and branch pointers
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+   fChain->SetBranchAddress("qqqMulti", &qqq.multi, &b_qqqMulti);
+   fChain->SetBranchAddress("qqqID",    &qqq.id, &b_qqqID);
+   fChain->SetBranchAddress("qqqCh",    &qqq.ch, &b_qqqCh);
+   fChain->SetBranchAddress("qqqE",     &qqq.e, &b_qqqE);
+   fChain->SetBranchAddress("qqqT",     &qqq.t, &b_qqqT);
+   fChain->SetBranchAddress("pcMulti",  &pc.multi, &b_pcMulti);
+   fChain->SetBranchAddress("pcID",     &pc.id, &b_pcID);
+   fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
+   fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
+   fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+
+}
+
+Bool_t Calibration::Notify(){
+
+   return kTRUE;
+}
+
+void Calibration::SlaveBegin(TTree * /*tree*/){
+
+   TString option = GetOption();
+
+}
+
+void Calibration::SlaveTerminate(){
+
+}
+
+
+#endif // #ifdef Calibration_cxx

ELoss/Eloss_17F

@@ -0,0 +1,268 @@
+0.017002095	0.00676442
+0.03400419	0.0135288
+0.085010476	0.032227
+0.136016762	0.0489265
+0.170020952	0.0592235
+0.255031428	0.0823584
+0.340041904	0.102374
+0.42505238	0.120086
+0.510062856	0.135943
+0.595073332	0.150461
+0.680083808	0.164011
+0.765094284	0.176885
+0.85010476	0.189282
+0.935115236	0.201176
+1.020125712	0.212518
+1.190146664	0.233962
+1.360167616	0.254045
+1.530188568	0.27299
+1.70020952	0.291072
+2.040251424	0.325807
+2.380293328	0.359536
+2.720335232	0.392589
+3.060377136	0.425159
+3.40041904	0.457286
+4.2505238	0.536817
+5.10062856	0.615601
+5.95073332	0.693052
+6.80083808	0.769499
+7.65094284	0.845324
+8.5010476	0.920793
+10.20125712	1.07377
+11.90146664	1.23229
+13.60167616	1.39414
+15.30188568	1.55782
+17.0020952	1.72459
+21.252619	2.15811
+25.5031428	2.61883
+29.7536666	3.10864
+34.0041904	3.62853
+38.2547142	4.17854
+42.505238	4.75843
+51.0062856	6.00863
+59.5073332	7.38089
+68.0083808	8.87668
+76.5094284	10.4957
+85.010476	12.2377
+93.5115236	14.1011
+102.0125712	16.0845
+110.5136188	18.1875
+119.0146664	20.4097
+127.515714	22.7505
+136.0167616	25.2096
+144.5178092	27.7867
+153.0188568	30.4814
+161.5199044	33.2935
+170.020952	36.2195
+187.0230472	42.214
+204.0251424	48.6246
+221.0272376	55.449
+238.0293328	62.6845
+255.031428	70.3284
+272.0335232	78.3781
+289.0356184	86.8308
+306.0377136	95.684
+323.0398088	104.935
+340.041904	114.581
+357.0439992	124.619
+374.0460944	135.048
+391.0481896	145.863
+408.0502848	157.064
+425.05238	168.647
+459.0565704	192.95
+493.0607608	218.753
+527.0649512	246.038
+561.0691416	274.787
+595.073332	304.983
+646.0796176	352.95
+697.0859032	404.079
+748.0921888	458.315
+799.0984744	515.608
+850.10476	575.909
+935.115236	682.969
+1020.125712	798.048
+1105.136188	920.949
+1190.146664	1051.49
+1275.15714	1189.49
+1360.167616	1334.78
+1445.178092	1487.21
+1530.188568	1646.62
+1615.199044	1812.86
+1700.20952	1985.8
+1785.219996	2165.29
+1870.230472	2351.2
+1955.240948	2543.42
+2040.251424	2741.82
+2125.2619	2946.27
+2210.272376	3156.67
+2295.282852	3372.91
+2380.293328	3594.88
+2465.303804	3822.47
+2550.31428	4055.59
+2635.324756	4294.14
+2720.335232	4538.01
+2805.345708	4787.13
+2890.356184	5041.4
+2975.36666	5300.73
+3060.377136	5565.04
+3145.387612	5834.24
+3230.398088	6108.26
+3315.408564	6387.01
+3400.41904	6670.42
+3570.439992	7250.92
+3740.460944	7849.17
+3910.481896	8464.62
+4080.502848	9096.74
+4250.5238	9745.02
+4420.544752	10409
+4590.565704	11088.2
+4760.586656	11782.1
+4930.607608	12490.4
+5100.62856	13212.7
+5270.649512	13948.5
+5440.670464	14697.4
+5610.691416	15459.2
+5780.712368	16233.4
+5950.73332	17019.7
+6120.754272	17817.8
+6290.775224	18627.3
+6460.796176	19448
+6630.817128	20279.6
+6800.83808	21121.8
+6970.859032	21974.2
+7140.879984	22836.7
+7310.900936	23709
+7480.921888	24590.9
+7650.94284	25482
+7820.963792	26382.2
+7990.984744	27291.2
+8161.005696	28208.8
+8331.026648	29134.9
+8501.0476	30069.1
+8841.089504	31961.3
+9181.131408	33884
+9521.173312	35835.8
+9861.215216	37815.1
+10201.25712	39820.8
+10541.29902	41851.6
+10881.34093	43906.4
+11221.38283	45984.1
+11561.42474	48083.6
+11901.46664	50203.9
+12241.50854	52344.2
+12581.55045	54503.4
+12921.59235	56680.8
+13261.63426	58875.5
+13601.67616	61086.7
+13941.71806	63313.8
+14281.75997	65556.1
+14621.80187	67812.7
+14961.84378	70083.2
+15301.88568	72366.9
+15641.92758	74663.1
+15981.96949	76971.4
+16322.01139	79291.2
+16662.0533	81622
+17002.0952	83963.3
+17342.1371	86314.6
+17682.17901	88675.4
+18022.22091	91045.4
+18362.26282	93424
+18702.30472	95811
+19042.34662	98205.9
+19382.38853	100608
+19722.43043	103018
+20062.47234	105434
+20402.51424	107857
+20742.55614	110286
+21082.59805	112721
+21422.63995	115162
+21762.68186	117608
+22102.72376	120059
+22442.76566	122514
+22782.80757	124975
+23122.84947	127439
+23462.89138	129908
+23802.93328	132380
+24142.97518	134856
+24483.01709	137335
+24823.05899	139817
+25163.1009	142303
+25503.1428	144791
+25843.1847	147281
+26183.22661	149774
+26523.26851	152270
+26863.31042	154767
+27203.35232	157266
+27543.39422	159767
+27883.43613	162270
+28223.47803	164774
+28563.51994	167279
+28903.56184	169786
+29753.6666	176056
+30603.77136	182331
+31453.87612	188609
+32303.98088	194888
+33154.08564	201166
+34004.1904	207442
+35704.39992	219984
+37404.60944	232503
+39104.81896	244992
+40805.02848	257444
+42505.238	269853
+44205.44752	282214
+45905.65704	294523
+47605.86656	306775
+49306.07608	318968
+51006.2856	331099
+54406.70464	355166
+57807.12368	378963
+61207.54272	402479
+64607.96176	425709
+68008.3808	448649
+71408.79984	471298
+74809.21888	493655
+78209.63792	515723
+81610.05696	537503
+85010.476	558999
+89260.9998	585475
+93511.5236	611522
+102012.5712	662361
+110513.6188	711594
+119014.6664	759299
+127515.714	805555
+136016.7616	850436
+144517.8092	894016
+153018.8568	936363
+161519.9044	977541
+170020.952	1.02E+06
+187023.0472	1.09E+06
+204025.1424	1.17E+06
+221027.2376	1.24E+06
+238029.3328	1.30E+06
+255031.428	1.37E+06
+272033.5232	1.43E+06
+289035.6184	1.49E+06
+306037.7136	1.54E+06
+323039.8088	1.60E+06
+340041.904	1.65E+06
+357043.9992	1.70E+06
+374046.0944	1.75E+06
+391048.1896	1.80E+06
+408050.2848	1.84E+06
+425052.38	1.89E+06
+442054.4752	1.93E+06
+459056.5704	1.98E+06
+476058.6656	2.02E+06
+493060.7608	2.06E+06
+510062.856	2.10E+06
+544067.0464	2.17E+06
+578071.2368	2.24E+06
+612075.4272	2.31E+06
+646079.6176	2.38E+06
+680083.808	2.44E+06
+714087.9984	2.50E+06
+748092.1888	2.56E+06
+782096.3792	2.61E+06
+816100.5696	2.67E+06
+850104.76	2.72E+06

ELoss/Eloss_27Al

@@ -0,0 +1,268 @@
+0.026981539	1087.74
+0.053963078	2175.49
+0.134907695	5438.8
+0.215852312	8557.19
+0.26981539	10540.7
+0.404723085	15079.2
+0.53963078	19011.9
+0.674538475	22467.9
+0.80944617	25531.3
+0.944353865	28303.5
+1.07926156	30859.2
+1.214169255	33253.7
+1.34907695	35529.1
+1.483984645	37685.6
+1.61889234	39719.2
+1.88870773	43505.2
+2.15852312	46980.1
+2.42833851	50199.6
+2.6981539	53228.6
+3.23778468	58941.2
+3.77741546	64372.8
+4.31704624	69606.4
+4.85667702	74683.1
+5.3963078	79618
+6.74538475	91580.1
+8.0944617	103093
+9.44353865	114105
+10.7926156	124746
+12.14169255	135119
+13.4907695	145269
+16.1889234	165367
+18.8870773	185754
+21.5852312	206324
+24.2833851	226926
+26.981539	247688
+33.72692375	300998
+40.4723085	357029
+47.21769325	416359
+53.963078	478956
+60.70846275	544719
+67.4538475	613499
+80.944617	759812
+94.4353865	917732
+107.926156	1.09E+06
+121.4169255	1.27E+06
+134.907695	1.46E+06
+148.3984645	1.67E+06
+161.889234	1.88E+06
+175.3800035	2.11E+06
+188.870773	2.35E+06
+202.3615425	2.60E+06
+215.852312	2.86E+06
+229.3430815	3.13E+06
+242.833851	3.41E+06
+256.3246205	3.71E+06
+269.81539	4.01E+06
+296.796929	4.64E+06
+323.778468	5.30E+06
+350.760007	6.00E+06
+377.741546	6.74E+06
+404.723085	7.53E+06
+431.704624	8.35E+06
+458.686163	9.21E+06
+485.667702	1.01E+07
+512.649241	1.10E+07
+539.63078	1.20E+07
+566.612319	1.30E+07
+593.593858	1.41E+07
+620.575397	1.52E+07
+647.556936	1.63E+07
+674.538475	1.75E+07
+728.501553	1.99E+07
+782.464631	2.25E+07
+836.427709	2.52E+07
+890.390787	2.81E+07
+944.353865	3.11E+07
+1025.298482	3.59E+07
+1106.243099	4.10E+07
+1187.187716	4.64E+07
+1268.132333	5.21E+07
+1349.07695	5.81E+07
+1483.984645	6.88E+07
+1618.89234	8.02E+07
+1753.800035	9.24E+07
+1888.70773	1.05E+08
+2023.615425	1.19E+08
+2158.52312	1.34E+08
+2293.430815	1.49E+08
+2428.33851	1.65E+08
+2563.246205	1.81E+08
+2698.1539	1.98E+08
+2833.061595	2.16E+08
+2967.96929	2.35E+08
+3102.876985	2.54E+08
+3237.78468	2.73E+08
+3372.692375	2.94E+08
+3507.60007	3.15E+08
+3642.507765	3.36E+08
+3777.41546	3.58E+08
+3912.323155	3.81E+08
+4047.23085	4.04E+08
+4182.138545	4.27E+08
+4317.04624	4.52E+08
+4451.953935	4.76E+08
+4586.86163	5.02E+08
+4721.769325	5.27E+08
+4856.67702	5.54E+08
+4991.584715	5.80E+08
+5126.49241	6.08E+08
+5261.400105	6.35E+08
+5396.3078	6.64E+08
+5666.12319	7.21E+08
+5935.93858	7.81E+08
+6205.75397	8.42E+08
+6475.56936	9.04E+08
+6745.38475	9.69E+08
+7015.20014	1.03E+09
+7285.01553	1.10E+09
+7554.83092	1.17E+09
+7824.64631	1.24E+09
+8094.4617	1.31E+09
+8364.27709	1.39E+09
+8634.09248	1.46E+09
+8903.90787	1.54E+09
+9173.72326	1.61E+09
+9443.53865	1.69E+09
+9713.35404	1.77E+09
+9983.16943	1.85E+09
+10252.98482	1.93E+09
+10522.80021	2.02E+09
+10792.6156	2.10E+09
+11062.43099	2.18E+09
+11332.24638	2.27E+09
+11602.06177	2.36E+09
+11871.87716	2.44E+09
+12141.69255	2.53E+09
+12411.50794	2.62E+09
+12681.32333	2.71E+09
+12951.13872	2.80E+09
+13220.95411	2.89E+09
+13490.7695	2.99E+09
+14030.40028	3.18E+09
+14570.03106	3.37E+09
+15109.66184	3.56E+09
+15649.29262	3.76E+09
+16188.9234	3.96E+09
+16728.55418	4.16E+09
+17268.18496	4.36E+09
+17807.81574	4.57E+09
+18347.44652	4.78E+09
+18887.0773	4.99E+09
+19426.70808	5.20E+09
+19966.33886	5.41E+09
+20505.96964	5.63E+09
+21045.60042	5.85E+09
+21585.2312	6.07E+09
+22124.86198	6.29E+09
+22664.49276	6.51E+09
+23204.12354	6.74E+09
+23743.75432	6.96E+09
+24283.3851	7.19E+09
+24823.01588	7.42E+09
+25362.64666	7.65E+09
+25902.27744	7.88E+09
+26441.90822	8.11E+09
+26981.539	8.34E+09
+27521.16978	8.57E+09
+28060.80056	8.81E+09
+28600.43134	9.04E+09
+29140.06212	9.28E+09
+29679.6929	9.52E+09
+30219.32368	9.75E+09
+30758.95446	9.99E+09
+31298.58524	1.02E+10
+31838.21602	1.05E+10
+32377.8468	1.07E+10
+32917.47758	1.10E+10
+33457.10836	1.12E+10
+33996.73914	1.14E+10
+34536.36992	1.17E+10
+35076.0007	1.19E+10
+35615.63148	1.22E+10
+36155.26226	1.24E+10
+36694.89304	1.27E+10
+37234.52382	1.29E+10
+37774.1546	1.31E+10
+38313.78538	1.34E+10
+38853.41616	1.36E+10
+39393.04694	1.39E+10
+39932.67772	1.41E+10
+40472.3085	1.44E+10
+41011.93928	1.46E+10
+41551.57006	1.49E+10
+42091.20084	1.51E+10
+42630.83162	1.54E+10
+43170.4624	1.56E+10
+43710.09318	1.59E+10
+44249.72396	1.61E+10
+44789.35474	1.64E+10
+45328.98552	1.66E+10
+45868.6163	1.69E+10
+47217.69325	1.75E+10
+48566.7702	1.81E+10
+49915.84715	1.87E+10
+51264.9241	1.94E+10
+52614.00105	2.00E+10
+53963.078	2.06E+10
+56661.2319	2.19E+10
+59359.3858	2.31E+10
+62057.5397	2.43E+10
+64755.6936	2.56E+10
+67453.8475	2.68E+10
+70152.0014	2.80E+10
+72850.1553	2.93E+10
+75548.3092	3.05E+10
+78246.4631	3.17E+10
+80944.617	3.29E+10
+86340.9248	3.53E+10
+91737.2326	3.76E+10
+97133.5404	4.00E+10
+102529.8482	4.23E+10
+107926.156	4.46E+10
+113322.4638	4.68E+10
+118718.7716	4.90E+10
+124115.0794	5.12E+10
+129511.3872	5.34E+10
+134907.695	5.55E+10
+141653.0798	5.82E+10
+148398.4645	6.07E+10
+161889.234	6.58E+10
+175380.0035	7.07E+10
+188870.773	7.54E+10
+202361.5425	8.00E+10
+215852.312	8.45E+10
+229343.0815	8.88E+10
+242833.851	9.30E+10
+256324.6205	9.71E+10
+269815.39	1.01E+11
+296796.929	1.09E+11
+323778.468	1.16E+11
+350760.007	1.23E+11
+377741.546	1.30E+11
+404723.085	1.36E+11
+431704.624	1.42E+11
+458686.163	1.48E+11
+485667.702	1.53E+11
+512649.241	1.59E+11
+539630.78	1.64E+11
+566612.319	1.69E+11
+593593.858	1.74E+11
+620575.397	1.79E+11
+647556.936	1.83E+11
+674538.475	1.88E+11
+701520.014	1.92E+11
+728501.553	1.96E+11
+755483.092	2.00E+11
+782464.631	2.04E+11
+809446.17	2.08E+11
+863409.248	2.16E+11
+917372.326	2.23E+11
+971335.404	2.29E+11
+1025298.482	2.36E+11
+1079261.56	2.42E+11
+1133224.638	2.48E+11
+1187187.716	2.54E+11
+1241150.794	2.59E+11
+1295113.872	2.65E+11
+1349076.95	2.70E+11

ELoss/Eloss_alpha

@@ -0,0 +1,345 @@
+0.053103695	11959.9
+0.116582129	19201.1
+0.180060563	24466.2
+0.243538998	28696
+0.307017432	32395.8
+0.370495866	35815.8
+0.4339739	39049.4
+0.497451133	42211.1
+0.560932369	45315.6
+0.624409603	48392.9
+0.687886836	51473.4
+0.751368072	54567.7
+0.814845305	57693.8
+0.878322539	60883.5
+0.941803775	64073.2
+1.005281008	67274.6
+1.068758242	70625.6
+1.132235475	73976.6
+1.195716711	77327.7
+1.259193944	80859
+1.322671178	84405.9
+1.386152414	87952.9
+1.449629647	91666.6
+1.513106881	95430.9
+1.576588117	99195.1
+1.64006535	103102
+1.703542583	107097
+1.767019817	111093
+1.830501053	115200
+1.893978286	119436
+1.95745552	123672
+2.020936756	128023
+2.084413989	132632
+2.147891222	137241
+2.211372458	141849
+2.274849692	146458
+2.338326925	151067
+2.401804159	155677
+2.465285395	160793
+2.528762628	165908
+2.592239861	171023
+2.655721097	176139
+2.719198331	181254
+2.782675564	186369
+2.8461568	191841
+2.909634034	197468
+2.973111267	203094
+3.0365885	208721
+3.100069736	214347
+3.16354697	219973
+3.227024203	225800
+3.290505439	231938
+3.353982673	238075
+3.417459906	244212
+3.480941142	250349
+3.544418375	256486
+3.607895609	262668
+3.671372842	269313
+3.734854078	275958
+3.798331312	282603
+3.861808545	289248
+3.925289781	295893
+3.988767014	302538
+4.05223224	309870
+4.115713476	317394
+4.179194712	324917
+4.242675948	332441
+4.306157184	339965
+4.36963842	347488
+4.433119656	355012
+4.496600892	362535
+4.560082128	370059
+4.623563364	377583
+4.6870446	385106
+4.750525836	392630
+4.813967046	400154
+4.877448282	407677
+4.940929518	415201
+5.004410754	422747
+5.06789199	431506
+5.131373226	440265
+5.194854462	449023
+5.258335698	457782
+5.321816934	466541
+5.38529817	475299
+5.448779406	484058
+5.512260642	492817
+5.575741878	501575
+5.639223114	510334
+5.70270435	519093
+5.76614556	527851
+5.829626796	536610
+5.893108032	545369
+5.956589268	554127
+6.020070504	563195
+6.08355174	573167
+6.147032976	583139
+6.210514212	593110
+6.273995448	603082
+6.337476684	613054
+6.40095792	623026
+6.464439156	632997
+6.527920392	642969
+6.591401628	652941
+6.654842838	662913
+6.718324074	672885
+6.78180531	682856
+6.845286546	692828
+6.908767782	702800
+6.972249018	712772
+7.035730254	723331
+7.09921149	734498
+7.162692726	745666
+7.226173962	756833
+7.289655198	768000
+7.353136434	779168
+7.41661767	790335
+7.480098906	801502
+7.543540116	812670
+7.607021352	823837
+7.670502588	835004
+7.733983824	846172
+7.79746506	857339
+7.860946296	868507
+7.924427532	879674
+7.987908768	890841
+8.051390004	902868
+8.11487124	915217
+8.178352476	927566
+8.241833712	939915
+8.305314948	952263
+8.368796184	964612
+8.43227742	976961
+8.49571863	989310
+8.559199866	1.00E+06
+8.622681102	1.01E+06
+8.686162338	1.03E+06
+8.749643574	1.04E+06
+8.81312481	1.05E+06
+8.876606046	1.06E+06
+8.940087282	1.08E+06
+9.003568518	1.09E+06
+9.067049754	1.10E+06
+9.13053099	1.12E+06
+9.194012226	1.13E+06
+9.257493462	1.14E+06
+9.320974698	1.16E+06
+9.384415908	1.17E+06
+9.447897144	1.18E+06
+9.51137838	1.20E+06
+9.574859616	1.21E+06
+9.638340852	1.22E+06
+9.701822088	1.24E+06
+9.765303324	1.25E+06
+9.82878456	1.26E+06
+9.892265796	1.28E+06
+9.955747032	1.29E+06
+10.01922827	1.30E+06
+10.0827095	1.32E+06
+10.14619074	1.34E+06
+10.20967198	1.35E+06
+10.27311319	1.37E+06
+10.33659442	1.38E+06
+10.40007566	1.40E+06
+10.46355689	1.41E+06
+10.52703813	1.43E+06
+10.59051937	1.44E+06
+10.6540006	1.46E+06
+10.71748184	1.47E+06
+10.78096307	1.49E+06
+10.84444431	1.50E+06
+10.90792555	1.52E+06
+10.97140678	1.53E+06
+11.03488802	1.55E+06
+11.09836925	1.56E+06
+11.16185049	1.58E+06
+11.2252917	1.59E+06
+11.28877294	1.61E+06
+11.35225417	1.62E+06
+11.41573541	1.64E+06
+11.47921664	1.66E+06
+11.54269788	1.67E+06
+11.60617912	1.69E+06
+11.66966035	1.70E+06
+11.73314159	1.72E+06
+11.79662282	1.73E+06
+11.86010406	1.75E+06
+11.9235853	1.76E+06
+11.98706653	1.78E+06
+12.05054777	1.79E+06
+12.11398898	1.81E+06
+12.17747021	1.83E+06
+12.24095145	1.85E+06
+12.30443269	1.86E+06
+12.36791392	1.88E+06
+12.43139516	1.90E+06
+12.49487639	1.92E+06
+12.55835763	1.93E+06
+12.62183887	1.95E+06
+12.6853201	1.97E+06
+12.74880134	1.99E+06
+12.81228257	2.00E+06
+12.87576381	2.02E+06
+12.93924505	2.04E+06
+13.00268626	2.06E+06
+13.06616749	2.07E+06
+13.12964873	2.09E+06
+13.19312996	2.11E+06
+13.2566112	2.13E+06
+13.32009244	2.14E+06
+13.38357367	2.16E+06
+13.44705491	2.18E+06
+13.51053614	2.20E+06
+13.57401738	2.22E+06
+13.63749862	2.23E+06
+13.70097985	2.25E+06
+13.76446109	2.27E+06
+13.82794232	2.29E+06
+13.89142356	2.30E+06
+13.95486477	2.32E+06
+14.01834601	2.34E+06
+14.08182724	2.36E+06
+14.14530848	2.38E+06
+14.20878971	2.40E+06
+14.27227095	2.42E+06
+14.33575219	2.44E+06
+14.39923342	2.46E+06
+14.46271466	2.48E+06
+14.52619589	2.50E+06
+14.58967713	2.52E+06
+14.65315837	2.54E+06
+14.7166396	2.56E+06
+14.78012084	2.58E+06
+14.84356205	2.60E+06
+14.90704328	2.62E+06
+14.97052452	2.63E+06
+15.03400576	2.65E+06
+15.09748699	2.67E+06
+15.16096823	2.69E+06
+15.22444946	2.71E+06
+15.2879307	2.73E+06
+15.35141194	2.75E+06
+15.41489317	2.77E+06
+15.47837441	2.79E+06
+15.54185564	2.81E+06
+15.60533688	2.83E+06
+15.66881812	2.85E+06
+15.73225933	2.87E+06
+15.79574056	2.89E+06
+15.8592218	2.91E+06
+15.92270303	2.93E+06
+15.98618427	2.95E+06
+16.04966551	2.97E+06
+16.11314674	2.99E+06
+16.17662798	3.02E+06
+16.24010921	3.04E+06
+16.30359045	3.06E+06
+16.36707169	3.08E+06
+16.43055292	3.10E+06
+16.49403416	3.13E+06
+16.55751539	3.15E+06
+16.6209566	3.17E+06
+16.68443784	3.19E+06
+16.74791908	3.21E+06
+16.81140031	3.24E+06
+16.87488155	3.26E+06
+16.93836278	3.28E+06
+17.00184402	3.30E+06
+17.06532526	3.32E+06
+17.12880649	3.35E+06
+17.19228773	3.37E+06
+17.25576896	3.39E+06
+17.3192502	3.41E+06
+17.38273144	3.43E+06
+17.44621267	3.46E+06
+17.50969391	3.48E+06
+17.57313512	3.50E+06
+17.63661635	3.52E+06
+17.70009759	3.54E+06
+17.76357883	3.57E+06
+17.82706006	3.59E+06
+17.8905413	3.61E+06
+17.95402253	3.63E+06
+18.01750377	3.65E+06
+18.08098501	3.68E+06
+18.14446624	3.70E+06
+18.20794748	3.73E+06
+18.27142871	3.75E+06
+18.33490995	3.78E+06
+18.39839119	3.80E+06
+18.4618324	3.82E+06
+18.52531363	3.85E+06
+18.58879487	3.87E+06
+18.6522761	3.90E+06
+18.71575734	3.92E+06
+18.77923858	3.95E+06
+18.84271981	3.97E+06
+18.90620105	3.99E+06
+18.96968228	4.02E+06
+19.03316352	4.04E+06
+19.09664476	4.07E+06
+19.16012599	4.09E+06
+19.22360723	4.11E+06
+19.28708846	4.14E+06
+19.35052967	4.16E+06
+19.41401091	4.19E+06
+19.47749215	4.21E+06
+19.54097338	4.24E+06
+19.60445462	4.26E+06
+19.66793585	4.28E+06
+19.73141709	4.31E+06
+19.79489833	4.33E+06
+19.85837956	4.36E+06
+19.9218608	4.38E+06
+19.98534203	4.41E+06
+20.04882327	4.43E+06
+20.11230451	4.46E+06
+20.17578574	4.48E+06
+20.23926698	4.51E+06
+20.30270819	4.54E+06
+20.36618942	4.56E+06
+20.42967066	4.59E+06
+20.4931519	4.62E+06
+20.55663313	4.64E+06
+20.62011437	4.67E+06
+20.6835956	4.69E+06
+20.74707684	4.72E+06
+20.81055808	4.75E+06
+20.87403931	4.77E+06
+20.93752055	4.80E+06
+21.00100178	4.83E+06
+21.06448302	4.85E+06
+21.12796426	4.88E+06
+21.19140547	4.91E+06
+21.2548867	4.93E+06
+21.31836794	4.96E+06
+21.38184917	4.98E+06
+21.44533041	5.01E+06
+21.50881165	5.04E+06
+21.57229288	5.06E+06
+21.63577412	5.09E+06
+21.69925535	5.12E+06
+21.76273659	5.14E+06
+21.82621783	5.17E+06
+21.88969906	5.20E+06

ELoss/Eloss_p

@@ -0,0 +1,268 @@
+0.00100784	0.00455783
+0.00201568	0.00911567
+0.0050392	0.0197891
+0.00806272	0.0284591
+0.0100784	0.0336328
+0.0151176	0.0449321
+0.0201568	0.0545806
+0.025196	0.0631952
+0.0302352	0.071111
+0.0352744	0.0785363
+0.0403136	0.0856119
+0.0453528	0.0924397
+0.050392	0.0990962
+0.0554312	0.105641
+0.0604704	0.112122
+0.0705488	0.125041
+0.0806272	0.138091
+0.0907056	0.151435
+0.100784	0.16519
+0.1209408	0.194217
+0.1410976	0.225513
+0.1612544	0.25917
+0.1814112	0.295144
+0.201568	0.333333
+0.25196	0.4377
+0.302352	0.55345
+0.352744	0.679377
+0.403136	0.814707
+0.453528	0.958947
+0.50392	1.11177
+0.604704	1.44231
+0.705488	1.80513
+0.806272	2.19946
+0.907056	2.62475
+1.00784	3.08057
+1.2598	4.35139
+1.51176	5.80613
+1.76372	7.44108
+2.01568	9.25315
+2.26764	11.2397
+2.5196	13.3984
+3.02352	18.2246
+3.52744	23.7179
+4.03136	29.8671
+4.53528	36.6625
+5.0392	44.0961
+5.54312	52.1607
+6.04704	60.8501
+6.55096	70.1587
+7.05488	80.0814
+7.5588	90.6136
+8.06272	101.751
+8.56664	113.49
+9.07056	125.827
+9.57448	138.759
+10.0784	152.267
+11.08624	180.081
+12.09408	209.992
+13.10192	241.974
+14.10976	276.006
+15.1176	312.066
+16.12544	350.134
+17.13328	390.189
+18.14112	432.214
+19.14896	476.19
+20.1568	522.101
+21.16464	569.93
+22.17248	619.661
+23.18032	671.279
+24.18816	724.77
+25.196	780.118
+27.21168	896.334
+29.22736	1019.82
+31.24304	1150.48
+33.25872	1288.2
+35.2744	1432.91
+38.29792	1662.88
+41.32144	1908.07
+44.34496	2168.23
+47.36848	2443.1
+50.392	2732.43
+55.4312	3246.18
+60.4704	3798.47
+65.5096	4388.33
+70.5488	5014.87
+75.588	5677.25
+80.6272	6374.65
+85.6664	7106.3
+90.7056	7871.46
+95.7448	8669.43
+100.784	9499.52
+105.8232	10361.1
+110.8624	11253.5
+115.9016	12176.2
+120.9408	13128.5
+125.98	14109.9
+131.0192	15119.8
+136.0584	16157.8
+141.0976	17223.3
+146.1368	18315.7
+151.176	19434.7
+156.2152	20579.8
+161.2544	21750.4
+166.2936	22946.2
+171.3328	24166.7
+176.372	25411.6
+181.4112	26680.3
+186.4504	27972.5
+191.4896	29287.8
+196.5288	30625.8
+201.568	31986.2
+211.6464	34772.7
+221.7248	37644.4
+231.8032	40598.6
+241.8816	43632.8
+251.96	46744.7
+262.0384	49931.8
+272.1168	53192
+282.1952	56523.1
+292.2736	59923.1
+302.352	63390
+312.4304	66921.8
+322.5088	70516.9
+332.5872	74173.4
+342.6656	77889.7
+352.744	81664
+362.8224	85494.9
+372.9008	89380.9
+382.9792	93320.4
+393.0576	97312.1
+403.136	101355
+413.2144	105447
+423.2928	109587
+433.3712	113774
+443.4496	118007
+453.528	122284
+463.6064	126605
+473.6848	130969
+483.7632	135373
+493.8416	139818
+503.92	144303
+524.0768	153386
+544.2336	162615
+564.3904	171984
+584.5472	181485
+604.704	191113
+624.8608	200861
+645.0176	210724
+665.1744	220697
+685.3312	230775
+705.488	240953
+725.6448	251226
+745.8016	261591
+765.9584	272043
+786.1152	282578
+806.272	293192
+826.4288	303883
+846.5856	314646
+866.7424	325478
+886.8992	336377
+907.056	347338
+927.2128	358361
+947.3696	369441
+967.5264	380577
+987.6832	391765
+1007.84	403003
+1027.9968	414290
+1048.1536	425622
+1068.3104	436998
+1088.4672	448416
+1108.624	459874
+1128.7808	471370
+1148.9376	482902
+1169.0944	494468
+1189.2512	506067
+1209.408	517698
+1229.5648	529358
+1249.7216	541047
+1269.8784	552762
+1290.0352	564502
+1310.192	576267
+1330.3488	588055
+1350.5056	599864
+1370.6624	611694
+1390.8192	623543
+1410.976	635410
+1431.1328	647295
+1451.2896	659195
+1471.4464	671111
+1491.6032	683041
+1511.76	694984
+1531.9168	706940
+1552.0736	718907
+1572.2304	730885
+1592.3872	742872
+1612.544	754869
+1632.7008	766874
+1652.8576	778887
+1673.0144	790907
+1693.1712	802933
+1713.328	814964
+1763.72	845063
+1814.112	875184
+1864.504	905318
+1914.896	935457
+1965.288	965594
+2015.68	995721
+2116.464	1.06E+06
+2217.248	1.12E+06
+2318.032	1.18E+06
+2418.816	1.24E+06
+2519.6	1.30E+06
+2620.384	1.35E+06
+2721.168	1.41E+06
+2821.952	1.47E+06
+2922.736	1.53E+06
+3023.52	1.59E+06
+3225.088	1.70E+06
+3426.656	1.82E+06
+3628.224	1.93E+06
+3829.792	2.04E+06
+4031.36	2.15E+06
+4232.928	2.26E+06
+4434.496	2.37E+06
+4636.064	2.48E+06
+4837.632	2.58E+06
+5039.2	2.68E+06
+5291.16	2.81E+06
+5543.12	2.94E+06
+6047.04	3.18E+06
+6550.96	3.42E+06
+7054.88	3.64E+06
+7558.8	3.87E+06
+8062.72	4.08E+06
+8566.64	4.29E+06
+9070.56	4.49E+06
+9574.48	4.69E+06
+10078.4	4.88E+06
+11086.24	5.25E+06
+12094.08	5.61E+06
+13101.92	5.94E+06
+14109.76	6.26E+06
+15117.6	6.57E+06
+16125.44	6.86E+06
+17133.28	7.14E+06
+18141.12	7.41E+06
+19148.96	7.67E+06
+20156.8	7.93E+06
+21164.64	8.17E+06
+22172.48	8.41E+06
+23180.32	8.63E+06
+24188.16	8.86E+06
+25196	9.07E+06
+26203.84	9.28E+06
+27211.68	9.48E+06
+28219.52	9.68E+06
+29227.36	9.87E+06
+30235.2	1.01E+07
+32250.88	1.04E+07
+34266.56	1.08E+07
+36282.24	1.11E+07
+38297.92	1.14E+07
+40313.6	1.17E+07
+42329.28	1.20E+07
+44344.96	1.23E+07
+46360.64	1.25E+07
+48376.32	1.28E+07
+50392	1.30E+07

FitHistogramsWithTSpectrum_Sequential_Improved.C

@@ -0,0 +1,124 @@
+#include <TFile.h>
+#include <TH1.h>
+#include <TSpectrum.h>
+#include <TF1.h>
+#include <TCanvas.h>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+#include <fstream>
+#include <TText.h>
+
+void FitHistogramsWithTSpectrum_Sequential_Improved() {
+    TFile *inputFile = new TFile("Histograms_anodes.root", "READ");
+    if (!inputFile || inputFile->IsZombie()) {
+        std::cerr << "Error opening the input file!" << std::endl;
+        return;
+    }
+
+    TCanvas *c1 = new TCanvas("c1", "Histogram Viewer", 800, 600);
+
+    // Open the output ASCII file to save the centroids
+    std::ofstream outFile("centroids.txt");
+    if (!outFile.is_open()) {
+        std::cerr << "Error opening output file!" << std::endl;
+        return;
+    }
+    outFile << "HistogramIndex\tPeakNumber\tCentroid\tAmplitude\tSigma" << std::endl;
+
+    for (int i = 0; i < 24; ++i) {
+        TH1 *histogram = dynamic_cast<TH1*>(inputFile->Get(Form("hCathode_%d", i)));
+        if (!histogram) {
+            std::cerr << "Failed to retrieve histogram_" << i << " from the file." << std::endl;
+            continue;
+        }
+
+        // Set range for peak search
+        double minX = 700;
+        double maxX = 25000;
+        histogram->GetXaxis()->SetRangeUser(minX, maxX);
+
+        // Draw the histogram
+        c1->cd();
+        histogram->Draw();
+
+        // Peak search using TSpectrum
+        const int maxPeaks = 5;
+        TSpectrum spectrumFinder(maxPeaks);
+        int nFound = spectrumFinder.Search(histogram, 2, "", 0.01);
+
+        if (nFound <= 0) {
+            std::cerr << "No peaks found for histogram " << i << std::endl;
+            continue;
+        }
+
+        Double_t *xPositions = spectrumFinder.GetPositionX();
+        Double_t *yPositions = spectrumFinder.GetPositionY();
+        std::vector<std::pair<Double_t, Double_t>> peaks;
+
+        // Collect and sort peaks by X position
+        for (int j = 0; j < nFound; ++j) {
+            peaks.emplace_back(xPositions[j], yPositions[j]);
+        }
+        std::sort(peaks.begin(), peaks.end());
+
+        // Fit each peak with a Gaussian
+        for (int j = 0; j < peaks.size(); ++j) {
+            Double_t peakX = peaks[j].first;
+            Double_t peakY = peaks[j].second;
+            Double_t initialAmplitude = peakY;  // Better initial guess
+            Double_t initialCentroid = peakX;   // Centroid based on peak position
+            Double_t initialSigma = 60.0;
+            // Define Gaussian with initial parameters
+            TF1 *gaussFit = new TF1(Form("gauss_%d", j), "gaus", peakX - 200, peakX + 200);
+            //gaussFit->SetParameters(peakY, peakX, 25.0); // Initial guesses for amplitude, mean, sigma
+            gaussFit->SetParameters(initialAmplitude, initialCentroid, initialSigma);
+            // Perform fit
+            int fitStatus = histogram->Fit(gaussFit, "RQ+");
+            if (fitStatus != 0) {
+                std::cerr << "Fit failed for peak " << j + 1 << " in histogram " << i << std::endl;
+                delete gaussFit;
+                continue;
+            }
+
+            // Retrieve fit parameters
+            double amplitude = gaussFit->GetParameter(0);
+            double centroid = gaussFit->GetParameter(1);
+            double sigma = gaussFit->GetParameter(2);
+            double amplitudeError = gaussFit->GetParError(0);
+            double centroidError = gaussFit->GetParError(1);
+            double sigmaError = gaussFit->GetParError(2);
+
+            // Chi-squared value
+            double chi2 = gaussFit->GetChisquare();
+            int ndf = gaussFit->GetNDF();
+            outFile << i << "\t" << j + 1 << "\t" << centroid << std::endl;
+            gaussFit->SetLineColor(kRed);
+            gaussFit->Draw("SAME");
+            TText *text = new TText();
+            text->SetNDC();
+            text->SetTextSize(0.03);
+            text->SetTextColor(kRed);
+            //text->DrawText(0.15, 0.8 - j * 0.05, Form("Peak %d: Amp=%.2f, Mean=%.2f, Sigma=%.2f", j + 1, amplitude, centroid, sigma));
+            text->DrawText(0.15, 0.8 - j * 0.05, 
+                Form("Peak %d: Amp=%.2f±%.2f, Mean=%.2f±%.2f, Sigma=%.2f±%.2f, Chi2/NDF=%.2f",
+                     j + 1, amplitude, amplitudeError, centroid, centroidError, sigma, sigmaError, chi2 / ndf));
+            // Save results
+            
+            
+            // Clean up
+            delete gaussFit;
+        }
+
+        // Update canvas for visualization
+        c1->Update();
+        std::cout << "Press Enter to view the next histogram..." << std::endl;
+        c1->WaitPrimitive(); // Wait until Enter is pressed in the ROOT console
+    }
+
+    // Close resources
+    inputFile->Close();
+    outFile.close();
+    delete c1;
+}
+

GainMatchQQQ.C

@@ -0,0 +1,309 @@
+#define GainMatchQQQ_cxx
+
+#include "GainMatchQQQ.h"
+#include <TH2.h>
+#include <TF1.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+#include <TCutG.h>
+#include <fstream>
+#include <utility>
+#include <algorithm>
+#include <cmath>
+#include <numeric>
+#include "Armory/HistPlotter.h"
+#include "TVector3.h"
+#include "TGraphErrors.h"
+#include "TF1.h"
+#include <cmath>
+
+TH2F *hQQQFVB;
+HistPlotter *plotter;
+
+int padID = 0;
+
+TCutG *cut;
+std::map<std::tuple<int, int, int>, std::vector<std::pair<double, double>>> dataPoints;
+
+void GainMatchQQQ::Begin(TTree * /*tree*/)
+{
+    plotter = new HistPlotter("GainQQQ.root", "TFILE");
+    TString option = GetOption();
+
+    hQQQFVB = new TH2F("hQQQFVB", "QQQ Front vs Back; Front E; Back E", 800, 0, 16000, 800, 0, 16000);
+
+    // Load the TCutG object
+    TFile *cutFile = TFile::Open("qqqcorr.root");
+    if (!cutFile || cutFile->IsZombie())
+    {
+        std::cerr << "Error: Could not open qqqcorr.root" << std::endl;
+        return;
+    }
+    cut = dynamic_cast<TCutG *>(cutFile->Get("qqqcorr"));
+    if (!cut)
+    {
+        std::cerr << "Error: Could not find TCutG named 'qqqcorr' in qqqcorr.root" << std::endl;
+        return;
+    }
+    cut->SetName("qqqcorr"); // Ensure the cut has the correct name
+}
+
+Bool_t GainMatchQQQ::Process(Long64_t entry)
+{
+
+    int ringMults[16] = {0};
+    int wedgeMults[16] = {0};
+    std::vector<std::tuple<int, int, int, double, double>> events;
+
+    b_qqqMulti->GetEntry(entry);
+    b_qqqID->GetEntry(entry);
+    b_qqqCh->GetEntry(entry);
+    b_qqqE->GetEntry(entry);
+    b_qqqT->GetEntry(entry);
+
+    qqq.CalIndex();
+
+    for (int i = 0; i < qqq.multi; i++)
+    {
+        for (int j = i + 1; j < qqq.multi; j++)
+        {
+            if (qqq.id[i] == qqq.id[j])
+            {
+                int chWedge = -1;
+                int chRing = -1;
+                float eWedge = 0.0;
+                float eRing = 0.0;
+                if (qqq.ch[i] < 16 && qqq.ch[j] >= 16)
+                {
+                    chWedge = qqq.ch[i];
+                    eWedge = qqq.e[i];
+                    chRing = qqq.ch[j] - 16;
+                    eRing = qqq.e[j];
+                }
+                else if (qqq.ch[j] < 16 && qqq.ch[i] >= 16)
+                {
+                    chWedge = qqq.ch[j];
+                    eWedge = qqq.e[j];
+                    chRing = qqq.ch[i] - 16;
+                    eRing = qqq.e[i];
+                }
+                else
+                    continue;
+                ringMults[chRing]++;
+                wedgeMults[chWedge]++;
+                hQQQFVB->Fill(eWedge, eRing);
+                events.emplace_back(qqq.id[i], chRing, chWedge, eRing, eWedge);
+                plotter->Fill2D(Form("hRaw_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 800, 0, 3000, 800, 0, 3000, eWedge, eRing, "hRawQQQ");
+                // double ratio = (eWedge > 0.0) ? (eRing / eWedge) : 0.0;
+                // double maxslope = 1.5;
+
+                // bool validPoint = false;
+                // if (ratio < maxslope && ratio > 1. / maxslope)
+                // {
+                //     // Accumulate data for gain matching
+                //     dataPoints[{qqq.id[i], chRing, chWedge}].emplace_back(eWedge, eRing);
+                //     plotter->Fill2D("hAll_in", 4000, 0, 16000, 4000, 0, 16000, eWedge, eRing);
+                //     validPoint = true;
+                // }
+
+                // if (!validPoint)
+                // {
+                //     plotter->Fill2D("hAll_out", 4000, 0, 16000, 4000, 0, 16000, eWedge, eRing);
+                // }
+            }
+        }
+    }
+
+    for (auto tuple : events)
+    {
+        auto [id, chr, chw, er, ew] = tuple;
+        if (ringMults[chr] > 1 || wedgeMults[chw] > 1)
+            continue; // ignore multiplicity > 1 events
+        double ratio = (ew > 0.0) ? (er / ew) : 0.0;
+        double maxslope = 1.5;
+
+        bool validPoint = false;
+        if (ratio < maxslope && ratio > 1. / maxslope)
+        {
+                // Accumulate data for gain matching
+                dataPoints[{id, chr, chw}].emplace_back(ew, er);
+                plotter->Fill2D("hAll_in", 4000, 0, 16000, 4000, 0, 16000, ew, er);
+                validPoint = true;
+                    }
+        if (!validPoint)
+        {
+            plotter->Fill2D("hAll_out", 4000, 0, 16000, 4000, 0, 16000, ew, er);
+        }
+    }
+
+    return kTRUE;
+}
+
+
+void GainMatchQQQ::Terminate()
+{
+    const int MAX_DET = 4;
+    const int MAX_RING = 16;
+    const int MAX_WEDGE = 16;
+
+    // We store gains locally just for the "corrected" plot, 
+    // but the file will output Slopes for the global minimizer.
+    double gainW[MAX_DET][MAX_RING][MAX_WEDGE] = {{{0}}};
+    double gainR[MAX_DET][MAX_RING][MAX_WEDGE] = {{{0}}};
+    bool gainValid[MAX_DET][MAX_RING][MAX_WEDGE] = {{{false}}};
+
+    // Output file for the Minimizer
+    std::ofstream outFile("qqq_GainMatch.txt");
+    
+    // Benchmark/Debug file
+    std::ofstream benchFile("benchmark_diff.txt"); 
+    benchFile << "ID Wedge Ring Chi2NDF Slope SlopeErr" << std::endl;
+
+    if (!outFile.is_open()) { std::cerr << "Error opening output file!" << std::endl; return; }
+
+    const int MIN_POINTS = 50;
+    const int MAX_ITER = 3;        // Outlier rejection passes
+    const double CLIP_SIGMA = 2.5; // Sigma threshold for outliers
+
+    for (const auto &kv : dataPoints)
+    {
+        auto key = kv.first;
+        auto [id, ring, wedge] = key;
+        const auto &pts = kv.second;
+
+        if (pts.size() < (size_t)MIN_POINTS) continue;
+
+        std::vector<std::pair<double, double>> current_pts = pts;
+        
+        double finalSlope = 0.0;
+        double finalSlopeErr = 0.0;
+        bool converged = false;
+
+        // --- Iterative Fitting ---
+        for (int iter = 0; iter < MAX_ITER; ++iter)
+        {
+            if (current_pts.size() < (size_t)MIN_POINTS) break;
+
+            std::vector<double> x, y, ex, ey;
+
+            for (const auto &p : current_pts)
+            {
+                x.push_back(p.first);  // Wedge E
+                y.push_back(p.second); // Ring E
+                ex.push_back(std::sqrt(std::abs(p.first))); // Error in X (Poisson)
+                ey.push_back(std::sqrt(std::abs(p.second))); // Error in Y (Poisson)
+                
+                // Sanity check to avoid 0 error
+                if(ex.back() < 1.0) ex.back() = 1.0;
+                if(ey.back() < 1.0) ey.back() = 1.0;
+            }
+
+            // 2. Create Graph
+            TGraphErrors *gr = new TGraphErrors(current_pts.size(), x.data(), y.data(), ex.data(), ey.data());
+            
+            // 3. Fit Linear Function through Origin
+            TF1 *f1= new TF1("calibFit", "[0]*x", 0, 16000);
+            f1->SetParameter(0, 1.0);   
+
+            // "Q"=Quiet, "N"=NoDraw, "S"=ResultPtr
+            // We do NOT use "W" (Ignore weights), we want to use the errors we set.
+            int fitStatus = gr->Fit(f1, "QNS");
+
+            if (fitStatus != 0) {
+                delete gr; delete f1;
+                break; 
+            }
+
+            finalSlope = f1->GetParameter(0);
+            double chi2 = f1->GetChisquare();
+            double ndf = f1->GetNDF();
+            
+            // Get the statistical error on the slope
+            double rawErr = f1->GetParError(0);
+            
+            // SCALING ERROR:
+            // If Chi2/NDF > 1, the data scatters more than Poisson stats predict.
+            // // We inflate the error by sqrt(Chi2/NDF) to be conservative for the Minimizer.
+            // double redChi2 = (ndf > 0) ? (chi2 / ndf) : 1.0;
+            // double inflation = (redChi2 > 1.0) ? std::sqrt(redChi2) : 1.0;
+            
+            // finalSlopeErr = rawErr * inflation;
+
+            // 4. Outlier Rejection
+            if (iter == MAX_ITER - 1) {
+                converged = true;
+                delete gr; delete f1;
+                break;
+            }
+
+            // Calculate Residuals
+            std::vector<double> residuals;
+            double sumSqResid = 0.0;
+            for(size_t k=0; k<current_pts.size(); ++k) {
+                double val = f1->Eval(current_pts[k].first);
+                double res = current_pts[k].second - val;
+                residuals.push_back(res);
+                sumSqResid += res*res;
+            }
+        //     double sigma = std::sqrt(sumSqResid / current_pts.size());
+            
+        //     // Filter
+        //     std::vector<std::pair<double, double>> next_pts;
+        //     for(size_t k=0; k<current_pts.size(); ++k) {
+        //         if(std::abs(residuals[k]) < CLIP_SIGMA * sigma) {
+        //             next_pts.push_back(current_pts[k]);
+        //         }
+        //     }
+
+        //     if (next_pts.size() == current_pts.size()) {
+        //         converged = true; 
+        //         delete gr; delete f1;
+        //         break;
+        //     }
+        //     current_pts = next_pts;
+        //     delete gr; delete f1;
+        }
+
+        if (!converged || finalSlope <= 0) continue;
+
+        // --- Store/Output ---
+        
+        // 1. Save locally for the verification plot (hAll)
+        // Approximate local gain for plotting purposes only
+        double gW_local = std::sqrt(finalSlope);
+        double gR_local = 1.0 / gW_local;
+        gainW[id][ring][wedge] = gW_local;
+        gainR[id][ring][wedge] = gR_local;
+        gainValid[id][ring][wedge] = true;
+
+        // 2. Write to File for Minimizer
+        // Format: ID Wedge Ring Slope Error
+        outFile << id << " " << wedge << " " << ring << " " << finalSlope << " " << finalSlopeErr << std::endl;
+
+        // 3. Benchmark Info
+        benchFile << id << " " << wedge << " " << ring << " " 
+                  << finalSlope << " " << finalSlopeErr << std::endl;
+    }
+
+    outFile.close();
+    benchFile.close();
+    std::cout << "Gain matching with Errors complete." << std::endl;
+
+    // Plotting the corrected data (Visual check using local approx gains)
+    for (auto &kv : dataPoints)
+    {
+        int id, ring, wedge;
+        std::tie(id, ring, wedge) = kv.first;
+        if (!gainValid[id][ring][wedge]) continue;
+        auto &pts = kv.second;
+        for (auto &pr : pts)
+        {
+            double corrWedge = pr.first * gainW[id][ring][wedge];
+            double corrRing = pr.second * gainR[id][ring][wedge];
+            plotter->Fill2D("hAll", 4000, 0, 16000, 4000, 0, 16000, corrWedge, corrRing);
+        }
+    }
+
+    plotter->FlushToDisk();
+}

GainMatchQQQ.h

@@ -0,0 +1,114 @@
+#ifndef GainMatchQQQ_h
+#define GainMatchQQQ_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TFile.h>
+#include <TSelector.h>
+
+#include "Armory/ClassDet.h"
+
+class GainMatchQQQ : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+// Fixed size dimensions of array or collections stored in the TTree if any.
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+
+   GainMatchQQQ(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~GainMatchQQQ() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(GainMatchQQQ,0);
+};
+
+#endif
+
+#ifdef GainMatchQQQ_cxx
+void GainMatchQQQ::Init(TTree *tree){
+
+   // Set branch addresses and branch pointers
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+   fChain->SetBranchAddress("qqqMulti", &qqq.multi, &b_qqqMulti);
+   fChain->SetBranchAddress("qqqID",    &qqq.id, &b_qqqID);
+   fChain->SetBranchAddress("qqqCh",    &qqq.ch, &b_qqqCh);
+   fChain->SetBranchAddress("qqqE",     &qqq.e, &b_qqqE);
+   fChain->SetBranchAddress("qqqT",     &qqq.t, &b_qqqT);
+   fChain->SetBranchAddress("pcMulti",  &pc.multi, &b_pcMulti);
+   fChain->SetBranchAddress("pcID",     &pc.id, &b_pcID);
+   fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
+   fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
+   fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+
+}
+
+Bool_t GainMatchQQQ::Notify(){
+
+   return kTRUE;
+}
+
+void GainMatchQQQ::SlaveBegin(TTree * /*tree*/){
+
+   TString option = GetOption();
+
+}
+
+void GainMatchQQQ::SlaveTerminate(){
+
+}
+
+
+#endif // #ifdef GainMatchQQQ_cxx

GainMatchSX3.C

@@ -0,0 +1,432 @@
+#define GainMatchSX3_cxx
+
+#include "GainMatchSX3.h"
+#include <TH2.h>
+#include <TF1.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+#include <TCutG.h>
+#include <fstream>
+#include <utility>
+#include <algorithm>
+#include <TProfile.h>
+#include "Armory/ClassSX3.h"
+#include "Armory/HistPlotter.h"
+#include <TGraphErrors.h>
+#include "TVector3.h"
+
+TH2F *hSX3FvsB;
+TH2F *hSX3FvsB_g;
+TH2F *hsx3IndexVE;
+TH2F *hsx3IndexVE_g;
+TH2F *hSX3;
+TH2F *hsx3Coin;
+
+int padID = 0;
+
+SX3 sx3_contr;
+TCutG *cut;
+TCutG *cut1;
+std::map<std::tuple<int, int, int, int>, std::vector<std::tuple<double, double, double>>> dataPoints;
+std::map<std::tuple<int, int, int, int>, int> comboCounts;
+
+const int MAX_DET = 24;
+const int MAX_UP = 4;
+const int MAX_DOWN = 4;
+const int MAX_BK = 4;
+
+double frontGainUp[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+double frontGainDown[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+bool frontGainValid[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{false}}}};
+TCanvas c("canvas", "canvas", 800, 600);
+
+// ==== Configuration Flags ====
+const bool interactiveMode = true; // If true: show canvas + wait for user
+const bool verboseFit = true;      // If true: print fit summary and chi²
+const bool drawCanvases = true;    // If false: canvases won't be drawn at all
+
+// HistPlotter plotter("SX3GainMatchBack.root");
+
+void GainMatchSX3::Begin(TTree * /*tree*/)
+{
+    TString option = GetOption();
+
+    hSX3FvsB = new TH2F("hSX3FvsB", "SX3 Front vs Back; Front E; Back E", 400, 0, 16000, 400, 0, 16000);
+    hSX3FvsB_g = new TH2F("hSX3FvsB_g", "SX3 Front vs Back; Front E; Back E", 400, 0, 16000, 400, 0, 16000);
+    hsx3IndexVE = new TH2F("hsx3IndexVE", "SX3 index vs Energy; sx3 index ; Energy", 24 * 12, 0, 24 * 12, 400, 0, 5000);
+    hsx3IndexVE_g = new TH2F("hsx3IndexVE_g", "SX3 index vs Energy; sx3 index ; Energy", 24 * 12, 0, 24 * 12, 400, 0, 5000);
+    hSX3 = new TH2F("hSX3", "SX3 Front v Back; Fronts; Backs", 8, 0, 8, 4, 0, 4);
+
+    hsx3Coin = new TH2F("hsx3Coin", "SX3 Coincident", 24 * 12, 0, 24 * 12, 24 * 12, 0, 24 * 12);
+
+    sx3_contr.ConstructGeo();
+
+    // Load the TCutG object
+    TFile *cutFile = TFile::Open("sx3cut.root");
+    if (!cutFile || cutFile->IsZombie())
+    {
+        std::cerr << "Error: Could not open sx3cut.root" << std::endl;
+        return;
+    }
+    cut = dynamic_cast<TCutG *>(cutFile->Get("sx3cut"));
+    if (!cut)
+    {
+        std::cerr << "Error: Could not find TCutG named 'sx3cut' in sx3cut.root" << std::endl;
+        return;
+    }
+    cut->SetName("sx3cut"); // Ensure the cut has the correct name
+
+    // Load the TCutG object
+    TFile *cutFile1 = TFile::Open("UvD.root");
+    bool cut1Loaded = (cut1 != nullptr);
+    cut1 = dynamic_cast<TCutG *>(cutFile1->Get("UvD"));
+    if (!cut1)
+    {
+        std::cerr << "Error: Could not find TCutG named 'UvD' in UvD.root" << std::endl;
+        return;
+    }
+    cut1->SetName("UvD");
+
+    // plotter.ReadCuts("cuts.txt");
+
+    std::string filename = "sx3_GainMatchfront.txt";
+    // std::string filename = "sx3_GainMatchfront.txt";
+
+    std::ifstream infile(filename);
+    if (!infile.is_open())
+    {
+        std::cerr << "Error opening " << filename << "!" << std::endl;
+        return;
+    }
+
+    int id, bk, u, d;
+    double gainup, gaindown;
+    while (infile >> id >> bk >> u >> d >> gainup >> gaindown)
+    {
+        frontGainUp[id][bk][u][d] = gainup;
+        frontGainDown[id][bk][u][d] = gaindown;
+        frontGainValid[id][bk][u][d] = true;
+        if(frontGainValid[id][bk][u][d]) {
+            // std::cout << "Loaded front gain for Det" << id << " Bk" << bk << " U" << u << " D" << d
+            //           << ": Up=" << gainup << ", Down=" << gaindown << std::endl;
+        }
+        else {
+            std::cout << "No valid front gain for Det" << id << " Bk" << bk << " U" << u << " D" << d << std::endl;
+        }
+    }
+}
+
+Bool_t GainMatchSX3::Process(Long64_t entry)
+{
+
+    b_sx3Multi->GetEntry(entry);
+    b_sx3ID->GetEntry(entry);
+    b_sx3Ch->GetEntry(entry);
+    b_sx3E->GetEntry(entry);
+    b_sx3T->GetEntry(entry);
+    b_qqqMulti->GetEntry(entry);
+    b_qqqID->GetEntry(entry);
+    b_qqqCh->GetEntry(entry);
+    b_qqqE->GetEntry(entry);
+    b_qqqT->GetEntry(entry);
+    b_pcMulti->GetEntry(entry);
+    b_pcID->GetEntry(entry);
+    b_pcCh->GetEntry(entry);
+    b_pcE->GetEntry(entry);
+    b_pcT->GetEntry(entry);
+
+    sx3.CalIndex();
+    qqq.CalIndex();
+    pc.CalIndex();
+
+    std::vector<std::pair<int, int>> ID;
+    for (int i = 0; i < sx3.multi; i++)
+    {
+
+        // for (int j = i + 1; j < sx3.multi; j++)
+        // {
+        //     if (sx3.id[i] == 3)
+        //         hsx3Coin->Fill(sx3.index[i], sx3.index[j]);
+        // }
+        if (sx3.e[i] > 100)
+        {
+            ID.push_back(std::pair<int, int>(sx3.id[i], i));
+            hsx3IndexVE->Fill(sx3.index[i], sx3.e[i]);
+        }
+    }
+
+    if (ID.size() > 0)
+    {
+        std::sort(ID.begin(), ID.end(), [](const std::pair<int, int> &a, const std::pair<int, int> &b)
+                  { return a.first < b.first; });
+
+        // start with the first entry in the sorted array: channels that belong to the same detector are together in sequenmce
+        std::vector<std::pair<int, int>> sx3ID;
+        sx3ID.push_back(ID[0]);
+        bool found = false;
+
+        for (size_t i = 1; i < ID.size(); i++)
+        { // Check if id of i belongs to the same detector and then add it to the detector ID vector
+            if (ID[i].first == sx3ID.back().first)
+            { // count the nunmber of hits that belong to the same detector
+                sx3ID.push_back(ID[i]);
+
+                if (sx3ID.size() >= 3)
+                {
+                    found = true;
+                }
+            }
+            else
+            { // the next event does not belong to the same detector, abandon the first event and continue with the next one
+                if (!found)
+                {
+                    sx3ID.clear();
+                    sx3ID.push_back(ID[i]);
+                }
+            }
+        }
+
+        if (found)
+        {
+            int sx3ChUp = -1, sx3ChDn = -1, sx3ChBk = -1;
+            float sx3EUp = 0.0, sx3EDn = 0.0, sx3EBk = 0.0;
+
+            // Build the correlated set once
+            for (size_t i = 0; i < sx3ID.size(); i++)
+            {
+                if (sx3.e[i] > 100)
+                {
+                    int index = sx3ID[i].second;
+                    if (sx3.ch[index] < 8)
+                    {
+                        if (sx3.ch[index] % 2 == 0)
+                        { 
+                            sx3ChDn = sx3.ch[index];
+                            sx3EDn = sx3.e[index];
+                            //
+                        }
+                        else
+                        {
+                            sx3ChUp = sx3.ch[index];
+                            sx3EUp = sx3.e[index];
+                        }
+                    }
+                    else
+                    {
+                        sx3ChBk = sx3.ch[index] - 8;
+                        sx3EBk = sx3.e[index];
+                    }
+                }
+                
+            }
+            // Only if we found all three channels do we proceed
+            if (sx3ChUp >= 0 && sx3ChDn >= 0 && sx3ChBk >= 0)
+            {
+                // Fill once per correlated set
+                hSX3->Fill(sx3ChDn + 4, sx3ChBk);
+                hSX3->Fill(sx3ChUp, sx3ChBk);
+                hSX3FvsB->Fill(sx3EUp + sx3EDn, sx3EBk);
+                
+                if (frontGainValid[sx3ID[0].first][sx3ChBk][sx3ChUp / 2][sx3ChDn / 2])
+                {
+                    sx3EUp *= frontGainUp[sx3ID[0].first][sx3ChBk][sx3ChUp / 2][sx3ChDn / 2];
+                    sx3EDn *= frontGainDown[sx3ID[0].first][sx3ChBk][sx3ChUp / 2][sx3ChDn / 2];
+                }
+                else
+                {
+                    // printf("No front gain for Det%d Bk%d U%d D%d\n", sx3ID[0].first, sx3ChBk, sx3ChUp / 2, sx3ChDn / 2);
+                    sx3EUp = sx3EDn = 0.;
+                }
+                // plotter.Fill2D("hSX3F", 400, 0, 16000, 400, 0, 16000, sx3EUp + sx3EDn, sx3EBk);
+
+                // Pick detector ID from one of the correlated hits (all same detector)
+                int detID = sx3ID[0].first;
+
+                TString histName = Form("hSX3FVB_id%d_U%d_D%d_B%d", detID, sx3ChUp, sx3ChDn, sx3ChBk);
+                TString histName1 = Form("UnCorr_id%d_U%d-D%dvsB%d", detID, sx3ChUp, sx3ChDn, sx3ChBk);
+
+                TH2F *hist2d = (TH2F *)gDirectory->Get(histName);
+                TH2F *hist2d1 = (TH2F *)gDirectory->Get(histName1);
+                if (!hist2d)
+                {
+                    hist2d = new TH2F(histName, histName,
+                                      400, 0, 16000, 400, 0, 16000);
+                }
+                if (!hist2d1)
+                {
+                    hist2d1 = new TH2F(histName1, histName1,
+                                       800, -1, 1, 800, 0, 4000);
+                }
+
+                if (sx3EBk > 100 || sx3EUp > 100 || sx3EDn > 100)
+                {
+                    hSX3FvsB_g->Fill(sx3EUp + sx3EDn, sx3EBk);
+
+                    // Use the correlated triplet directly
+                    dataPoints[{detID, sx3ChBk, sx3ChUp, sx3ChDn}]
+                        .emplace_back(sx3EBk, sx3EUp, sx3EDn);
+                }
+
+                hist2d->Fill(sx3EUp + sx3EDn, sx3EBk);
+                hist2d1->Fill((sx3EUp - sx3EDn) / (sx3EUp + sx3EDn), sx3EBk);
+            }
+        }
+    }
+
+    return kTRUE;
+}
+
+const double GAIN_ACCEPTANCE_THRESHOLD = 0.3;
+void GainMatchSX3::Terminate()
+{
+    double backSlope[MAX_DET][MAX_BK] = {{0}};
+    bool backSlopeValid[MAX_DET][MAX_BK] = {{false}};
+
+    std::ofstream outFile("sx3_BackGains0.txt");
+    if (!outFile.is_open())
+    {
+        std::cerr << "Error opening sx3_BackGains.txt for writing!" << std::endl;
+        return;
+    }
+
+    // === Gain fit: (Up+Dn) vs Back, grouped by [id][bk] ===
+    for (int id = 0; id < MAX_DET; id++)
+    {
+        for (int bk = 0; bk < MAX_BK; bk++)
+        {
+            std::vector<double> bkE, udE;
+
+            // Collect all (Up+Dn, Back) for this id,bk
+            for (const auto &kv : dataPoints)
+            {
+                auto [cid, cbk, u, d] = kv.first;
+                if (cid != id || cbk != bk)
+                    continue;
+
+                for (const auto &pr : kv.second)
+                {
+                    double eBk, eUp, eDn;
+                    std::tie(eBk, eUp, eDn) = pr;
+                    if ((eBk < 100) || (eUp < 100) || (eDn < 100))
+                        continue;
+
+                    bkE.push_back(eBk);
+                    udE.push_back(eUp + eDn);
+                }
+            }
+
+            if (bkE.size() < 5)
+                continue; // not enough statistics
+
+            // Build graph with errors
+            const double fixedError = 0.0;                      // ADC channels
+            std::vector<double> exVals(udE.size(), 0.0);        // no x error
+            std::vector<double> eyVals(udE.size(), fixedError); // constant y error
+
+            TGraphErrors g(udE.size(), udE.data(), bkE.data(),
+                           exVals.data(), eyVals.data());
+
+            TF1 f("f", "[0]*x", 0, 16000);
+            // f.SetParameter(0, 1.0); // initial slope
+
+            if (drawCanvases)
+            {
+                g.SetTitle(Form("Detector %d Back %d: (Up+Dn) vs Back", id, bk));
+                g.SetMarkerStyle(20);
+                g.SetMarkerColor(kBlue);
+                g.Draw("AP");
+
+                g.Fit(&f, interactiveMode ? "Q" : "QNR");
+
+                if (verboseFit)
+                {
+                    double chi2 = f.GetChisquare();
+                    int ndf = f.GetNDF();
+                    double reducedChi2 = (ndf != 0) ? chi2 / ndf : -1;
+
+                    std::cout << Form("Det%d Back%d → Slope: %.4f | χ²/ndf = %.2f/%d = %.2f",
+                                      id, bk, f.GetParameter(0), chi2, ndf, reducedChi2)
+                              << std::endl;
+                }
+
+                if (interactiveMode)
+                {
+                    c.Update();
+                    gPad->WaitPrimitive();
+                }
+                else
+                {
+                    c.Close();
+                }
+            }
+            else
+            {
+                g.Fit(&f, "QNR");
+            }
+
+            double slope = 1 / f.GetParameter(0);
+            if (std::abs(slope - 1.0) < 0.3) // sanity check
+            {
+                backSlope[id][bk] = slope;
+                backSlopeValid[id][bk] = true;
+                outFile << id << " " << bk << " " << slope << "\n";
+                printf("Back slope Det%d Bk%d → %.4f\n", id, bk, slope);
+            }
+            else
+            {
+                std::cerr << "Warning: Bad slope for Det" << id << " Bk" << bk
+                          << " slope=" << slope << std::endl;
+            }
+        }
+    }
+
+    outFile.close();
+    std::cout << "Back gain matching complete." << std::endl;
+
+    // === Create histograms ===
+    TH2F *hFVB = new TH2F("hFVB", "Corrected Up+Dn vs Corrected Back;Up+Dn E;Corrected Back E",
+                          600, 0, 16000, 600, 0, 16000);
+    TH2F *hAsym = new TH2F("hAsym", "Up vs Dn divide corrected back;Up/Back E;Dn/Back E",
+                           400, 0.0, 1.0, 400, 0.0, 1.0);
+    TH2F *hAsymUnorm = new TH2F("hAsymUnorm", "Up vs Dn;Up E;Dn E",
+                                800, 0.0, 4000.0, 800, 0.0, 4000.0);
+
+    // Fill histograms using corrected back energies
+    for (const auto &kv : dataPoints)
+    {
+        auto [id, bk, u, d] = kv.first;
+        if (!backSlopeValid[id][bk])
+            continue;
+
+        double slope = backSlope[id][bk];
+
+        for (const auto &pr : kv.second)
+        {
+            double eBk, eUp, eDn;
+            std::tie(eBk, eUp, eDn) = pr;
+
+            double updn = eUp + eDn;
+            if (updn == 0 || eBk == 0)
+                continue;
+
+            double correctedBack = eBk * slope;
+            double asym = (eUp - eDn) / updn;
+
+            hFVB->Fill(updn, correctedBack);
+            hAsym->Fill(eUp / correctedBack, eDn / correctedBack);
+            hAsymUnorm->Fill(eUp, eDn);
+            TString histNamex = Form("CorrBack_id%d_U%d-D%dvsB%d", id, u, d, bk);
+
+            TH2F *hist2dx = (TH2F *)gDirectory->Get(histNamex);
+            if (!hist2dx)
+            {
+                hist2dx = new TH2F(histNamex, histNamex,
+                                   800, -1, 1, 800, 0, 4000);
+            }
+
+            hist2dx->Fill((eUp - eDn) / (eUp + eDn), correctedBack);
+        }
+    }
+    // plotter.FlushToDisk();
+}

GainMatchSX3.h

@@ -0,0 +1,114 @@
+#ifndef GainMatchSX3_h
+#define GainMatchSX3_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TFile.h>
+#include <TSelector.h>
+
+#include "Armory/ClassDet.h"
+
+class GainMatchSX3 : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+// Fixed size dimensions of array or collections stored in the TTree if any.
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+
+   GainMatchSX3(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~GainMatchSX3() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(GainMatchSX3,0);
+};
+
+#endif
+
+#ifdef GainMatchSX3_cxx
+void GainMatchSX3::Init(TTree *tree){
+
+   // Set branch addresses and branch pointers
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+   fChain->SetBranchAddress("qqqMulti", &qqq.multi, &b_qqqMulti);
+   fChain->SetBranchAddress("qqqID",    &qqq.id, &b_qqqID);
+   fChain->SetBranchAddress("qqqCh",    &qqq.ch, &b_qqqCh);
+   fChain->SetBranchAddress("qqqE",     &qqq.e, &b_qqqE);
+   fChain->SetBranchAddress("qqqT",     &qqq.t, &b_qqqT);
+   fChain->SetBranchAddress("pcMulti",  &pc.multi, &b_pcMulti);
+   fChain->SetBranchAddress("pcID",     &pc.id, &b_pcID);
+   fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
+   fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
+   fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+
+}
+
+Bool_t GainMatchSX3::Notify(){
+
+   return kTRUE;
+}
+
+void GainMatchSX3::SlaveBegin(TTree * /*tree*/){
+
+   TString option = GetOption();
+
+}
+
+void GainMatchSX3::SlaveTerminate(){
+
+}
+
+
+#endif // #ifdef GainMatchSX3_cxx

GainMatchSX3Front.C

@@ -0,0 +1,420 @@
+#define GainMatchSX3Front_cxx
+
+#include "GainMatchSX3Front.h"
+#include <TH2.h>
+#include <TF1.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+#include <TCutG.h>
+#include <fstream>
+#include <utility>
+#include <algorithm>
+#include <TProfile.h>
+#include "Armory/ClassSX3.h"
+#include "TGraphErrors.h"
+#include "TMultiDimFit.h"
+
+#include "TVector3.h"
+
+TH2F *hSX3FvsB;
+TH2F *hSX3FvsB_g;
+TH2F *hsx3IndexVE;
+TH2F *hsx3IndexVE_g;
+TH2F *hSX3;
+TH2F *hsx3Coin;
+
+int padID = 0;
+
+SX3 sx3_contr;
+TCutG *cut;
+TCutG *cut1;
+std::map<std::tuple<int, int, int, int>, std::vector<std::tuple<double, double, double>>> dataPoints;
+TCanvas c(Form("canvas"), "Fit", 800, 600);
+
+// Gain arrays
+
+const int MAX_DET = 24;
+const int MAX_UP = 4;
+const int MAX_DOWN = 4;
+const int MAX_BK = 4;
+double backGain[MAX_DET][MAX_BK] = {{0}};
+bool backGainValid[MAX_DET][MAX_BK] = {{false}};
+double frontGain[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+bool frontGainValid[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{false}}}};
+double uvdslope[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+// ==== Configuration Flags ====
+const bool interactiveMode = true; // If true: show canvas + wait for user
+const bool verboseFit = true;      // If true: print fit summary and chi²
+const bool drawCanvases = true;    // If false: canvases won't be drawn at all
+
+void GainMatchSX3Front::Begin(TTree * /*tree*/)
+{
+    TString option = GetOption();
+
+    hSX3FvsB = new TH2F("hSX3FvsB", "SX3 Front vs Back; Front E; Back E", 800, 0, 16000, 800, 0, 16000);
+    hSX3FvsB_g = new TH2F("hSX3FvsB_g", "SX3 Front vs Back; Front E; Back E", 800, 0, 16000, 800, 0, 16000);
+    hsx3IndexVE = new TH2F("hsx3IndexVE", "SX3 index vs Energy; sx3 index ; Energy", 24 * 12, 0, 24 * 12, 400, 0, 5000);
+    hsx3IndexVE_g = new TH2F("hsx3IndexVE_g", "SX3 index vs Energy; sx3 index ; Energy", 24 * 12, 0, 24 * 12, 400, 0, 5000);
+    hSX3 = new TH2F("hSX3", "SX3 Front v Back; Fronts; Backs", 8, 0, 8, 4, 0, 4);
+
+    hsx3Coin = new TH2F("hsx3Coin", "SX3 Coincident", 24 * 12, 0, 24 * 12, 24 * 12, 0, 24 * 12);
+
+    sx3_contr.ConstructGeo();
+
+    // Load the TCutG object
+    TFile *cutFile = TFile::Open("sx3cut.root");
+    bool cutLoaded = (cut != nullptr);
+    cut = dynamic_cast<TCutG *>(cutFile->Get("sx3cut"));
+    if (!cut)
+    {
+        std::cerr << "Error: Could not find TCutG named 'sx3cut' in sx3cut.root" << std::endl;
+        return;
+    }
+    cut->SetName("sx3cut"); // Ensure the cut has the correct name
+
+    // Load the TCutG object
+    TFile *cutFile1 = TFile::Open("UvD.root");
+    bool cut1Loaded = (cut1 != nullptr);
+    cut1 = dynamic_cast<TCutG *>(cutFile1->Get("UvD"));
+    if (!cut1)
+    {
+        std::cerr << "Error: Could not find TCutG named 'UvD' in UvD.root" << std::endl;
+        return;
+    }
+    cut1->SetName("UvD");
+
+    std::string filename = "sx3_BackGains.txt";
+
+    std::ifstream infile(filename);
+    if (!infile.is_open())
+    {
+        std::cerr << "Error opening " << filename << "!" << std::endl;
+        return;
+    }
+
+    int id, bk;
+    double gain;
+    while (infile >> id >> bk >> gain)
+    {
+        backGain[id][bk] = gain;
+        if (backGain[id][bk] > 0)
+            backGainValid[id][bk] = true;
+        else
+            backGainValid[id][bk] = false;
+    }
+
+    SX3 sx3_contr;
+}
+
+Bool_t GainMatchSX3Front::Process(Long64_t entry)
+{
+
+    b_sx3Multi->GetEntry(entry);
+    b_sx3ID->GetEntry(entry);
+    b_sx3Ch->GetEntry(entry);
+    b_sx3E->GetEntry(entry);
+    b_sx3T->GetEntry(entry);
+
+    sx3.CalIndex();
+
+    std::vector<std::pair<int, int>> ID;
+    for (int i = 0; i < sx3.multi; i++)
+    {
+
+        for (int j = i + 1; j < sx3.multi; j++)
+        {
+            // if (sx3.id[i] == 3)
+            hsx3Coin->Fill(sx3.index[i], sx3.index[j]);
+        }
+        if (sx3.e[i] > 100)
+        {
+            ID.push_back(std::pair<int, int>(sx3.id[i], i));
+            hsx3IndexVE->Fill(sx3.index[i], sx3.e[i]);
+        }
+    }
+
+    if (ID.size() > 0)
+    {
+        std::sort(ID.begin(), ID.end(), [](const std::pair<int, int> &a, const std::pair<int, int> &b)
+                  { return a.first < b.first; });
+
+        // start with the first entry in the sorted array: channels that belong to the same detector are together in sequenmce
+        std::vector<std::pair<int, int>> sx3ID;
+        sx3ID.push_back(ID[0]);
+        bool found = false;
+
+        for (size_t i = 1; i < ID.size(); i++)
+        { // Check if id of i belongs to the same detector and then add it to the detector ID vector
+            if (ID[i].first == sx3ID.back().first)
+            { // count the nunmber of hits that belong to the same detector
+                sx3ID.push_back(ID[i]);
+
+                if (sx3ID.size() >= 3)
+                {
+                    found = true;
+                }
+            }
+            else
+            { // the next event does not belong to the same detector, abandon the first event and continue with the next one
+                if (!found)
+                {
+                    sx3ID.clear();
+                    sx3ID.push_back(ID[i]);
+                }
+            }
+        }
+
+        if (found)
+        {
+            int sx3ChUp = -1, sx3ChDn = -1, sx3ChBk = -1;
+            float sx3EUp = 0.0, sx3EDn = 0.0, sx3EBk = 0.0;
+
+            for (size_t i = 0; i < sx3ID.size(); i++)
+            {
+                int index = sx3ID[i].second;
+                // Check the channel number and assign it to the appropriate channel type
+                if (sx3.ch[index] < 8)
+                {
+                    if (sx3.ch[index] % 2 == 0)
+                    {
+                        sx3ChDn = sx3.ch[index] / 2;
+                        sx3EDn = sx3.e[index];
+                    }
+                    else
+                    {
+                        sx3ChUp = sx3.ch[index] / 2;
+                        sx3EUp = sx3.e[index];
+                    }
+                }
+                else
+                {
+                    sx3ChBk = sx3.ch[index] - 8;
+                    // if (sx3ChBk == 2)
+                    //     printf("Found back channel Det %d Back %d \n", sx3.id[index], sx3ChBk);
+                    sx3EBk = sx3.e[index];
+                }
+            }
+
+            for (int i = 0; i < sx3.multi; i++)
+            {
+                // If we have a valid front and back channel, fill the histograms
+                hSX3->Fill(sx3ChDn + 4, sx3ChBk);
+                hSX3->Fill(sx3ChUp, sx3ChBk);
+
+                // Fill the histogram for the front vs back
+                hSX3FvsB->Fill(sx3EUp + sx3EDn, sx3EBk);
+
+                if (sx3.e[i] > 100 && sx3.id[i] == 3)
+                {
+                    // back gain correction
+
+                    // Fill the histogram for the front vs back with gain correction
+                    // hSX3FvsB_g->Fill(sx3EUp + sx3EDn, sx3EBk);
+                    // // Fill the index vs energy histogram
+                    // hsx3IndexVE_g->Fill(sx3.index[i], sx3.e[i]);
+                    // }
+                    // {
+                    TString histName = Form("hSX3FVB_id%d_U%d_D%d_B%d", sx3.id[i], sx3ChUp, sx3ChDn, sx3ChBk);
+                    TH2F *hist2d = (TH2F *)gDirectory->Get(histName);
+                    if (!hist2d)
+                    {
+                        hist2d = new TH2F(histName, Form("hSX3FVB_id%d_U%d_D%d_B%d", sx3.id[i], sx3ChUp, sx3ChDn, sx3ChBk), 400, 0, 16000, 400, 0, 16000);
+                    }
+
+                    // if (sx3ChBk == 2)
+                    //     printf("Found back channel Det %d Back %d \n", sx3.id[i], sx3ChBk);
+                    hsx3IndexVE_g->Fill(sx3.index[i], sx3.e[i]);
+                    hSX3FvsB_g->Fill(sx3EUp + sx3EDn, sx3EBk);
+
+                    hist2d->Fill(sx3EUp + sx3EDn, sx3EBk);
+
+                    if (cut && cut->IsInside(sx3EUp + sx3EDn, sx3EBk) && cut1 && cut1->IsInside(sx3EUp / sx3EBk, sx3EDn / sx3EBk))
+                    {
+
+                        if (backGainValid[sx3.id[i]][sx3ChBk])
+                        {
+                            sx3EBk *= backGain[sx3.id[i]][sx3ChBk];
+                        }
+                        // Accumulate data for gain matching
+                        dataPoints[{sx3.id[i], sx3ChBk, sx3ChUp, sx3ChDn}].emplace_back(sx3EBk, sx3EUp, sx3EDn);
+                    }
+                }
+            }
+        }
+    }
+
+    return kTRUE;
+}
+
+void GainMatchSX3Front::Terminate()
+{
+
+    std::map<std::tuple<int, int, int, int>, TVectorD> fitCoefficients;
+
+    // === Gain matching ===
+
+    std::ofstream outFile("sx3_GainMatchfront.txt");
+    if (!outFile.is_open())
+    {
+        std::cerr << "Error opening output file!" << std::endl;
+        return;
+    }
+
+    TH2F *hUvD = new TH2F("hUvD", " UvD; Up/CorrBack; Down/CorrBack", 600, 0, 1, 600, 0, 1);
+
+    for (const auto &kv : dataPoints)
+    {
+        auto [id, bk, u, d] = kv.first;
+        const auto &pts = kv.second;
+
+        if (pts.size() < 50)
+            continue;
+
+        std::vector<double> uE, dE, udE, corrBkE;
+
+        for (const auto &pr : pts)
+        {
+            double eBkCorr, eUp, eDn;
+            std::tie(eBkCorr, eUp, eDn) = pr;
+            if ((eBkCorr < 100) || (eUp < 100) || (eDn < 100))
+                continue; // Skip if any energy is zero
+            uE.push_back(eUp / eBkCorr);
+            dE.push_back(eDn / eBkCorr);
+            udE.push_back(eUp + eDn);
+            corrBkE.push_back(eBkCorr);
+            hUvD->Fill(eUp / eBkCorr, eDn / eBkCorr);
+        }
+        if (uE.size() < 5 || dE.size() < 5 || corrBkE.size() < 5)
+            continue; // Ensure we have enough points for fitting
+        // TGraph g(udE.size(), udE.data(), corrBkE.data());
+
+        // TF1 f("f", "[0]*x", 0, 20000);
+        // f.SetParameter(0, 1.0); // Initial guess for the gain
+        // g.Fit(&f, "R");
+
+        const double fixedError = 0.0; // in ADC channels
+
+        std::vector<double> xVals, yVals, exVals, eyVals;
+
+        // Build data with fixed error
+        for (size_t i = 0; i < udE.size(); ++i)
+        {
+            double x = uE[i]; // front energy
+            double y = dE[i]; // back energy
+
+            xVals.push_back(x);
+            yVals.push_back(y);
+            exVals.push_back(fixedError); // error in up energy
+            eyVals.push_back(0.);         // error in down energy
+        }
+
+        // Build TGraphErrors with errors
+        TGraphErrors g(xVals.size(), xVals.data(), yVals.data(), exVals.data(), eyVals.data());
+
+        TF1 f("f", "[0]*x+[1]", 0, 16000);
+        f.SetParameter(0, -1.0); // Initial guess
+
+        if (drawCanvases)
+        {
+            g.SetTitle(Form("Detector %d: U%d D%d B%d", id, u, d, bk));
+            g.SetMarkerStyle(20);
+            g.SetMarkerColor(kBlue);
+            g.Draw("AP");
+
+            g.Fit(&f, interactiveMode ? "Q" : "QNR"); // 'R' avoids refit, 'N' skips drawing
+
+            if (verboseFit)
+            {
+                double chi2 = f.GetChisquare();
+                int ndf = f.GetNDF();
+                double reducedChi2 = (ndf != 0) ? chi2 / ndf : -1;
+
+                std::cout << Form("Det%d U%d D%d B%d → Gain: %.4f | χ²/ndf = %.2f/%d = %.2f",
+                                  id, u, d, bk, f.GetParameter(0), chi2, ndf, reducedChi2)
+                          << std::endl;
+            }
+
+            if (interactiveMode)
+            {
+                c.Update();
+                gPad->WaitPrimitive();
+            }
+            else
+            {
+                c.Close(); // Optionally avoid clutter in batch
+            }
+        }
+        else
+        {
+            g.Fit(&f, "QNR");
+        }
+
+        double slope = f.GetParameter(0);
+        double intercept = f.GetParameter(1);   
+
+        // printf("Front gain Det%d Back%d Up%dDn%d → %.4f\n", id, bk, u, d, frontGain[id][bk][u][d]);
+        if (std::abs(slope + 1.0) < 0.3) // sanity check
+        {
+            frontGain[id][bk][u][d] = slope;
+
+            frontGainValid[id][bk][u][d] = true;
+            outFile << id << " " << bk << " " << u << " " << d << " " << TMath::Abs(slope)/intercept << " " << 1.0/intercept << std::endl;
+            printf("Back slope Det%d Bk%d → %.4f\n", id, bk, slope);
+        }
+        else
+        {
+            std::cerr << "Warning: Bad slope for Det" << id << " Bk" << bk
+                      << " slope=" << f.GetParameter(0) << std::endl;
+        }
+    }
+
+    outFile.close();
+    std::cout << "Gain matching complete." << std::endl;
+
+    // === Stage 3: Create corrected histogram ===
+    TH2F *hCorrectedFvB = new TH2F("hCorrectedFvB", "Corrected;Corrected Front Sum;Corrected Back", 800, 0, 8000, 800, 0, 8000);
+    TH2F *hCorrectedUvD = new TH2F("hCorrectedUvD", "Corrected UvD; UvD Up; UvD Down", 600, 0, 1, 600, 0, 1);
+
+    for (const auto &kv : dataPoints)
+    {
+
+        auto [id, bk, u, d] = kv.first;
+        double front;
+        if (frontGainValid[id][bk][u][d])
+            front = frontGain[id][bk][u][d];
+        else
+            continue;
+        for (const auto &pr : kv.second)
+        {
+            double eBk, eUp, eDn;
+            std::tie(eBk, eUp, eDn) = pr;
+            double corrUp = eUp * front;
+            // double corrDn = eDn * front;
+
+            hCorrectedFvB->Fill(corrUp + eDn, eBk);
+            hCorrectedUvD->Fill(corrUp / eBk, eDn / eBk);
+        }
+    }
+
+    // // === Final canvas ===
+    // gStyle->SetOptStat(1110);
+    // TCanvas *c1 = new TCanvas("c1", "Gain Correction Results", 1200, 600);
+    // c1->Divide(2, 1);
+
+    // c1->cd(1);
+    // hSX3FvsB_g->SetTitle("Before Correction (Gated)");
+    // hSX3FvsB_g->GetXaxis()->SetTitle("Measured Front Sum (E_Up + E_Dn)");
+    // hSX3FvsB_g->GetYaxis()->SetTitle("Measured Back E");
+    // hSX3FvsB_g->Draw("colz");
+
+    // c1->cd(2);
+    // hCorrectedFvB->SetTitle("After Correction");
+    // hCorrectedFvB->Draw("colz");
+    // TF1 *diag = new TF1("diag", "x", 0, 40000);
+    // diag->SetLineColor(kRed);
+    // diag->SetLineWidth(2);
+    // diag->Draw("same");
+
+    std::cout << "Terminate() completed successfully." << std::endl;
+}

GainMatchSX3Front.h

@@ -0,0 +1,104 @@
+#ifndef GainMatchSX3Front_h
+#define GainMatchSX3Front_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TFile.h>
+#include <TSelector.h>
+
+#include "Armory/ClassDet.h"
+
+class GainMatchSX3Front : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+// Fixed size dimensions of array or collections stored in the TTree if any.
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+
+   GainMatchSX3Front(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~GainMatchSX3Front() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(GainMatchSX3Front,0);
+};
+
+#endif
+
+#ifdef GainMatchSX3Front_cxx
+void GainMatchSX3Front::Init(TTree *tree){
+
+   // Set branch addresses and branch pointers
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+
+}
+
+Bool_t GainMatchSX3Front::Notify(){
+
+   return kTRUE;
+}
+
+void GainMatchSX3Front::SlaveBegin(TTree * /*tree*/){
+
+   TString option = GetOption();
+
+}
+
+void GainMatchSX3Front::SlaveTerminate(){
+
+}
+
+
+#endif // #ifdef GainMatchSX3Front_cxx

GainMatchSX3Front1.C

@@ -0,0 +1,245 @@
+#define GainMatchSX3_cxx
+
+#include "GainMatchSX3.h"
+#include "Armory/ClassSX3.h"
+#include <TFile.h>
+#include <TTree.h>
+#include <TGraph.h>
+#include <TF1.h>
+#include <TH2F.h>
+#include <TCanvas.h>
+#include <TStyle.h>
+#include <TApplication.h>
+#include <map>
+#include <vector>
+#include <tuple>
+#include <fstream>
+#include <iostream>
+#include <algorithm>
+
+// Constants
+const int MAX_DET = 24;
+const int MAX_BK = 4;
+const int MAX_UP = 4;
+const int MAX_DOWN = 4;
+
+// Gain arrays
+double backGain[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+bool backGainValid[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{false}}}};
+
+double frontGain[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{0}}}};
+bool frontGainValid[MAX_DET][MAX_BK][MAX_UP][MAX_DOWN] = {{{{false}}}};
+
+// Data container
+std::map<std::tuple<int, int, int, int>, std::vector<std::tuple<double, double, double>>> dataPoints;
+
+// Load back gains
+void LoadBackGains(const std::string &filename)
+{
+    std::ifstream infile(filename);
+    if (!infile.is_open())
+    {
+        std::cerr << "Error opening " << filename << "!" << std::endl;
+        return;
+    }
+
+    int id, bk, u, d;
+    double gain;
+    while (infile >> id >> bk >> u >> d >> gain)
+    {
+        backGain[id][bk][u][d] = gain;
+        backGainValid[id][bk][u][d] = true;
+    }
+
+    infile.close();
+    std::cout << "Loaded back gains from " << filename << std::endl;
+    SX3 sx3_contr;
+}
+
+// Front gain matching function
+Bool_t GainMatchSX3::Process(Long64_t entry)
+{
+    // Link SX3 branches
+    
+    b_sx3Multi->GetEntry(entry);
+    b_sx3ID->GetEntry(entry);
+    b_sx3Ch->GetEntry(entry);
+    b_sx3E->GetEntry(entry);
+    b_sx3T->GetEntry(entry);
+
+    sx3.CalIndex();
+
+    Long64_t nentries = tree->GetEntries(Long64_t entry);
+    std::cout << "Total entries: " << nentries << std::endl;
+
+    TH2F *hBefore = new TH2F("hBefore", "Before Correction;E_Up+E_Dn;Back Energy", 400, 0, 40000, 400, 0, 40000);
+    TH2F *hAfter = new TH2F("hAfter", "After Correction;E_Up+E_Dn;Corrected Back Energy", 400, 0, 40000, 400, 0, 40000);
+
+    for (Long64_t entry = 0; entry < nentries; ++entry)
+    {
+        tree->GetEntry(entry);
+        sx3.CalIndex();
+
+        std::vector<std::pair<int, int>> ID;
+
+        for (int i = 0; i < sx3.multi; i++)
+        {
+            if (sx3.e[i] > 100)
+            {
+                ID.push_back({sx3.id[i], i});
+            }
+        }
+
+        if (ID.empty())
+            continue;
+
+        // Sort by id
+        std::sort(ID.begin(), ID.end(), [](auto &a, auto &b) { return a.first < b.first; });
+
+        std::vector<std::pair<int, int>> sx3ID;
+        sx3ID.push_back(ID[0]);
+        bool found = false;
+
+        for (size_t i = 1; i < ID.size(); i++)
+        {
+            if (ID[i].first == sx3ID.back().first)
+            {
+                sx3ID.push_back(ID[i]);
+                if (sx3ID.size() >= 3)
+                    found = true;
+            }
+            else if (!found)
+            {
+                sx3ID.clear();
+                sx3ID.push_back(ID[i]);
+            }
+        }
+
+        if (!found)
+            continue;
+
+        int sx3ChUp = -1, sx3ChDn = -1, sx3ChBk = -1;
+        float sx3EUp = 0.0, sx3EDn = 0.0, sx3EBk = 0.0;
+        int sx3id = sx3ID[0].first;
+
+        for (auto &[id, idx] : sx3ID)
+        {
+            if (sx3.ch[idx] < 8)
+            {
+                if (sx3.ch[idx] % 2 == 0)
+                {
+                    sx3ChDn = sx3.ch[idx] / 2;
+                    sx3EDn = sx3.e[idx];
+                }
+                else
+                {
+                    sx3ChUp = sx3.ch[idx] / 2;
+                    sx3EUp = sx3.e[idx];
+                }
+            }
+            else
+            {
+                sx3ChBk = sx3.ch[idx] - 8;
+                sx3EBk = sx3.e[idx];
+            }
+        }
+
+        if (sx3ChUp < 0 || sx3ChDn < 0 || sx3ChBk < 0)
+            continue;
+
+        if (!backGainValid[sx3id][sx3ChBk][sx3ChUp][sx3ChDn])
+            continue;
+
+        double corrBk = sx3EBk * backGain[sx3id][sx3ChBk][sx3ChUp][sx3ChDn];
+
+        hBefore->Fill(sx3EUp + sx3EDn, sx3EBk);
+        hAfter->Fill(sx3EUp + sx3EDn, corrBk);
+
+        dataPoints[{sx3id, sx3ChBk, sx3ChUp, sx3ChDn}].emplace_back(corrBk, sx3EUp, sx3EDn);
+    }
+
+    // === Fit front gains ===
+    std::ofstream outFile("sx3_GainMatchfront.txt");
+    if (!outFile.is_open())
+    {
+        std::cerr << "Error opening sx3_GainMatchfront.txt!" << std::endl;
+        return;
+    }
+
+    for (const auto &kv : dataPoints)
+    {
+        auto [id, bk, u, d] = kv.first;
+        const auto &pts = kv.second;
+
+        if (pts.size() < 5)
+            continue;
+
+        std::vector<double> udE, corrBkE;
+
+        for (const auto &pr : pts)
+        {
+            double eBkCorr, eUp, eDn;
+            std::tie(eBkCorr, eUp, eDn) = pr;
+            udE.push_back(eUp + eDn);
+            corrBkE.push_back(eBkCorr);
+        }
+
+        TGraph g(udE.size(), udE.data(), corrBkE.data());
+        TF1 f("f", "[0]*x", 0, 40000);
+        g.Fit(&f, "QNR");
+
+        frontGain[id][bk][u][d] = f.GetParameter(0);
+        frontGainValid[id][bk][u][d] = true;
+
+        outFile << id << " " << bk << " " << u << " " << d << " " << frontGain[id][bk][u][d] << std::endl;
+        printf("Front gain Det%d Back%d Up%dDn%d → %.4f\n", id, bk, u, d, frontGain[id][bk][u][d]);
+    }
+
+    outFile.close();
+    std::cout << "Front gain matching complete." << std::endl;
+
+    // === Draw diagnostic plots ===
+    gStyle->SetOptStat(1110);
+    TCanvas *c = new TCanvas("c", "Gain Matching Diagnostics", 1200, 600);
+    c->Divide(2, 1);
+
+    c->cd(1);
+    hBefore->Draw("colz");
+    TF1 *diag1 = new TF1("diag1", "x", 0, 40000);
+    diag1->SetLineColor(kRed);
+    diag1->Draw("same");
+
+    c->cd(2);
+    hAfter->Draw("colz");
+    TF1 *diag2 = new TF1("diag2", "x", 0, 40000);
+    diag2->SetLineColor(kRed);
+    diag2->Draw("same");
+}
+
+int main(int argc, char **argv)
+{
+    TApplication app("app", &argc, argv);
+
+    // Load back gains
+    LoadBackGains("sx3_GainMatchback.txt");
+
+    // Open tree
+    TFile *f = TFile::Open("input_tree.root"); // <<< Change file name
+    if (!f || f->IsZombie())
+    {
+        std::cerr << "Cannot open input_tree.root!" << std::endl;
+        return 1;
+    }
+    TTree *tree = (TTree *)f->Get("tree");
+    if (!tree)
+    {
+        std::cerr << "Tree not found!" << std::endl;
+        return 1;
+    }
+
+    // Run front gain matching
+    GainMatchSX3(tree);
+
+    app.Run();
+    return 0;
+}

MakeVertex.h

@@ -0,0 +1,132 @@
+#ifndef MakeVertex_h
+#define MakeVertex_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TApplication.h>
+#include <TFile.h>
+#include <TSelector.h>
+#include <iomanip>
+#include <vector>         // Required for vectors
+#include <utility>        // Required for std::pair
+
+#include "Armory/ClassDet.h"
+#include "Armory/ClassPW.h" // YOU ADDED THIS (Correct! Defines Coord)
+
+class MakeVertex : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+   Det misc;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+   TBranch        *b_miscMulti;   //!
+   TBranch        *b_miscID;   //!
+   TBranch        *b_miscCh;   //!
+   TBranch        *b_miscE;   //!
+   TBranch        *b_miscT;   //!
+   TBranch        *b_miscTf;   //!
+
+   // 1. Geometry Cache
+   Coord Crossover[24][24][2];
+
+   // 2. Persistent Vectors (REQUIRED for the optimized .cxx to work)
+   std::vector<std::pair<int, double>> anodeHits;
+   std::vector<std::pair<int, double>> cathodeHits;
+   std::vector<std::pair<int, double>> corrcatMax;
+   std::vector<std::pair<int, double>> corranoMax;
+   std::vector<double> cathodeTimes;
+   std::vector<double> anodeTimes;
+   
+   MakeVertex(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~MakeVertex() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(MakeVertex,0);
+};
+
+#endif
+
+#ifdef MakeVertex_cxx
+void MakeVertex::Init(TTree *tree){
+
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+   fChain->SetBranchAddress("qqqMulti", &qqq.multi, &b_qqqMulti);
+   fChain->SetBranchAddress("qqqID",    &qqq.id, &b_qqqID);
+   fChain->SetBranchAddress("qqqCh",    &qqq.ch, &b_qqqCh);
+   fChain->SetBranchAddress("qqqE",     &qqq.e, &b_qqqE);
+   fChain->SetBranchAddress("qqqT",     &qqq.t, &b_qqqT);
+   fChain->SetBranchAddress("pcMulti",  &pc.multi, &b_pcMulti);
+   fChain->SetBranchAddress("pcID",     &pc.id, &b_pcID);
+   fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
+   fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
+   fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+   fChain->SetBranchAddress("miscMulti", &misc.multi, &b_miscMulti);
+   fChain->SetBranchAddress("miscID",    &misc.id, &b_miscID);
+   fChain->SetBranchAddress("miscCh",    &misc.ch, &b_miscCh);
+   fChain->SetBranchAddress("miscE",     &misc.e, &b_miscE);
+   fChain->SetBranchAddress("miscT",     &misc.t, &b_miscT);
+}
+
+Bool_t MakeVertex::Notify(){
+   return kTRUE;
+}
+
+void MakeVertex::SlaveBegin(TTree * /*tree*/){
+   // TString option = GetOption();
+}
+
+void MakeVertex::SlaveTerminate(){
+}
+#endif // #ifdef MakeVertex_cxx

MatchAndPlotCentroids.C

@@ -0,0 +1,133 @@
+#include <fstream>
+#include <sstream>
+#include <vector>
+#include <map>
+#include <iostream>
+#include <TGraph.h>
+#include <TF1.h>
+#include <TCanvas.h>
+#include <TH1.h>
+
+
+
+void MatchAndPlotCentroids() {
+    // Open the centroid data file
+    std::ifstream inputFile("centroids.txt");
+    if (!inputFile.is_open()) {
+        std::cerr << "Error: Could not open Centroids.txt" << std::endl;
+        return;
+    }
+
+    // Data structure to store centroids by histogram and peak number
+    std::map<int, std::map<int, double>> centroidData;
+
+    // Read data from the file
+    std::string line;
+    while (std::getline(inputFile, line)) {
+        std::istringstream iss(line);
+        int histogramIndex, peakNumber;
+        double centroid;
+        if (iss >> histogramIndex >> peakNumber >> centroid) {
+            centroidData[histogramIndex][peakNumber] = centroid;
+        }
+    }
+
+    inputFile.close();
+
+    // Ensure histogram 24 exists and has data
+    if (centroidData.find(1) == centroidData.end()) {
+        std::cerr << "Error: Histogram 0 not found in the data!" << std::endl;
+        return;
+    }
+
+    // Reference centroids from histogram 24
+    const auto& referenceCentroids = centroidData[1];
+    std::ofstream outputFile("slope_intercept_results.txt");
+    if (!outputFile.is_open()) {
+        std::cerr << "Error: Could not open the output file for writing!" << std::endl;
+        return;
+    }
+    outputFile << "Histogram Number\tSlope\tIntercept\n";
+    // Loop through histograms 25 to 47
+    for (int targetHist = 0; targetHist <= 23; targetHist++) {
+        // Ensure the target histogram exists and matches in peak numbers
+        if (centroidData.find(targetHist) == centroidData.end() || centroidData[targetHist].size() != referenceCentroids.size()) {
+            //4th cnetroid data point for 19 was generated using the 3 datqa points for the slope of wires 0 and 19
+            std::cout << "Skipping Histogram " << targetHist << " due to mismatched or missing data." << std::endl;
+            continue;
+        }
+
+        // Prepare x and y values for TGraph
+        std::vector<double> xValues, yValues;
+        for (const auto& [peakNumber, refCentroid] : referenceCentroids) {
+            if (centroidData[targetHist].find(peakNumber) != centroidData[targetHist].end()) {
+                yValues.push_back(refCentroid);
+                xValues.push_back(centroidData[targetHist][peakNumber]);
+            } else {
+                std::cerr << "Warning: Peak " << peakNumber << " missing in histogram " << targetHist << std::endl;
+            }
+        }
+
+        if (xValues.size() < 3) {
+            std::cout << "Skipping Histogram " << targetHist << " as it has less than 3 matching centroids." << std::endl;
+            continue;
+        }
+
+        // Create a TGraph
+        TCanvas *c1 = new TCanvas(Form("c_centroid_1_vs_%d", targetHist), Form("Centroid 1 vs %d", targetHist), 800, 600);
+        TGraph *graph = new TGraph(xValues.size(), &xValues[0], &yValues[0]);
+        graph->SetTitle(Form("Centroid of Histogram  %d vs 1", targetHist));
+        graph->GetYaxis()->SetTitle("Centroid of Histogram 1");
+        graph->GetXaxis()->SetTitle(Form("Centroid of Histogram %d", targetHist));
+        graph->SetMarkerStyle(20); // Full circle marker
+        graph->SetMarkerSize(1.0);
+        graph->SetMarkerColor(kBlue);
+        // Draw the graph
+        graph->Draw("AP");
+        double minX = *std::min_element(xValues.begin(), xValues.end());
+        double maxX = *std::max_element(xValues.begin(), xValues.end());
+        // Fit the data with a linear function
+        TF1 *fitLine = new TF1("fitLine", "pol1", minX, maxX);  // Adjust range as needed
+	fitLine->SetLineColor(kRed); // Set the line color to distinguish it
+        fitLine->SetLineWidth(2);    // Thicker line for visibility
+        graph->Fit(fitLine, "M");
+        fitLine->Draw("same");
+        fitLine->SetParLimits(0, -10, 10); // Limit intercept between -10 and 10
+        fitLine->SetParLimits(1, 0, 2); 
+        // Extract slope and intercept
+        double slope = fitLine->GetParameter(1);
+        double intercept = fitLine->GetParameter(0);
+        outputFile << targetHist << "\t" << slope << "\t" << intercept << "\n";
+        std::cout << "Histogram 24 vs " << targetHist << ": Slope = " << slope << ", Intercept = " << intercept << std::endl;
+        std::vector<double> residuals;
+    for (size_t i = 0; i < xValues.size(); ++i) {
+        double fittedY = fitLine->Eval(xValues[i]); // Evaluate fitted function at x
+        double residual = yValues[i] - fittedY;    // Residual = observed - fitted
+        residuals.push_back(residual);
+    }
+
+    // Create a graph for the residuals
+    /*TGraph *residualGraph = new TGraph(residuals.size(), &xValues[0], &residuals[0]);
+    residualGraph->SetTitle(Form("Residuals for Histogram 24 vs %d", targetHist));
+    residualGraph->GetYaxis()->SetTitle("Residuals");
+    residualGraph->GetXaxis()->SetTitle(Form("Centroid of Histogram %d", targetHist));
+    residualGraph->SetMarkerStyle(20);
+    residualGraph->SetMarkerSize(1.0);
+    residualGraph->SetMarkerColor(kGreen);
+
+    // Draw the residuals plot below the original plot (can be on a new canvas if preferred)
+    TCanvas *c2 = new TCanvas(Form("c_residuals_24_vs_%d", targetHist), Form("Residuals for Centroid 24 vs %d", targetHist), 800, 400);
+    residualGraph->Draw("AP");*/
+        c1->Update();
+        //c2->Update();
+        std::cout << "Press Enter to continue..." << std::endl;
+        
+        //std::cin.get();
+        c1->WaitPrimitive();
+        //c2->WaitPrimitive();
+        //std::cin.get();
+        //std::cin.get();
+    }
+    outputFile.close();
+    std::cout << "Results written to slope_intercept_results.txt" << std::endl;
+}

PCGainMatch.C

@@ -0,0 +1,454 @@
+#define PCGainMatch_cxx
+
+#include "PCGainMatch.h"
+#include <TH2.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+#include <TCutG.h>
+#include <utility>
+#include <algorithm>
+#include "Armory/ClassSX3.h"
+#include "Armory/ClassPW.h"
+
+#include "TVector3.h"
+
+TH2F * hsx3IndexVE;
+TH2F * hqqqIndexVE;
+TH2F * hpcIndexVE;
+
+TH2F * hsx3Coin;
+TH2F * hqqqCoin;
+TH2F * hpcCoin;
+
+TH2F * hqqqPolar;
+TH2F * hsx3VpcIndex;
+TH2F * hqqqVpcIndex;
+TH2F * hqqqVpcE;
+TH2F * hsx3VpcE;
+TH2F * hanVScatsum;
+TH2F * hanVScatsum_a[24];
+TH2F * hanVScatsum_hcut;
+TH2F * hanVScatsum_lcut;
+TH2F * hAnodeHits;
+TH1F * hAnodeMultiplicity;
+
+
+int padID = 0;
+
+SX3 sx3_contr;
+PW pw_contr;
+TVector3 hitPos;
+bool HitNonZero;
+
+TH1F * hZProj;
+TCutG *AnCatSum_high;
+TCutG *AnCatSum_low;
+TCutG *PCCoinc_cut1;
+TCutG *PCCoinc_cut2;
+bool inCuth;
+bool inCutl;
+bool inPCCut;
+
+void PCGainMatch::Begin(TTree * /*tree*/){
+  TString option = GetOption();
+
+  hsx3IndexVE = new TH2F("hsx3IndexVE", "SX3 index vs Energy; sx3 index ; Energy",  24*12, 0,  24*12, 400, 0, 5000); hsx3IndexVE->SetNdivisions( -612, "x");
+  hqqqIndexVE = new TH2F("hqqqIndexVE", "QQQ index vs Energy; QQQ index ; Energy", 4*2*16, 0, 4*2*16, 400, 0, 5000); hqqqIndexVE->SetNdivisions( -1204, "x");
+  hpcIndexVE = new TH2F("hpcIndexVE",   "PC index vs Energy; PC index ; Energy",     2*24, 0,   2*24, 800, 0, 16000); hpcIndexVE->SetNdivisions( -1204, "x");
+
+
+  hsx3Coin = new TH2F("hsx3Coin", "SX3 Coincident",  24*12, 0,  24*12,  24*12, 0, 24*12);
+  hqqqCoin = new TH2F("hqqqCoin", "QQQ Coincident", 4*2*16, 0, 4*2*16, 4*2*16, 0, 4*2*16);
+  hpcCoin  = new TH2F("hpcCoin",  "PC Coincident",    2*24, 0,   2*24,   2*24, 0, 2*24);
+
+  hqqqPolar = new TH2F("hqqqPolar", "QQQ Polar ID", 16*4, -TMath::Pi(), TMath::Pi(),16, 10, 50);
+
+  hsx3VpcIndex = new TH2F("hsx3Vpcindex", "sx3 vs pc; sx3 index; pc index",  24*12, 0, 24*12, 48, 0, 48);
+  hsx3VpcIndex->SetNdivisions( -612, "x");
+  hsx3VpcIndex->SetNdivisions( -12, "y");
+  hqqqVpcIndex = new TH2F("hqqqVpcindex", "qqq vs pc; qqq index; pc index",  4*2*16, 0, 4*2*16, 48, 0, 48);
+  hqqqVpcIndex->SetNdivisions( -612, "x");
+  hqqqVpcIndex->SetNdivisions( -12, "y");
+
+  hqqqVpcE = new TH2F("hqqqVpcEnergy", "qqq vs pc; qqq energy; pc energy", 400, 0, 5000, 400, 0, 5000);
+  hqqqVpcE->SetNdivisions( -612, "x");
+  hqqqVpcE->SetNdivisions( -12, "y");
+  
+  hsx3VpcE = new TH2F("hsx3VpcEnergy", "sx3 vs pc; sx3 energy; pc energy", 400, 0, 5000, 400, 0, 5000);
+  hsx3VpcE->SetNdivisions( -612, "x");
+  hsx3VpcE->SetNdivisions( -12, "y");
+
+  hZProj = new TH1F("hZProj", "Nos of anodes", 20, 0, 19);
+  hAnodeHits = new TH2F("hAnodeHits", "Anode vs Anode Energy, Anode ID; Anode E", 24,0 , 23, 400, 0 , 20000);
+  hAnodeMultiplicity = new TH1F("hAnodeMultiplicity", "Number of Anodes/Event", 40, 0, 40); 
+  hanVScatsum = new TH2F("hanVScatsum", "Anode vs Cathode Sum; Anode E; Cathode E", 400,0 , 10000, 800, 0 , 16000);
+  for (int i = 0; i < 24; i++) {
+        TString histName = Form("hAnodeVsCathode_%d", i);
+        TString histTitle = Form("Anode %d vs Cathode Sum; Anode E; Cathode Sum E", i);
+        hanVScatsum_a[i] = new TH2F(histName, histTitle, 400, 0, 10000, 400, 0, 16000);
+    }
+  hanVScatsum_lcut = new TH2F("hanVScatsum_LCUT", "Anode vs Cathode Sum; Anode E; Cathode E", 400,0 , 16000, 400, 0 , 16000);
+  hanVScatsum_hcut = new TH2F("hanVScatsum_HCUT", "Anode vs Cathode Sum; Anode E; Cathode E", 400,0 , 16000, 400, 0 , 16000);
+
+  sx3_contr.ConstructGeo();
+  pw_contr.ConstructGeo();
+  // TFile *f1 = new TFile("AnCatSum_high.root");
+  // TFile *f2 = new TFile("AnCatSum_low.root");
+  // TFile *f3 = new TFile("PCCoinc_cut1.root");
+  // TFile *f4 = new TFile("PCCoinc_cut2.root");
+  // AnCatSum_high= (TCutG*)f1->Get("AnCatSum_high");
+  // AnCatSum_low= (TCutG*)f2->Get("AnCatSum_low");
+  // PCCoinc_cut1= (TCutG*)f3->Get("PCCoinc_cut1");
+  // PCCoinc_cut2= (TCutG*)f4->Get("PCCoinc_cut2");
+}
+
+
+
+
+Bool_t PCGainMatch::Process(Long64_t entry){
+// if (entry % 1000000 == 0) {
+//     std::cout << "Processing entry: " << entry << std::endl;
+// }
+  // if ( entry > 100 ) return kTRUE;
+
+  hitPos.Clear();
+  HitNonZero = false;
+
+  // if( entry > 1) return kTRUE;
+  // printf("################### ev : %llu \n", entry);
+
+  b_sx3Multi->GetEntry(entry);
+  b_sx3ID->GetEntry(entry);
+  b_sx3Ch->GetEntry(entry);
+  b_sx3E->GetEntry(entry);
+  b_sx3T->GetEntry(entry);
+  b_qqqMulti->GetEntry(entry);
+  b_qqqID->GetEntry(entry);
+  b_qqqCh->GetEntry(entry);
+  b_qqqE->GetEntry(entry);
+  b_qqqT->GetEntry(entry);
+  b_pcMulti->GetEntry(entry);
+  b_pcID->GetEntry(entry);
+  b_pcCh->GetEntry(entry);
+  b_pcE->GetEntry(entry);
+  b_pcT->GetEntry(entry);
+
+  sx3.CalIndex();
+  qqq.CalIndex();
+  pc.CalIndex();
+
+  // sx3.Print();
+
+  //########################################################### Raw data
+
+  // //======================= PC
+
+  std::vector<std::pair<int, double>> anodeHits={};
+  std::vector<std::pair<int, double>> cathodeHits={};  
+  int aID = 0;
+  int cID = 0;
+  float aE = 0;
+  float cE = 0;
+
+// Define the excluded SX3 and QQQ channels
+  // std::unordered_set<int> excludeSX3 = {34, 35, 36, 37, 61, 62, 67, 73, 74, 75, 76, 77, 78, 79, 80, 93, 97, 100, 103, 108, 109, 110, 111, 112};
+  // std::unordered_set<int> excludeQQQ = {0, 17, 109, 110, 111, 112, 113, 119, 127, 128};
+  // inCuth=false;
+  // inCutl=false;
+  // inPCCut=false;
+  for( int i = 0; i < pc.multi; i ++){
+    
+    if(pc.e[i]>50 && pc.multi<7){ 
+
+      float aESum = 0;
+      float cESum = 0;
+      if (pc.index[i] < 24 ) {
+            anodeHits.push_back(std::pair<int, double>(pc.index[i], pc.e[i]));
+        } else if (pc.index[i] >= 24) {
+            cathodeHits.push_back(std::pair<int, double>(pc.index[i], pc.e[i]));
+        }
+
+      for(int j=i+1;j<pc.multi;j++){
+        // if(PCCoinc_cut1->IsInside(pc.index[i], pc.index[j]) || PCCoinc_cut2->IsInside(pc.index[i], pc.index[j])){
+        //   // hpcCoin->Fill(pc.index[i], pc.index[j]);
+        //   inPCCut = true;
+        // }
+        hpcCoin->Fill(pc.index[i], pc.index[j]);
+      } 
+      if (anodeHits.size()==1 && cathodeHits.size() >= 1) {
+          
+          for (const auto& anode : anodeHits) {
+          // for(int l=0; l<sx3.multi; l++){
+          //   if (sx3.index[l]==80){
+
+              aID = anode.first;
+              aE = anode.second;
+              aESum += aE;
+              // printf("aID : %d, aE : %f\n", aID, aE);
+          }
+
+            // printf("aID : %d, aE : %f, cE : %f\n", aID, aE, cE);
+            for (const auto& cathode : cathodeHits) {
+              cID = cathode.first;
+              cE = cathode.second;
+              // if(cE>cEMax){
+              //   cEMax = cE;
+              //   cIDMax = cID;
+              // }
+              // if(cE>cEnextMax && cE<cEMax){
+              //   cEnextMax = cE;
+              //   cIDnextMax = cID;
+              // }
+
+              cESum += cE;
+              }
+          // }
+          
+          // inCuth = false;
+          // inCutl = false;
+          // inPCCut = false;
+          // for(int j=i+1;j<pc.multi;j++){
+          //   if(PCCoinc_cut1->IsInside(pc.index[i], pc.index[j]) || PCCoinc_cut2->IsInside(pc.index[i], pc.index[j])){
+          //     // hpcCoin->Fill(pc.index[i], pc.index[j]);
+          //     inPCCut = true;
+          //   }
+          //   hpcCoin->Fill(pc.index[i], pc.index[j]);
+          // } 
+
+          // Check if the accumulated energies are within the defined ranges
+          // if (AnCatSum_high && AnCatSum_high->IsInside(aESum, cESum)) {
+          //     inCuth = true;
+          // }
+          // if (AnCatSum_low && AnCatSum_low->IsInside(aESum, cESum)) {
+          //     inCutl = true;
+          // }
+          
+          // Fill histograms based on the cut conditions
+          // if (inCuth && inPCCut) {
+          //     hanVScatsum_hcut->Fill(aESum, cESum);
+          // }
+          // if (inCutl && inPCCut) {
+          //     hanVScatsum_lcut->Fill(aESum, cESum);
+          // }               
+            // for(auto anode : anodeHits){
+         
+              // float aE = anode.second;
+              // aESum += aE;
+              // if(inPCCut){
+            hanVScatsum->Fill(aESum, cESum);
+            // }
+            if (aID < 24 && aE > 50) {
+             hanVScatsum_a[aID]->Fill(aE, cESum);
+            }
+
+          
+            // }
+          // Fill histograms for the `pc` data
+          hpcIndexVE->Fill(pc.index[i], pc.e[i]);
+          // if(inPCCut){
+            hAnodeMultiplicity->Fill(anodeHits.size());
+          // }
+      }
+
+    }
+  }    
+  
+
+
+  // //======================= SX3
+
+  std::vector<std::pair<int, int>> ID; // first = id, 2nd = index
+  for( int i = 0; i < sx3.multi; i ++){
+    if(sx3.e[i]>50){
+      ID.push_back(std::pair<int, int>(sx3.id[i], i));
+      hsx3IndexVE->Fill( sx3.index[i], sx3.e[i] );
+
+      for( int j = i+1; j < sx3.multi; j++){
+        hsx3Coin->Fill( sx3.index[i], sx3.index[j]);
+      }
+
+      for( int j = 0; j < pc.multi; j++){
+        hsx3VpcIndex->Fill( sx3.index[i], pc.index[j] );
+        //  if( sx3.ch[index] > 8 ){
+        //    hsx3VpcE->Fill( sx3.e[i], pc.e[j] );
+        //   }
+      }
+    } 
+  }
+
+
+  if( ID.size() > 0 ){
+    std::sort(ID.begin(), ID.end(),  [](const std::pair<int, int> & a, const std::pair<int, int> & b) {
+      return a.first < b.first;
+    } );
+    // printf("##############################\n");
+    // for( size_t i = 0; i < ID.size(); i++) printf("%zu | %d %d \n", i, ID[i].first, ID[i].second );
+
+    std::vector<std::pair<int, int>> sx3ID; 
+    sx3ID.push_back(ID[0]);
+    bool found = false;
+    for( size_t i = 1; i < ID.size(); i++){
+      if( ID[i].first == sx3ID.back().first) {
+        sx3ID.push_back(ID[i]);
+        if( sx3ID.size() >= 3) {
+          found = true;
+        } 
+      }else{
+        if( !found ){
+          sx3ID.clear();
+          sx3ID.push_back(ID[i]);
+        }
+      }
+    }
+
+    // printf("---------- sx3ID Multi : %zu \n", sx3ID.size());
+
+    if( found ){
+      int sx3ChUp, sx3ChDn, sx3ChBk;
+      float sx3EUp, sx3EDn;
+      // printf("------ sx3 ID : %d, multi: %zu\n", sx3ID[0].first, sx3ID.size());
+      for( size_t i = 0; i < sx3ID.size(); i++ ){
+        int index = sx3ID[i].second;
+        // printf(" %zu | index %d | ch : %d, energy : %d \n", i, index, sx3.ch[index], sx3.e[index]);
+
+
+        if( sx3.ch[index] < 8 ){
+          if( sx3.ch[index] % 2 == 0) {
+            sx3ChDn = sx3.ch[index];
+            sx3EDn = sx3.e[index];
+          }else{
+            sx3ChUp = sx3.ch[index];
+            sx3EUp = sx3.e[index];
+          }
+        }else{
+          sx3ChBk = sx3.ch[index];
+        }
+         for( int j = 0; j < pc.multi; j++){
+
+      // hsx3VpcIndex->Fill( sx3.index[i], pc.index[j] );
+            if( sx3.ch[index] > 8 && pc.index[j]<24 && pc.e[j]>50 ){
+              hsx3VpcE->Fill( sx3.e[i], pc.e[j] );
+          //  hpcIndexVE->Fill( pc.index[i], pc.e[i] );
+            }
+          }
+      }
+
+      sx3_contr.CalSX3Pos(sx3ID[0].first, sx3ChUp, sx3ChDn, sx3ChBk, sx3EUp, sx3EDn);
+      hitPos = sx3_contr.GetHitPos();
+      HitNonZero = true;
+      // hitPos.Print();
+    }
+
+  }
+  
+
+  // //======================= QQQ
+  for( int i = 0; i < qqq.multi; i ++){
+
+      // for( int j = 0; j < pc.multi; j++){
+        if(qqq.e[i]>50 ){
+          hqqqIndexVE->Fill( qqq.index[i], qqq.e[i] );
+          for( int j = 0; j < qqq.multi; j++){
+            if ( j == i ) continue;
+            hqqqCoin->Fill( qqq.index[i], qqq.index[j]);
+          }
+
+
+          for( int j = i + 1; j < qqq.multi; j++){
+            for( int k = 0; k < pc.multi; k++){
+              // if(qqq.e[i>50]){
+                hqqqVpcE->Fill( qqq.e[i], pc.e[k] );
+                hqqqVpcIndex->Fill( qqq.index[i], pc.index[j] );
+              }
+            // }
+          }
+        }  
+      // }
+  }
+
+    // hanVScatsum->Fill(aE,cE);
+    
+
+    if( HitNonZero){
+      pw_contr.CalTrack( hitPos, aID, cID);
+      hZProj->Fill(pw_contr.GetZ0());
+    }
+
+  
+  
+  
+
+
+  //########################################################### Track constrcution
+
+
+  //############################## DO THE KINEMATICS
+
+
+  return kTRUE;
+}
+
+void PCGainMatch::Terminate(){
+
+  gStyle->SetOptStat("neiou");
+  TCanvas * canvas = new TCanvas("cANASEN", "ANASEN", 2000, 2000); 
+  canvas->Divide(3,3);
+
+  //hsx3VpcIndex->Draw("colz");
+
+  //=============================================== pad-1
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hsx3IndexVE->Draw("colz");
+
+  //=============================================== pad-2
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hqqqIndexVE->Draw("colz");
+
+  //=============================================== pad-3
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hpcIndexVE->Draw("colz");
+
+  //=============================================== pad-4
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hsx3Coin->Draw("colz");
+
+  //=============================================== pad-5
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  canvas->cd(padID)->SetLogz(true);
+
+  hqqqCoin->Draw("colz");
+
+  //=============================================== pad-6
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  hpcCoin->Draw("colz");
+
+  //=============================================== pad-7
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  // hsx3VpcIndex ->Draw("colz"); 
+  hsx3VpcE->Draw("colz") ;
+
+  //=============================================== pad-8
+  padID ++; canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+
+  // hqqqVpcIndex ->Draw("colz");  
+
+  hqqqVpcE ->Draw("colz");
+  //=============================================== pad-9
+  padID ++; 
+
+  // canvas->cd(padID)->DrawFrame(-50, -50, 50, 50);
+  // hqqqPolar->Draw("same colz pol");
+
+ canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
+  hanVScatsum->Draw("colz");
+  // hAnodeHits->Draw("colz");
+  // hAnodeMultiplicity->Draw();
+}

PCGainMatch.h

@@ -0,0 +1,114 @@
+#ifndef PCGainMatch_h
+#define PCGainMatch_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TFile.h>
+#include <TSelector.h>
+
+#include "Armory/ClassDet.h"
+
+class PCGainMatch : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+// Fixed size dimensions of array or collections stored in the TTree if any.
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+
+   PCGainMatch(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~PCGainMatch() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(PCGainMatch,0);
+};
+
+#endif
+
+#ifdef PCGainMatch_cxx
+void PCGainMatch::Init(TTree *tree){
+
+   // Set branch addresses and branch pointers
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+   fChain->SetBranchAddress("qqqMulti", &qqq.multi, &b_qqqMulti);
+   fChain->SetBranchAddress("qqqID",    &qqq.id, &b_qqqID);
+   fChain->SetBranchAddress("qqqCh",    &qqq.ch, &b_qqqCh);
+   fChain->SetBranchAddress("qqqE",     &qqq.e, &b_qqqE);
+   fChain->SetBranchAddress("qqqT",     &qqq.t, &b_qqqT);
+   fChain->SetBranchAddress("pcMulti",  &pc.multi, &b_pcMulti);
+   fChain->SetBranchAddress("pcID",     &pc.id, &b_pcID);
+   fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
+   fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
+   fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+
+}
+
+Bool_t PCGainMatch::Notify(){
+
+   return kTRUE;
+}
+
+void PCGainMatch::SlaveBegin(TTree * /*tree*/){
+
+   TString option = GetOption();
+
+}
+
+void PCGainMatch::SlaveTerminate(){
+
+}
+
+
+#endif // #ifdef Analyzer_cxx

ProcessRun.sh

@@ -1,22 +1,26 @@
 #!/bin/bash
 
-if [ "$#" -ne 2 ]; then
-    echo "Usage: $0 runID timeWindow_ns"
+if [ "$#" -ne 3 ]; then
+    echo "Usage: $0 runID timeWindow_ns option"
+    echo "option: 0 - process raw data, 1 - process mapped data"
     echo "Exiting..."
     exit 1
 fi
 
-runID=$1
+runID=$(printf "%03d" $1)
 timeWindow=$2
 
-rawFolder=/home/tandem/Desktop/analysis/data
-rootFolder=../root_data
+option=$3
+
+# rawFolder=/home/tandem/data1/2024_09_17Fap/data
+rawFolder=/mnt/d/17F
+rootFolder=/mnt/d/Remapped_files/17F_data/root_data
 
 if [ $option -eq 0 ]; then
 
-    rsync -auh --info=progress2 splitpole@128.186.111.223:/media/nvmeData/2024_09_17Fap/*.fsu /home/tandem/data1/2024_09_17Fap/data
+    # rsync -auh --info=progress2 splitpole@128.186.111.223:/media/nvmeData/2024_09_17Fap/*.fsu /home/tandem/data1/2024_09_17Fap/data
 
-    fileList=`\ls -1 ${rawFolder}/*Run_${runID}_*.fsu`
+    fileList=`\ls -1 ${rawFolder}/*SourceRun_${runID}_*.fsu`
 
     ./EventBuilder ${timeWindow} 0 0 100000000 ${fileList}
 
@@ -26,4 +30,5 @@ if [ $option -eq 0 ]; then
 
     ./Mapper ${rootFolder}/*${runID}*${timeWindow}.root
 fi
-root "processRun.C(\"${rootFolder}/Run_${runID}_mapped.root\")"
+
+# root "processRun.C(\"${rootFolder}/Run_${runID}_mapped.root\")"

QQQ_Calcheck.C

@@ -0,0 +1,167 @@
+
+#define QQQ_Calcheck_cxx
+
+#include <TH2.h>
+#include <TF1.h>
+#include <TStyle.h>
+#include <TCanvas.h>
+#include <TMath.h>
+#include <TCutG.h>
+#include <fstream>
+#include <utility>
+#include <algorithm>
+#include "Armory/HistPlotter.h"
+#include "TVector3.h"
+#include "QQQ_Calcheck.h"
+
+TH2F *hQQQFVB;
+HistPlotter *plotter;
+int padID = 0;
+
+TCutG *cut;
+std::map<std::tuple<int, int, int>, std::vector<std::pair<double, double>>> dataPoints;
+
+bool qqqEcut = false;
+
+// Gain Arrays
+const int MAX_QQQ = 4;
+const int MAX_RING = 16;
+const int MAX_WEDGE = 16;
+double qqqwGain[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+double qqqrGain[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqwGainValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+bool qqqrGainValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+double qqqCalib[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqCalibValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+
+void QQQ_Calcheck::Begin(TTree * /*tree*/)
+{
+    plotter = new HistPlotter("Cal_checkQQQ.root", "TFILE");
+    // ----------------------- Load QQQ Gains
+    {
+        std::string filename = "qqq_GainMatch.dat";
+        std::ifstream infile(filename);
+        if (!infile.is_open())
+        {
+            std::cerr << "Error opening " << filename << "!" << std::endl;
+        }
+        else
+        {
+            int det, ring, wedge;
+            double gainw,gainr;
+            while (infile >> det >> ring >> wedge >> gainw>> gainr)
+            {
+                qqqwGain[det][ring][wedge] = gainw;
+                // qqqrGain[det][ring][wedge] = gainr;
+                qqqwGainValid[det][ring][wedge] = (gainw > 0);
+                // qqqrGainValid[det][ring][wedge] = (gainr > 0);
+            }
+            infile.close();
+            std::cout << "Loaded QQQ gains from " << filename << std::endl;
+        }
+    }
+    // ----------------------- Load QQQ Calibrations
+    {
+        std::string filename = "qqq_Calib.dat";
+        std::ifstream infile(filename);
+        if (!infile.is_open())
+        {
+            std::cerr << "Error opening " << filename << "!" << std::endl;
+        }
+        else
+        {
+            int det, ring, wedge;
+            double slope;
+            while (infile >> det >> ring >> wedge >> slope)
+            {
+                qqqCalib[det][ring][wedge] = slope;
+                qqqCalibValid[det][ring][wedge] = (slope > 0);
+            }
+            infile.close();
+            std::cout << "Loaded QQQ calibrations from " << filename << std::endl;
+        }
+    }
+}
+
+Bool_t QQQ_Calcheck::Process(Long64_t entry)
+{
+    b_qqqMulti->GetEntry(entry);
+    b_qqqID->GetEntry(entry);
+    b_qqqCh->GetEntry(entry);
+    b_qqqE->GetEntry(entry);
+    b_qqqT->GetEntry(entry);
+
+    qqq.CalIndex();
+
+    for (int i = 0; i < qqq.multi; i++)
+    {
+        for (int j = i + 1; j < qqq.multi; j++)
+        {
+            if (qqq.e[i] > 100)
+                qqqEcut = true;
+            if (qqq.id[i] == qqq.id[j])
+            {
+                int chWedge = -1;
+                int chRing = -1;
+                float eWedgeRaw = 0.0;
+                float eWedge = 0.0;
+                float eWedgeMeV = 0.0;
+                float eRingRaw = 0.0;
+                float eRing = 0.0;
+                float eRingMeV = 0.0;
+                // plug in gains
+                if (qqq.ch[i] < 16 && qqq.ch[j] >= 16 && /*qqqrGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16] &&*/ qqqwGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16])
+                {
+                    chWedge = qqq.ch[i];
+                    eWedgeRaw = qqq.e[i];
+                    eWedge = qqq.e[i] * qqqwGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+                    // printf("Wedge E: %.2f  Gain: %.4f \n", eWedge, qqqGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16]);
+                    chRing = qqq.ch[j] - 16;
+                    eRingRaw = qqq.e[j];
+                    eRing = qqq.e[j];//* qqqrGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i]-16];
+                }
+                else if (qqq.ch[j] < 16 && qqq.ch[i] >= 16/* && qqqrGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16] */&& qqqwGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16])
+                {
+                    chWedge = qqq.ch[j];
+                    eWedge = qqq.e[j] * qqqwGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16];
+                    eWedgeRaw = qqq.e[j];
+
+                    chRing = qqq.ch[i] - 16;
+                    eRing = qqq.e[i];// * qqqrGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+                    eRingRaw = qqq.e[i];
+                }
+                else
+                    continue;
+                // plug in calibrations
+                if (qqqCalibValid[qqq.id[i]][chWedge][chRing])
+                {
+                    eWedgeMeV = eWedge * qqqCalib[qqq.id[i]][chWedge][chRing] / 1000;
+                    eRingMeV = eRing * qqqCalib[qqq.id[i]][chWedge][chRing] / 1000;
+                }
+                else
+                    continue;
+
+                // hQQQFVB->Fill(eWedge, eRing);
+                plotter->Fill2D(Form("hRaw_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 400, 0, 8000, 400, 0, 8000, eWedgeRaw, eRingRaw, "ERaw");
+                plotter->Fill2D(Form("hGM_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 400, 0, 16000, 400, 0, 16000, eWedge, eRing, "EGM");
+                plotter->Fill2D(Form("hCal_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 400, 0, 10, 400, 0, 10, eWedgeMeV, eRingMeV, "ECal");
+                if(eWedgeRaw >1500 && eRingRaw>1500 )
+                plotter->Fill2D(Form("hCal_cut_qqq%d_ring%d_wedge%d", qqq.id[i], chRing, chWedge), 400, 0, 10, 400, 0, 10, eWedgeMeV, eRingMeV, "ECal_cut");
+                
+                plotter->Fill2D(Form("hRCal_qqq%d", qqq.id[i]), 16, 0, 15, 1000, 0, 30, chRing, eRingMeV, "RingCal");
+                plotter->Fill2D(Form("hWCal_qqq%d", qqq.id[i]), 16, 0, 15, 1000, 0, 30, chWedge, eWedgeMeV, "WedgeCal");
+                plotter->Fill2D("hRawQQQ", 4000, 0, 8000, 4000, 0, 8000, eWedgeRaw, eRingRaw);
+                plotter->Fill2D("hGMQQQ", 4000, 0, 8000, 4000, 0, 8000, eWedge, eRing);
+                plotter->Fill2D("hCalQQQ", 4000, 0, 10, 4000, 0, 10, eWedgeMeV, eRingMeV);
+            }
+        }
+    }
+
+    return kTRUE;
+}
+
+void QQQ_Calcheck::Terminate()
+{
+    plotter->FlushToDisk();
+    std::cout << "Calibration check file for 2D QQQ histogram saved.\n";
+}

QQQ_Calcheck.h

@@ -0,0 +1,114 @@
+#ifndef QQQ_Calcheck_h
+#define QQQ_Calcheck_h
+
+#include <TROOT.h>
+#include <TChain.h>
+#include <TFile.h>
+#include <TSelector.h>
+
+#include "Armory/ClassDet.h"
+
+class QQQ_Calcheck : public TSelector {
+public :
+   TTree          *fChain;   //!pointer to the analyzed TTree or TChain
+
+// Fixed size dimensions of array or collections stored in the TTree if any.
+
+   // Declaration of leaf types
+   Det sx3;
+   Det qqq;
+   Det pc ;
+
+   ULong64_t       evID;
+   UInt_t          run;
+
+   // List of branches
+   TBranch        *b_eventID;   //!
+   TBranch        *b_run;   //!
+   TBranch        *b_sx3Multi;   //!
+   TBranch        *b_sx3ID;   //!
+   TBranch        *b_sx3Ch;   //!
+   TBranch        *b_sx3E;   //!
+   TBranch        *b_sx3T;   //!
+   TBranch        *b_qqqMulti;   //!
+   TBranch        *b_qqqID;   //!
+   TBranch        *b_qqqCh;   //!
+   TBranch        *b_qqqE;   //!
+   TBranch        *b_qqqT;   //!
+   TBranch        *b_pcMulti;   //!
+   TBranch        *b_pcID;   //!
+   TBranch        *b_pcCh;   //!
+   TBranch        *b_pcE;   //!
+   TBranch        *b_pcT;   //!
+
+   QQQ_Calcheck(TTree * /*tree*/ =0) : fChain(0) { }
+   virtual ~QQQ_Calcheck() { }
+   virtual Int_t   Version() const { return 2; }
+   virtual void    Begin(TTree *tree);
+   virtual void    SlaveBegin(TTree *tree);
+   virtual void    Init(TTree *tree);
+   virtual Bool_t  Notify();
+   virtual Bool_t  Process(Long64_t entry);
+   virtual Int_t   GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
+   virtual void    SetOption(const char *option) { fOption = option; }
+   virtual void    SetObject(TObject *obj) { fObject = obj; }
+   virtual void    SetInputList(TList *input) { fInput = input; }
+   virtual TList  *GetOutputList() const { return fOutput; }
+   virtual void    SlaveTerminate();
+   virtual void    Terminate();
+
+   ClassDef(QQQ_Calcheck,0);
+};
+
+#endif
+
+#ifdef QQQ_Calcheck_cxx
+void QQQ_Calcheck::Init(TTree *tree){
+
+   // Set branch addresses and branch pointers
+   if (!tree) return;
+   fChain = tree;
+   fChain->SetMakeClass(1);
+
+   fChain->SetBranchAddress("evID", &evID, &b_eventID);
+   fChain->SetBranchAddress("run", &run, &b_run);
+
+   sx3.SetDetDimension(24,12);
+   qqq.SetDetDimension(4,32);
+   pc.SetDetDimension(2,24);
+
+   fChain->SetBranchAddress("sx3Multi", &sx3.multi, &b_sx3Multi);
+   fChain->SetBranchAddress("sx3ID",    &sx3.id, &b_sx3ID);
+   fChain->SetBranchAddress("sx3Ch",    &sx3.ch, &b_sx3Ch);
+   fChain->SetBranchAddress("sx3E",     &sx3.e, &b_sx3E);
+   fChain->SetBranchAddress("sx3T",     &sx3.t, &b_sx3T);
+   fChain->SetBranchAddress("qqqMulti", &qqq.multi, &b_qqqMulti);
+   fChain->SetBranchAddress("qqqID",    &qqq.id, &b_qqqID);
+   fChain->SetBranchAddress("qqqCh",    &qqq.ch, &b_qqqCh);
+   fChain->SetBranchAddress("qqqE",     &qqq.e, &b_qqqE);
+   fChain->SetBranchAddress("qqqT",     &qqq.t, &b_qqqT);
+   fChain->SetBranchAddress("pcMulti",  &pc.multi, &b_pcMulti);
+   fChain->SetBranchAddress("pcID",     &pc.id, &b_pcID);
+   fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
+   fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
+   fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
+
+}
+
+Bool_t QQQ_Calcheck::Notify(){
+
+   return kTRUE;
+}
+
+void QQQ_Calcheck::SlaveBegin(TTree * /*tree*/){
+
+   TString option = GetOption();
+
+}
+
+void QQQ_Calcheck::SlaveTerminate(){
+
+}
+
+
+#endif // #ifdef QQQ_Calcheck_cxx

RunTimeSummary.C

@@ -0,0 +1,140 @@
+#include <TFile.h>
+#include <TH1.h>
+#include <TH2.h>
+#include <TString.h>
+#include <TSystem.h>
+#include <TCanvas.h>
+#include <iostream>
+
+void RunTimeSummary(int startRun, int endRun)
+{
+    TString fileDir = "/mnt/d/Remapped_files/17F_data/root_data/";
+    TString histName = "AnodeQQQ_Time";
+    TString filePattern = "Run_%03d_mapped_histograms.root";
+    TString filePatternAlt = "ProtonRun_%d_mapped_histograms.root";
+    TString filePatternAlt2 = "Source_%d_mapped_histograms.root";
+
+    int nBinsTime = 0;
+    double timeMin = 0, timeMax = 0;
+    bool foundRef = false;
+
+    for (int r = startRun; r <= endRun; r++)
+    {
+        TString tempName;
+
+        // 1. Try Pattern 1: Run_XXX...
+        tempName = fileDir + Form(filePattern, r);
+        if (gSystem->AccessPathName(tempName))
+        { // Returns true if MISSING
+
+            // 2. Try Pattern 2: ProtonRun_X...
+            tempName = fileDir + Form(filePatternAlt, r);
+            if (gSystem->AccessPathName(tempName))
+            {
+
+                // 3. Try Pattern 3: Source_X...
+                tempName = fileDir + Form(filePatternAlt2, r);
+                if (gSystem->AccessPathName(tempName))
+                {
+                    // All 3 patterns failed. Skip this run.
+                    continue;
+                }
+            }
+        }
+
+        // If we get here, 'tempName' holds the valid filename that was found
+        TFile *fTemp = TFile::Open(tempName);
+        if (!fTemp || fTemp->IsZombie())
+        {
+            if (fTemp)
+                delete fTemp;
+            continue;
+        }
+
+        TH1F *hRef = (TH1F *)fTemp->Get(histName);
+        if (hRef)
+        {
+
+            nBinsTime = hRef->GetNbinsX();
+            timeMin = hRef->GetXaxis()->GetXmin();
+            timeMax = hRef->GetXaxis()->GetXmax();
+            foundRef = true;
+
+            delete hRef;
+            fTemp->Close();
+            delete fTemp;
+            printf("Reference found in Run %d: %d bins, Range [%.1f, %.1f]\n", r, nBinsTime, timeMin, timeMax);
+            break;
+        }
+        fTemp->Close();
+        delete fTemp;
+    }
+
+    if (!foundRef)
+    {
+        printf("Error: No valid histograms found in the entire range. Exiting.\n");
+        return;
+    }
+
+    int nRuns = endRun - startRun + 1;
+    TH2F *hSummary = new TH2F("hSummary",
+                              Form("Timing Summary (Runs %d-%d);Timing;Run Number", startRun, endRun),
+                              nBinsTime, timeMin, timeMax,
+                              nRuns, startRun, endRun + 1);
+
+    for (int run = startRun; run <= endRun; run++)
+    {
+
+        TString filename = fileDir + Form(filePattern, run);
+
+        if (gSystem->AccessPathName(filename))
+            continue;
+
+        TFile *fin = TFile::Open(filename);
+        if (!fin || fin->IsZombie())
+        {
+            if (fin)
+                delete fin;
+            continue;
+        }
+
+        TH1F *hin = (TH1F *)fin->Get(histName);
+
+        if (hin)
+        {
+            // Determine which ROW (Y-bin) corresponds to this Run
+            // Note: ROOT bins start at 1.
+            // If startRun=10 and run=10 -> binY=1.
+            int binY_Run = run - startRun + 1;
+
+            // Loop through the Time bins (X-bins in the 1D hist)
+            for (int binX_Time = 1; binX_Time <= hin->GetNbinsX(); binX_Time++)
+            {
+
+                double content = hin->GetBinContent(binX_Time);
+
+                // Copy content to: (Time, Run)
+                if (content > 0)
+                {
+                    hSummary->SetBinContent(binX_Time, binY_Run, content);
+                }
+            }
+            delete hin;
+        }
+
+        fin->Close();
+        delete fin;
+
+        if ((run - startRun) % 10 == 0)
+            printf("Stitched Run %d...\n", run);
+    }
+
+    TFile *fOut = new TFile("SummaryPlot.root", "RECREATE");
+    hSummary->Write();
+
+    TCanvas *c1 = new TCanvas("c1", "Time Summary Plot", 1000, 800);
+    hSummary->SetStats(0);
+    hSummary->Draw("COLZ");
+
+    printf("Done! Saved to SummaryPlot.root\n");
+}

TrackRecon.C

@@ -1,48 +1,188 @@
 #define TrackRecon_cxx
 
 #include "TrackRecon.h"
+#include "Armory/ClassPW.h"
+#include "Armory/HistPlotter.h"
+
 #include <TH2.h>
 #include <TStyle.h>
 #include <TCanvas.h>
 #include <TMath.h>
+#include "TVector3.h"
 
+#include <fstream>
+#include <iostream>
+#include <sstream>
+#include <map>
 #include <utility>
 #include <algorithm>
 
-#include "Armory/ClassSX3.h"
-#include "Armory/ClassPC1An.h"
-
-#include "TVector3.h"
-
-int padID = 0;
-
-SX3 sx3_contr;
-PC pw_contr;
+// Global instances
+PW pw_contr;
+PW pwinstance;
 TVector3 hitPos;
+double qqqenergy,qqqtime;
+
+// Calibration globals
+const int MAX_QQQ = 4;
+const int MAX_RING = 16;
+const int MAX_WEDGE = 16;
+double qqqGain[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqGainValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+double qqqCalib[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{0}}};
+bool qqqCalibValid[MAX_QQQ][MAX_RING][MAX_WEDGE] = {{{false}}};
+// TCutg *cutQQQ;
+
+// PC Arrays
+double pcSlope[48];
+double pcIntercept[48];
+
+HistPlotter *plotter;
+
 bool HitNonZero;
+bool sx3ecut;
+bool qqqEcut;
 
-TH1F * hZProj;
+void TrackRecon::Begin(TTree *tree)
+{ // get file name
+  std::cout << tree->GetCurrentFile()->GetName() << std::endl;
+  // get substring from file name to identify run number
 
-void TrackRecon::Begin(TTree * /*tree*/){
   TString option = GetOption();
+  std::string treefilename(tree->GetCurrentFile()->GetName());
 
-  hZProj = new TH1F("hZProj", "Z Projection", 200, -600, 600);
+  plotter = new HistPlotter(treefilename.substr(0, treefilename.length() - std::string(".root").length()) + "_histograms.root", "TFILE");
+  // plotter = new HistPlotter("Analyzer.root", "TFILE");
 
-  sx3_contr.ConstructGeo();
   pw_contr.ConstructGeo();
+  pwinstance.ConstructGeo();
 
+  // ---------------------------------------------------------
+  // 1. CRITICAL FIX: Initialize PC Arrays to Default (Raw)
+  // ---------------------------------------------------------
+  for (int i = 0; i < 48; i++)
+  {
+    pcSlope[i] = 1.0;     // Default slope = 1 (preserves Raw energy)
+    pcIntercept[i] = 0.0; // Default intercept = 0
   }
 
-Bool_t TrackRecon::Process(Long64_t entry){
+  // Calculate Crossover Geometry ONCE
+  TVector3 a, c, diff;
+  double a2, ac, c2, adiff, cdiff, denom, alpha;
 
-  // if ( entry > 100 ) return kTRUE;
+  for (size_t i = 0; i < pwinstance.An.size(); i++)
+  {
+    a = pwinstance.An[i].first - pwinstance.An[i].second;
 
+    for (size_t j = 0; j < pwinstance.Ca.size(); j++)
+    {
+      c = pwinstance.Ca[j].first - pwinstance.Ca[j].second;
+      diff = pwinstance.An[i].first - pwinstance.Ca[j].first;
+      a2 = a.Dot(a);
+      c2 = c.Dot(c);
+      ac = a.Dot(c);
+      adiff = a.Dot(diff);
+      cdiff = c.Dot(diff);
+      denom = a2 * c2 - ac * ac;
+      alpha = (ac * cdiff - c2 * adiff) / denom;
+
+      Crossover[i][j][0].x = pwinstance.An[i].first.X() + alpha * a.X();
+      Crossover[i][j][0].y = pwinstance.An[i].first.Y() + alpha * a.Y();
+      Crossover[i][j][0].z = pwinstance.An[i].first.Z() + alpha * a.Z();
+
+      if (Crossover[i][j][0].z < -190 || Crossover[i][j][0].z > 190 || (i + j) % 24 == 12)
+      {
+        Crossover[i][j][0].z = 9999999;
+      }
+
+      Crossover[i][j][1].x = alpha;
+      Crossover[i][j][1].y = 0;
+    }
+  }
+
+  // Load PC Calibrations
+  std::ifstream inputFile("slope_intercept_results.dat");
+  if (inputFile.is_open())
+  {
+    std::string line;
+    int index;
+    double slope, intercept;
+    while (std::getline(inputFile, line))
+    {
+      std::stringstream ss(line);
+      ss >> index >> slope >> intercept;
+      if (index >= 0 && index <= 47)
+      {
+        pcSlope[index] = slope;
+        pcIntercept[index] = intercept;
+      }
+    }
+    inputFile.close();
+  }
+  else
+  {
+    std::cerr << "Error opening slope_intercept.txt" << std::endl;
+  }
+
+  // Load QQQ Cuts from file
+  //   {
+  //     std::string filename = "QQQ_PCCut.root";
+  //     TFile *cutFile = TFile::Open(filename.c_str(), "READ");
+  //     if (cutFile && !cutFile->IsZombie())
+  //     {
+  //       cutQQQ = (TCutg *)cutFile->Get("cutQQQPC");
+  //       if (cutQQQ)
+  //       {
+  //         std::cout << "Loaded QQQ PC cut from " << filename << std::endl;
+  //       }
+  //       else
+  //       {
+  //         std::cerr << "Error: cutQQQPC not found in " << filename << std::endl;
+  //       }
+  //       cutFile->Close();
+  //   }
+  // }
+
+  // ... (Load QQQ Gains and Calibs - same as before) ...
+  {
+    std::string filename = "qqq_GainMatch.dat";
+    std::ifstream infile(filename);
+    if (infile.is_open())
+    {
+      int det, ring, wedge;
+      double gainw, gainr;
+      while (infile >> det >> wedge >> ring >> gainw >> gainr)
+      {
+        qqqGain[det][wedge][ring] = gainw;
+        qqqGainValid[det][wedge][ring] = (gainw > 0);
+        // std::cout << "QQQ Gain Loaded: Det " << det << " Ring " << ring << " Wedge " << wedge << " GainW " << gainw << " GainR " << gainr << std::endl;
+      }
+      infile.close();
+    }
+  }
+  {
+    std::string filename = "qqq_Calib.dat";
+    std::ifstream infile(filename);
+    if (infile.is_open())
+    {
+      int det, ring, wedge;
+      double slope;
+      while (infile >> det >> wedge >> ring >> slope)
+      {
+        qqqCalib[det][wedge][ring] = slope;
+        qqqCalibValid[det][wedge][ring] = (slope > 0);
+        // std::cout << "QQQ Calib Loaded: Det " << det << " Ring " << ring << " Wedge " << wedge << " Slope " << slope << std::endl;
+      }
+      infile.close();
+    }
+  }
+}
+
+Bool_t TrackRecon::Process(Long64_t entry)
+{
   hitPos.Clear();
   HitNonZero = false;
-
-  if( entry > 1) return kTRUE;
-  // printf("################### ev : %llu \n", entry);
-
+  bool qqq1000cut = false;
   b_sx3Multi->GetEntry(entry);
   b_sx3ID->GetEntry(entry);
   b_sx3Ch->GetEntry(entry);
@@ -63,183 +203,558 @@ Bool_t TrackRecon::Process(Long64_t entry){
   qqq.CalIndex();
   pc.CalIndex();
 
-  // sx3.Print();
+  // QQQ Processing
 
-  //########################################################### Raw data
-  // //======================= SX3
+  int qqqCount = 0;
+  int qqqAdjCh = 0;
+  qqqenergy=-1;
+  qqqtime=-1;
 
-  std::vector<std::pair<int, int>> ID; // first = id, 2nd = index
+  // REMOVE WHEN RERUNNING USING THE NEW CALIBRATION FILE
+  // for (int i = 0; i < qqq.multi; i++)
+  // {
+  //   if ((qqq.id[i] == 3 || qqq.id[i] == 1) && qqq.ch[i] < 16)
+  //   {
+  //     qqq.ch[i] = 16 - qqq.ch[i];
+  //   }
+  // }
+  // for (int i = 0; i < qqq.multi; i++)
+  // {
+  //   if (qqq.id[i] == 0 && qqq.ch[i] >= 16)
+  //   {
+  //     qqq.ch[i] = 31 - qqq.ch[i] + 16;
+  //   }
+  // }
 
-  if( ID.size() > 0 ){
-    std::sort(ID.begin(), ID.end(),  [](const std::pair<int, int> & a, const std::pair<int, int> & b) {
-      return a.first < b.first;
-    } );
-    // printf("##############################\n");
-    // for( size_t i = 0; i < ID.size(); i++) printf("%zu | %d %d \n", i, ID[i].first, ID[i].second );
+  bool PCQQQTimeCut = false;
+  for (int i = 0; i < qqq.multi; i++)
+  {
 
-    std::vector<std::pair<int, int>> sx3ID; 
-    sx3ID.push_back(ID[0]);
-    bool found = false;
-    for( size_t i = 1; i < ID.size(); i++){
-      if( ID[i].first == sx3ID.back().first) {
-        sx3ID.push_back(ID[i]);
-        if( sx3ID.size() >= 3) {
-          found = true;
-        } 
-      }else{
-        if( !found ){
-          sx3ID.clear();
-          sx3ID.push_back(ID[i]);
-        }
-      }
+    plotter->Fill2D("QQQ_Index_Vs_Energy", 16 * 8, 0, 16 * 8, 2000, 0, 16000, qqq.index[i], qqq.e[i], "hRawQQQ");
+
+    for (int j = 0; j < qqq.multi; j++)
+    {
+      if (j == i)
+        continue;
+      plotter->Fill2D("QQQ_Coincidence_Matrix", 16 * 8, 0, 16 * 8, 16 * 8, 0, 16 * 8, qqq.index[i], qqq.index[j], "hRawQQQ");
     }
 
-    // printf("---------- sx3ID Multi : %zu \n", sx3ID.size());
-
-    if( found ){
-      int sx3ChUp, sx3ChDn, sx3ChBk;
-      float sx3EUp, sx3EDn;
-      // printf("------ sx3 ID : %d, multi: %zu\n", sx3ID[0].first, sx3ID.size());
-      for( size_t i = 0; i < sx3ID.size(); i++ ){
-        int index = sx3ID[i].second;
-        // printf(" %zu | index %d | ch : %d, energy : %d \n", i, index, sx3.ch[index], sx3.e[index]);
-
-
-        if( sx3.ch[index] < 8 ){
-          if( sx3.ch[index] % 2 == 0) {
-            sx3ChDn = sx3.ch[index];
-            sx3EDn = sx3.e[index];
-          }else{
-            sx3ChUp = sx3.ch[index];
-            sx3EUp = sx3.e[index];
+    for (int k = 0; k < pc.multi; k++)
+    {
+      if (pc.index[k] < 24 && pc.e[k] > 50)
+      {
+        plotter->Fill2D("QQQ_Vs_Anode_Energy", 400, 0, 4000, 1000, 0, 16000, qqq.e[i], pc.e[k], "hRawQQQ");
+        plotter->Fill2D("QQQ_Vs_PC_Index", 16 * 8, 0, 16 * 8, 24, 0, 24, qqq.index[i], pc.index[k], "hRawQQQ");
       }
-        }else{
-          sx3ChBk = sx3.ch[index];
+      else if (pc.index[k] >= 24 && pc.e[k] > 50)
+      {
+        plotter->Fill2D("QQQ_Vs_Cathode_Energy", 400, 0, 4000, 1000, 0, 16000, qqq.e[i], pc.e[k], "hRawQQQ");
       }
     }
 
-      sx3_contr.CalSX3Pos(sx3ID[0].first, sx3ChUp, sx3ChDn, sx3ChBk, sx3EUp, sx3EDn);
-      hitPos = sx3_contr.GetHitPos();
-      HitNonZero = true;
-      // hitPos.Print();
-    }
+    for (int j = i + 1; j < qqq.multi; j++)
+    {
+      if (qqq.id[i] == qqq.id[j])
+      {
+        qqqCount++;
 
-  }
-  
-
-  // //======================= QQQ
-  for( int i = 0; i < qqq.multi; i ++){
-    for( int j = i + 1; j < qqq.multi; j++){
-      if( qqq.id[i] == qqq.id[j]  ){ // must be same detector 
         int chWedge = -1;
         int chRing = -1;
-        if( qqq.ch[i] < qqq.ch[j]){
-          chRing = qqq.ch[j] - 16;
+        double eWedge = 0.0;
+        double eWedgeMeV = 0.0;
+        double eRing = 0.0;
+        double eRingMeV = 0.0;
+        double tRing = 0.0;
+        double tWedge = 0.0;
+
+        if (qqq.ch[i] < 16 && qqq.ch[j] >= 16 && qqqGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16])
+        {
           chWedge = qqq.ch[i];
-        }else{
-          chRing = qqq.ch[i];
-          chWedge = qqq.ch[j] - 16;
+          eWedge = qqq.e[i] * qqqGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+          chRing = qqq.ch[j] - 16;
+          eRing = qqq.e[j];
+          tRing = static_cast<double>(qqq.t[j]);
+          tWedge = static_cast<double>(qqq.t[i]);
+        }
+        else if (qqq.ch[j] < 16 && qqq.ch[i] >= 16 && qqqGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16])
+        {
+          chWedge = qqq.ch[j];
+          eWedge = qqq.e[j] * qqqGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16];
+          chRing = qqq.ch[i] - 16;
+          eRing = qqq.e[i];
+          tRing = static_cast<double>(qqq.t[i]);
+          tWedge = static_cast<double>(qqq.t[j]);
+        }
+        else
+          continue;
+
+        plotter->Fill1D("Wedgetime_Vs_Ringtime", 100, -1000, 1000, tWedge - tRing, "hTiming");
+        plotter->Fill2D("RingE_vs_Index", 16 * 4, 0, 16 * 4, 1000, 0, 16000, chRing + qqq.id[i] * 16, eRing, "hRawQQQ");
+        plotter->Fill2D("WedgeE_vs_Index", 16 * 4, 0, 16 * 4, 1000, 0, 16000, chWedge + qqq.id[i] * 16, eWedge, "hRawQQQ");
+
+        if (qqqCalibValid[qqq.id[i]][chWedge][chRing])
+        {
+          eWedgeMeV = eWedge * qqqCalib[qqq.id[i]][chWedge][chRing] / 1000;
+          eRingMeV = eRing * qqqCalib[qqq.id[i]][chWedge][chRing] / 1000;
+        }
+        else
+          continue;
+
+        plotter->Fill2D("WedgeE_Vs_RingECal", 1000, 0, 10, 1000, 0, 10, eWedgeMeV, eRingMeV, "hCalQQQ");
+         if(qqq.multi>2 )       plotter->Fill2D("WedgeE_Vs_RingECal_mulit>2", 1000, 0, 10, 1000, 0, 10, eWedgeMeV, eRingMeV, "hCalQQQ");
+         if(qqq.multi==2 )       plotter->Fill2D("WedgeE_Vs_RingECal_mulit=2", 1000, 0, 10, 1000, 0, 10, eWedgeMeV, eRingMeV, "hCalQQQ");
+
+        for (int k = 0; k < pc.multi; k++)
+        {
+          plotter->Fill2D("RingCh_vs_Anode_Index", 16 * 4, 0, 16 * 4, 24, 0, 24, chRing + qqq.id[i] * 16, pc.index[k], "hRawQQQ");
+          plotter->Fill2D("WedgeCh_vs_Anode_Index", 16 * 4, 0, 16 * 4, 24, 0, 24, chWedge + qqq.id[i] * 16, pc.index[k], "hRawQQQ");
+          plotter->Fill2D("WedgeCh_vs_Anode_Index" + std::to_string(qqq.id[i]), 16 * 4, 0, 16 * 4, 24, 0, 24, chWedge + qqq.id[i] * 16, pc.index[k]);
+          plotter->Fill2D("RingCh_vs_Cathode_Index", 16 * 4, 0, 16 * 4, 24, 24, 48, chRing + qqq.id[i] * 16, pc.index[k], "hRawQQQ");
+          plotter->Fill2D("WedgeCh_vs_Cathode_Index", 16 * 4, 0, 16 * 4, 24, 24, 48, chWedge + qqq.id[i] * 16, pc.index[k], "hRawQQQ");
+
+          if (pc.index[k] < 24 && pc.e[k] > 50)
+          {
+            // plotter->Fill2D("QQQ_CalibW_Vs_PC_Energy", 1000, 0, 16, 2000, 0, 30000, eWedgeMeV, pc.e[k], "hCalQQQ");
+            // plotter->Fill2D("QQQ_CalibR_Vs_PC_Energy", 1000, 0, 16, 2000, 0, 30000, eRingMeV, pc.e[k], "hCalQQQ");
+
+            // if (tRing - static_cast<double>(pc.t[k]) < 0 && tRing - static_cast<double>(pc.t[k]) > -600)
+            // // {
+            // //   plotter->Fill2D("QQQ_CalibW_Vs_PC_Energy_Tight", 1000, 0, 16, 2000, 0, 30000, eWedgeMeV, pc.e[k], "hCalQQQ");
+            // //   plotter->Fill2D("QQQ_CalibR_Vs_PC_Energy_Tight", 1000, 0, 16, 2000, 0, 30000, eRingMeV, pc.e[k], "hCalQQQ");
+            // // }
+            // // else
+            // // {
+            // //   plotter->Fill2D("QQQ_CalibW_Vs_PC_Energy_OffTime", 1000, 0, 16, 2000, 0, 30000, eWedgeMeV, pc.e[k], "hCalQQQ");
+            // //   plotter->Fill2D("QQQ_CalibR_Vs_PC_Energy_OffTime", 1000, 0, 16, 2000, 0, 30000, eRingMeV, pc.e[k], "hCalQQQ");
+            // // }
+            plotter->Fill2D("Timing_Difference_QQQR_Anode_vRing", 1250, -2500, 2500, 16, 0, 16, tRing - static_cast<double>(pc.t[k]), chRing, "hTiming");
+            plotter->Fill2D("DelT_Vs_QQQRingECal", 500, -2500, 2500, 1000, 0, 10, tRing - static_cast<double>(pc.t[k]), eRingMeV, "hTiming");
+            plotter->Fill2D("CalibratedQQQEvsAnodeE_R", 1000, 0, 10, 2000, 0, 30000, eRingMeV, pc.e[k], "hPCQQQ");
+            plotter->Fill2D("CalibratedQQQEvsAnodeE_W", 1000, 0, 10, 2000, 0, 30000, eWedgeMeV, pc.e[k], "hPCQQQ");
+            if (tRing - static_cast<double>(pc.t[k]) < -150) // 27Al
+            // if (tRing - static_cast<double>(pc.t[k]) < -75 && tRing - static_cast<double>(pc.t[k]) > -145) // 17F
+            {
+              PCQQQTimeCut = true;
+            }
           }
 
-        // printf(" ID : %d , chWedge : %d, chRing : %d \n", qqq.id[i], chWedge, chRing);
+          if (pc.index[k] >= 24 && pc.e[k] > 50)
+          {
+            plotter->Fill2D("Timing_Difference_QQQR_Cathode_vRing", 1250, -2500, 2500, 16, 0, 16, tRing - static_cast<double>(pc.t[k]), chRing, "hTiming");
+          }
+        }
 
         double theta = -TMath::Pi() / 2 + 2 * TMath::Pi() / 16 / 4. * (qqq.id[i] * 16 + chWedge + 0.5);
-        double rho   = 10.+40./16.*(chRing+0.5);
-        // if(qqq.e[i]>50){
-        // hqqqPolar->Fill( theta, rho);
-        // }
-        // qqq.used[i] = true;
-        // qqq.used[j] = true;
+        double rho = 50. + 50. / 16. * (chRing + 0.5);
 
-        if( !HitNonZero ){
+        plotter->Fill2D("QQQPolarPlot", 16 * 4, -TMath::Pi(), TMath::Pi(), 32, 40, 100, theta, rho, "hCalQQQ");
+        plotter->Fill2D("QQQCartesianPlot", 200, -100, 100, 200, -100, 100, rho * TMath::Cos(theta), rho * TMath::Sin(theta), "hCalQQQ");
+        plotter->Fill2D("QQQCartesianPlot" + std::to_string(qqq.id[i]), 200, -100, 100, 200, -100, 100, rho * TMath::Cos(theta), rho * TMath::Sin(theta), "hCalQQQ");
+        if (PCQQQTimeCut)
+        {
+          plotter->Fill2D("PC_XY_Projection_QQQ_TimeCut" + std::to_string(qqq.id[i]), 400, -100, 100, 400, -100, 100, rho * TMath::Cos(theta), rho * TMath::Sin(theta), "hPCQQQ");
+        }
+        plotter->Fill2D("PC_XY_Projection_QQQ" + std::to_string(qqq.id[i]), 400, -100, 100, 400, -100, 100, rho * TMath::Cos(theta), rho * TMath::Sin(theta), "hPCQQQ");
+
+        if (!HitNonZero)
+        {
           double x = rho * TMath::Cos(theta);
           double y = rho * TMath::Sin(theta);
           hitPos.SetXYZ(x, y, 23 + 75 + 30);
+          qqqenergy = eRingMeV;
+          qqqtime = tRing;
           HitNonZero = true;
         }
       }
     }
-  
-   
   }
-  // //======================= PC
 
-  ID.clear();
-  int counter=0;
-  std::vector<std::pair<int, double>> E; 
-  E.clear();
+  plotter->Fill1D("QQQ_Multiplicity", 10, 0, 10, qqqCount, "hRawQQQ");
 
-  if( E.size()==3 ){
-    float aE = 0;
-    float cE = 0;
-    int multi_an =0;
-    for(int l=0;l<E.size();l++){
-     if(E[l].first<24 && E[l].first!=20 && E[l].first!=12){
-        multi_an++;
+  // PC Gain Matching and Filling
+  double anodeT = -99999;
+  double cathodeT = 99999;
+  int anodeIndex = -1;
+  int cathodeIndex = -1;
+  for (int i = 0; i < pc.multi; i++)
+  {
+    if (pc.e[i] > 10)
+    {
+      plotter->Fill2D("PC_Index_Vs_Energy", 48, 0, 48, 2000, 0, 30000, pc.index[i], static_cast<double>(pc.e[i]), "hRawPC");
+    }
+
+    if (pc.index[i] < 48)
+    {
+      pc.e[i] = pcSlope[pc.index[i]] * pc.e[i] + pcIntercept[pc.index[i]];
+      plotter->Fill2D("PC_Index_VS_GainMatched_Energy", 48, 0, 48, 2000, 0, 30000, pc.index[i], pc.e[i], "hGMPC");
+    }
+
+    if (pc.index[i] < 24)
+    {
+      anodeT = static_cast<double>(pc.t[i]);
+      anodeIndex = pc.index[i];
+    }
+    else
+    {
+      cathodeT = static_cast<double>(pc.t[i]);
+      cathodeIndex = pc.index[i] - 24;
+    }
+
+    if (anodeT != -99999 && cathodeT != 99999)
+    {
+      for (int j = 0; j < qqq.multi; j++)
+      {
+        plotter->Fill1D("AC_Time_qqq_coin", 500, -2500, 2500, anodeT - cathodeT, "hTiming");
+        // plotter->Fill2D("AC_Time_Vs_QQQ_ch", 500, -2500, 2500, 16 * 8, 0, 16 * 8, anodeT - cathodeT, qqq.ch[j], "hTiming");
+        plotter->Fill2D("AC_Time_vs_AIndex", 500, -2500, 2500, 24, 0, 24, anodeT - cathodeT, anodeIndex, "hTiming");
+        plotter->Fill2D("AC_Time_vs_CIndex", 500, -2500, 2500, 24, 0, 24, anodeT - cathodeT, cathodeIndex, "hTiming");
+        // plotter->Fill1D("AC_Time_A" + std::to_string(anodeIndex) + "_C" + std::to_string(cathodeIndex), 200, -1000, 1000, anodeT - cathodeT, "TimingPC");
+      }
+
+      for (int j = 0; j < sx3.multi; j++)
+      {
+        plotter->Fill1D("AC_Time_sx3_coinc", 500, -2500, 2500, anodeT - cathodeT, "hTiming");
+      }
+
+      plotter->Fill1D("AC_Time", 500, -2500, 2500, anodeT - cathodeT, "hTiming");
+    }
+
+    for (int j = i + 1; j < pc.multi; j++)
+    {
+      // plotter->Fill2D("PC_Coincidence_Matrix_anodeMinusCathode_lt_-200_" + std::to_string(anodeT - cathodeT < -200), 48, 0, 48, 48, 0, 48, pc.index[i], pc.index[j], "hRawPC");
+      if(pc.e[i]>50 && pc.e[j]>50)
+      plotter->Fill2D("Anode_V_Anode", 24, 0, 24, 24, 0, 24, pc.index[i], pc.index[j], "hRawPC");
     }
   }
 
-    if(multi_an==1){
-      for(int l=0;l<E.size();l++){
-        if(E[l].first<24 && E[l].first!=20 && E[l].first!=12){
-          aE = E[l].second;
-        }else if(E[l].first>24){
-          cE = E[l].second;
+  anodeHits.clear();
+  cathodeHits.clear();
+  corrcatMax.clear();
+
+  int aID = 0;
+  int cID = 0;
+  double aE = 0;
+  double cE = 0;
+  double aESum = 0;
+  double cESum = 0;
+  double aEMax = 0;
+  int aIDMax = 0;
+
+  for (int i = 0; i < pc.multi; i++)
+  {
+    // if (pc.e[i] > 100)
+    {
+      if (pc.index[i] < 24)
+        anodeHits.push_back(std::pair<int, double>(pc.index[i], pc.e[i]));
+      else if (pc.index[i] >= 24)
+        cathodeHits.push_back(std::pair<int, double>(pc.index[i] - 24, pc.e[i]));
+    }
+  }
+
+  // std::sort(anodeHits.begin(), anodeHits.end(), [](const std::pair<int, double> &a, const std::pair<int, double> &b)
+  //           { return a.second > b.second; });
+  // std::sort(cathodeHits.begin(), cathodeHits.end(), [](const std::pair<int, double> &a, const std::pair<int, double> &b)
+  //           { return a.second > b.second; });
+
+  if (anodeHits.size() >= 1 && cathodeHits.size() >= 1)
+  {
+    // 2. CRITICAL FIX: Define reference vector 'a'
+    // In Analyzer.cxx, 'a' was left over from the loop. We use the first anode wire as reference here.
+    // (Assuming pwinstance.An is populated and wires are generally parallel).
+    TVector3 refAnode = pwinstance.An[0].first - pwinstance.An[0].second;
+
+    {
+      for (const auto &anode : anodeHits)
+      {
+        aID = anode.first;
+        aE = anode.second;
+        aESum += aE;
+        if (aE > aEMax)
+        {
+          aEMax = aE;
+          aIDMax = aID;
+        }
+      }
+
+      for (const auto &cathode : cathodeHits)
+      {
+        cID = cathode.first;
+        cE = cathode.second;
+        plotter->Fill2D("AnodeMax_Vs_Cathode_Coincidence_Matrix", 24, 0, 24, 24, 0, 24, aIDMax, cID, "hRawPC");
+        plotter->Fill2D("Anode_Vs_Cathode_Coincidence_Matrix", 24, 0, 24, 24, 0, 24, aID, cID, "hRawPC");
+        plotter->Fill2D("Anode_vs_CathodeE", 2000, 0, 30000, 2000, 0, 30000, aE, cE, "hGMPC");
+        // plotter->Fill2D("CathodeMult_V_CathodeE", 6, 0, 6, 2000, 0, 30000, cathodeHits.size(), cE, "hGMPC");
+        for (int j = -4; j < 3; j++)
+        {
+          if ((aIDMax + 24 + j) % 24 == 23 - cID)
+          {
+            corrcatMax.push_back(std::pair<int, double>(cID, cE));
+            cESum += cE;
+          }
+        }
+      }
+    }
+  }
+
+  TVector3 anodeIntersection;
+  anodeIntersection.Clear();
+  if (corrcatMax.size() > 0)
+  {
+    double x = 0, y = 0, z = 0;
+    for (const auto &corr : corrcatMax)
+    {
+      if (Crossover[aIDMax][corr.first][0].z > 9000000)
+        continue;
+      if (cESum > 0)
+      {
+        x += (corr.second) / cESum * Crossover[aIDMax][corr.first][0].x;
+        y += (corr.second) / cESum * Crossover[aIDMax][corr.first][0].y;
+        z += (corr.second) / cESum * Crossover[aIDMax][corr.first][0].z;
+      }
+    }
+    if (x == 0 && y == 0 && z == 0)
+      ;
+    // to ignore events with no valid crossover points
+    else
+      anodeIntersection = TVector3(x, y, z);
+    // std::cout << "Anode Intersection: " << anodeIntersection.X() << ", " << anodeIntersection.Y() << ", " << anodeIntersection.Z() << std::endl;
+  }
+  bool PCQQQPhiCut = false;
+  // flip the algorithm for cathode 1 multi anode events
+  if ((hitPos.Phi() > (anodeIntersection.Phi() - TMath::PiOver4())) && (hitPos.Phi() < (anodeIntersection.Phi() + TMath::PiOver4())))
+  {
+    PCQQQPhiCut = true;
+  }
+
+  for (double AIz = 20; AIz <= 100; AIz += 5.0)
+  {
+    TVector3 TargetPos(0, 0, AIz);
+    if (PCQQQPhiCut && anodeIntersection.Perp() != 0 && cathodeHits.size() >= 2)
+      // TVector3 anodePosAtZ(anodeIntersection.X() * (AIz / anodeIntersection.Z()), anodeIntersection.Y() * (AIz / anodeIntersection.Z()), AIz);
+      // TVector3 anodePosAtZ(anodeIntersection.X(), anodeIntersection.Y(),anodeIntersection.Z() + AIz);
+      plotter->Fill2D("Inttheta_vs_QQQtheta_TC" + std::to_string(PCQQQTimeCut) + "_TZ" + std::to_string(AIz), 180, 0, 180, 90, 0, 90, (anodeIntersection - TargetPos).Theta() * 180. / TMath::Pi(),
+                      (hitPos - TargetPos).Theta() * 180. / TMath::Pi(), "TPosVariation");
+  }
+
+  if (anodeIntersection.Perp() != 0)
+  {
+    plotter->Fill1D("PC_Z_Projection", 600, -300, 300, anodeIntersection.Z(), "hPCzQQQ");
+    plotter->Fill2D("Z_Proj_VsDelTime", 600, -300, 300, 200, -2000, 2000, anodeIntersection.Z(), anodeT - cathodeT, "hPCzQQQ");
+    plotter->Fill2D("IntPhi_vs_QQQphi", 100, -200, 200, 80, -200, 200, anodeIntersection.Phi() * 180. / TMath::Pi(), hitPos.Phi() * 180. / TMath::Pi(), "hPCQQQ");
+    plotter->Fill1D("IntRho", 200, 0, 100, anodeIntersection.Perp(), "hRawPC");
+    plotter->Fill2D("Inttheta_vs_QQQtheta", 90, 0, 180, 20, 0, 45, anodeIntersection.Theta() * 180. / TMath::Pi(), hitPos.Theta() * 180. / TMath::Pi(), "hPCQQQ");
+    plotter->Fill2D("Inttheta_vs_QQQtheta_TC" + std::to_string(PCQQQTimeCut), 90, 0, 180, 20, 0, 45, anodeIntersection.Theta() * 180. / TMath::Pi(), hitPos.Theta() * 180. / TMath::Pi(), "hPCQQQ");
+    plotter->Fill2D("IntPhi_vs_QQQphi_TC" + std::to_string(PCQQQTimeCut) + "PhiC" + std::to_string(PCQQQPhiCut), 100, -200, 200, 80, -200, 200, anodeIntersection.Phi() * 180. / TMath::Pi(), hitPos.Phi() * 180. / TMath::Pi(), "hPCQQQ");
+  }
+  if (anodeIntersection.Perp() != 0 && cathodeHits.size() >= 2)
+    plotter->Fill1D("PC_Z_Projection_TC" + std::to_string(PCQQQTimeCut) + "PhiC" + std::to_string(PCQQQPhiCut), 600, -300, 300, anodeIntersection.Z(), "hPCzQQQ");
+
+  if (anodeIntersection.Perp() != 0 && cathodeHits.size() == 1)
+  {
+    plotter->Fill1D("PC_Z_proj_1C", 600, -300, 300, anodeIntersection.Z(), "hPCzQQQ");
+    plotter->Fill2D("IntersectionPhi_vs_AnodeZ_1C", 400, -200, 200, 600, -300, 300, anodeIntersection.Phi() * 180. / TMath::Pi(), anodeIntersection.Z(), "hPCzQQQ");
+  }
+
+  if (anodeIntersection.Perp() != 0 && cathodeHits.size() == 2)
+  {
+    plotter->Fill1D("PC_Z_proj_2C", 600, -300, 300, anodeIntersection.Z(), "hPCzQQQ");
+    plotter->Fill2D("IntersectionPhi_vs_AnodeZ_2C", 400, -200, 200, 600, -300, 300, anodeIntersection.Phi() * 180. / TMath::Pi(), anodeIntersection.Z(), "hPCzQQQ");
+  }
+  if (anodeIntersection.Perp() != 0 && cathodeHits.size() > 2)
+  {
+    plotter->Fill1D("PC_Z_proj_nC", 600, -300, 300, anodeIntersection.Z(), "hPCzQQQ");
+    plotter->Fill2D("IntersectionPhi_vs_AnodeZ_nC", 400, -200, 200, 600, -300, 300, anodeIntersection.Phi() * 180. / TMath::Pi(), anodeIntersection.Z(), "hPCzQQQ");
+  }
+  if (anodeHits.size() > 0 && cathodeHits.size() > 0)
+    plotter->Fill2D("AHits_vs_CHits", 12, 0, 11, 6, 0, 5, anodeHits.size(), cathodeHits.size(), "hRawPC");
+
+  // make another plot with nearest neighbour constraint
+  bool hasNeighbourAnodes = false;
+  bool hasNeighbourCathodes = false;
+
+  // 1. Check Anodes for neighbours (including wrap-around 0-23)
+  for (size_t i = 0; i < anodeHits.size(); i++)
+  {
+    for (size_t j = i + 1; j < anodeHits.size(); j++)
+    {
+      int diff = std::abs(anodeHits[i].first - anodeHits[j].first);
+      if (diff == 1 || diff == 23)
+      { // 23 handles the cylindrical wrap
+        hasNeighbourAnodes = true;
+        break;
+      }
+    }
+    if (hasNeighbourAnodes)
+      break;
+  }
+
+  // 2. Check Cathodes for neighbours (including wrap-around 0-23)
+  for (size_t i = 0; i < cathodeHits.size(); i++)
+  {
+    for (size_t j = i + 1; j < cathodeHits.size(); j++)
+    {
+      int diff = std::abs(cathodeHits[i].first - cathodeHits[j].first);
+      if (diff == 1 || diff == 23)
+      {
+        hasNeighbourCathodes = true;
+        break;
+      }
+    }
+    if (hasNeighbourCathodes)
+      break;
+  }
+
+  // ---------------------------------------------------------
+  // FILL PLOTS
+  // ---------------------------------------------------------
+  if (anodeHits.size() > 0 && cathodeHits.size() > 0)
+  {
+    // plotter->Fill2D("AHits_vs_CHits_NA" + std::to_string(hasNeighbourAnodes), 12, 0, 11, 6, 0, 5, anodeHits.size(), cathodeHits.size(), "hRawPC");
+    // plotter->Fill2D("AHits_vs_CHits_NC" + std::to_string(hasNeighbourCathodes), 12, 0, 11, 6, 0, 5, anodeHits.size(), cathodeHits.size(), "hRawPC");
+
+    // Constraint Plot: Only fill if BOTH planes have adjacent hits
+    // This effectively removes events with only isolated single-wire hits (noise)
+    if (hasNeighbourAnodes && hasNeighbourCathodes)
+    {
+      plotter->Fill2D("AHits_vs_CHits_NN", 12, 0, 11, 6, 0, 5, anodeHits.size(), cathodeHits.size(), "hRawPC");
+    }
+  }
+
+  if (HitNonZero && anodeIntersection.Z() != 0)
+  {
+    pw_contr.CalTrack2(hitPos, anodeIntersection);
+    plotter->Fill1D("VertexRecon", 600, -300, 300, pw_contr.GetZ0());
+
+    if (PCQQQPhiCut && PCQQQTimeCut)
+    {
+      if (cathodeHits.size() == 2)
+        plotter->Fill1D("VertexRecon_TC_PhiC_2C", 600, -300, 300, pw_contr.GetZ0());
+    }
+    plotter->Fill1D("VertexRecon_TC" + std::to_string(PCQQQTimeCut) + "_PhiC" + std::to_string(PCQQQPhiCut), 600, -300, 300, pw_contr.GetZ0());
+  }
+
+  for (int i = 0; i < qqq.multi; i++)
+  {
+    if (PCQQQTimeCut)
+    {
+      plotter->Fill2D("PC_XY_Projection_QQQ_TimeCut" + std::to_string(qqq.id[i]), 400, -100, 100, 400, -100, 100, anodeIntersection.X(), anodeIntersection.Y(), "hPCQQQ");
+    }
+    plotter->Fill2D("PC_XY_Projection_QQQ" + std::to_string(qqq.id[i]), 400, -100, 100, 400, -100, 100, anodeIntersection.X(), anodeIntersection.Y(), "hPCQQQ");
+
+    for (int j = i + 1; j < qqq.multi; j++)
+    {
+      if (qqq.id[i] == qqq.id[j])
+      {
+        int chWedge = -1;
+        int chRing = -1;
+        double eWedge = 0.0;
+        double eWedgeMeV = 0.0;
+        double eRing = 0.0;
+        double eRingMeV = 0.0;
+        double tRing = 0.0;
+        int qqqID = -1;
+        if (qqq.ch[i] < 16 && qqq.ch[j] >= 16 && qqqGainValid[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16])
+        {
+          chWedge = qqq.ch[i];
+          eWedge = qqq.e[i] * qqqGain[qqq.id[i]][qqq.ch[i]][qqq.ch[j] - 16];
+          chRing = qqq.ch[j] - 16;
+          eRing = qqq.e[j];
+          tRing = static_cast<double>(qqq.t[j]);
+          qqqID = qqq.id[i];
+        }
+        else if (qqq.ch[j] < 16 && qqq.ch[i] >= 16 && qqqGainValid[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16])
+        {
+          chWedge = qqq.ch[j];
+          eWedge = qqq.e[j] * qqqGain[qqq.id[j]][qqq.ch[j]][qqq.ch[i] - 16];
+          chRing = qqq.ch[i] - 16;
+          tRing = static_cast<double>(qqq.t[i]);
+          eRing = qqq.e[i];
+          qqqID = qqq.id[i];
+        }
+        else
+          continue;
+
+        if (qqqCalibValid[qqq.id[i]][chRing][chWedge])
+        {
+          eWedgeMeV = eWedge * qqqCalib[qqq.id[i]][chRing][chWedge] / 1000;
+          eRingMeV = eRing * qqqCalib[qqq.id[i]][chRing][chWedge] / 1000;
+        }
+        else
+          continue;
+
+        // if (anodeIntersection.Z() != 0)
+        {
+          plotter->Fill2D("PC_Z_vs_QQQRing", 600, -300, 300, 16, 0, 16, anodeIntersection.Z(), chRing, "hPCzQQQ");
+        }
+
+        if (anodeIntersection.Z() != 0 && cathodeHits.size() == 2)
+        {
+          plotter->Fill2D("PC_Z_vs_QQQRing_2C", 600, -300, 300, 16, 0, 16, anodeIntersection.Z(), chRing, "hPCzQQQ");
+          plotter->Fill2D("PC_Z_vs_QQQRing_2C" + std::to_string(qqq.id[i]), 600, -300, 300, 16, 0, 16, anodeIntersection.Z(), chRing, "hPCzQQQ");
+          plotter->Fill2D("PC_Z_vs_QQQWedge_2C", 600, -300, 300, 16, 0, 16, anodeIntersection.Z(), chWedge, "hPCzQQQ");
+        }
+        plotter->Fill2D("Vertex_V_QQQRing", 600, -300, 300, 16, 0, 16, pw_contr.GetZ0(), chRing, "hPCQQQ");
+        double phi = TMath::ATan2(anodeIntersection.Y(), anodeIntersection.X()) * 180. / TMath::Pi();
+        // while (phi > 180)
+        //   phi -= 180;
+        // while (phi < -180)
+        //   phi += 180;
+        plotter->Fill2D("PolarAngle_Vs_QQQWedge" + std::to_string(qqqID), 360, -360, 360, 16, 0, 16, phi, chWedge, "hPCQQQ");
+        // plotter->Fill2D("EdE_PC_vs_QQQ_timegate_ls1000"+std::to_string())
+
+        plotter->Fill2D("PC_Z_vs_QQQRing_Det" + std::to_string(qqqID), 600, -300, 300, 16, 0, 16, anodeIntersection.Z(), chRing, "hPCQQQ");
+        for (int k = 0; k < pc.multi; k++)
+        {
+          if (pc.index[k] >= 24)
+            continue;
+          plotter->Fill2D("CalibratedQQQE_RvsAnodeE_TC" + std::to_string(PCQQQTimeCut) + "PhiC" + std::to_string(PCQQQPhiCut), 1000, 0, 10, 2000, 0, 30000, eRingMeV, pc.e[k], "hPCQQQ");
+          plotter->Fill2D("CalibratedQQQE_WvsAnodeE_TC" + std::to_string(PCQQQTimeCut) + "PhiC" + std::to_string(PCQQQPhiCut), 1000, 0, 10, 2000, 0, 30000, eWedgeMeV, pc.e[k], "hPCQQQ");
+          plotter->Fill2D("AnodeQQQ_dTimevsdPhi", 200, -2000, 2000, 80, -200, 200, tRing - static_cast<double>(pc.t[k]), (hitPos.Phi() - anodeIntersection.Phi()) * 180. / TMath::Pi(), "hTiming");
+          plotter->Fill1D("AnodeQQQ_Time", 200, -2000, 2000, tRing - static_cast<double>(pc.t[k]));
+        }
       }
     }
   }
 
-  //using CalTrack3 to get the track position and direction
-  
-    // hanVScatsum->Fill(aE,cE);
-      
-    if( HitNonZero){
-      if (ID.size() == 3) {
-        int aID = -1;
-        int cID1 = -1;
-        int cID2 = -1;
-       for (int i = 0; i < ID.size(); i++) {
-          if (pc.ch[ID[i].second] < 24 && pc.ch[ID[i].second] != 20 && pc.ch[ID[i].second] != 12) {
-          aID = pc.ch[ID[i].second];
-          } else if (pc.ch[ID[i].second] > 24) {
-             if (cID1 == -1) {
-              cID1 = pc.ch[ID[i].second];
-              } else {
-              cID2 = pc.ch[ID[i].second];
-              }
-            }
-         }
-        if (aID != -1 && cID1 != -1 && cID2 != -1) {
-          pw_contr.CalTrack3(hitPos, aID, cID1, cID2);
-          pw_contr.Print();
-          printf("###################\n");
-
-          hZProj->Fill(pw_contr.GetZ0());
-        }
-      }
+  TVector3 guessVertex(0, 0, 90.);
+  // rho=40.0 mm is halfway between the cathodes(rho=42) and anodes(rho=37)
+  double pcz_guess = 42.0 / TMath::Tan((hitPos - guessVertex).Theta()) + guessVertex.Z(); // this is ideally kept to be all QQQ+userinput for calibration of pcz
+  if (PCQQQTimeCut && PCQQQPhiCut && hitPos.Perp() > 0 && anodeIntersection.Perp() > 0 && cathodeHits.size() >= 2)
+  {
+    plotter->Fill2D("pczguess_vs_qqqE", 100, 0, 200, 800, 0, 20, pcz_guess, qqqenergy, "pczguess");
+    // plotter->Fill2D("pczguess_vs_pcz_rad="+std::to_string(hitPos.Perp()),100,0,200,150,0,200,pcz_guess,anodeIntersection.Z(),"pczguess"); //entirely qqq-derived position vs entirely PC derived position
+    plotter->Fill2D("pczguess_vs_pcz_phi=" + std::to_string(hitPos.Phi() * 180. / M_PI), 100, 0, 200, 150, 0, 200, pcz_guess, anodeIntersection.Z() / 0.8, "pczguess"); // entirely qqq-derived position vs entirely PC derived position
+    plotter->Fill2D("pczguess_vs_pcz", 100, 0, 200, 150, 0, 200, pcz_guess, anodeIntersection.Z() / 0.8);
+    plotter->Fill2D("pcz_vs_pcPhi_rad=" + std::to_string(hitPos.Perp()), 360, 0, 360, 150, 0, 200, anodeIntersection.Phi() * 180. / M_PI, anodeIntersection.Z() / 0.8, "pczguess");
   }
 
-  // }
+  for (int i = 0; i < sx3.multi; i++)
+  {
+    // plotting sx3 strip hits vs anode phi
+    if (sx3.ch[i] < 8)
+      plotter->Fill2D("AnodePhi_vs_SX3Strip", 100, -200, 200, 8 * 24, 0, 8 * 24, anodeIntersection.Phi() * 180. / TMath::Pi(), sx3.id[i] * 8 + sx3.ch[i]);
   }
 
+  if (anodeIntersection.Z() != 0 && cathodeHits.size() == 3)
+  {
+    plotter->Fill1D("PC_Z_proj_3C", 600, -300, 300, anodeIntersection.Z(), "hPCzQQQ");
+  }
 
+  plotter->Fill2D("AnodeMaxE_Vs_Cathode_Sum_Energy", 2000, 0, 30000, 2000, 0, 30000, aEMax, cESum, "hGMPC");
+  plotter->Fill1D("Correlated_Cathode_MaxAnode", 6, 0, 5, corrcatMax.size(), "hGMPC");
+  plotter->Fill2D("Correlated_Cathode_VS_MaxAnodeEnergy", 6, 0, 5, 2000, 0, 30000, corrcatMax.size(), aEMax, "hGMPC");
+  plotter->Fill1D("AnodeHits", 12, 0, 11, anodeHits.size(), "hGMPC");
+  plotter->Fill2D("AnodeMaxE_vs_AnodeHits", 12, 0, 11, 2000, 0, 30000, anodeHits.size(), aEMax, "hGMPC");
 
-  //########################################################### Track constrcution
-
-
-  //############################## DO THE KINEMATICS
-
+  if (anodeHits.size() < 1)
+  {
+    plotter->Fill1D("NoAnodeHits_CathodeHits", 6, 0, 5, cathodeHits.size(), "hGMPC");
+  }
 
   return kTRUE;
 }
 
-void TrackRecon::Terminate(){
-
-  gStyle->SetOptStat("neiou");
-  TCanvas * canvas = new TCanvas("cANASEN", "ANASEN", 200, 200); 
-  padID=1;
- canvas->cd(padID); canvas->cd(padID)->SetGrid(1);
-
- hZProj->Draw();
-
+void TrackRecon::Terminate()
+{
+  plotter->FlushToDisk();
 }

TrackRecon.h

@@ -5,19 +5,21 @@
 #include <TChain.h>
 #include <TFile.h>
 #include <TSelector.h>
+#include <vector>         // Required for vectors
+#include <utility>        // Required for std::pair
 
 #include "Armory/ClassDet.h"
+#include "Armory/ClassPW.h" // YOU ADDED THIS (Correct! Defines Coord)
 
 class TrackRecon : public TSelector {
 public :
    TTree          *fChain;   //!pointer to the analyzed TTree or TChain
 
-// Fixed size dimensions of array or collections stored in the TTree if any.
-
    // Declaration of leaf types
    Det sx3;
    Det qqq;
    Det pc ;
+   Det misc;
 
    ULong64_t       evID;
    UInt_t          run;
@@ -40,6 +42,20 @@ public :
    TBranch        *b_pcCh;   //!
    TBranch        *b_pcE;   //!
    TBranch        *b_pcT;   //!
+   TBranch        *b_miscMulti;   //!
+   TBranch        *b_miscID;   //!
+   TBranch        *b_miscCh;   //!
+   TBranch        *b_miscE;   //!
+   TBranch        *b_miscT;   //!
+   TBranch        *b_miscTf;   //!
+
+   // 1. Geometry Cache
+   Coord Crossover[24][24][2];
+
+   // 2. Persistent Vectors (REQUIRED for the optimized .cxx to work)
+   std::vector<std::pair<int, double>> anodeHits;
+   std::vector<std::pair<int, double>> cathodeHits;
+   std::vector<std::pair<int, double>> corrcatMax;
 
    TrackRecon(TTree * /*tree*/ =0) : fChain(0) { }
    virtual ~TrackRecon() { }
@@ -65,7 +81,6 @@ public :
 #ifdef TrackRecon_cxx
 void TrackRecon::Init(TTree *tree){
 
-   // Set branch addresses and branch pointers
    if (!tree) return;
    fChain = tree;
    fChain->SetMakeClass(1);
@@ -92,23 +107,21 @@ void TrackRecon::Init(TTree *tree){
    fChain->SetBranchAddress("pcCh",     &pc.ch, &b_pcCh);
    fChain->SetBranchAddress("pcE",      &pc.e, &b_pcE);
    fChain->SetBranchAddress("pcT",      &pc.t, &b_pcT);
-
+   fChain->SetBranchAddress("miscMulti", &misc.multi, &b_miscMulti);
+   fChain->SetBranchAddress("miscID",    &misc.id, &b_miscID);
+   fChain->SetBranchAddress("miscCh",    &misc.ch, &b_miscCh);
+   fChain->SetBranchAddress("miscE",     &misc.e, &b_miscE);
+   fChain->SetBranchAddress("miscT",     &misc.t, &b_miscT);
 }
 
 Bool_t TrackRecon::Notify(){
-
    return kTRUE;
 }
 
 void TrackRecon::SlaveBegin(TTree * /*tree*/){
-
-   TString option = GetOption();
-
+   // TString option = GetOption();
 }
 
 void TrackRecon::SlaveTerminate(){
-
 }
-
-
 #endif // #ifdef TrackRecon_cxx

centroids.txt

@@ -0,0 +1,97 @@
+HistogramIndex	PeakNumber	Centroid	Amplitude	Sigma
+0	1	991.118
+0	2	2026.83
+0	3	3060.26
+0	4	4092.45
+1	1	922.213
+1	2	1885.55
+1	3	2845.53
+1	4	3810.32
+2	1	955.591
+2	2	1953.17
+2	3	2949.37
+2	4	3950.79
+3	1	995.787
+3	2	2036.58
+3	3	3076.91
+3	4	4112.05
+4	1	1017.48
+4	2	2080.19
+4	3	3142.24
+4	4	4206.1
+5	1	1022.78
+5	2	2091.21
+5	3	3158.28
+5	4	4226.97
+6	1	1076.22
+6	2	2203.37
+6	3	3329.53
+6	4	4457.69
+7	1	977.46
+7	2	1998.02
+7	3	3017.36
+7	4	4040.47
+8	1	1049.74
+8	2	2144.38
+8	3	3238.2
+8	4	4335.25
+9	1	1000.59
+9	2	2046.42
+9	3	3090.29
+9	4	4129.63
+10	1	1014.92
+10	2	2076.16
+10	3	3134.59
+10	4	4213.42
+11	1	1004.85
+11	2	2052.88
+11	3	3100.3
+11	4	4164.75
+12	1	945.861
+12	2	1932.49
+12	3	2917.95
+12	4	3955.15
+13	1	998.307
+13	2	2040.38
+13	3	3078.76
+13	4	4135.51
+14	1	966.429
+14	2	1972.15
+14	3	2974.84
+14	4	4056.41
+15	1	958.352
+15	2	1958.64
+15	3	2957.7
+15	4	3970.41
+16	1	970.732
+16	2	1977.63
+16	3	2984.97
+16	4	4002.56
+17	1	1013.65
+17	2	2064.9
+17	3	3114.19
+17	4	4190.98
+18	1	975.538
+18	2	1990.64
+18	3	3005.46
+18	4	4048.99
+19	1	1082.91
+19	2	2194.08
+19	3	3303.65
+19	4	4411.32
+20	1	912.778
+20	2	1866.83
+20	3	2819.21
+20	4	3781.63
+21	1	1002.36
+21	2	1989.95
+21	3	2975.53
+21	4	3986.71
+22	1	1075.38
+22	2	2144.25
+22	3	3210.17
+22	4	4312.84
+23	1	988.828
+23	2	2016.35
+23	3	3044.19
+23	4	4082.41

centroids_edited.txt

@@ -0,0 +1,89 @@
+HistogramIndex	PeakNumber	Centroid	Amplitude	Sigma
+1	1	922.213
+1	2	1885.55
+1	3	2845.53
+1	4	3810.32
+2	1	955.591
+2	2	1953.17
+2	3	2949.37
+2	4	3950.79
+3	1	995.787
+3	2	2036.58
+3	3	3076.91
+3	4	4112.05
+4	1	1017.48
+4	2	2080.19
+4	3	3142.24
+4	4	4206.1
+5	1	1022.78
+5	2	2091.21
+5	3	3158.28
+5	4	4226.97
+6	1	1076.22
+6	2	2203.37
+6	3	3329.53
+6	4	4457.69
+7	1	977.46
+7	2	1998.02
+7	3	3017.36
+7	4	4040.47
+8	1	1049.74
+8	2	2144.38
+8	3	3238.2
+8	4	4335.25
+9	1	1000.59
+9	2	2046.42
+9	3	3090.29
+9	4	4129.63
+10	1	1014.92
+10	2	2076.16
+10	3	3134.59
+10	4	4213.42
+11	1	1004.85
+11	2	2052.88
+11	3	3100.3
+11	4	4164.75
+12	1	945.861
+12	2	1932.49
+12	3	2917.95
+12	4	3955.15
+13	1	998.307
+13	2	2040.38
+13	3	3078.76
+13	4	4135.51
+14	1	966.429
+14	2	1972.15
+14	3	2974.84
+14	4	4056.41
+15	1	958.352
+15	2	1958.64
+15	3	2957.7
+15	4	3970.41
+16	1	970.732
+16	2	1977.63
+16	3	2984.97
+16	4	4002.56
+17	1	1013.65
+17	2	2064.9
+17	3	3114.19
+17	4	4190.98
+18	1	975.538
+18	2	1990.64
+18	3	3005.46
+18	4	4048.99
+20	1	912.778
+20	2	1866.83
+20	3	2819.21
+20	4	3781.63
+21	1	1002.36
+21	2	1989.95
+21	3	2975.53
+21	4	3986.71
+22	1	1075.38
+22	2	2144.25
+22	3	3210.17
+22	4	4312.84
+23	1	988.828
+23	2	2016.35
+23	3	3044.19
+23	4	4082.41

gainmatch.C

@@ -1,541 +0,0 @@
-#define gainmatch_cxx
-
-#include "gainmatch.h"
-#include <TH2.h>
-#include <TStyle.h>
-#include <TCanvas.h>
-#include <TMath.h>
-#include <TCutG.h>
-
-
-#include <utility>
-#include <algorithm>
-
-#include "Armory/ClassSX3.h"
-#include "Armory/ClassPW.h"
-
-#include "TVector3.h"
-
-TH2F * hsx3IndexVE;
-TH2F * hqqqIndexVE;
-TH2F * hqqqIndexVE_cut;
-TH2F * hpcIndexVE;
-
-TH2F * hsx3Coin;
-TH2F * hqqqCoin;
-TH2F * hpcCoin;
-TH2F * hpcCoin_cut;
-
-TH2F * hGoodQQQ;
-TH2F * hGoodQQQRingVWedge;
-
-TH2F * hqqqPolar;
-TH2F * hsx3VpcIndex;
-TH2F * hqqqVpcIndex;
-TH2F * hqqqVpcIndex_cut;
-TH2F * hqqqVpcE;
-TH2F * hqqqVpcE_cut;
-TH2F * hqqqVpcE_cut1;
-TH2F * hqqqVpcE_cut2;
-TH2F * hqqqVpcE_cutCoinc;
-TH2F * hsx3VpcE;
-TH2F * hanVScatsum;
-TH2F * hanVScatsum_cut;
-TH2F * hanVScatsum_cut1;
-TH2F * hanVScatsum_cut2;
-TH2F * hsx3Vsx3;
-TH2F * hsx3uVsx3d_01;
-TH2F * hsx3uVsx3d_23;
-TH2F * hsx3uVsx3d_45;
-TH2F * hsx3uVsx3d_67;
-TH2F * hVCID;
-TH1F *hsx3bk_9_shifted ;
-TH1F *hsx3bk_10_shifted ;
-TH1F *hsx3bk_11_shifted ;
-
-int padID = 0;
-
-TCutG *Coinc_cut_set1;
-//TCutG *crap_cut;
-TCutG *AnCathCoinc_cut;
-TCutG *AnCathCoinc_cut1;
-TCutG *AnCathCoinc_cut2;
-
-SX3 sx3_contr;
-PW pw_contr;
-TVector3 hitPos;
-bool HitNonZero;
-bool inCut;
-bool inCut1;
-bool inCut2;
-bool inCutCoinc;
-TH1F *hZd_01_1;
-TH1F *hZd_01_2;
-TH1F *hZd_01_3;
-TH1F *hZd_01_4;
-TH1F * hZProj;
-TH1F * hsx3bk_11;
-TH1F * hsx3bk_10;
-TH1F * hsx3bk_9;
-TH1F * hsx3bk_8;
-void gainmatch::Begin(TTree * /*tree*/){
-  TString option = GetOption();
-
-  hsx3IndexVE = new TH2F("hsx3IndexVE", "SX3 index vs Energy; sx3 index ; Energy",  24*12, 0,  24*12, 400, 0, 5000); hsx3IndexVE->SetNdivisions( -612, "x");
-  hqqqIndexVE = new TH2F("hqqqIndexVE", "QQQ index vs Energy; QQQ index ; Energy", 4*2*16, 0, 4*2*16, 400, 0, 5000); hqqqIndexVE->SetNdivisions( -1204, "x");
-    hqqqIndexVE_cut = new TH2F("hqqqIndexVE_cut", "QQQ index vs Energy gated; QQQ index ; Energy", 4*2*16, 0, 4*2*16, 400, 0, 5000); hqqqIndexVE->SetNdivisions( -1204, "x");
-  hpcIndexVE = new TH2F("hpcIndexVE",   "PC index vs Energy; PC index ; Energy",     2*24, 0,   2*24, 400, 0, 4000); hpcIndexVE->SetNdivisions( -1204, "x");
-
-  hGoodQQQ = new TH2F("hGoodQQQ", "number of good QQQ vs QQQ id", 10, 0, 10, 4, 0, 4);
-  hGoodQQQRingVWedge = new TH2F("hGoodQQQRingVWedge", "Ring index, Wedge index", 16*4, 0, 16*4, 16*4, 0, 16*4);
-  hZd_01_1 =new TH1F("hZd_01_1", "Z position", 100, -1, 1); 
-  hZd_01_2 =new TH1F("hZd_01_2", "Z position", 100, -1, 1); 
-  hZd_01_3 =new TH1F("hZd_01_3", "Z position", 100, -1, 1); 
-  hZd_01_4 =new TH1F("hZd_01_4", "Z position", 100, -1, 1); 
-  hsx3Coin = new TH2F("hsx3Coin", "SX3 Coincident",  24*12, 0,  24*12,  24*12, 0, 24*12);
-  hqqqCoin = new TH2F("hqqqCoin", "QQQ Coincident", 4*2*16, 0, 4*2*16, 4*2*16, 0, 4*2*16);
-  hpcCoin  = new TH2F("hpcCoin",  "PC Coincident",    2*24, 0,   2*24,   2*24, 0, 2*24);
-  hpcCoin_cut  = new TH2F("hpcCoin_cut",  "PC Coincident gated",    2*24, 0,   2*24,   2*24, 0, 2*24);
-    
-  hqqqPolar = new TH2F("hqqqPolar", "QQQ Polar ID", 16*4, -TMath::Pi(), TMath::Pi(),16, 10, 50);
-
-  hsx3VpcIndex = new TH2F("hsx3Vpcindex", "sx3 vs pc; sx3 index; pc index",  24*12, 0, 24*12, 48, 0, 48);
-  hsx3Vsx3 = new TH2F("hsx3Vsx3", "sx3 vs sx3; sx3 E; sx3 E",  8000, 0, 16000, 8000, 0, 16000);
-  hsx3uVsx3d_01 = new TH2F("hsx3uVsx3d_01", "sx3u vs sx3d; sx3u E; sx3d E",  100, 0, 1, 100, 0, 1);
-  hsx3uVsx3d_23 = new TH2F("hsx3uVsx3d_23", "sx3u vs sx3d; sx3u E; sx3d E",  100, 0, 1, 100, 0, 1);
-  hsx3uVsx3d_45 = new TH2F("hsx3uVsx3d_45", "sx3u vs sx3d; sx3u E; sx3d E",  1000, 0, 5000, 1000, 0, 5000);
-  hsx3uVsx3d_67 = new TH2F("hsx3uVsx3d_67", "sx3u vs sx3d; sx3u E; sx3d E",  1000, 0, 5000, 1000, 0, 5000);
-  hsx3VpcIndex->SetNdivisions( -612, "x");
-  hsx3VpcIndex->SetNdivisions( -12, "y");
-  
-  hqqqVpcIndex = new TH2F("hqqqVpcindex", "qqq vs pc; qqq index; pc index",  4*2*16, 0, 4*2*16, 48, 0, 48);
-  hqqqVpcIndex->SetNdivisions( -612, "x");
-  hqqqVpcIndex->SetNdivisions( -12, "y");
-
-  hqqqVpcIndex_cut = new TH2F("hqqqVpcindex_cut", "qqq vs pc gated; qqq index; pc index",  4*2*16, 0, 4*2*16, 48, 0, 48);
-  hqqqVpcIndex_cut->SetNdivisions( -612, "x");
-  hqqqVpcIndex_cut->SetNdivisions( -12, "y");
-
-  hqqqVpcE = new TH2F("hqqqVpcEnergy", "qqq vs pc; qqq energy; pc energy", 8000, 0, 16000, 8000, 0, 16000);
-  hqqqVpcE->SetNdivisions( -612, "x");
-  hqqqVpcE->SetNdivisions( -12, "y");
-    
-  hqqqVpcE_cut = new TH2F("hqqqVpcEnergy_cut", "qqq vs pc gated; qqq energy; pc energy", 8000, 0, 16000, 8000, 0, 16000);
-  hqqqVpcE_cut->SetNdivisions( -612, "x");
-  hqqqVpcE_cut->SetNdivisions( -12, "y");
-    
-    hqqqVpcE_cut1 = new TH2F("hqqqVpcEnergy_cut1", "qqq vs pc gated; qqq energy; pc energy", 8000, 0, 16000, 8000, 0, 16000);
-    hqqqVpcE_cut1->SetNdivisions( -612, "x");
-    hqqqVpcE_cut1->SetNdivisions( -12, "y");
-      
-    hqqqVpcE_cut2 = new TH2F("hqqqVpcEnergy_cut2", "qqq vs pc gated; qqq energy; pc energy", 8000, 0, 16000, 8000, 0, 16000);
-    hqqqVpcE_cut2->SetNdivisions( -612, "x");
-    hqqqVpcE_cut2->SetNdivisions( -12, "y");
-    
-    hqqqVpcE_cutCoinc = new TH2F("hqqqVpcEnergy_cutCoinc", "qqq vs pc gated; qqq energy; pc energy", 8000, 0, 16000, 8000, 0, 16000);
-    hqqqVpcE_cutCoinc->SetNdivisions( -612, "x");
-    hqqqVpcE_cutCoinc->SetNdivisions( -12, "y");
-  hsx3bk_8=new TH1F("hsx3bk_8", "hsx3bk_8",1000, 0,5000);
-  hsx3bk_9=new TH1F("hsx3bk_9", "hsx3bk_9",1000, 0,5000);
-  hsx3bk_10=new TH1F("hsx3bk_10", "hsx3bk_10",1000, 0,5000); 
-  hsx3bk_11=new TH1F("hsx3bk_11", "hsx3bk_11",1000, 0,5000);
-  hsx3VpcE = new TH2F("hsx3VpcEnergy", "sx3 vs pc; sx3 energy; pc energy", 400, 0, 5000, 400, 0, 5000);
-  hsx3VpcE->SetNdivisions( -612, "x");
-  hsx3VpcE->SetNdivisions( -12, "y");
-  hsx3bk_9_shifted  = new TH1F("hsx3bk_9_shifted", "hsx3bk_9",1000, 0,5000);
-  hsx3bk_10_shifted  = new TH1F("hsx3bk_10_shifted", "hsx3bk_9",1000, 0,5000);
-  hsx3bk_11_shifted  = new TH1F("hsx3bk_11_shifted", "hsx3bk_9",1000, 0,5000);
-  hZProj = new TH1F("hZProj", "Z Projection", 200, -600, 600);
-
-  hanVScatsum = new TH2F("hanVScatsum", "Anode vs Cathode Sum; Anode E; Cathode E", 8000,0 , 16000, 8000, 0 , 16000);
-  hanVScatsum_cut = new TH2F("hanVScatsum_cut", "Anode vs Cathode Sum gated; Anode E; Cathode E", 1600,0 , 16000, 1600, 0 , 16000);
-    hanVScatsum_cut1 = new TH2F("hanVScatsum_cut1", "Anode vs Cathode Sum gated; Anode E; Cathode E", 1600,0 , 16000, 1600, 0 , 16000);
-    hanVScatsum_cut2 = new TH2F("hanVScatsum_cut2", "Anode vs Cathode Sum gated; Anode E; Cathode E", 1600,0 , 16000, 1600, 0 , 16000);
-
-  hVCID = new TH2F("hVCID", "Virtual Cathod ID vs total Cath. Energy", 200, 0, 24, 200, 0, 10000);
-
-  sx3_contr.ConstructGeo();
-  pw_contr.ConstructGeo();
-
-  TFile *f3 = new TFile("Coinc_cut_set1.root");
-    //TFile *f4 = new TFile("crap_cut.root");
-  TFile *f = new TFile("AnCathCoinc_cut.root");
-    TFile *f1 = new TFile("AnCathCoinc_cut1.root");
-    TFile *f2 = new TFile("AnCathCoinc_cut2.root");
-
-    
-  Coinc_cut_set1 = (TCutG*)f3->Get("Coinc_cut_set1");
-    //crap_cut = (TCutG*)f4->Get("crap_cut");
-  AnCathCoinc_cut = (TCutG*)f->Get("AnCathCoinc_cut");
-    AnCathCoinc_cut1 = (TCutG*)f1->Get("AnCathCoinc_cut1");
-    AnCathCoinc_cut2 = (TCutG*)f2->Get("AnCathCoinc_cut2");
-
-    
-}
-
-
-
-
-Bool_t gainmatch::Process(Long64_t entry){
-
-  // if ( entry > 100 ) return kTRUE;
-
-  hitPos.Clear();
-  HitNonZero = false;
-    inCut = false;
-
-  // if( entry > 1) return kTRUE;
-  // printf("################### ev : %llu \n", entry);
-
-  b_sx3Multi->GetEntry(entry);
-  b_sx3ID->GetEntry(entry);
-  b_sx3Ch->GetEntry(entry);
-  b_sx3E->GetEntry(entry);
-  b_sx3T->GetEntry(entry);
-  b_qqqMulti->GetEntry(entry);
-  b_qqqID->GetEntry(entry);
-  b_qqqCh->GetEntry(entry);
-  b_qqqE->GetEntry(entry);
-  b_qqqT->GetEntry(entry);
-  b_pcMulti->GetEntry(entry);
-  b_pcID->GetEntry(entry);
-  b_pcCh->GetEntry(entry);
-  b_pcE->GetEntry(entry);
-  b_pcT->GetEntry(entry);
-
-  sx3.CalIndex();
-  qqq.CalIndex();
-  pc.CalIndex();
-
-  // sx3.Print();
-
-  //########################################################### Raw data
-  // //======================= SX3
-
-std::vector<std::pair<int, int>> ID; // first = id, 2nd = index
-for (int i = 0; i < sx3.multi; i++) {
-    ID.push_back(std::pair<int, int>(sx3.id[i], i));
-
-    hsx3IndexVE->Fill(sx3.index[i], sx3.e[i]);
-
-    for (int j = i + 1; j < sx3.multi; j++) {
-        hsx3Coin->Fill(sx3.index[i], sx3.index[j]);
-    }
-
-    for (int j = 0; j < pc.multi; j++) {
-        hsx3VpcIndex->Fill(sx3.index[i], pc.index[j]);
-    }
-}
-
-if (ID.size() > 0) {
-    std::sort(ID.begin(), ID.end(), [](const std::pair<int, int> &a, const std::pair<int, int> &b) {
-        return a.first < b.first;
-    });
-
-    std::vector<std::pair<int, int>> sx3ID;
-    sx3ID.push_back(ID[0]);
-    bool found = false;
-    for (size_t i = 1; i < ID.size(); i++) {
-        if (ID[i].first == sx3ID.back().first) {
-            sx3ID.push_back(ID[i]);
-            if (sx3ID.size() >= 3) {
-                found = true;
-            }
-        } else {
-            if (!found) {
-                sx3ID.clear();
-                sx3ID.push_back(ID[i]);
-            }
-        }
-    }
-
-    if (found) {
-        int sx3ChUp = -1, sx3ChDn = -1, sx3ChBk = -1;
-        float sx3EUp = 0.0, sx3EDn = 0.0, sx3EBk = 0.0;
-
-        for (size_t i = 0; i < sx3ID.size(); i++) {
-            int index = sx3ID[i].second;
-
-            if (sx3.ch[index] < 8) {
-                if (sx3.ch[index] % 2 == 0) {
-                    sx3ChDn = sx3.ch[index];
-                    sx3EDn = sx3.e[index];
-                } else {
-                    sx3ChUp = sx3.ch[index];
-                    sx3EUp = sx3.e[index];
-                }
-            } else {
-                sx3ChBk = sx3.ch[index];
-                sx3EBk = sx3.e[index];
-            }
-
-            int ch = sx3.ch[index];
-            float energy = sx3.e[index];
-            if (sx3ID[0].first == 9) {
-               float peak8 = 0.0;
-    		float peak9 = 0.0;
-    		int peak10 = 0.0;
-   		float peak11 = 0.0;
-   		float shift9 =0.0;
-   		float shift10 =0.0;
-   		float shift11 =0.0;
-   		int minBin_8 = hsx3bk_8->FindBin(1);
-                int maxBin_8 = hsx3bk_8->FindBin(5000);
-                int maxRangeBinContent_8 = -1;
-                double maxBinCenter_8 = 0.0;
-                int minBin_9 = hsx3bk_9->FindBin(1);
-                int maxBin_9 = hsx3bk_9->FindBin(5000);
-                int maxRangeBinContent_9 = -1;
-                double maxBinCenter_9 = 0.0;
-                int minBin_10 = hsx3bk_10->FindBin(1);
-                int maxBin_10 = hsx3bk_10->FindBin(5000);
-                int maxRangeBinContent_10 = -1;
-                double maxBinCenter_10 = 0.0;
-                int minBin_11 = hsx3bk_11->FindBin(1);
-                int maxBin_11 = hsx3bk_11->FindBin(5000);
-                int maxRangeBinContent_11 = -1;
-                double maxBinCenter_11 = 0.0;
-                if (sx3ChBk == 8) {
-                   
-                   hsx3bk_8->Fill(sx3EBk);
-                    
-
-                    for (int bin = minBin_8; bin <= maxBin_8; ++bin) {
-                       if (hsx3bk_8->GetBinContent(bin) > maxRangeBinContent_8) {
-                         maxRangeBinContent_8 = hsx3bk_8->GetBinContent(bin);
-                         maxBinCenter_8 = hsx3bk_8->GetBinCenter(bin);
-                       }
-                    }
-
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                   //printf("peak8: %f\n",  maxBinCenter_8);
-                }
-               //printf("peak8_mm: %f\n",  maxBinCenter);
-               else if (sx3ChBk == 9) {
-                  
-                   hsx3bk_9->Fill(sx3EBk);
-                   for (int bin = minBin_9; bin <= maxBin_9; ++bin) {
-                       if (hsx3bk_9->GetBinContent(bin) > maxRangeBinContent_9) {
-                         maxRangeBinContent_9 = hsx3bk_9->GetBinContent(bin);
-                         maxBinCenter_9 = hsx3bk_9->GetBinCenter(bin);
-                       }
-                    }
-
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                    //printf("peak9: %f\n",  maxBinCenter_9);
-                   //hsx3bk_9_shifted->Fill(sx3EBk*0.76);
-                    peak9 = 2097.5/maxBinCenter_9;
-                    //printf("peak9_shift: %f\n",  peak9);
-                    hsx3bk_9_shifted->Fill(sx3EBk*(2097.5/maxBinCenter_9));
-                   //printf("peak9 %d\n", peak9);
-                }
-               else if(sx3ChBk == 10) {
-                    
-                   hsx3bk_10->Fill(sx3EBk);
-                   for (int bin = minBin_10; bin <= maxBin_10; ++bin) {
-                       if (hsx3bk_10->GetBinContent(bin) > maxRangeBinContent_10) {
-                         maxRangeBinContent_10 = hsx3bk_10->GetBinContent(bin);
-                         maxBinCenter_10 = hsx3bk_10->GetBinCenter(bin);
-                       }
-                    }
-
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                    //printf("peak10: %f\n",  maxBinCenter_10);
-                   //hsx3bk_9_shifted->Fill(sx3EBk*0.76);
-                    peak10= 2097.5/maxBinCenter_10;
-                    //printf("peak10_shift: %f\n", 1787.5/maxBinCenter_10);
-                    hsx3bk_10_shifted->Fill(sx3EBk*(2097.5/maxBinCenter_10));
-                   //printf("peak9 %d\n", peak9);
-                }
-                   //peak10 = hsx3bk_10->GetMaximumBin();
-                   // printf("peak10 %d\n" ,peak10);
-               
-              else if(sx3ChBk == 11) {
-                   
-                   hsx3bk_11->Fill(sx3EBk);
-                   for (int bin = minBin_11; bin <= maxBin_11; ++bin) {
-                       if (hsx3bk_11->GetBinContent(bin) > maxRangeBinContent_11) {
-                         maxRangeBinContent_11 = hsx3bk_11->GetBinContent(bin);
-                         maxBinCenter_11 = hsx3bk_11->GetBinCenter(bin);
-                       }
-                    }
-
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                   //peak8 = hsx3bk_8->GetMaximumBin();
-                    //printf("peak9: %f\n",  maxBinCenter_11);
-                   //hsx3bk_9_shifted->Fill(sx3EBk*0.76);
-                    peak11 = 2097.5/maxBinCenter_11;
-                    //printf("peak11_shift: %f\n",  peak11);
-                    hsx3bk_11_shifted->Fill(sx3EBk*(2097.5/maxBinCenter_11));
-                   //printf("peak9 %d\n", peak9);
-                
-                }
-                 
-    	          
-                  float sx3EBk_shifted = 0.0;
-                  float sx3E_u_matched_01 = 0.0;
-                  float sx3E_d_matched_01 = 0.0;
-                  float sx3E_fb_matched_01 = 0.0;
-                  float sx3E_fbu_matched_01 = 0.0;
-                  float sx3E_fbd_matched_01 = 0.0;  
-                  float diff =0.0;
-                  float ratio = 0.0;
-                  float coeff = 0.0;
-                     if (sx3ChBk == 9) {
-                        sx3EBk_shifted = (sx3EBk *(2097.5/maxBinCenter_9));
-                     } else if (sx3ChBk == 10) {
-                        sx3EBk_shifted = (sx3EBk * (2097.5/maxBinCenter_10));
-                     } else if (sx3ChBk == 11) {
-                       sx3EBk_shifted = (sx3EBk * (2097.5/maxBinCenter_11)) ;
-                     } else {
-                     sx3EBk_shifted = sx3EBk; // Use unshifted value for sx3ChBk == 8
-                     }
-                     if ((sx3ChUp == 1 && sx3ChDn == 0)) {
-                        sx3E_u_matched_01= (sx3EUp-0.898729)/0.836243;
-                        //sx3E_u_matched_01= (0.836243*sx3EDn)+0.898729;
-                        sx3E_d_matched_01= (sx3EDn-0.898729)/0.836243;
-                        sx3E_fb_matched_01=(sx3EBk_shifted+9.2423)/0.924773 ;
-                        sx3E_fbu_matched_01=(sx3E_u_matched_01+9.2423)/0.924773 ;
-                        sx3E_fbd_matched_01=(sx3E_d_matched_01+9.2423)/0.924773 ;
-                        diff = sx3E_fb_matched_01 - (sx3EUp+sx3E_fbd_matched_01);
-                        ratio = sx3EUp/sx3E_fbd_matched_01;
-                        coeff = ((sx3EUp+diff) - (sx3E_fbd_matched_01*ratio))/(diff*(1+ratio));
-                     }
-                     
-                 //TH2F *hsx3uVsx3d_01 = nullptr;
-               if (sx3ChBk >=8) { 
-                    
-                  //if (sx3ChBk == 9) {
-                     
-
-                       
-                          if ((sx3ChUp == 1 && sx3ChDn == 0)) {
-                             if (sx3ChUp != -1 && sx3ChDn != -1 && sx3ChBk !=-1) {
-                                if (sx3EBk_shifted > 50 && sx3EUp > 50 && sx3EDn > 50) {
-                                 printf("sx3EUp: %f, sx3EDn: %f, sx3E_u_matched_01: %f,sx3E_d_matched_01: %f\n", sx3EUp, sx3EDn, sx3E_u_matched_01,sx3E_d_matched_01);
-                              //printf("Filling hsx3uVsx3d_01_shifted: %f\n", sx3EBk_ud_matched_01 / sx3EBk_shifted);   
-                             // hsx3uVsx3d_01->Fill(sx3E_u_matched_01 / sx3EBk_shifted, sx3E_d_matched_01 / sx3EBk_shifted);
-                                  hsx3uVsx3d_01->Fill(sx3EUp / sx3EBk_shifted, sx3E_d_matched_01 / sx3EBk_shifted);                              
-                                  hsx3uVsx3d_23->Fill(sx3EUp / sx3EBk_shifted, sx3EDn/ sx3EBk_shifted);
-                            }
-                       } 
-                 //}
-                }     
-                  else if ((sx3ChUp == 3 && sx3ChDn == 2)) {
-                       if (sx3ChUp != -1 && sx3ChDn != -1 && sx3ChBk !=-1) {
-                         if (sx3EBk_shifted != 0 && sx3EBk_shifted > 50 && sx3EUp > 50 && sx3EDn > 50) {
-                              printf("sx3EUp: %f, sx3EDn: %f, sx3EBk_shifted: %f\n", sx3EUp, sx3EDn, sx3EBk_shifted);
-                              printf("Filling hsx3uVsx3d_23_shifted: %f\n", sx3EUp / sx3EBk_shifted);
-                             // hsx3uVsx3d_23->Fill(sx3EUp / sx3EBk_shifted, (-0.924754*sx3EUp+0.916671) / sx3EBk_shifted);
-                          
-                         }
-                      }    
-                  }   
-                   /* if ((sx3ChUp == 1 && sx3ChDn == 0)) {
-                        if (sx3ChUp != -1 && sx3ChDn != -1 && sx3ChBk !=-1) {
-                          if (sx3EBk != 0 && sx3EBk > 50 && sx3EUp > 50 && sx3EDn > 50) {
-                            printf("sx3EUp: %f, sx3EDn: %f, sx3EBk: %f\n", sx3EUp, sx3EDn, sx3EBk);
-                            printf("Filling hsx3uVsx3d_01: %f\n", sx3EUp / sx3EBk);
-                            hsx3uVsx3d_45->Fill(sx3EUp / sx3EBk, sx3EDn / sx3EBk);
-                          
-                         }
-                      }    
-                  } 
-                  else if ((sx3ChUp == 3 && sx3ChDn == 2)) {
-                       if (sx3ChUp != -1 && sx3ChDn != -1 && sx3ChBk !=-1) {
-                         if (sx3EBk != 0 && sx3EBk > 50 && sx3EUp > 50 && sx3EDn > 50) {
-                            printf("sx3EUp: %f, sx3EDn: %f, sx3EBk: %f\n", sx3EUp, sx3EDn, sx3EBk);
-                            printf("Filling hsx3uVsx3d_23: %f\n", sx3EUp / sx3EBk);
-                            hsx3uVsx3d_67->Fill(sx3EUp / sx3EBk, sx3EDn / sx3EBk);
-                           
-                         }
-                      }    
-                }*/
-                 if (sx3ChUp == 1 && sx3ChDn == 0){
-                //if (sx3ChUp == 1 || sx3ChDn == 0 || sx3ChUp == 3 || sx3ChDn == 2 || sx3ChUp == 5 || sx3ChDn == 4 || sx3ChUp == 7 || sx3ChDn == 6) {
-                        if (sx3ChUp != -1  && sx3ChBk !=-1 && sx3ChDn !=-1) {
-                           if (sx3EBk_shifted > 50 && sx3EUp > 50 && sx3EDn>50  &&sx3E_u_matched_01>50 && sx3E_u_matched_01>50) {
-                              //printf("sx3EUp: %f, sx3EDn: %f, sx3E_u_matched_01: %f,sx3E_d_matched_01: %f\n", sx3EUp, sx3EDn, sx3E_u_matched_01,sx3E_d_matched_01);
-                              printf("Filling hsx3uVsx3d_nn: %f, gggggg: %f \n", (sx3EUp+sx3EDn),(sx3E_u_matched_01+sx3E_d_matched_01) );   
-                              hsx3uVsx3d_45->Fill((sx3EUp+sx3E_d_matched_01),sx3EBk_shifted);
-                              hsx3uVsx3d_67->Fill((sx3EUp+sx3E_d_matched_01),sx3E_fb_matched_01);
-                            } 
-                       } 
-                 }
-                  /*if (sx3ChBk > 8) {
-                     if ((sx3ChUp == 7 && sx3ChDn == 6) || 
-                         (sx3ChUp == 5 && sx3ChDn == 4) || 
-                         (sx3ChUp == 3 && sx3ChDn == 2) || 
-                         (sx3ChUp == 1 && sx3ChDn == 0)) {
-                    if (sx3ChUp != -1 && sx3ChDn != -1 && sx3ChBk !=-1) {
-                        if (sx3EBk != 0 && sx3EBk > 50 && sx3EUp > 50 && sx3EDn > 50) {
-                            hsx3uVsx3d->Fill(sx3EUp / sx3EBk, sx3EDn / sx3EBk);
-                            hsx3Vsx3->Fill(sx3EUp ,sx3EDn);
-                            printf("sx3EUp: %f | sx3EDn: %f | sx3EBk: %f | sx3ChUp: %d | sx3ChDn: %d | sx3ChBk: %d\n", sx3EUp, sx3EDn, sx3EBk, sx3ChUp, sx3ChDn, sx3ChBk);
-                        }
-                    }
-                  }
-                 }*/
-                 //else {
-                    //printf("sx3EUp\n");
-                //}
-            if (sx3ChUp == 1 && sx3ChDn == 0){
-               
-                if (sx3ChUp != -1  && sx3ChBk !=-1 && sx3ChDn !=-1) {
-                    if (sx3E_d_matched_01> sx3EUp ) {
-                       //printf("hZd_01_1_dn: %f\n", sx3E_d_matched_01);
-                        //printf("hZd_01_1_b: %f\n", sx3E_fb_matched_01);
-                        hZd_01_1->Fill((2*(sx3E_d_matched_01+(coeff*diff))/sx3E_fb_matched_01)-1);
-                        }
-                    else if(sx3EUp> sx3E_d_matched_01) {
-                        //printf("hZd_01_2_sx3EUp: %f\n",sx3EUp );
-                        //printf("hZd_01_2_sx3EDn: %f\n",sx3E_fb_matched_01);
-                        
-                        hZd_01_2->Fill(1-(2*(sx3EUp+(1-coeff)*diff))/sx3E_fb_matched_01);
-                        }  
-                    else if(sx3EUp>0.0  && sx3E_d_matched_01>0.0 && sx3E_d_matched_01>=sx3EUp ) {
-                        hZd_01_3->Fill((2*(sx3E_d_matched_01+ coeff*diff)/sx3E_fb_matched_01)-1);
-                        } 
-                    else if(sx3EUp>0.0  && sx3E_d_matched_01>0.0 && sx3E_d_matched_01<sx3EUp ) {
-                        hZd_01_4->Fill(1-(2*(sx3EUp+ (1-coeff)*diff)/sx3E_fb_matched_01));
-                       } 
-                 }
-            }
-          }
-            for (int j = 0; j < pc.multi; j++) {
-                if (sx3.ch[index] > 8) {
-                    hsx3VpcE->Fill(sx3.e[i], pc.e[j]);
-                }
-            }
-        }
-
-        sx3_contr.CalSX3Pos(sx3ID[0].first, sx3ChUp, sx3ChDn, sx3ChBk, sx3EUp, sx3EDn);
-        hitPos = sx3_contr.GetHitPos();
-        HitNonZero = true;
-        // hitPos.Print();
-    }
-}
-
-
-
-
-
-  // //======================= PC
-
-
-  //########################################################### Track constrcution
-
-
-  //############################## DO THE KINEMATICS
-
-}
-  return kTRUE;
-}
-
-void gainmatch::Terminate(){
-
- 
-}

mapping.h

@@ -19,25 +19,25 @@ const std::map<int, unsigned short> board = {
     {4, 22129},
     {5, 15529},
     {6, 15528},
+    //  {7,89},
     {7, 334},
     {8, 379},
     {9, 325},
-   {10,  405}
-};
+    {10, 405}};
 const int nBd = board.size();
 
 const int nV1740 = 7;
-const int nV1725 = 3;
+const int nV1725 = 4;
 
 //+++++++++++++++++++ detID;
 // The detectors are seperated into 2 type: SuperX3, QQQ, and PC
 // the SuperX3 has 24 detectors for each kind, wach detector has 12 channels
 // the QQQ has 4 detectors for each kind, each detector has 32 channels
 // the PC has 2 types, anode and cathode, each has 24 channels
+// the MISC has 6 channels, the lollipop IC and siliscon followed by the hotneedle IC, as well as the Rf and MCP
 // The detID = Type * 10000 + index * 100 + channel
 // fro example, detID(superX3-8, ch-7) = 00807
 
-
 // use the GenMapping() to get that
 const std::vector<int> mapping = {
 
@@ -63,59 +63,82 @@ const std::vector<int> mapping = {
     1906, 1907, 1904, 1905, 1903, 1902, 1901, 1900, 2106, 2107, 2104, 2105, 2103, 2102, 2101, 2100,
     //================== 22129
     1806, 1807, 1804, 1805, 1803, 1802, 1801, 1800, 2306, 2307, 2304, 2305, 2303, 2302, 2301, 2300,
- 10016, 10017, 10018, 10019, 10020, 10021, 10022, 10023, 10024, 10025, 10026, 10027, 10028, 10029, 10030, 10031,
+    10031, 10030, 10029, 10028, 10027, 10026, 10025, 10024, 10023, 10022, 10021, 10020, 10019, 10018, 10017, 10016,
+    // 10016, 10017, 10018, 10019, 10020, 10021, 10022, 10023, 10024, 10025, 10026, 10027, 10028, 10029, 10030, 10031,
     10116, 10117, 10118, 10119, 10120, 10121, 10122, 10123, 10124, 10125, 10126, 10127, 10128, 10129, 10130, 10131,
     10015, 10014, 10013, 10012, 10011, 10010, 10009, 10008, 10007, 10006, 10005, 10004, 10003, 10002, 10001, 10000,
     //================== 15529
     10231, 10230, 10229, 10228, 10227, 10226, 10225, 10224, 10223, 10222, 10221, 10220, 10219, 10218, 10217, 10216,
- 10115, 10114, 10113, 10112, 10111, 10110, 10109, 10108, 10107, 10106, 10105, 10104, 10103, 10102, 10101, 10100,
- 10315, 10314, 10313, 10312, 10311, 10310, 10309, 10308, 10307, 10306, 10305, 10304, 10303, 10302, 10301, 10300,
+    10100, 10101, 10102, 10103, 10104, 10105, 10106, 10107, 10108, 10109, 10110, 10111, 10112, 10113, 10114, 10115,
+    //  10115, 10114, 10113, 10112, 10111, 10110, 10109, 10108, 10107, 10106, 10105, 10104, 10103, 10102, 10101, 10100,
+    10300, 10301, 10302, 10303, 10304, 10305, 10306, 10307, 10308, 10309, 10310, 10311, 10312, 10313, 10314, 10315,
+    //  10315, 10314, 10313, 10312, 10311, 10310, 10309, 10308, 10307, 10306, 10305, 10304, 10303, 10302, 10301, 10300,
     10215, 10214, 10213, 10212, 10211, 10210, 10209, 10208, 10207, 10206, 10205, 10204, 10203, 10202, 10201, 10200,
     //================== 15528
     10316, 10317, 10318, 10319, 10320, 10321, 10322, 10323, 10324, 10325, 10326, 10327, 10328, 10329, 10330, 10331,
     -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
     -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
     -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    //================== 89
+    //  0     1      2      3      4      5      6      7      8      9     10     11     12     13     14     15
+    //  30004,    -1, 30003,    -1,    -1,    -1,    -1,    -1,     -1,   -1,    -1,    -1,    -1,    -1,    -1,    -1,
     //================== 334
- 20116, 20117, 20118, 20119, 20120, 20121, 20122, 20123, 20016, 20017, 20018, 20019, 20020, 20021, 20022, 20023,
+    20116, 20117, 20118, 20119, -1, 20121, 20122, 20123, 20016, 20017, 20018, -1, 20020, 20021, 20022, 20023,
     //================== 379
- 20000, 20001, 20002, 20003, 20004, 20005,    -1, 20007, 20008,    -1, 20010, 20011, 20012, 20013, 20014, 20015,
+    -1, 20001, 20002, 20003, 20004, 20005, -1, 20007, 20008, -1, 20010, 20011, 20012, 20013, 20014, 20015,
     //================== 325
- 20100, 20101, 20102, 20103, 20104, 20105, 20106, 20107, 20108, 20109, 20110, 20111, 20112, 20113, 20114, 20115,
+    20100, 20101, 20102, 20103, 20104, 20105, 20106, 20107, 20108, 20109, 20110, 20111, 20112, -1, 20114, 20115,
     //================== 405
- 20006,    -1,    -1, 20009,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1
+    //  0     1      2      3      4      5      6      7      8      9     10     11     12     13     14     15
+    20006, -1, 30005, 20009, -1, 20120, 20000, 20019, 20113, 30000, 30004, 30001, 30002, -1, 30003, -1};
 
-};
-
-void PrintMapping(){
+// MCP moved from channel 1 to 2 after Run number 322
+// MCP and Rf moved to ch 0 and 1 after Run number after Run282
+// moved back to ch
+void PrintMapping()
+{
 
   int digiID = 0;
   int count = 0;
   printf("==================== ID-MAP: \n");
-  printf("%11s|", "");  for(int i = 0 ; i < 16; i++ ) printf("%7d|", i);
+  printf("%11s|", "");
+  for (int i = 0; i < 16; i++)
+    printf("%7d|", i);
   printf("\n");
-  for(int i = 0 ; i < 12 + 16*8; i++ ) printf("-");
-  for(size_t i = 0 ; i < mapping.size(); i ++){
-    if( (i) % 16 == 0 ) {
+  for (int i = 0; i < 12 + 16 * 8; i++)
+    printf("-");
+  for (size_t i = 0; i < mapping.size(); i++)
+  {
+    if ((i) % 16 == 0)
+    {
       printf("\n");
 
-      if( digiID < nBd ){
-        if( board.at(digiID) > 1000 ) {
-          if( count == 3 ) digiID ++;
-          if( i % 64 == 0 ) {
+      if (digiID < nBd)
+      {
+        if (board.at(digiID) > 1000)
+        {
+          if (count == 3)
+            digiID++;
+          if (i % 64 == 0)
+          {
             printf("%11d|", board.at(digiID));
             count = 0;
           }
-        }else{
-          if( count == 1 ) digiID ++;
-          if( i % 16 == 0 ) {
+        }
+        else
+        {
+          if (count == 1)
+            digiID++;
+          if (i % 16 == 0)
+          {
             printf("%11d|", board.at(digiID));
             count = 0;
           }
         }
       }
 
-      if( count != 0) printf("%11s|", "");
+      if (count != 0)
+        printf("%11s|", "");
       count++;
     }
 
@@ -123,46 +146,51 @@ void PrintMapping(){
     int detID = (mapping[i] - typeID * 10000) / 100;
     int ch = mapping[i] - typeID * 10000 - detID * 100;
 
-    if( mapping[i] == -1 ) {
+    if (mapping[i] == -1)
+    {
 
       printf("%7s|", "");
+    }
+    else
+    {
 
-    }else{
-
-      if( typeID == 0){ // SX3
+      if (typeID == 0)
+      { // SX3
 
         printf("\033[36m%3d(%2d)\033[0m|", detID, ch);
-
-      }else if( typeID == 1){ // QQQ
+      }
+      else if (typeID == 1)
+      { // QQQ
 
         printf("\033[91m%3d(%2d)\033[0m|", detID, ch);
-        
-      }else if( typeID == 2){ // PC
+      }
+      else if (typeID == 2)
+      { // PC
 
         printf("\033[35m%3d(%2d)\033[0m|", detID, ch);
+      }
+      else if (typeID == 3)
+      { // MISC
 
-      }else{
-
-
+        printf("\033[33m%3d(%2d)\033[0m|", detID, ch);
       }
     }
   }
   printf("\n");
-  for(int i = 0 ; i < 12 + 16*8; i++ ) printf("-");
+  for (int i = 0; i < 12 + 16 * 8; i++)
+    printf("-");
   printf("\n");
-
 }
 
-
-void GenMapping(std::string mapFile){
-
+void GenMapping(std::string mapFile)
+{
 
   std::vector<int> map;
 
-
   std::ifstream inputFile(mapFile); // Replace "your_file.txt" with the actual file path
 
-  if (!inputFile.is_open()) {
+  if (!inputFile.is_open())
+  {
     printf("Error: Could not open the file (%s).\n", mapFile.c_str());
     return;
   }
@@ -170,55 +198,70 @@ void GenMapping(std::string mapFile){
   std::string line;
 
   // Read the file line by line
-  while (std::getline(inputFile, line)) {
+  while (std::getline(inputFile, line))
+  {
     std::vector<std::string> words;
     std::istringstream iss(line);
 
     // Extract words from the current line
-    while (true) {
+    while (true)
+    {
       std::string word;
-      if (!(iss >> word)) break;  // Break if there are no more words
+      if (!(iss >> word))
+        break; // Break if there are no more words
 
       word.erase(std::remove_if(word.begin(), word.end(), ::isspace), word.end());
       words.push_back(word);
-    
     }
 
-    if( atoi(words[0].c_str()) % 16 == 0 ) printf("=================\n");
-
+    if (atoi(words[0].c_str()) % 16 == 0)
+      printf("=================\n");
 
     int detID = atoi(words[1].c_str()) * 100;
-    if(words.size() < 5 ) printf(" hahhahha %s\n", line.c_str()); 
-    if( words[2] == "BARREL" ) {
-      if( words[3] == "FRONTDOWN" ){
+    if (words.size() < 5)
+      printf(" hahhahha %s\n", line.c_str());
+    if (words[2] == "BARREL")
+    {
+      if (words[3] == "FRONTDOWN")
+      {
         int chID = atoi(words[4].c_str());
-        if( chID % 2 != 0 ) chID -= 1;
+        if (chID % 2 != 0)
+          chID -= 1;
         detID += chID;
       }
 
-      if( words[3] == "FRONTUP" ){
+      if (words[3] == "FRONTUP")
+      {
         int chID = atoi(words[4].c_str());
-        if( chID % 2 == 0 ) chID += 1;
+        if (chID % 2 == 0)
+          chID += 1;
         detID += chID;
       }
 
-      if( words[3] == "BACK") detID += atoi(words[4].c_str()) + 8;
+      if (words[3] == "BACK")
+        detID += atoi(words[4].c_str()) + 8;
     }
 
-    if( words[2] == "FQQQ" ) {
+    if (words[2] == "FQQQ")
+    {
       detID += 10000;
-      if( words[3] == "WEDGE") detID += atoi(words[4].c_str());
-      if( words[3] == "RING") detID += atoi(words[4].c_str()) + 16;
+      if (words[3] == "WEDGE")
+        detID += atoi(words[4].c_str());
+      if (words[3] == "RING")
+        detID += atoi(words[4].c_str()) + 16;
     }
 
-    if( words[2] == "PC" ) {
+    if (words[2] == "PC")
+    {
       detID += 20000;
-      if( words[3] == "ANODE") detID += atoi(words[4].c_str());
-      if( words[3] == "CATHODE") detID += 100 + atoi(words[4].c_str());
-
+      if (words[3] == "ANODE")
+        detID += atoi(words[4].c_str());
+      if (words[3] == "CATHODE")
+        detID += 100 + atoi(words[4].c_str());
     }
 
-    if( words[2] == "blank") {
+    if (words[2] == "blank")
+    {
       detID = -1;
     }
 
@@ -234,19 +277,29 @@ void GenMapping(std::string mapFile){
   int digiID = 0;
   int count = 0;
   printf("===============================\n");
-  for( size_t i = 0; i < ((map.size() +15)/16) * 16; i++){
-    if( i % 16 == 0) {
+  for (size_t i = 0; i < ((map.size() + 15) / 16) * 16; i++)
+  {
+    if (i % 16 == 0)
+    {
       printf("\n");
-      if( digiID < nBd ){
-        if( board.at(digiID) > 1000 ) {
-          if( count == 3 ) digiID ++;
-          if( i % 64 == 0 ) {
+      if (digiID < nBd)
+      {
+        if (board.at(digiID) > 1000)
+        {
+          if (count == 3)
+            digiID++;
+          if (i % 64 == 0)
+          {
             printf("  //================== %d\n", board.at(digiID));
             count = 0;
           }
-        }else{
-          if( count == 1 ) digiID ++;
-          if( i % 16 == 0 ) {
+        }
+        else
+        {
+          if (count == 1)
+            digiID++;
+          if (i % 16 == 0)
+          {
             printf("  //================== %d\n", board.at(digiID));
             count = 0;
           }
@@ -254,9 +307,12 @@ void GenMapping(std::string mapFile){
       }
       count++;
     }
-    if( i < map.size() ){
+    if (i < map.size())
+    {
       printf(" %5d,", map[i]);
-    }else{
+    }
+    else
+    {
       printf(" %5d,", -1);
     }
   }
@@ -265,13 +321,14 @@ void GenMapping(std::string mapFile){
   printf("sorting mapping and see if there any repeated\n");
   std::sort(map.begin(), map.end());
 
-  for( size_t i = 1; i < map.size(); i++){
-    if( map[i] == -1 ) continue;
-    if( map[i] == map[i-1] ) printf("%5d \n", map[i]);
+  for (size_t i = 1; i < map.size(); i++)
+  {
+    if (map[i] == -1)
+      continue;
+    if (map[i] == map[i - 1])
+      printf("%5d \n", map[i]);
   }
   printf("=========== Done. if nothing show, no repeat. \n");
-
-
 }
 
 #endif

mapping_old.txt

@@ -302,22 +302,22 @@
 301	1	FQQQ	RING	13
 302	1	FQQQ	RING	14
 303	1	FQQQ	RING	15
-304	1	FQQQ	WEDGE	15
-305	1	FQQQ	WEDGE	14
-306	1	FQQQ	WEDGE	13
-307	1	FQQQ	WEDGE	12
-308	1	FQQQ	WEDGE	11
-309	1	FQQQ	WEDGE	10
-310	1	FQQQ	WEDGE	9
-311	1	FQQQ	WEDGE	8
-312	1	FQQQ	WEDGE	7
-313	1	FQQQ	WEDGE	6
-314	1	FQQQ	WEDGE	5
-315	1	FQQQ	WEDGE	4
-316	1	FQQQ	WEDGE	3
-317	1	FQQQ	WEDGE	2
-318	1	FQQQ	WEDGE	1
-319	1	FQQQ	WEDGE	0
+304	1	FQQQ	WEDGE	0
+305	1	FQQQ	WEDGE	1
+306	1	FQQQ	WEDGE	2
+307	1	FQQQ	WEDGE	3
+308	1	FQQQ	WEDGE	4
+309	1	FQQQ	WEDGE	5
+310	1	FQQQ	WEDGE   6
+311	1	FQQQ	WEDGE   7
+312	1	FQQQ	WEDGE   8
+313	1	FQQQ	WEDGE   9
+314	1	FQQQ	WEDGE   10
+315	1	FQQQ	WEDGE   11
+316	1	FQQQ	WEDGE   12
+317	1	FQQQ	WEDGE   13
+318	1	FQQQ	WEDGE   14
+319	1	FQQQ	WEDGE   15
 320	2	FQQQ	RING	15
 321	2	FQQQ	RING	14
 322	2	FQQQ	RING	13
@@ -366,22 +366,22 @@
 365	2	FQQQ	WEDGE	2
 366	2	FQQQ	WEDGE	1
 367	2	FQQQ	WEDGE	0
-368	3	FQQQ	WEDGE	15
-369	3	FQQQ	WEDGE	14
-370	3	FQQQ	WEDGE	13
-371	3	FQQQ	WEDGE	12
-372	3	FQQQ	WEDGE	11
-373	3	FQQQ	WEDGE	10
-374	3	FQQQ	WEDGE	9
-375	3	FQQQ	WEDGE	8
-376	3	FQQQ	WEDGE	7
-377	3	FQQQ	WEDGE	6
-378	3	FQQQ	WEDGE	5
-379	3	FQQQ	WEDGE	4
-380	3	FQQQ	WEDGE	3
-381	3	FQQQ	WEDGE	2
-382	3	FQQQ	WEDGE	1
-383	3	FQQQ	WEDGE	0
+368	3	FQQQ	WEDGE	0
+369	3	FQQQ	WEDGE	1
+370	3	FQQQ	WEDGE	2
+371	3	FQQQ	WEDGE	3
+372	3	FQQQ	WEDGE	4
+373	3	FQQQ	WEDGE	5
+374	3	FQQQ	WEDGE   6
+375	3	FQQQ	WEDGE	7
+376	3	FQQQ	WEDGE	8
+377	3	FQQQ	WEDGE	9
+378	3	FQQQ	WEDGE   10
+379	3	FQQQ	WEDGE   11
+380	3	FQQQ	WEDGE   12
+381	3	FQQQ	WEDGE   13
+382	3	FQQQ	WEDGE   14
+383	3	FQQQ	WEDGE	15
 384	3	FQQQ	RING	0
 385	3	FQQQ	RING	1
 386	3	FQQQ	RING	2

process_mapped_run.sh

@@ -0,0 +1,73 @@
+#!/bin/bash
+
+# ==========================================
+# CONFIGURATION
+# ==========================================
+DATA_DIR="/mnt/d/Remapped_files/17F_data/root_data"
+MACRO="TrackRecon.C"
+
+# SAFETY SETTINGS
+JOBS=2          # Keep low (2-4) to prevent WSL crashes
+MIN_MEM="1G"    # Wait if RAM is full
+# ==========================================
+
+# 1. CHECK ARGUMENTS
+if [ "$#" -ne 2 ]; then
+    echo "Usage: $0 <Start_Run> <End_Run>"
+    echo "Example: $0 10 50"
+    exit 1
+fi
+
+START_RUN=$1
+END_RUN=$2
+
+# 2. COMPILE MACRO
+# Compiling once is mandatory for parallel execution
+echo "Compiling ${MACRO}..."
+root -l -b -q -e "gROOT->ProcessLine(\".L ${MACRO}+\");"
+if [ $? -ne 0 ]; then
+    echo "Error: Compilation failed."
+    exit 1
+fi
+
+# 3. DEFINE WORKER FUNCTION
+run_job() {
+    file_path="$1"
+    macro_name="$2"
+    
+    echo "Processing: $file_path"
+    
+    # Execute ROOT
+    nice -n 15 root -l -x -b -q "$file_path" -e "tree->Process(\"${macro_name}+\");" > "${file_path}.log" 2>&1
+}
+export -f run_job
+
+# 4. QUEUE BUILDER (The "Skip" Logic is here)
+echo "Checking runs $START_RUN to $END_RUN..."
+
+for (( i=$START_RUN; i<=$END_RUN; i++ ))
+do
+    # Construct the input filename
+    # Logic: Run_0 + number -> Run_0115
+    file="${DATA_DIR}/Run_${i}_mapped.root"
+    
+    # ------------------------------------------------------------
+    # SKIP LOGIC
+    # We check if the log file exists. If so, we assume it's done.
+    # ------------------------------------------------------------
+    log_file="${file}.log"
+    
+    if [ -f "$log_file" ]; then
+        # >&2 redirects to stderr so it doesn't get fed into 'parallel'
+        echo "Skipping Run $i: Log file already exists." >&2
+        continue
+    fi
+
+    # Only add to queue if the INPUT file actually exists
+    if [ -f "$file" ]; then
+        echo "$file"
+    else
+        echo "Warning: Input file for run $i not found." >&2
+    fi
+
+done | parallel --jobs $JOBS --memfree $MIN_MEM --retries 2 run_job {} "$MACRO"

qqq_Calib.dat

@@ -0,0 +1,760 @@
+0 0 0 3.34288
+0 1 0 3.29257
+0 2 0 3.31126
+0 3 0 3.28022
+0 4 0 3.29877
+0 5 0 3.29877
+0 6 0 3.305
+0 7 0 3.305
+0 8 0 3.26797
+0 9 0 3.32384
+0 10 0 3.31126
+0 11 0 3.32384
+0 12 0 3.29877
+0 13 0 3.31126
+0 14 0 3.28022
+0 15 0 3.27409
+0 0 2 3.44828
+0 1 2 3.53179
+0 2 2 3.53179
+0 3 2 3.44149
+0 4 2 3.48259
+0 5 2 3.47567
+0 6 2 3.48953
+0 7 2 3.45508
+0 8 2 3.46878
+0 9 2 3.46192
+0 10 2 3.45508
+0 11 2 3.46192
+0 12 2 3.48259
+0 13 2 3.5035
+0 14 2 3.4965
+0 15 2 3.46878
+0 0 3 3.2022
+0 1 3 3.20807
+0 2 3 3.23176
+0 3 3 3.23176
+0 4 3 3.23774
+0 5 3 3.20807
+0 6 3 3.19635
+0 7 3 3.21987
+0 8 3 3.18471
+0 9 3 3.21396
+0 10 3 3.19635
+0 11 3 3.20807
+0 12 3 3.18471
+0 13 3 3.22581
+0 14 3 3.19635
+0 15 3 3.19635
+0 0 4 3.33016
+0 1 4 3.32384
+0 2 4 3.32384
+0 3 4 3.37512
+0 4 4 3.39476
+0 5 4 3.305
+0 6 4 3.33016
+0 7 4 3.34928
+0 8 4 3.31126
+0 9 4 3.31754
+0 10 4 3.33651
+0 11 4 3.31126
+0 12 4 3.32384
+0 13 4 3.305
+0 14 4 3.34928
+0 15 4 3.31754
+0 0 5 3.31754
+0 1 5 3.33651
+0 2 5 3.34928
+0 3 5 3.33016
+0 4 5 3.40136
+0 5 5 3.41463
+0 6 5 3.33651
+0 7 5 3.36215
+0 8 5 3.36862
+0 9 5 3.34288
+0 10 5 3.32384
+0 11 5 3.31754
+0 12 5 3.33016
+0 13 5 3.36862
+0 14 5 3.31754
+0 15 5 3.32384
+0 0 6 3.36215
+0 1 6 3.37512
+0 2 6 3.3557
+0 3 6 3.3557
+0 4 6 3.34928
+0 5 6 3.40798
+0 6 6 3.39476
+0 7 6 3.31754
+0 8 6 3.33016
+0 9 6 3.34928
+0 10 6 3.33651
+0 11 6 3.33651
+0 12 6 3.34288
+0 13 6 3.3557
+0 14 6 3.34288
+0 15 6 3.34928
+0 0 7 4.2735
+0 1 7 4.24242
+0 2 7 4.21179
+0 3 7 4.21179
+0 4 7 4.21179
+0 5 7 4.19162
+0 6 7 4.31566
+0 7 7 4.24242
+0 8 7 4.1816
+0 9 7 4.21179
+0 10 7 4.22195
+0 11 7 4.22195
+0 12 7 4.1816
+0 13 7 4.21179
+0 14 7 4.19162
+0 15 7 4.28397
+0 0 8 3.51053
+0 1 8 3.52467
+0 2 8 3.5035
+0 3 8 3.4965
+0 4 8 3.48953
+0 5 8 3.53179
+0 6 8 3.4965
+0 7 8 3.56779
+0 8 8 3.56779
+0 9 8 3.48953
+0 10 8 3.5035
+0 11 8 3.48259
+0 12 8 3.5035
+0 13 8 3.47567
+0 14 8 3.48953
+0 15 8 3.48953
+0 0 9 3.39476
+0 1 9 3.41463
+0 2 9 3.42131
+0 3 9 3.40798
+0 4 9 3.39476
+0 5 9 3.42801
+0 6 9 3.42131
+0 7 9 3.44149
+0 8 9 3.48259
+0 9 9 3.44149
+0 10 9 3.41463
+0 11 9 3.41463
+0 12 9 3.42801
+0 13 9 3.39476
+0 14 9 3.42131
+0 15 9 3.42131
+0 0 10 3.59712
+0 1 10 3.56053
+0 2 10 3.52467
+0 3 10 3.5533
+0 4 10 3.57508
+0 5 10 3.53893
+0 6 10 3.56053
+0 7 10 3.5533
+0 8 10 3.5461
+0 9 10 3.56779
+0 10 10 3.63448
+0 11 10 3.56779
+0 12 10 3.5824
+0 13 10 3.5533
+0 14 10 3.5824
+0 15 10 3.53179
+0 0 11 3.44149
+0 1 11 3.41463
+0 2 11 3.39476
+0 3 11 3.3557
+0 4 11 3.40798
+0 5 11 3.40136
+0 6 11 3.40136
+0 7 11 3.38164
+0 8 11 3.38164
+0 9 11 3.40136
+0 10 11 3.45508
+0 11 11 3.46192
+0 12 11 3.42131
+0 13 11 3.40798
+0 14 11 3.38819
+0 15 11 3.43474
+0 0 12 3.40798
+0 1 12 3.42131
+0 2 12 3.42801
+0 3 12 3.42801
+0 4 12 3.42131
+0 5 12 3.44149
+0 6 12 3.44149
+0 7 12 3.44828
+0 8 12 3.44149
+0 9 12 3.42801
+0 10 12 3.42801
+0 11 12 3.48953
+0 12 12 3.47567
+0 13 12 3.44149
+0 14 12 3.42801
+0 15 12 3.44828
+0 0 13 3.65726
+0 1 13 3.62694
+0 2 13 3.68034
+0 3 13 3.59712
+0 4 13 3.66492
+0 5 13 3.65726
+0 6 13 3.61197
+0 7 13 3.67261
+0 8 13 3.68809
+0 9 13 3.63448
+0 10 13 3.67261
+0 11 13 3.68034
+0 12 13 3.71156
+0 13 13 3.72737
+0 14 13 3.65726
+0 15 13 3.64964
+0 0 14 3.56779
+0 1 14 3.56779
+0 2 14 3.51759
+0 3 14 3.47567
+0 4 14 3.4965
+0 5 14 3.51053
+0 6 14 3.51759
+0 7 14 3.48953
+0 8 14 3.51053
+0 9 14 3.53893
+0 10 14 3.53893
+0 11 14 3.69588
+0 12 14 3.47567
+0 13 14 3.7037
+0 14 14 3.71156
+0 15 14 3.5533
+0 0 15 39.3258
+0 1 15 3.42131
+0 2 15 3.42131
+0 3 15 3.48953
+0 4 15 3.38164
+0 5 15 3.43474
+0 6 15 3.37512
+0 7 15 3.38164
+0 8 15 28
+0 9 15 33.9806
+0 10 15 3.37512
+0 11 15 3.33016
+0 12 15 3.36862
+0 13 15 29.4118
+0 14 15 36.8421
+0 15 15 34.6535
+1 0 0 3.22581
+1 1 0 3.21396
+1 2 0 3.17893
+1 3 0 3.20807
+1 7 0 3.18471
+1 8 0 3.16742
+1 0 1 3.29877
+1 1 1 3.33016
+1 2 1 3.29257
+1 3 1 3.305
+1 7 1 3.29877
+1 8 1 3.305
+1 0 2 3.25581
+1 1 2 3.28022
+1 2 2 3.27409
+1 3 2 3.23774
+1 7 2 3.21396
+1 8 2 3.24374
+1 0 3 3.18471
+1 1 3 3.1617
+1 2 3 3.20807
+1 3 3 3.22581
+1 7 3 3.18471
+1 8 3 3.15032
+1 0 4 3.21987
+1 1 4 3.23176
+1 2 4 3.21987
+1 3 4 3.24977
+1 7 4 3.22581
+1 8 4 3.24977
+1 0 5 3.17893
+1 1 5 3.17893
+1 2 5 3.17316
+1 3 5 3.18471
+1 7 5 3.19052
+1 8 5 3.1617
+1 0 6 3.29257
+1 1 6 3.29257
+1 2 6 3.33016
+1 3 6 3.32384
+1 7 6 3.31754
+1 8 6 3.305
+1 0 7 3.61944
+1 1 7 3.61197
+1 2 7 3.61197
+1 3 7 3.59712
+1 7 7 3.68809
+1 8 7 3.64964
+1 0 8 3.23774
+1 1 8 3.25581
+1 2 8 3.26188
+1 3 8 3.26188
+1 7 8 3.26797
+1 8 8 3.28022
+1 0 9 3.33651
+1 1 9 3.33016
+1 2 9 3.3557
+1 3 9 3.34928
+1 7 9 3.36862
+1 8 9 3.37512
+1 0 10 3.38819
+1 1 10 3.42131
+1 2 10 3.42801
+1 3 10 3.42801
+1 7 10 3.38164
+1 8 10 3.41463
+1 0 11 3.21987
+1 1 11 3.24374
+1 2 11 3.23774
+1 3 11 3.21987
+1 7 11 3.21987
+1 8 11 3.23774
+1 0 12 3.21987
+1 1 12 3.17893
+1 2 12 3.19635
+1 3 12 3.23774
+1 7 12 3.21396
+1 8 12 3.20807
+1 0 13 3.61197
+1 1 13 3.62694
+1 2 13 3.65726
+1 3 13 3.64964
+1 7 13 3.5824
+1 8 13 3.62694
+1 0 14 3.14465
+1 1 14 3.15032
+1 2 14 3.18471
+1 3 14 3.14465
+1 7 14 3.14465
+1 8 14 3.156
+1 0 15 3.51759
+1 1 15 3.53893
+1 2 15 3.48953
+1 3 15 3.43474
+1 7 15 3.52467
+1 8 15 3.62694
+2 0 0 2.83401
+2 1 0 2.75374
+2 2 0 2.76243
+2 3 0 2.75374
+2 4 0 2.77118
+2 5 0 2.78441
+2 6 0 2.7668
+2 7 0 2.77557
+2 8 0 2.7668
+2 9 0 2.76243
+2 10 0 2.7408
+2 11 0 2.7668
+2 12 0 2.7451
+2 13 0 2.75808
+2 14 0 2.74941
+2 0 1 3.01464
+2 1 1 3.04083
+2 2 1 2.9889
+2 3 1 2.97366
+2 4 1 2.97366
+2 5 1 2.96359
+2 6 1 2.97872
+2 7 1 2.93871
+2 8 1 2.96862
+2 9 1 2.9838
+2 10 1 2.96862
+2 11 1 2.97366
+2 12 1 2.9889
+2 13 1 2.94365
+2 14 1 2.9838
+2 0 2 2.83861
+2 1 2 2.90456
+2 2 2 2.89495
+2 3 2 2.82943
+2 4 2 2.83861
+2 5 2 2.84322
+2 6 2 2.84322
+2 7 2 2.84322
+2 8 2 2.83861
+2 9 2 2.82943
+2 10 2 2.83401
+2 11 2 2.82486
+2 12 2 2.81124
+2 13 2 2.82486
+2 14 2 2.80674
+2 0 3 2.67789
+2 1 3 2.68199
+2 2 3 2.71528
+2 3 3 2.72374
+2 4 3 2.67789
+2 5 3 2.6738
+2 6 3 2.65756
+2 7 3 2.66565
+2 8 3 2.66972
+2 9 3 2.69024
+2 10 3 2.68199
+2 11 3 2.63753
+2 12 3 2.67789
+2 13 3 2.68199
+2 14 3 2.69024
+2 0 4 2.78884
+2 1 4 2.81124
+2 2 4 2.81577
+2 3 4 2.86182
+2 4 4 2.87121
+2 5 4 2.81124
+2 6 4 2.77557
+2 7 4 2.80674
+2 8 4 2.80224
+2 9 4 2.78441
+2 10 4 2.77557
+2 11 4 2.80224
+2 12 4 2.80224
+2 13 4 2.7933
+2 14 4 2.80674
+2 0 5 2.77118
+2 1 5 2.7668
+2 2 5 2.77557
+2 3 5 2.77557
+2 4 5 2.81124
+2 5 5 2.84322
+2 6 5 2.76243
+2 7 5 2.78441
+2 8 5 2.7408
+2 9 5 2.76243
+2 10 5 2.77998
+2 11 5 2.77557
+2 12 5 2.78441
+2 13 5 2.77557
+2 14 5 2.7668
+2 0 6 2.91424
+2 1 6 2.91424
+2 2 6 2.9191
+2 3 6 2.90939
+2 4 6 2.89975
+2 5 6 2.96862
+2 6 6 2.97872
+2 7 6 2.9191
+2 8 6 2.89975
+2 9 6 2.91424
+2 10 6 2.92887
+2 11 6 2.9191
+2 12 6 2.89017
+2 13 6 2.90939
+2 14 6 2.90939
+2 0 7 2.83401
+2 1 7 2.81124
+2 2 7 2.78441
+2 3 7 2.83861
+2 4 7 2.83861
+2 5 7 2.82486
+2 6 7 2.89495
+2 7 7 2.88541
+2 8 7 2.84322
+2 9 7 2.81577
+2 10 7 2.83401
+2 11 7 2.81577
+2 12 7 2.82486
+2 13 7 2.82486
+2 14 7 2.82486
+2 0 8 2.92887
+2 1 8 2.92398
+2 2 8 2.90939
+2 3 8 2.9191
+2 4 8 2.89975
+2 5 8 2.92887
+2 6 8 2.91424
+2 7 8 2.96862
+2 8 8 2.96862
+2 9 8 2.92398
+2 10 8 2.90939
+2 11 8 2.9191
+2 12 8 2.87592
+2 13 8 2.9191
+2 14 8 2.91424
+2 0 10 2.91424
+2 1 10 2.93378
+2 2 10 2.92887
+2 3 10 2.94365
+2 4 10 2.93871
+2 5 10 2.93378
+2 6 10 2.93871
+2 7 10 2.92887
+2 8 10 2.90939
+2 9 10 2.97366
+2 10 10 2.97872
+2 11 10 2.92398
+2 12 10 2.92398
+2 13 10 2.90939
+2 14 10 2.93378
+2 0 11 3.01984
+2 1 11 3.01464
+2 2 11 3.01984
+2 3 11 3.00429
+2 4 11 3.00429
+2 5 11 3.03556
+2 6 11 3.02506
+2 7 11 3.02506
+2 8 11 3.0303
+2 9 11 3.00946
+2 10 11 3.07828
+2 11 11 3.07828
+2 12 11 3.00946
+2 13 11 3.0303
+2 14 11 2.99914
+2 0 12 2.90456
+2 1 12 2.92887
+2 2 12 2.89495
+2 3 12 2.92887
+2 4 12 2.90456
+2 5 12 2.91424
+2 6 12 2.92887
+2 7 12 2.89495
+2 8 12 2.93378
+2 9 12 2.90939
+2 10 12 2.92398
+2 11 12 2.97366
+2 12 12 2.96862
+2 13 12 2.90939
+2 14 12 2.89495
+2 0 13 2.83861
+2 1 13 2.81124
+2 2 13 2.80674
+2 3 13 2.80674
+2 4 13 2.83401
+2 5 13 2.84784
+2 6 13 2.83401
+2 7 13 2.82031
+2 8 13 2.81577
+2 9 13 2.81577
+2 10 13 2.81577
+2 11 13 2.82943
+2 12 13 2.89017
+2 13 13 2.90939
+2 14 13 2.82486
+2 0 14 2.93871
+2 1 14 2.9191
+2 2 14 2.93871
+2 3 14 2.9191
+2 4 14 2.93378
+2 5 14 2.94861
+2 6 14 2.90939
+2 7 14 2.92398
+2 8 14 2.90456
+2 9 14 2.91424
+2 10 14 2.90939
+2 11 14 2.90456
+2 12 14 3.00946
+2 13 14 3.04613
+2 14 14 2.96862
+3 0 0 2.80674
+3 1 0 2.76243
+3 2 0 2.75374
+3 3 0 2.73224
+3 4 0 2.7408
+3 5 0 2.72374
+3 7 0 2.72798
+3 8 0 2.7408
+3 9 0 2.73651
+3 10 0 2.7195
+3 11 0 2.7451
+3 12 0 2.71528
+3 13 0 2.72374
+3 14 0 2.69854
+3 15 0 2.72798
+3 0 1 6.4695
+3 5 1 6.37523
+3 7 1 6.35209
+3 15 1 6.32911
+3 0 2 2.89017
+3 1 2 2.95858
+3 2 2 3.00429
+3 3 2 2.91424
+3 4 2 2.92398
+3 5 2 2.89975
+3 7 2 2.91424
+3 8 2 2.88541
+3 9 2 2.91424
+3 10 2 2.91424
+3 11 2 2.87592
+3 12 2 2.90456
+3 13 2 2.89017
+3 14 2 2.9191
+3 15 2 2.90939
+3 0 3 2.9889
+3 1 3 2.9889
+3 2 3 3.01984
+3 3 3 3.03556
+3 4 3 2.97366
+3 5 3 2.97366
+3 7 3 2.9838
+3 8 3 2.9838
+3 9 3 2.97872
+3 10 3 2.95858
+3 11 3 2.95359
+3 12 3 2.96862
+3 13 3 2.97872
+3 14 3 2.96862
+3 15 3 2.96862
+3 0 4 2.96862
+3 1 4 2.93871
+3 2 4 2.94365
+3 3 4 2.99914
+3 4 4 3.0303
+3 5 4 2.95359
+3 7 4 2.93378
+3 8 4 2.92887
+3 9 4 2.92398
+3 10 4 2.97366
+3 11 4 2.93871
+3 12 4 2.95858
+3 13 4 2.95858
+3 14 4 2.96359
+3 15 4 2.96862
+3 0 5 2.88541
+3 1 5 2.88541
+3 2 5 2.88541
+3 3 5 2.88066
+3 4 5 2.96359
+3 5 5 2.95858
+3 7 5 2.89495
+3 8 5 2.89975
+3 9 5 2.90456
+3 10 5 2.88066
+3 11 5 2.90456
+3 12 5 2.90456
+3 13 5 2.90939
+3 14 5 2.88541
+3 15 5 2.89975
+3 0 7 2.95858
+3 1 7 2.9889
+3 2 7 2.96359
+3 3 7 2.94861
+3 4 7 2.95858
+3 5 7 2.9889
+3 7 7 3.04083
+3 8 7 2.96862
+3 9 7 2.9889
+3 10 7 2.9838
+3 11 7 2.95359
+3 12 7 2.96862
+3 13 7 2.97872
+3 14 7 2.96862
+3 15 7 2.96862
+3 0 8 3.12221
+3 1 8 3.11665
+3 2 8 3.14465
+3 3 8 3.13901
+3 4 8 3.12221
+3 5 8 3.13901
+3 7 8 3.16742
+3 8 8 3.19052
+3 9 8 3.13901
+3 10 8 3.11665
+3 11 8 3.13901
+3 12 8 3.13901
+3 13 8 3.16742
+3 14 8 3.09461
+3 15 8 3.14465
+3 0 9 2.96359
+3 1 9 2.9838
+3 2 9 2.93378
+3 3 9 2.9191
+3 4 9 2.94365
+3 5 9 2.94861
+3 7 9 2.97366
+3 8 9 2.99914
+3 9 9 3.0303
+3 10 9 2.9889
+3 11 9 2.95359
+3 12 9 2.97872
+3 13 9 2.95858
+3 14 9 2.95359
+3 15 9 2.94365
+3 0 10 3.34928
+3 1 10 3.38164
+3 2 10 3.38164
+3 3 10 3.39476
+3 4 10 3.37512
+3 5 10 3.37512
+3 7 10 3.38819
+3 8 10 3.3557
+3 9 10 3.42801
+3 10 10 3.39476
+3 11 10 3.40798
+3 12 10 3.36862
+3 13 10 3.38819
+3 14 10 3.36862
+3 15 10 3.39476
+3 0 11 3.19052
+3 1 11 3.19052
+3 2 11 3.16742
+3 3 11 3.156
+3 4 11 3.19052
+3 5 11 3.19635
+3 7 11 3.17316
+3 8 11 3.18471
+3 9 11 3.19052
+3 10 11 3.23176
+3 11 11 3.25581
+3 12 11 3.2022
+3 13 11 3.19635
+3 14 11 3.23774
+3 15 11 3.22581
+3 0 12 3.03556
+3 1 12 3.08914
+3 2 12 3.0303
+3 3 12 3.0837
+3 4 12 3.07828
+3 5 12 3.06748
+3 7 12 3.04083
+3 8 12 3.06212
+3 9 12 3.07828
+3 10 12 3.04613
+3 11 12 3.14465
+3 12 12 3.11665
+3 13 12 3.06748
+3 14 12 3.15032
+3 15 12 3.0837
+3 0 13 3.11111
+3 1 13 3.10559
+3 2 13 3.10009
+3 3 13 3.08914
+3 4 13 3.07828
+3 5 13 3.08914
+3 7 13 3.10009
+3 8 13 3.10559
+3 9 13 3.0837
+3 10 13 3.09461
+3 11 13 3.10559
+3 12 13 3.156
+3 13 13 3.22581
+3 14 13 3.16742
+3 15 13 3.13339
+3 0 14 2.93378
+3 1 14 2.95858
+3 2 14 2.97366
+3 3 14 2.9191
+3 4 14 2.96862
+3 5 14 2.94365
+3 7 14 2.96862
+3 8 14 2.9889
+3 9 14 2.95858
+3 10 14 2.93378
+3 11 14 3.01984
+3 12 14 2.96359
+3 13 14 3.0303
+3 14 14 3.05677
+3 15 14 2.9889
+3 0 15 3.13339
+3 1 15 3.14465
+3 2 15 3.156
+3 3 15 3.18471
+3 4 15 3.17893
+3 5 15 3.15032
+3 7 15 3.1617
+3 8 15 3.16742
+3 9 15 3.19052
+3 10 15 3.1617
+3 11 15 3.156
+3 12 15 3.2022
+3 13 15 3.156
+3 14 15 3.25581
+3 15 15 3.31126

qqq_GainMatch.dat

@@ -0,0 +1,760 @@
+0 0 0 1.12207 0
+0 1 0 1.08493 0
+0 2 0 1.10745 0
+0 3 0 1.0896 0
+0 4 0 1.14681 0
+0 5 0 1.12957 0
+0 6 0 1.05646 0
+0 7 0 1.09773 0
+0 8 0 1.05916 0
+0 9 0 1.10486 0
+0 10 0 1.13044 0
+0 11 0 1.0665 0
+0 12 0 1.12404 0
+0 13 0 1.12471 0
+0 14 0 1.11974 0
+0 15 0 1.10215 0
+0 0 2 1.05256 0
+0 1 2 1.01731 0
+0 2 2 1.04108 0
+0 3 2 1.02415 0
+0 4 2 1.07689 0
+0 5 2 1.06084 0
+0 6 2 0.989488 0
+0 7 2 1.03084 0
+0 8 2 0.993233 0
+0 9 2 1.03774 0
+0 10 2 1.06344 0
+0 11 2 1.00042 0
+0 12 2 1.0559 0
+0 13 2 1.05577 0
+0 14 2 1.05148 0
+0 15 2 1.03467 0
+0 0 3 1.1385 0
+0 1 3 1.10223 0
+0 2 3 1.12758 0
+0 3 3 1.10855 0
+0 4 3 1.16811 0
+0 5 3 1.14951 0
+0 6 3 1.07275 0
+0 7 3 1.11613 0
+0 8 3 1.07539 0
+0 9 3 1.12459 0
+0 10 3 1.15338 0
+0 11 3 1.08428 0
+0 12 3 1.14383 0
+0 13 3 1.14369 0
+0 14 3 1.14039 0
+0 15 3 1.11949 0
+0 0 4 1.09932 0
+0 1 4 1.0625 0
+0 2 4 1.08606 0
+0 3 4 1.06822 0
+0 4 4 1.1235 0
+0 5 4 1.10999 0
+0 6 4 1.03531 0
+0 7 4 1.07693 0
+0 8 4 1.03709 0
+0 9 4 1.08531 0
+0 10 4 1.11285 0
+0 11 4 1.0469 0
+0 12 4 1.10321 0
+0 13 4 1.10394 0
+0 14 4 1.10035 0
+0 15 4 1.08045 0
+0 0 5 1.09396 0
+0 1 5 1.05866 0
+0 2 5 1.08213 0
+0 3 5 1.06565 0
+0 4 5 1.12018 0
+0 5 5 1.1064 0
+0 6 5 1.03231 0
+0 7 5 1.0731 0
+0 8 5 1.03371 0
+0 9 5 1.08144 0
+0 10 5 1.10954 0
+0 11 5 1.04273 0
+0 12 5 1.10036 0
+0 13 5 1.10079 0
+0 14 5 1.09671 0
+0 15 5 1.07585 0
+0 0 6 1.11619 0
+0 1 6 1.0771 0
+0 2 6 1.10141 0
+0 3 6 1.08367 0
+0 4 6 1.14209 0
+0 5 6 1.12639 0
+0 6 6 1.05297 0
+0 7 6 1.09318 0
+0 8 6 1.05305 0
+0 9 6 1.10065 0
+0 10 6 1.12791 0
+0 11 6 1.06161 0
+0 12 6 1.11892 0
+0 13 6 1.1185 0
+0 14 6 1.11602 0
+0 15 6 1.09589 0
+0 0 7 0.992207 0
+0 1 7 0.95617 0
+0 2 7 0.97662 0
+0 3 7 0.96121 0
+0 4 7 1.00953 0
+0 5 7 0.996397 0
+0 6 7 0.931868 0
+0 7 7 0.964233 0
+0 8 7 0.931324 0
+0 9 7 0.973485 0
+0 10 7 0.999204 0
+0 11 7 0.940932 0
+0 12 7 0.991757 0
+0 13 7 0.991016 0
+0 14 7 0.989383 0
+0 15 7 0.975226 0
+0 0 8 1.06807 0
+0 1 8 1.03455 0
+0 2 8 1.05888 0
+0 3 8 1.0404 0
+0 4 8 1.09704 0
+0 5 8 1.08007 0
+0 6 8 1.00981 0
+0 7 8 1.05129 0
+0 8 8 1.01367 0
+0 9 8 1.0595 0
+0 10 8 1.08453 0
+0 11 8 1.019 0
+0 12 8 1.07599 0
+0 13 8 1.07544 0
+0 14 8 1.07126 0
+0 15 8 1.05213 0
+0 0 9 1.07322 0
+0 1 9 1.03869 0
+0 2 9 1.06165 0
+0 3 9 1.0447 0
+0 4 9 1.10153 0
+0 5 9 1.08441 0
+0 6 9 1.01286 0
+0 7 9 1.05365 0
+0 8 9 1.01672 0
+0 9 9 1.06427 0
+0 10 9 1.08927 0
+0 11 9 1.02263 0
+0 12 9 1.07962 0
+0 13 9 1.07916 0
+0 14 9 1.07558 0
+0 15 9 1.05542 0
+0 0 10 1.03342 0
+0 1 10 0.999954 0
+0 2 10 1.02158 0
+0 3 10 1.00498 0
+0 4 10 1.05958 0
+0 5 10 1.04313 0
+0 6 10 0.974025 0
+0 7 10 1.01269 0
+0 8 10 0.975984 0
+0 9 10 1.02259 0
+0 10 10 1.04922 0
+0 11 10 0.985154 0
+0 12 10 1.03874 0
+0 13 10 1.03801 0
+0 14 10 1.03509 0
+0 15 10 1.0175 0
+0 0 11 1.08258 0
+0 1 11 1.04797 0
+0 2 11 1.07057 0
+0 3 11 1.05309 0
+0 4 11 1.11159 0
+0 5 11 1.09417 0
+0 6 11 1.02086 0
+0 7 11 1.06119 0
+0 8 11 1.02392 0
+0 9 11 1.07117 0
+0 10 11 1.10077 0
+0 11 11 1.03559 0
+0 12 11 1.09012 0
+0 13 11 1.08843 0
+0 14 11 1.08571 0
+0 15 11 1.06485 0
+0 0 12 1.07307 0
+0 1 12 1.03946 0
+0 2 12 1.0614 0
+0 3 12 1.04367 0
+0 4 12 1.10177 0
+0 5 12 1.08434 0
+0 6 12 1.01155 0
+0 7 12 1.05298 0
+0 8 12 1.01438 0
+0 9 12 1.06102 0
+0 10 12 1.08926 0
+0 11 12 1.02538 0
+0 12 12 1.08318 0
+0 13 12 1.07886 0
+0 14 12 1.07625 0
+0 15 12 1.05681 0
+0 0 13 1.01387 0
+0 1 13 0.981192 0
+0 2 13 1.00272 0
+0 3 13 0.986491 0
+0 4 13 1.04149 0
+0 5 13 1.02408 0
+0 6 13 0.955257 0
+0 7 13 0.995111 0
+0 8 13 0.957727 0
+0 9 13 1.0025 0
+0 10 13 1.02863 0
+0 11 13 0.967083 0
+0 12 13 1.02681 0
+0 13 13 1.02643 0
+0 14 13 1.0182 0
+0 15 13 0.997673 0
+0 0 14 1.04472 0
+0 1 14 1.011 0
+0 2 14 1.03378 0
+0 3 14 1.01487 0
+0 4 14 1.07252 0
+0 5 14 1.05521 0
+0 6 14 0.984421 0
+0 7 14 1.02534 0
+0 8 14 0.988077 0
+0 9 14 1.03279 0
+0 10 14 1.05902 0
+0 11 14 0.996786 0
+0 12 14 1.05098 0
+0 13 14 1.05293 0
+0 14 14 1.04859 0
+0 15 14 1.02731 0
+0 0 15 1.09462 0
+0 1 15 1.06343 0
+0 2 15 1.08376 0
+0 3 15 1.06709 0
+0 4 15 1.12538 0
+0 5 15 1.10751 0
+0 6 15 1.03287 0
+0 7 15 1.07668 0
+0 8 15 1.03758 0
+0 9 15 1.08417 0
+0 10 15 1.1094 0
+0 11 15 1.04588 0
+0 12 15 1.09978 0
+0 13 15 1.10121 0
+0 14 15 1.0985 0
+0 15 15 1.07597 0
+1 0 0 1.00584 0
+1 1 0 0.991739 0
+1 2 0 1.04076 0
+1 3 0 0.989385 0
+1 7 0 0.957583 0
+1 8 0 0.942439 0
+1 0 1 0.96917 0
+1 1 1 0.950773 0
+1 2 1 1.00249 0
+1 3 1 0.95195 0
+1 7 1 0.92104 0
+1 8 1 0.906307 0
+1 0 2 0.985122 0
+1 1 2 0.967623 0
+1 2 2 1.01795 0
+1 3 2 0.967184 0
+1 7 2 0.935621 0
+1 8 2 0.920832 0
+1 0 3 1.00595 0
+1 1 3 0.990189 0
+1 2 3 1.04015 0
+1 3 3 0.987531 0
+1 7 3 0.954839 0
+1 8 3 0.940718 0
+1 0 4 0.990917 0
+1 1 4 0.975577 0
+1 2 4 1.0252 0
+1 3 4 0.974288 0
+1 7 4 0.941412 0
+1 8 4 0.92702 0
+1 0 5 1.00671 0
+1 1 5 0.99208 0
+1 2 5 1.04264 0
+1 3 5 0.990048 0
+1 7 5 0.956649 0
+1 8 5 0.942892 0
+1 0 6 0.96557 0
+1 1 6 0.950451 0
+1 2 6 0.998704 0
+1 3 6 0.949055 0
+1 7 6 0.917574 0
+1 8 6 0.903503 0
+1 0 7 0.891906 0
+1 1 7 0.87781 0
+1 2 7 0.922639 0
+1 3 7 0.875712 0
+1 7 7 0.853554 0
+1 8 7 0.836195 0
+1 0 8 0.989769 0
+1 1 8 0.974462 0
+1 2 8 1.02441 0
+1 3 8 0.972957 0
+1 7 8 0.942627 0
+1 8 8 0.925595 0
+1 0 9 0.958183 0
+1 1 9 0.943537 0
+1 2 9 0.99262 0
+1 3 9 0.941384 0
+1 7 9 0.910448 0
+1 8 9 0.89467 0
+1 0 10 0.94311 0
+1 1 10 0.930002 0
+1 2 10 0.977494 0
+1 3 10 0.927837 0
+1 7 10 0.89765 0
+1 8 10 0.882992 0
+1 0 11 0.996567 0
+1 1 11 0.981705 0
+1 2 11 1.03187 0
+1 3 11 0.978015 0
+1 7 11 0.946121 0
+1 8 11 0.931507 0
+1 0 12 1.00398 0
+1 1 12 0.989787 0
+1 2 12 1.04028 0
+1 3 12 0.986024 0
+1 7 12 0.954241 0
+1 8 12 0.939639 0
+1 0 13 0.896427 0
+1 1 13 0.882492 0
+1 2 13 0.927603 0
+1 3 13 0.879707 0
+1 7 13 0.850951 0
+1 8 13 0.83792 0
+1 0 14 1.02997 0
+1 1 14 1.01547 0
+1 2 14 1.06817 0
+1 3 14 1.01254 0
+1 7 14 0.98002 0
+1 8 14 0.963423 0
+1 0 15 0.953121 0
+1 1 15 0.938522 0
+1 2 15 0.986155 0
+1 3 15 0.937939 0
+1 7 15 0.907522 0
+1 8 15 0.891172 0
+2 0 0 1.06379 0
+2 1 0 1.10875 0
+2 2 0 1.02294 0
+2 3 0 1.02842 0
+2 4 0 1.06084 0
+2 5 0 1.0194 0
+2 6 0 1.05202 0
+2 7 0 1.07026 0
+2 8 0 0.991063 0
+2 9 0 1.00772 0
+2 10 0 1.0433 0
+2 11 0 1.07869 0
+2 12 0 1.04086 0
+2 13 0 1.06181 0
+2 14 0 1.02712 0
+2 0 1 0.995685 0
+2 1 1 1.03281 0
+2 2 1 0.955546 0
+2 3 1 0.959761 0
+2 4 1 0.991299 0
+2 5 1 0.951227 0
+2 6 1 0.982886 0
+2 7 1 1.0003 0
+2 8 1 0.924545 0
+2 9 1 0.939693 0
+2 10 1 0.973191 0
+2 11 1 1.0087 0
+2 12 1 0.972144 0
+2 13 1 0.993519 0
+2 14 1 0.960164 0
+2 0 2 1.04864 0
+2 1 2 1.08857 0
+2 2 2 1.00562 0
+2 3 2 1.01227 0
+2 4 2 1.04421 0
+2 5 2 1.00279 0
+2 6 2 1.0365 0
+2 7 2 1.05444 0
+2 8 2 0.974793 0
+2 9 2 0.991239 0
+2 10 2 1.02675 0
+2 11 2 1.06391 0
+2 12 2 1.02552 0
+2 13 2 1.04714 0
+2 14 2 1.01293 0
+2 0 3 1.10698 0
+2 1 3 1.15985 0
+2 2 3 1.06676 0
+2 3 3 1.07236 0
+2 4 3 1.10393 0
+2 5 3 1.06069 0
+2 6 3 1.09578 0
+2 7 3 1.11475 0
+2 8 3 1.03064 0
+2 9 3 1.04788 0
+2 10 3 1.08533 0
+2 11 3 1.1247 0
+2 12 3 1.084 0
+2 13 3 1.10751 0
+2 14 3 1.06881 0
+2 0 4 1.05695 0
+2 1 4 1.10478 0
+2 2 4 1.01516 0
+2 3 4 1.02202 0
+2 4 4 1.05319 0
+2 5 4 1.0132 0
+2 6 4 1.04602 0
+2 7 4 1.06436 0
+2 8 4 0.983777 0
+2 9 4 1.00063 0
+2 10 4 1.03641 0
+2 11 4 1.07385 0
+2 12 4 1.03511 0
+2 13 4 1.05746 0
+2 14 4 1.02133 0
+2 0 5 1.06973 0
+2 1 5 1.11893 0
+2 2 5 1.02921 0
+2 3 5 1.03518 0
+2 4 5 1.06659 0
+2 5 5 1.024 0
+2 6 5 1.05907 0
+2 7 5 1.07706 0
+2 8 5 0.996679 0
+2 9 5 1.01315 0
+2 10 5 1.04979 0
+2 11 5 1.08783 0
+2 12 5 1.04761 0
+2 13 5 1.07017 0
+2 14 5 1.03459 0
+2 0 6 1.01777 0
+2 1 6 1.06565 0
+2 2 6 0.979373 0
+2 3 6 0.985911 0
+2 4 6 1.01836 0
+2 5 6 0.976077 0
+2 6 6 1.01061 0
+2 7 6 1.02541 0
+2 8 6 0.948997 0
+2 9 6 0.964438 0
+2 10 6 0.998979 0
+2 11 6 1.03578 0
+2 12 6 0.997692 0
+2 13 6 1.01927 0
+2 14 6 0.98573 0
+2 0 7 1.04993 0
+2 1 7 1.09893 0
+2 2 7 1.01005 0
+2 3 7 1.01582 0
+2 4 7 1.04851 0
+2 5 7 1.00559 0
+2 6 7 1.04112 0
+2 7 7 1.0568 0
+2 8 7 0.978975 0
+2 9 7 0.993864 0
+2 10 7 1.0298 0
+2 11 7 1.06841 0
+2 12 7 1.02848 0
+2 13 7 1.05094 0
+2 14 7 1.01543 0
+2 0 8 1.01612 0
+2 1 8 1.06305 0
+2 2 8 0.977015 0
+2 3 8 0.982285 0
+2 4 8 1.01406 0
+2 5 8 0.973506 0
+2 6 8 1.00636 0
+2 7 8 1.02191 0
+2 8 8 0.94526 0
+2 9 8 0.962214 0
+2 10 8 0.996687 0
+2 11 8 1.03274 0
+2 12 8 0.995101 0
+2 13 8 1.01635 0
+2 14 8 0.983357 0
+2 0 10 1.01528 0
+2 1 10 1.0629 0
+2 2 10 0.977071 0
+2 3 10 0.982667 0
+2 4 10 1.01391 0
+2 5 10 0.973828 0
+2 6 10 1.00659 0
+2 7 10 1.02271 0
+2 8 10 0.945569 0
+2 9 10 0.961178 0
+2 10 10 0.99506 0
+2 11 10 1.03282 0
+2 12 10 0.995946 0
+2 13 10 1.01636 0
+2 14 10 0.983149 0
+2 0 11 0.98887 0
+2 1 11 1.03575 0
+2 2 11 0.950057 0
+2 3 11 0.957045 0
+2 4 11 0.98771 0
+2 5 11 0.948147 0
+2 6 11 0.980085 0
+2 7 11 0.996872 0
+2 8 11 0.921831 0
+2 9 11 0.937791 0
+2 10 11 0.969633 0
+2 11 11 1.00569 0
+2 12 11 0.968821 0
+2 13 11 0.989286 0
+2 14 11 0.95708 0
+2 0 12 1.02614 0
+2 1 12 1.07428 0
+2 2 12 0.986035 0
+2 3 12 0.992505 0
+2 4 12 1.02473 0
+2 5 12 0.982998 0
+2 6 12 1.01596 0
+2 7 12 1.03366 0
+2 8 12 0.956237 0
+2 9 12 0.971838 0
+2 10 12 1.00753 0
+2 11 12 1.04671 0
+2 12 12 1.00818 0
+2 13 12 1.02586 0
+2 14 12 0.991409 0
+2 0 13 1.06079 0
+2 1 13 1.1109 0
+2 2 13 1.02101 0
+2 3 13 1.02705 0
+2 4 13 1.0606 0
+2 5 13 1.01806 0
+2 6 13 1.05253 0
+2 7 13 1.07057 0
+2 8 13 0.989061 0
+2 9 13 1.00561 0
+2 10 13 1.04113 0
+2 11 13 1.07944 0
+2 12 13 1.04261 0
+2 13 13 1.06189 0
+2 14 13 1.02742 0
+2 0 14 1.03499 0
+2 1 14 1.0824 0
+2 2 14 0.996601 0
+2 3 14 1.00177 0
+2 4 14 1.03489 0
+2 5 14 0.991935 0
+2 6 14 1.02592 0
+2 7 14 1.04317 0
+2 8 14 0.965101 0
+2 9 14 0.980145 0
+2 10 14 1.01669 0
+2 11 14 1.05187 0
+2 12 14 1.01527 0
+2 13 14 1.03445 0
+2 14 14 1.00218 0
+3 0 0 1.02668 0
+3 1 0 1.05936 0
+3 2 0 1.08615 0
+3 3 0 1.06914 0
+3 4 0 1.0033 0
+3 5 0 1.04672 0
+3 7 0 1.00311 0
+3 8 0 1.06115 0
+3 9 0 1.0264 0
+3 10 0 1.07247 0
+3 11 0 1.01683 0
+3 12 0 1.06141 0
+3 13 0 0.98663 0
+3 14 0 1.08288 0
+3 15 0 1.09865 0
+3 0 1 0.896415 0
+3 5 1 0.886632 0
+3 7 1 0.894764 0
+3 15 1 0.944132 0
+3 0 2 0.958758 0
+3 1 2 0.991373 0
+3 2 2 1.01735 0
+3 3 2 1.00148 0
+3 4 2 0.937938 0
+3 5 2 0.980391 0
+3 7 2 0.937721 0
+3 8 2 0.992541 0
+3 9 2 0.95922 0
+3 10 2 1.00326 0
+3 11 2 0.950558 0
+3 12 2 0.992706 0
+3 13 2 0.921237 0
+3 14 2 1.0139 0
+3 15 2 1.02952 0
+3 0 3 0.938772 0
+3 1 3 0.972454 0
+3 2 3 0.99648 0
+3 3 3 0.983469 0
+3 4 3 0.921026 0
+3 5 3 0.961268 0
+3 7 3 0.919383 0
+3 8 3 0.973386 0
+3 9 3 0.940748 0
+3 10 3 0.98233 0
+3 11 3 0.931532 0
+3 12 3 0.973319 0
+3 13 3 0.90318 0
+3 14 3 0.993651 0
+3 15 3 1.00895 0
+3 0 4 0.945405 0
+3 1 4 0.978441 0
+3 2 4 1.00276 0
+3 3 4 0.987975 0
+3 4 4 0.926133 0
+3 5 4 0.96733 0
+3 7 4 0.925474 0
+3 8 4 0.980402 0
+3 9 4 0.947152 0
+3 10 4 0.990976 0
+3 11 4 0.939097 0
+3 12 4 0.980622 0
+3 13 4 0.910305 0
+3 14 4 1.00016 0
+3 15 4 1.01719 0
+3 0 5 0.96506 0
+3 1 5 0.9989 0
+3 2 5 1.02523 0
+3 3 5 1.00911 0
+3 4 5 0.947918 0
+3 5 5 0.991991 0
+3 7 5 0.946836 0
+3 8 5 1.00176 0
+3 9 5 0.968487 0
+3 10 5 1.0118 0
+3 11 5 0.958123 0
+3 12 5 1.00164 0
+3 13 5 0.930079 0
+3 14 5 1.02211 0
+3 15 5 1.03808 0
+3 0 7 0.941011 0
+3 1 7 0.974489 0
+3 2 7 0.999141 0
+3 3 7 0.981835 0
+3 4 7 0.922634 0
+3 5 7 0.962816 0
+3 7 7 0.92086 0
+3 8 7 0.975121 0
+3 9 7 0.944277 0
+3 10 7 0.987067 0
+3 11 7 0.934807 0
+3 12 7 0.97648 0
+3 13 7 0.907341 0
+3 14 7 0.997508 0
+3 15 7 1.01366 0
+3 0 8 0.89627 0
+3 1 8 0.928294 0
+3 2 8 0.952441 0
+3 3 8 0.936783 0
+3 4 8 0.878916 0
+3 5 8 0.917206 0
+3 7 8 0.88043 0
+3 8 8 0.93158 0
+3 9 8 0.900573 0
+3 10 8 0.9408 0
+3 11 8 0.890392 0
+3 12 8 0.930038 0
+3 13 8 0.863319 0
+3 14 8 0.949375 0
+3 15 8 0.963463 0
+3 0 9 0.948492 0
+3 1 9 0.981967 0
+3 2 9 1.00739 0
+3 3 9 0.990932 0
+3 4 9 0.928484 0
+3 5 9 0.971465 0
+3 7 9 0.928916 0
+3 8 9 0.983222 0
+3 9 9 0.953984 0
+3 10 9 0.995541 0
+3 11 9 0.941864 0
+3 12 9 0.983412 0
+3 13 9 0.91342 0
+3 14 9 1.00336 0
+3 15 9 1.02097 0
+3 0 10 0.838475 0
+3 1 10 0.86862 0
+3 2 10 0.891363 0
+3 3 10 0.876602 0
+3 4 10 0.823031 0
+3 5 10 0.85912 0
+3 7 10 0.821671 0
+3 8 10 0.868138 0
+3 9 10 0.845315 0
+3 10 10 0.88348 0
+3 11 10 0.833665 0
+3 12 10 0.870701 0
+3 13 10 0.808021 0
+3 14 10 0.887408 0
+3 15 10 0.902132 0
+3 0 11 0.885101 0
+3 1 11 0.916216 0
+3 2 11 0.940889 0
+3 3 11 0.923896 0
+3 4 11 0.867684 0
+3 5 11 0.9062 0
+3 7 11 0.866413 0
+3 8 11 0.917874 0
+3 9 11 0.888327 0
+3 10 11 0.932097 0
+3 11 11 0.881387 0
+3 12 11 0.920479 0
+3 13 11 0.852823 0
+3 14 11 0.936398 0
+3 15 11 0.952434 0
+3 0 12 0.917321 0
+3 1 12 0.949356 0
+3 2 12 0.974708 0
+3 3 12 0.958998 0
+3 4 12 0.899136 0
+3 5 12 0.939278 0
+3 7 12 0.898067 0
+3 8 12 0.95081 0
+3 9 12 0.920047 0
+3 10 12 0.963872 0
+3 11 12 0.909538 0
+3 12 12 0.955445 0
+3 13 12 0.885332 0
+3 14 12 0.972018 0
+3 15 12 0.986613 0
+3 0 13 0.906732 0
+3 1 13 0.940638 0
+3 2 13 0.964936 0
+3 3 13 0.949298 0
+3 4 13 0.890224 0
+3 5 13 0.931129 0
+3 7 13 0.889726 0
+3 8 13 0.942384 0
+3 9 13 0.911354 0
+3 10 13 0.952627 0
+3 11 13 0.901228 0
+3 12 13 0.94338 0
+3 13 13 0.874148 0
+3 14 13 0.961403 0
+3 15 13 0.977713 0
+3 0 14 0.95233 0
+3 1 14 0.987515 0
+3 2 14 1.01396 0
+3 3 14 0.997041 0
+3 4 14 0.935215 0
+3 5 14 0.976277 0
+3 7 14 0.933648 0
+3 8 14 0.98953 0
+3 9 14 0.957268 0
+3 10 14 1.00003 0
+3 11 14 0.947087 0
+3 12 14 0.989929 0
+3 13 14 0.91941 0
+3 14 14 1.01076 0
+3 15 14 1.0263 0
+3 0 15 0.905797 0
+3 1 15 0.935697 0
+3 2 15 0.962285 0
+3 3 15 0.945393 0
+3 4 15 0.889273 0
+3 5 15 0.926698 0
+3 7 15 0.88521 0
+3 8 15 0.938653 0
+3 9 15 0.90796 0
+3 10 15 0.949553 0
+3 11 15 0.898358 0
+3 12 15 0.936328 0
+3 13 15 0.872314 0
+3 14 15 0.959995 0
+3 15 15 0.98169 0

slope_intercept_cathode.dat

@@ -0,0 +1,23 @@
+Histogram Number	Slope	Intercept
+24	1	-2.89219e-10
+25	0.942098	-0.105169
+26	0.980862	-0.732032
+27	0.982975	-2.22704
+28	0.978815	-1.51477
+29	0.965245	-2.19515
+30	0.945384	-0.892599
+31	0.977408	-0.908592
+32	0.919546	3.25464
+33	0.972194	2.44956
+34	0.92852	5.44745
+35	0.947098	1.40531
+36	0.875491	-1.13145
+37	1.95496	-1735.58
+38	0.970862	2.86019
+40	0.91793	-3.80615
+41	0.913897	-2.12964
+42	0.954014	-0.760604
+43	0.993616	-1.40278
+45	0.926169	-21.2016
+46	1.00577	-2.14281
+47	0.943312	-1.26464

slope_intercept_results.dat

@@ -0,0 +1,49 @@
+Histogram Number	Slope	Intercept
+0	0.931015	-1.35431
+1	1	-1.87356e-10
+2	0.964185	1.49989
+3	0.92638	-1.30621
+4	0.905569	1.00834
+5	0.901182	0.470903
+6	0.853932	3.32687
+7	0.942785	1.08887
+8	0.878904	-0.0107433
+9	0.922662	-2.32259
+10	0.903343	8.38332
+11	0.914227	6.56108
+12	0.961008	23.0982
+13	0.920976	5.22104
+14	0.936584	31.5073
+15	0.959044	5.43267
+16	0.95263	-0.404053
+17	0.90953	4.82833
+18	0.940277	10.3629
+19	0.86746	-17.8678
+20	1.00683	4.76371
+21	0.968342	-43.9496
+22	0.892882	-32.0742
+23	0.933615	1.10704
+24	1	-2.89219e-10
+25	0.942098	-0.105169
+26	0.980862	-0.732032
+27	0.982975	-2.22704
+28	0.978815	-1.51477
+29	0.965245	-2.19515
+30	0.945384	-0.892599
+31	0.977408	-0.908592
+32	0.919546	3.25464
+33	0.972194	2.44956
+34	0.92852	5.44745
+35	0.947098	1.40531
+36	0.875491	-1.13145
+37	1	0
+38	0.970862	2.86019
+39	1	0
+40	0.91793	-3.80615
+41	0.913897	-2.12964
+42	0.954014	-0.760604
+43	0.993616	-1.40278
+44	1	0
+45	0.926169	-21.2016
+46	1.00577	-2.14281
+47	0.943312	-1.26464

slope_intercept_results_anode.dat

@@ -0,0 +1,21 @@
+Histogram Number	Slope	Intercept
+1	1	-1.87356e-10
+2	0.964185	1.49989
+3	0.92638	-1.30621
+4	0.905569	1.00834
+5	0.901182	0.470903
+7	0.942785	1.08887
+8	0.878904	-0.0107433
+10	0.903343	8.38332
+11	0.914227	6.56108
+12	0.961008	23.0982
+13	0.920976	5.22104
+14	0.936584	31.5073
+15	0.959044	5.43267
+16	0.95263	-0.404053
+17	0.90953	4.82833
+18	0.940277	10.3629
+20	1.00683	4.76371
+21	0.968342	-43.9496
+22	0.892882	-32.0742
+23	0.933615	1.10704

sx3_BackGains.txt

@@ -0,0 +1,12 @@
+7 0 1.20298
+7 1 0.995493
+7 2 0.993613
+7 3 1.2514
+9 0 1.01574
+9 1 0.961032
+9 2 0.988379
+9 3 1.05832
+19 0 1.07936
+19 1 0.97626
+19 2 1.00078
+19 3 1.03335

sx3_GainMatchfront.txt

@@ -0,0 +1,8 @@
+3 0 1 1 0.852399 0.881228
+3 0 2 2 0.813845 0.975967
+3 0 3 3 0.859643 0.863715
+3 1 1 1 0.76728 0.942438
+3 1 2 2 0.780302 0.929008
+3 2 2 2 0.729082 1.02005
+3 3 2 2 0.759098 1.05376
+3 3 3 3 0.821183 0.952335

sx3cal/EXFit.C

@@ -0,0 +1,67 @@
+{
+    int index = 3;
+    TFile *f = new TFile("../results_SX3_run12.root");
+    TH2F *h2=NULL;
+    TH1F *h1x=NULL, *h1y=NULL;
+    //f->cd("evsx");
+    //f->ls();
+
+    double known_xpos[2][2] = {{0,18.75},{-18.75,0}};
+    std::vector<double> xpos, xposkn; //first = x = known position, second = y = unknown position
+
+    std::ofstream ofb(Form("backgains%d.dat",index));
+    std::ofstream off(Form("frontgains%d.dat",index));
+    for(int i=1; i<4; i++) {
+        //do it for pad#2
+        int backnum=2;
+        h2 = (TH2F*)(f->Get(Form("evsx/be_vs_x_sx3_id_%d_f%d_b%d",index,i,backnum)));
+        auto macro = [&]() {
+            h1x = (TH1F*)(h2->ProjectionX("_px"));
+            double xleft = h1x->GetBinCenter(h1x->FindFirstBinAbove(h1x->GetMaximum()*0.25));
+            double xright = h1x->GetBinCenter(h1x->FindLastBinAbove(h1x->GetMaximum()*0.25));
+            //h1x->GetXaxis()->SetRangeUser(4*xleft, xright*4);
+            h1x->Draw();
+            TLine L1(xleft,0,xleft,h1x->GetMaximum()); L1.SetLineColor(kRed); L1.Draw("SAME");
+            TLine L2(xright,0,xright,h1x->GetMaximum()); L2.SetLineColor(kRed); L2.Draw("SAME");
+            gPad->Modified();
+            gPad->Update();
+            xpos.push_back(xleft); xposkn.push_back(known_xpos[backnum-1][0]);
+            xpos.push_back(xright); xposkn.push_back(known_xpos[backnum-1][1]);
+            while(gPad->WaitPrimitive());
+
+            h1y = (TH1F*)(h2->ProjectionY("_py"));
+            double ycenter = h1y->GetBinCenter(h1y->GetMaximumBin());
+//            std::cout << "front " << i << " back " << backnum << " "  << xleft << " " << xright << " " << ycenter << " " << 5486/ycenter << std::endl;
+            ofb << index <<" front " << i << " back " << backnum << " "  << 5486/ycenter << std::endl;
+            h1y->GetXaxis()->SetRangeUser(ycenter-200,ycenter+200);
+            h1y->Draw();
+            TLine L3(ycenter,0,ycenter,h1y->GetMaximum()*1.1); L3.SetLineColor(kRed); L3.Draw("SAME");
+
+            gPad->Modified();
+            gPad->Update();
+            while(gPad->WaitPrimitive());
+        };
+        if(h2)
+            macro();
+
+        //repeat for pad#1
+        backnum=1;
+        h2 = (TH2F*)(f->Get(Form("evsx/be_vs_x_sx3_id_%d_f%d_b%d",index,i,backnum)));
+        if(h2)
+            macro();
+
+        double xtofit[] = {xpos[0],xpos[3]};
+        double xktofit[] = {xposkn[0],xposkn[3]};
+        TGraph G1(xpos.size(),xpos.data(),xposkn.data());
+        G1.Draw("APL*");
+        G1.Fit("pol1","Q");
+        off << index<<" lengthcal front " << i << " " << G1.GetFunction("pol1")->GetParameter(0) << " " << G1.GetFunction("pol1")->GetParameter(1) << std::endl;
+        gPad->Modified(); gPad->Update();
+        while(gPad->WaitPrimitive());
+        xpos.clear();
+        xposkn.clear();
+    }
+    ofb.close();
+    off.close();
+    f->Close();
+}

sx3cal/LRFit.C

@@ -0,0 +1,37 @@
+{
+    TFile *f = new TFile("../results_SX3_run12.root");
+    f->cd("l_vs_r");
+    f->ls();
+    int clkpos = 3;
+    std::ofstream ofile(Form("rightgains%d.dat",clkpos));
+    for(int i=1; i<4; i++) {
+        TH2F h2(*(TH2F*)(f->Get(Form("l_vs_r/l_vs_r_sx3_id_%d_f%d",clkpos,i))));
+        h2.Draw();
+
+        TH1F hproj(*(TH1F*)(h2.ProjectionX("_px")));
+        /*hproj.Draw("SAME");
+        gPad->Modified();
+        gPad->Update();
+        while(gPad->WaitPrimitive());*/
+
+        int leftbin = hproj.FindFirstBinAbove(hproj.GetMaximum()*0.1);
+        int rightbin = hproj.FindLastBinAbove(hproj.GetMaximum()*0.1);
+
+        TH1F h1(*(TH1F*)(h2.ProfileX("_pfx",leftbin,rightbin)));
+        h1.Draw("histo same");
+        TLine L1(h1.GetBinCenter(leftbin),0,h1.GetBinCenter(leftbin),1000); L1.SetLineColor(kRed); L1.Draw("SAME");
+        TLine L2(h1.GetBinCenter(rightbin),0,h1.GetBinCenter(rightbin),1000); L2.SetLineColor(kRed); L2.Draw("SAME");
+        //h2.GetYaxis()->SetRangeUser(0,2000);
+        //h2.GetXaxis()->SetRangeUser(hproj.GetBinCenter(leftbin),hproj.GetBinCenter(rightbin));
+        h2.Fit("pol1","","SAME",h1.GetBinCenter(leftbin),h1.GetBinCenter(rightbin));
+
+        TF1 *f1 = (TF1*)h2.GetFunction("pol1");
+        f1->Draw("SAME");
+        ofile << clkpos << " " << i << " " << f1->GetParameter(0) << " " << TMath::Abs(f1->GetParameter(1)) << std::endl;
+        gPad->Modified();
+        gPad->Update();
+        while(gPad->WaitPrimitive());
+    }
+    ofile.close();
+    f->Close();
+}

sx3cal/backgains.dat

@@ -0,0 +1,28 @@
+1 front 0 back 2 4.03168
+1 front 1 back 2 4.03168
+1 front 2 back 2 4.11533
+1 front 3 back 2 4.17315
+7 front 0 back 2 4.26886
+7 front 0 back 1 3.44529
+7 front 1 back 2 4.26886
+7 front 1 back 1 3.44529
+7 front 2 back 2 4.26886
+7 front 2 back 1 3.46759
+7 front 3 back 2 4.26886
+7 front 3 back 1 3.44529
+9 front 0 back 2 3.63215
+9 front 0 back 1 3.42327
+9 front 1 back 2 3.63215
+9 front 1 back 1 3.42327
+9 front 2 back 2 3.65694
+9 front 2 back 1 3.46759
+9 front 3 back 2 3.68208
+9 front 3 back 1 3.42327
+3 front 0 back 2 3.
+3 front 0 back 1 3.
+3 front 1 back 2 3.65694
+3 front 1 back 1 3.68208
+3 front 2 back 2 3.70756
+3 front 2 back 1 3.78616
+3 front 3 back 2 3.7334
+3 front 3 back 1 3.68208

sx3cal/backgains.dat.unity

@@ -0,0 +1,80 @@
+1   0   0   1.
+1   1   0   1.
+1   2   0   1.
+1   3   0   1.
+1   0   1   1.
+1   1   1   1.
+1   2   1   1.
+1   3   1   1.
+1   0   2   1.
+1   1   2   1.
+1   2   2   1.
+1   3   2   1.
+1   0   3   1.
+1   1   3   1.
+1   2   3   1.
+1   3   3   1.
+7   0   0   1.
+7   1   0   1.
+7   2   0   1.
+7   3   0   1.
+7   0   1   1.
+7   1   1   1.
+7   2   1   1.
+7   3   1   1.
+7   0   2   1.
+7   1   2   1.
+7   2   2   1.
+7   3   2   1.
+7   0   3   1.
+7   1   3   1.
+7   2   3   1.
+7   3   3   1.
+0   0   0   1.
+0   1   0   1.
+0   2   0   1.
+0   3   0   1.
+0   0   1   1.
+0   1   1   1.
+0   2   1   1.
+0   3   1   1.
+0   0   2   1.
+0   1   2   1.
+0   2   2   1.
+0   3   2   1.
+0   0   3   1.
+0   1   3   1.
+0   2   3   1.
+0   3   3   1.
+2   0   0   1.
+2   1   0   1.
+2   2   0   1.
+2   3   0   1.
+2   0   1   1.
+2   1   1   1.
+2   2   1   1.
+2   3   1   1.
+2   0   2   1.
+2   1   2   1.
+2   2   2   1.
+2   3   2   1.
+2   0   3   1.
+2   1   3   1.
+2   2   3   1.
+2   3   3   1.
+9   0   0   1.
+9   1   0   1.
+9   2   0   1.
+9   3   0   1.
+9   0   1   1.
+9   1   1   1.
+9   2   1   1.
+9   3   1   1.
+9   0   2   1.
+9   1   2   1.
+9   2   2   1.
+9   3   2   1.
+9   0   3   1.
+9   1   3   1.
+9   2   3   1.
+9   3   3   1.

sx3cal/frontgains.dat

@@ -0,0 +1,16 @@
+1 lengthcal front 0 0.878906 58.5938
+1 lengthcal front 1 1.42045 56.8182
+1 lengthcal front 2 -2.55682 56.8182
+1 lengthcal front 3 2.55682 56.8182
+7 lengthcal front 0 0.425806 42.5806
+7 lengthcal front 1 1.92004 45.1774
+7 lengthcal front 2 1.11607 44.6429
+7 lengthcal front 3 3.45909 44.6334
+9 lengthcal front 0 1.82872 45.7181
+9 lengthcal front 1 1.01649 45.1774
+9 lengthcal front 2 1.46827 45.1774
+9 lengthcal front 3 2.54513 46.2751
+3 lengthcal front 0 0. 50.
+3 lengthcal front 1 1.1713 58.5652
+3 lengthcal front 2 -3.07505 58.5723
+3 lengthcal front 3 4.0726 60.3348

sx3cal/frontgains.dat.unity

@@ -0,0 +1,20 @@
+9   temp  temp 0   0.    1.
+9   temp  temp 1   0.    1.
+9   temp  temp 2   0.    1.
+9   temp  temp 3   0.    1.
+7   temp  temp 0   0.    1.
+7   temp  temp 1   0.    1.
+7   temp  temp 2   0.    1.
+7   temp  temp 3   0.    1.
+1   temp  temp 0   0.    1.
+1   temp  temp 1   0.    1.
+1   temp  temp 2   0.    1.
+1   temp  temp 3   0.    1.
+2   temp  temp 0   0.    1.
+2   temp  temp 1   0.    1.
+2   temp  temp 2   0.    1.
+2   temp  temp 3   0.    1.
+0   temp  temp 0   0.    1.
+0   temp  temp 1   0.    1.
+0   temp  temp 2   0.    1.
+0   temp  temp 3   0.    1.

sx3cal/rightgains.dat

@@ -0,0 +1,16 @@
+1 0 1221.23 0.648782
+1 1 1819.66 1.06196
+1 2 1860.02 1.11979
+1 3 1825.44 0.964989
+7 0 1609.63 1.04668
+7 1 1734.45 1.12285
+7 2 1538.97 1.0486
+7 3 1524.57 0.951587
+9 0 1672.38 1.11321
+9 1 1542.13 1.01442
+9 2 1540.38 0.967847
+9 3 1560.42 0.969022
+3 0 1000.0  1.
+3 1 1539.42 1.0422
+3 2 1720.12 1.31534
+3 3 1562.16 1.00415

sx3cal/rightgains.dat.unity

@@ -0,0 +1,20 @@
+9   0   1000    1.0
+9   1   1000    1.0
+9   2   1000    1.0
+9   3   1000    1.0
+7   0   1000    1.0
+7   1   1000    1.0
+7   2   1000    1.0
+7   3   1000    1.0
+2   0   1000    1.0
+2   1   1000    1.0
+2   2   1000    1.0
+2   3   1000    1.0
+0   0   1000    1.0
+0   1   1000    1.0
+0   2   1000    1.0
+0   3   1000    1.0
+1   0   1000    1.0
+1   1   1000    1.0
+1   2   1000    1.0
+1   3   1000    1.0