Re: [ROOT] Sorting a tree

• Next message: Meir Ron: "[ROOT] bool problem when CINT init_cint after scratch_all!"
• Previous message: Rene Brun: "Re: [ROOT] pointers initialisation problems"
• In reply to: Alberto Pulvirenti: "[ROOT] Sorting a tree"
• Next in thread: Rene Brun: "Re: [ROOT] Sorting a tree"
• Reply: Rene Brun: "Re: [ROOT] Sorting a tree"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Hi Alberto,

You can use a TEventList to sort the Tree.
Just create an empty TEventList and enter your events in an order
that can choose based on your own algorithm.
Once you have the TEventlist, you can
  - use TTree::SetEventList(mylist). When looping on the entries,
    functions such as TTree::draw will loop in the order specified in the list
  - write a new sorted Tree in the same loop

Rene Brun

Alberto Pulvirenti wrote:
> 
> Dear rooters,
> is there anyone who knows if (and, eventually, how) it is possible to
> sort a tree, re-ordering its entries with respect to a specified criterion?
> 
> Thanks.
> 
> Alberto

• Next message: Meir Ron: "[ROOT] bool problem when CINT init_cint after scratch_all!"
• Previous message: Rene Brun: "Re: [ROOT] pointers initialisation problems"
• In reply to: Alberto Pulvirenti: "[ROOT] Sorting a tree"
• Next in thread: Rene Brun: "Re: [ROOT] Sorting a tree"
• Reply: Rene Brun: "Re: [ROOT] Sorting a tree"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

This archive was generated by hypermail 2b29 : Tue Jan 01 2002 - 17:51:03 MET