----- Original Message ----- From: "Penworks Corporation" <[EMAIL PROTECTED]> > > Actually I would amend that even more - I forgot about the list > architecture itself. I don't know offhand how it's done, but if you want > to say that it's a doubly-linked list, then you have to add in a few more > longs for pointers foward and back - probably at least another 64 bits, so > assume 192 bits minimum per entry.
I doubt very much that it's a linked list, that would be horribly slow. It's probably a hash table or something similar. I'm not too up on exactly how they work, except the very basic theory, which is to dynamically resize an array in chunks, and maintain a list of indexes somewhere. They have the side-effect of wasting a certain amount of memory, although in the grand scheme of things it's probably not a lot, all this can start to add up if you are using deeply nested lists. - Robert [To remove yourself from this list, or to change to digest mode, go to http://www.penworks.com/lingo-l.cgi To post messages to the list, email [EMAIL PROTECTED] (Problems, email [EMAIL PROTECTED]). Lingo-L is for learning and helping with programming Lingo. Thanks!]
