Hi all.
I’m really sorry to ask this question as I think everyone doing anything with ROOT trees have faced this problem. However I did not find a clear description of the mechanism behind and advices what to do.
I have created some tree with a C structure, quite similar to what is given in the ROOT tutorial here:
root.cern.ch/root/htmldoc/guide … -structure
I will be able to post my code later, if asked.
Suddenly there are two trees in the file and moreover the indices are not even starting from 1 (19 and 20).
I see that tr and tr19 are actually the same object, but tr20 is different. Thus if I simply ask for the tree by the name which I know, “dataTree”, I will get the one with 380 entries, presumably with some data missing.
Next issue is the size of file. This is, of cause, a just an example here. In the full version I expect rather high data rate and I would like to enjoy the nice ROOT tree compression capability to minimize the disk space occupied. Is there any data redundancy or it just looks as if there are two trees?
Does it have to do something with TTree:Autosave()? Or TTree::SetMaxTreeSize()? Or incorrect file closing?
Thank you.
Egor.