class TDataSet: public TNamed

  cout << "ctor for " << GetName() << " - " << GetTitle() << endl;

return real parent

 Creates TDataSet (clone) with a topology similar with TDataSet *pattern

  Parameters:

  pattern        - the pattern dataset
  iopt = kStruct - clone only my structural links
         kAll    - clone all links
         kRefs   - clone only refs
         kMarked - clone marked (not implemented yet) only

   All new-created sets become the structural ones anyway.

  cout << "ctor for " << GetName() << " - " << GetTitle() << endl;

 This copy ctor has been depricated (left for thwe sake of the backweard compatibility)

              cout << "Default destructor for " << GetName() << " - " << GetTitle() << endl;

 Create the internal container at once if any

 Add TDataSet object at the "idx" position in ds
 or at the end of the dataset
 The final result is defined by either TList::AddAt or TObjArray::AddAt
 methods

   !!!! Under construction !!!!!
 Add TDataSet object at the "idx" position in ds
 or at the end of the dataset
 The final result is defined by either TList::AddAt or TObjArray::AddAt
 methods

 Add TDataSet object at the end of the dataset list of this dataset

 Add TDataSet object at the beginning of the dataset list of this dataset

 Browse this dataset (called by TBrowser).

 the custom implementation fo the TObject::Clone

 Delete - deletes the list of the TDataSet objects and all "Structural Members"
          as well
          This method doesn't affect the "Associated Members"

 Aliase for TDataSet::Find(const Char_t *path) method

 Full description see: TDataSetIter::Find

 Note. This method is quite expansive.
 ----- It is done to simplify the user's code when one wants to find ONLY object.
       If you need to find more then 1 object in this dataset,
       regard using TDataSetIter class yourself.

 Full description see: TDataSetIter::Find

 Note. This is method is quite expansive.
 ----- It is done to simplify the user's code when one wants to find ONLY object.
       If you need to find more then 1 object in this dataset,
       regard using TDataSetIter class yourself.

 Full description see: TDataSetIter::Find

 Note. This method is quite expansive.
 ----- It is done to simplify the user's code when one wants to find ONLY object.
       If you need to find more then 1 object in this dataset,
       regard using TDataSetIter class yourself.

  Return the first object in the list. Returns 0 when list is empty.

add data set to main data set

return pointer to the main dataset

 The depricated method (left here for the sake of the backward compatibility)

 Return the last object in the list. Returns 0 when list is empty.

 Return the object next to this one in the parent structure
 This convinient but time-consuming. Don't use it in the inner loops

 Return the object that is previous to this one in the parent structure
 This convinient but time-consuming. Don't use it in the inner loops

 The depricated method (left here for the sake of the backward compatibility)

ls(Option_t *option)

option       - defines the path to be listed
= "*" -  means print all levels

ls(Int_t depth)

Prints the list of the this TDataSet.

Parameter:

Int_t depth >0 the number of levels to be printed
=0 all levels will be printed
No par - ls() prints only level out

 apply the class default ctor to instantiate a new object of the same kind.
 This is a base method to be overriden by the classes
 derived from TDataSet (to support TDataSetIter::Mkdir for example)

 Compare the name of the TDataSet with "dirname"
 ignorercase flags indicates whether the comparision is case sensitive

 Mark all members of this dataset

 UnMark all members of this dataset

 Invert mark bit for all members of this dataset

 return kTRUE if the "internal" collection has no member

 Callback method to complete ls() method recursive loop
 This is to allow to sepoarate navigation and the custom invormation
 in the derived classes (see; TTable::PrintContents for example

 return the full path of this data set

 Remiove the "set" from this TDataSet

 Remove object from the "idx" cell of this set and return
 the pointer to the removed object if any

 Purge  - deletes all "dummy" "Structural Members" those are not ended
          up with some dataset with data inside (those return HasData() = 0)

 Purge does affect only the "Structural Members" and doesn't "Associated" ones

  Break the "parent" relationship with the current object parent if present
  parent != 0   Makes this object the "Structural Member"
                of the "parent" dataset
          = 0   Makes this object the "pure Associator", i.e it makes this
                object the "Structural Member" of NO other TDataSet

 One should not use this method but TDataSet::Write instead
 This method os left here for the sake of the backward compatibility
 To Write object first we should temporary break the
 the backward fParent pointer (otherwise ROOT follows this links
 and will pull fParent out too.

  Remove the object from the original and add it to dataset
  TDataSet dataset   != 0  -  Make this object the "Structural Member"
                                of "dataset"
                        = 0  -  Make this object "Orphan"

 Update this TDataSet with "set"

 ATTENTION !!!

 This method changes the parent relationships of the input "set"

  Update()

  Recursively updates all tables for all nested datasets
  in inverse order

 Sort recursively all members of the TDataSet with TList::Sort method

 To Write object first we should temporary break the
 the backward fParent pointer (otherwise ROOT follows this links
 and will pull fParent out too.

 To Write object first we should temporary break the
 the backward fParent pointer (otherwise ROOT follows this links
 and will pull fParent out too.

 --   Int_t IncCnt(){ fCnt++; return fCnt;}
 --   Int_t DecCnt(){ fCnt--; return fCnt;}
 --   Int_t Cnt()   { return fCnt;}

 --     Int_t               fCnt;      // reference counter.