----- Original Message ----- From: "Buzz Kettles" <[EMAIL PROTECTED]> > > > >A very large list will take up a lot of RAM. > > What do you mean by a 'very large list'? > # props/subprops?
Obviously it's relative. As my statement implies, the amount of memory used by a list is roughly proportional to the number of elements ;-) The point of interest to me is not whether a list will take up a "small" or a "big" amount of memory, or any other such ambiguous term, but *exactly* how much each element requires, what is the overhead per list, and how Director manages dynamic allocation of lists: particularly how much memory gets allocated to each list, whether it is used or not. Tab has begun to answer that, but from the sounds of it he's not too sure either. I'm wondering if this is properly documented anywhere at Macromedia? (well, it must be internally, but I mean that is publicly accessible) I'd also like to know more about how proplists are managed, particularly proplists that use strings as indices. - 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!]
