1 \defgroup Containers Containers
3 \brief The containers and generators the ROOT framework offers.
5 Collections are
a key feature of the ROOT system. Many,
if not most, of
6 the applications you
write will use collections. If you have used
7 polymorphic
C++ collections before, some of
this material will be review.
8 However, much of
this tutorial covers aspects of collections specific to
9 the ROOT system. In
this tutorial the following features will be demonstrated:
11 - [Chapter about Collections in the Users Guide](https:
12 - [Using collections](https:
13 - How to create instances of collections
14 - The difference between lists, ordered collections, hash-tables, maps, etc.
15 - How to add and
remove elements of
a collection
16 - How to search
a collection
for a specific element
17 - How to access and modify collection elements
19 - How to manage memory
for collections and collection elements
20 - How collection elements are tested
for equality (`
IsEqual()`)
21 - How collection elements are compared (`
Compare()`) in case of sorted collections
22 - How collection elements are hashed (`
Hash()`) in hash tables
int iterate(rng_state_t *X)
UInt_t Hash(const TString &s)
double write(int n, const std::string &file_name, const std::string &vector_type, int compress=0)
writing
bool IsEqual(const Transform &t1, const Transform &t2, unsigned int size)
Int_t Compare(const void *item1, const void *item2)