Hi Alberto, Did you look into using a TTree. TTree are specialized to handle a very large amount of objects and do selection on them. (See the many example in the tutorials and test directory, as well as an extensive discussion in the User Guide). Cheers, Philippe. -----Original Message----- From: owner-roottalk@pcroot.cern.ch [mailto:owner-roottalk@pcroot.cern.ch]On Behalf Of Alberto Pulvirenti Sent: Friday, October 19, 2001 12:01 PM To: roottalk@pcroot.cern.ch Subject: [ROOT] Lists Hi to all rooters! If there is any who knows well the collection classes, he could give me a clever suggestion. My problem is to collect many objects (~100000) and to visit the collection to get the ones which, every time, satisfy some criteria that I estabilished. But, when using the only one thing I know well, the TObjArray, I didn't achieve the correct performance, and wasted many time wisiting objects that I don't need. Maybe, it could be a good idea to use a THashList, but I'm not sure... any suggestion? Thanks by Alberto Pulvirenti
This archive was generated by hypermail 2b29 : Tue Jan 01 2002 - 17:51:03 MET