General purpose resizable FAST_ARRAYs. The only difference with ARRAY is the fact that the lower bound
is actually frozen to 0. The item access is likely to be more efficient as well as loop going from
upper to lower just because lower is 0. Keep in mind that even if the lower is frozen to 0
it is really better to use the lower attribute, and not 0 directly, just because you may decide in the
future to use another COLLECTION implementation.
Like ARRAY, the FAST_ARRAY implementation uses only one chunk of memory, the storage area which is a
NATIVE_ARRAY. One must keep in mind that this internal storage area is always kept left align. Thus,
you can expect good performances while using a FAST_ARRAY to modelize a stack behavior with add_last /
last / remove_last. Conversely add_first and remove_first are likely to slow down your program if
they are too often used. If the fact that lower is stuck to 0 do matter, also consider ARRAY.