Writing TNtuple or String into a Tree

[Danilo]

Hi,

why don’t you organise your parallelism around the solution we found in this thread?

Std::map or TTree::GetV1()

I see indeed, this is quite simillar to a map ! I will try to implement this idea. What do you mean by performance figure a plot where I compare methods ? If yes, no I don’t have. I will use this script in the context of PROOF environment. Basically everything will be parallelized. Maybe I can share an example. (I took it from a previous thread and I modified it.) Actually to be more precise, I will know the number of spill/run after reading the tree once. Then I thing there are multiple me…

Cheers,
Danilo