Hi,
i’m creating a program that opens two file each of them having a TTree with 9 branches. Since for each signal of the first TTree i have to cycle over all the entries of the other TTree until a certain condition is met, first of all i’ve realized a loop that cycle over all the events; however this method is really very very slow. Since the condition has to be searched in a branch that is, my his own, sorted, is there a way to implement the TMath::BinarySearch function in this case?
Thanks in advance,
Marco