HRaNode

class HRaNode : public TObject

    public:

                      HRaNode()
                      HRaNode(Int_t size)
                      HRaNode(const HRaNode&)
                      ~HRaNode()
                 void addSubNode(HRaNode* n)
       static TClass* Class()
         virtual void clear()
             HRaNode* getSubNode(Int_t idx)
      virtual TClass* IsA() const
             HRaNode& operator=(const HRaNode&)
         virtual void ShowMembers(TMemberInspector& insp, char* parent)
         virtual void Streamer(TBuffer& b)
                 void StreamerNVirtual(TBuffer& b)

Data Members

    protected:

      TObjArray* fSubNodes  

Class Description

HRaTree, HRaNode, HRaIndexNode

 HRaTree stands for "Hades Random Access Tree". This class implements
random access to the objects in any category using a tree; the only condition
is that the data objects in the category inherit from HLocatedDataObject, so
the random access implemented by the HRaTree corresponds to the indexes
in the data objects rather than the natural indexing in the category.

 As said, the HRaTree is a tree of HRaNode objects. The lower level nodes
are HRaIndexNode and store pointers to the actual data objects being accesed
with the HRaTree.

Calls "Clear" for each of the subnodes

Inline Functions

            HRaNode HRaNode()
            HRaNode HRaNode(Int_t size)
           HRaNode* getSubNode(Int_t idx)
               void addSubNode(HRaNode* n)
            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
               void StreamerNVirtual(TBuffer& b)
            HRaNode HRaNode(const HRaNode&)
           HRaNode& operator=(const HRaNode&)