Well, if the problem persists, one thing you could do, is loop the first tree, read all the entries, and in the same loop only fill the second tree, if the entry fits the cut. Longer (not that much) but efficient.
Well, if the problem persists, one thing you could do, is loop the first tree, read all the entries, and in the same loop only fill the second tree, if the entry fits the cut. Longer (not that much) but efficient.