# trackingQA Set of macros to generate output histograms to compare different track finders and fitters with each other ## Usage As an input a simulation and a digitization file are needed. To compare two different trackers with each other they should use the same sim and digi file. To generate the corresponding files run the macros in macro/master. ### reco_complete.C / reco_forward_complete.C First macro to run. If you want to run an individual track finder you have to modify this file to the task to call your track finder into the macro. Usage: root -l reco_complete.C"(, )" is the prefix used for the simulation and digitization macro. This value is needed. is optional and set as default to 0 meaning that all events in the sim file are processed ### trackingQA_complete.C / trackingQA_forward_complete.C Macro compares the generated track data with the ideal track finder. Usage: root -l trackingQA_complete.C"(, , )" has to be identical to the one used for reco_complete.C is the name of the branch where the PndTrack data is stored in the output tree of the reco file has to be set if not all events should be analyzed ### plot_trackingQA.C Plots the results from the trackingQA task Usage: root -l plot_trackingQA.C"()" is the name of the output file generated in the trackingQA_complete.C macro ### QA_histos.C / QA_histos_forward.C Generates histogramms for comparison with other track finders Usage: root -l QA_histos.C"(, ) is again the same prefix used in reco_complete and trackingQA_complete is the same as in trackingQA_complete.C ### comp_recoqa.C Plots the histograms of two different root filew with the same type of histograms on top of each other and compares them. Very usefull tool to compare different track finders with each other. Takes as input the files generated by QA_histos. Usage: root -l comp_recoqa.C"(, , , , )" is the first input file you want to compare to is the second input file you want to compare sets the number of histograms per canvas two histograms are checked if they have the identical shape via a Kolmogorov test (see TH1::KolmogorovTest). MinP sets the minimum probability that two histograms have still the same shape Minimum number of events. If a histograms has less entries it is marked as almost empty