May be we could keep the old implementation as CTGrowableStack

[Ducasse]

Since the new implementation only works if we specify upfront the maximum size of the stack,
we could keep the old implementation based on OrderedCollection and rename it CTGrowableStack.

BTW as a general point it would be nice to have a subclass of the main class that we can introspect
for example to be able to get the max stack depth for the CTGrowableStack.

A similar concept is interesting with Dictioary.
Sometimes during algorithms we need to know how many times the dictionary was hit, what was the most
accessed keys....