Containers

The containers and generators the ROOT framework offers.

Collections are a key feature of the ROOT system. Many, if not most, of the applications you write will use collections. If you have used polymorphic C++ collections before, some of this material will be review. However, much of this tutorial covers aspects of collections specific to the ROOT system. In this tutorial the following features will be demonstrated:

• Chapter about Collections in the Users Guide
• Using collections
• How to create instances of collections
• The difference between lists, ordered collections, hash-tables, maps, etc.
• How to add and remove elements of a collection
• How to search a collection for a specific element
• How to access and modify collection elements
• How to iterate over a collection
• How to manage memory for collections and collection elements
• How collection elements are tested for equality (IsEqual())
• How collection elements are compared (Compare()) in case of sorted collections
• How collection elements are hashed (Hash()) in hash tables

Classes
class	TArray
	Abstract array base class. More...
class	TArrayC
	Array of chars or bytes (8 bits per element). More...
class	TArrayD
	Array of doubles (64 bits per element). More...
class	TArrayF
	Array of floats (32 bits per element). More...
class	TArrayI
	Array of integers (32 bits per element). More...
class	TArrayL
	Array of longs (32 or 64 bits per element). More...
class	TArrayL64
	Array of long64s (64 bits per element). More...
class	TArrayS
	Array of shorts (16 bits per element). More...
class	TBits
	Container of bits. More...
class	TBtree
	B-tree class. More...
class	TClassTable
	This class registers for all classes their name, id and dictionary function in a hash table. More...
class	TClonesArray
	An array of clone (identical) objects. More...
class	TCollection
	Collection abstract base class. More...
class	THashList
	THashList implements a hybrid collection class consisting of a hash table and a list to store TObject's. More...
class	THashTable
	THashTable implements a hash table to store TObject's. More...
class	TIterator
	Iterator abstract base class. More...
class	TList
	A doubly linked list. More...
class	TMap
	TMap implements an associative array of (key,value) pairs using a THashTable for efficient retrieval (therefore TMap does not conserve the order of the entries). More...
class	TObjArray
	An array of TObjects. More...
class	TObjectTable
	This class registers all instances of TObject and its derived classes in a hash table. More...
class	TOrdCollection
	Ordered collection. More...
class	TRefArray
	An array of references to TObjects. More...
class	TRefTable
	A TRefTable maintains the association between a referenced object and the parent object supporting this referenced object. More...
class	ROOT::TSeq< T >
	A pseudo container class which is a generator of indices. More...
class	TSeqCollection
	Sequenceable collection abstract base class. More...
class	TSortedList
	A sorted doubly linked list. More...