class RooAbsCollection: public TObject, public RooPrintable

 Destructor

 Examine client server dependencies in list and
 delete contents in safe order: any client
 is deleted before a server is deleted

 Take a snap shot of current collection contents:
 An owning collection is returned containing clones of

     - Elements in this collection
     - External dependents of all elements
       and recursively any dependents of those dependents
       (if deepCopy flag is set)

 Ff deepCopy is specified, the client-server links between the cloned
 list elements and the cloned external dependents are reconnected to
 each other, making the snapshot a completely self-contained entity.

 Add clones of servers of given argument to list

 Add the specified argument to list. Returns kTRUE if successful, or
 else kFALSE if a variable of the same name is already in the list.
 This method can only be called on a list that is flagged as owning
 all of its contents, or else on an empty list (which will force the
 list into that mode).

 Add a clone of the specified argument to list. Returns a pointer to
 the clone if successful, or else zero if a variable of the same name
 is already in the list or the list does *not* own its variables (in
 this case, try add() instead.) Calling addClone() on an empty list
 forces it to take ownership of all its subsequent variables.

 Add the specified argument to list. Returns kTRUE if successful, or
 else kFALSE if a variable of the same name is already in the list
 or the list owns its variables (in this case, try addClone() or addOwned() instead).

 Add a collection of arguments to this collection by calling add()
 for each element in the source collection

 Add a collection of arguments to this collection by calling addOwned()
 for each element in the source collection

 Add a collection of arguments to this collection by calling addOwned()
 for each element in the source collection

 Replace any args in our set with args of the same name from the other set
 and return kTRUE for success. Fails if this list is a copy of another.

 Replace var1 with var2 and return kTRUE for success. Fails if
 this list is a copy of another, if var1 is not already in this set,
 or if var2 is already in this set. var1 and var2 do not need to have
 the same name.

 Remove the specified argument from our list. Return kFALSE if
 the specified argument is not found in our list. An exact pointer
 match is required, not just a match by name. A variable can be
 removed from a copied list and will be deleted at the same time.

 Remove each argument in the input list from our list using remove(const RooAbsArg&).
 Return kFALSE in case of problems.

 Remove all arguments from our set, deleting them if we own them.
 This effectively restores our object to the state it would have
 just after calling the RooAbsCollection(const char*) constructor.

 Set given attribute in each element of the collection by
 calling each elements setAttribute() function.

 Create a subset of the current collection, consisting only of those
 elements with the specified attribute set. The caller is responsibe
 for deleting the returned collection

 Create a subset of the current collection, consisting only of those
 elements that are contained as well in the given reference collection.
 The caller is responsible for deleting the returned collection

 Create a subset of the current collection, consisting only of those
 elements with names matching the wildcard expressions in nameList,
 supplied as a comma separated list

 Check if this and other collection have identically named contents

 Check if this and other collection have common entries

 Find object with given name in list. A null pointer
 is returned if no object with the given name is found

 Print info about this argument set to the specified stream.

  Standard: OneLine description of each argument
     Shape: Standard description of each argument
   Verbose: Shape description of each argument

 Output content of collection as LaTex table. By default a table with two columns is created: the left
 column contains the name of each variable, the right column the value.

 The following optional named arguments can be used to modify the default behavior

   Columns(Int_t ncol)                    -- Fold table into multiple columns, i.e. ncol=3 will result in 3 x 2 = 6 total columns
   Sibling(const RooAbsCollection& other) -- Define sibling list. The sibling list is assumed to have objects with the same
                                             name in the same order. If this is not the case warnings will be printed. If a single
                                             sibling list is specified, 3 columns will be output: the (common) name, the value of this
                                             list and the value in the sibling list. Multiple sibling lists can be specified by
                                             repeating the Sibling() command.
   Format(const char* str)                -- Classic format string, provided for backward compatibility
   Format(...)                            -- Formatting arguments, details are given below
   OutputFile(const char* fname)          -- Send output to file with given name rather than standard output

 The Format(const char* what,...) has the following structure

   const char* what          -- Controls what is shown. "N" adds name, "E" adds error,
                                "A" shows asymmetric error, "U" shows unit, "H" hides the value
   FixedPrecision(int n)     -- Controls precision, set fixed number of digits
   AutoPrecision(int n)      -- Controls precision. Number of shown digits is calculated from error
                                + n specified additional digits (1 is sensible default)
   VerbatimName(Bool_t flag) -- Put variable name in a \verb+   + clause.

 Example use: list.printLatex(Columns(2), Format("NEU",AutoPrecision(1),VerbatimName()) ) ;

 Count number of rows to print

 Hash table control

 export subset of THashList interface

 first() returns the first element that the iterator would return, which is not necessarily
 the first element added to this set!