1 void PathLengthTest() {
3 // It's a test macro for path length calculation in AliFastGlauber
12 // centrality (fraction of geometrical cross section
13 g.SetCentralityClass(0.00,0.10);
15 // plot b,ell, and ell1 vs ell2 (back-to-back partons) in that centrality
18 g.PlotBDistr(nEntries);
19 g.PlotLengthDistr(nEntries);
20 g.PlotLengthB2BDistr(nEntries);
23 // examples on getting stuff out of it
24 Double_t b,ell,ell1,ell2;
27 printf(" Random b in cetrality class (according to hard cross section):\n %f fm\n",b);
31 printf(" for this b: %f fm\n",ell);
33 printf(" for random b : %f fm\n",ell);
35 printf(" Lengths for two partons back-to-back:\n");
36 g.GetLengthsBackToBack(b,ell1,ell2);
37 printf(" for this b: %f fm and %f fm\n",ell1,ell2);
38 g.GetLengthsBackToBack(ell1,ell2);
39 printf(" for random b: %f fm and %f fm\n",ell1,ell2);
42 Double_t phis[3]={2.,4.,6.};
44 printf(" Lengths for N partons from PYTHIA:\n");
45 g.GetLengthsForPythia(3,phis,ells,b);
46 printf(" for this b: %f fm, %f fm and %f fm\n",ells[0],ells[1],ells[2]);
47 g.GetLengthsForPythia(3,phis,ells);
48 printf(" for random b: %f fm, %f fm and %f fm\n",ells[0],ells[1],ells[2]);