HRaIndexNode

class HRaIndexNode : public HRaNode

    protected:

                   HRaIndexNode()

    public:

                      HRaIndexNode(Int_t size)
                      ~HRaIndexNode()
       static TClass* Class()
         virtual void clear()
             TObject* getCell(Int_t i)
      virtual TClass* IsA() const
                 void setCell(TObject* obj, Int_t i)
         virtual void ShowMembers(TMemberInspector& insp, char* parent)
         virtual void Streamer(TBuffer& b)
                 void StreamerNVirtual(TBuffer& b)

Data Members

    protected:

      TObjArray fCells  

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.

Clears the pointers to the data objects being accessed throught the HRaTree

Inline Functions

                void ~HRaIndexNode()
        HRaIndexNode HRaIndexNode()
        HRaIndexNode HRaIndexNode(Int_t size)
            TObject* getCell(Int_t i)
                void setCell(TObject* obj, Int_t i)
             TClass* Class()
             TClass* IsA() const
                void ShowMembers(TMemberInspector& insp, char* parent)
                void Streamer(TBuffer& b)
                void StreamerNVirtual(TBuffer& b)