1. You can put hashtables into hastables (to any depth you want) to get
multi-dimensional-hashtables.
2. The same, of course, applies to ArrayLists.
3. ArrayList's don't really "grow": If you break the size limits of an
ArrayList, it will allocate a bigger block of memory, copy all the data, and
free the old block, this is merely hidden away inside the class - you can of
course do the same in your code.
4. If you really need a the data structure that can increase its size
without reallocation, you'll have to use a linked list, but that will
probably not give you any performance benefit unless you frequently
insert/remove items in the beginning/middle of your list. (AFAIK garbage
collectors don't like linked lists)
Hope this helps
Niki
"Naomi" <no*******@goaway.xyz> wrote in news:c8**********@lust.ihug.co.nz...
Hi there,
Just wondering, if there is any way to have a dynamic / unspecified size
of an array? It obviously needs to be updated, deleted etc. The only way I
thought is by making the array massive at the start? Any other ideas?
Apparently Hashtable, ArrayList etc are useless as they all take one
dimension. :( Please help me!
Thanks,
Naomi