class TGenCollectionProxy: public TVirtualCollectionProxy

 Build a proxy for an emulated container.

 Build a proxy for a collection whose type is described by 'collectionClass'.

 Build a proxy for a collection whose type is described by 'collectionClass'.

 Standard destructor

 Virtual copy constructor

 Proxy initializer

 Check existence of function pointers

 Proxy initializer

 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.

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

 Return a pointer to the TClass representing the content.

 Update the internal ValueClass when a TClass constructor need to
 replace an emulated TClass by the real TClass.

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

 Return the address of the value at index 'idx'

 Clear the emulated collection.

 Return the current size of the container

 Resize the container

 Allocate the needed space.
 For associative collection, this returns a TStaging object that
 need to be deleted manually __or__ returned by calling Commit(TStaging*)

 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>.

 Commit the change.

 Add an object.

 Remove the last object.

 Call to delete/destruct individual item.

 Streamer Function.

 Streamer I/O overload

 TClassStreamer IO overload

 See typedef void (*CreateIterators_t)(void *collection, void *&begin_arena, void *&end_arena);
 begin_arena and end_arena should contain the location of 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.

 See typedef void (*CopyIterator_t)(void *&dest, const void *source);
 Copy the iterator source, into dest.   dest should contain should contain the location of memory arena  of size fgIteratorSize.
 If the collection iterator are 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 and its address returned by modifying the value of dest.

 See typedef void* (*Next_t)(void *iter, void *end);
 iter and end should be pointer to respectively an iterator to be incremented and the result of colleciton.end()
 'Next' will increment the iterator 'iter' and return 0 if the iterator reached the end.
 If the end is not reached, 'Next' will return the address of the content unless the collection contains pointers in
 which case 'Next' will return the value of the pointer.

 See typedef void (*DeleteIterator_t)(void *iter);
 If the sizeof iterator is greater than fgIteratorArenaSize, call delete on the addresses,
 Otherwise just call the iterator's destructor.

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

 Return the set of action necessary to stream in this collection member-wise coming from
 the old value class layout refered to by 'version'.

 Return the set of action necessary to stream in this collection member-wise coming from
 the old value class layout refered to by 'version'.

 Return the set of action necessary to stream out this collection member-wise.