class TGenCollectionProxy: public TVirtualCollectionProxy

 Delete individual item from STL container

 Late initialization of collection proxy

 Some hack to avoid const-ness.

 Allow to check function pointers.

 Set pointer to the TClass representing the content.

 Virtual copy constructor.

 Copy constructor.

 Initializing constructor

 Standard destructor.

 Return a pointer to the TClass representing the container.

 Return the type of collection see TClassEdit::ESTLType

 Return the offset between two consecutive value_types (memory layout).

 Return the sizeof the collection object.

 Push new proxy environment.

 Pop old proxy environment.

 Return true if the content is of type 'pointer to'.

 Return a pointer to the TClass representing the content.

 If the content is a simple numerical value, return its type (see TDataType).

 Return the address of the value at index 'idx'.

 Return the current size of the container.

 Block allocation of containees.

 Insert data into the container where data is a C-style array of the actual type contained in the collection
 of the given size.   For associative container (map, etc.), the data type is the pair<key,value>.

 Block commit of containees.

 TClassStreamer I/O overload.

 Routine to read the content of the buffer into 'obj'.

 MemberWise actions

 Set of functions to iterate easily throught the collection

 typedef void (*CreateIterators_t)(void *collection, void **begin_arena, void **end_arena);
 begin_arena and end_arena should contain the location of a memory arena of size fgIteratorSize.
 If the collection iterator are of that size or less, the iterators will be constructed in place in those location (new with placement)
 Otherwise the iterators will be allocated via a regular new and their address returned by modifying the value of begin_arena and end_arena.

 typedef void* (*CopyIterator_t)(void **dest, const void *source);
 Copy the iterator source, into dest.   dest should contain the location of a memory arena of size fgIteratorSize.
 If the collection iterator is of that size or less, the iterator will be constructed in place in this location (new with placement)
 Otherwise the iterator will be allocated via a regular new.
 The actual address of the iterator is returned in both case.

 typedef void* (*Next_t)(void *iter, const void *end);
 iter and end should be pointers to respectively an iterator to be incremented and the result of collection.end()
 If the iterator has not reached the end of the collection, 'Next' increment the iterator 'iter' and return 0 if
 the iterator reached the end.
 If the end was not reached, 'Next' returns the address of the content pointed to by the iterator before the
 incrementation ; if the collection contains pointers, 'Next' will return the value of the pointer.

 typedef void (*DeleteIterator_t)(void *iter);
 typedef void (*DeleteTwoIterators_t)(void *begin, void *end);
 If the size of the iterator is greater than fgIteratorArenaSize, call delete on the addresses,
 Otherwise just call the iterator's destructor.