Well, what constitutes a "large amount of RAM"?
Each list entry is a combination of type and item, I believe each is a MoaLong, or a 32-bit (4 byte) DWORD long, so each list entry is 4 bytes. That's 64 bytes per entry. If it's a property list, then I guess you would double that to 128 bytes per entry (4 32-bit ints) to keep track of the data. That would be the overhead. Anything more would depend on what you stored in there. A property list of, say, 10,000 entries would take 10000 * 128, or just over 1 meg - not a huge amount of overhead on today's 64 to 128-meg machines. After that, factor in the data itself - pointers, strings, symbol values, whatever. - Tab At 07:41 PM 9/8/02, Robert Tweed wrote: >----- Original Message ----- >From: "Tab Julius" <[EMAIL PROTECTED]> > > > > Unless you have a huge amount of strings, it's hard to have a list take up > > a lot of ram. Typically a list might have a POINTER to an image, but not > > the image itself. > >A very large list will take up a lot of RAM. I'd also quite like to know how >many bytes each list entry requires, as well as any additional overhead per >list (and how unused space a list will also allocate for itself, and how >often). > >- 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!]
