| simplistic Object array that differentiates from ArrayList by
using chunks instead of exponential growth, thus efficiently dealing
with huge, potentially sparse arrays
the motivation for this class is memory optimization, i.e. space efficient
storage of potentially huge arrays without good a-priori size guesses
this class is awefully lifted from DynamicIntArray (same motivation, but
primitive types - not much factorizable functionality w/o excessive
casting/boxing)
the API of this class is between a primitive array and a AbstractList. Since
it handles Objects, we could turn this into a Collection (and probably should)
NOTE: like standard Collection implementations/arrays, this class is not
synchronized
|
