Hello John, Thanks. I might look into that. The memory manager I use is a block allocator with sub-allocator and coalesces free'd memory as it's returned to the allocator. I don't actually ever "malloc" or "free". I let STL handle all the memory management so, I don't really have to worry about memory leaks.
C Tuesday, January 2, 2007, 8:34:45 AM, you wrote: JS> A very simple and efficient method of holding temporary results is to JS> just read it into a temporary file which is memory mapped. The VM JS> manager takes care of the memory buffering so you do not have to be JS> concerned about upper size limits being constrained by memory resources. JS> The file can be anonymous to make the process tidier (subject to a few JS> limitations). JS> Traversing the list is just a matter of reading forwards and back either JS> by using a file handles and the read API or by using a pointer. It have JS> not tried using a pointer to such a structure in a list control, but it JS> may be possible. JS> Avoiding using mallocs for dynamic memory allocation makes for less JS> possibility of checkerboarding in long running processes. JS> Teg wrote: >> Hello Roger, >> -- Best regards, Teg mailto:[EMAIL PROTECTED] ----------------------------------------------------------------------------- To unsubscribe, send email to [EMAIL PROTECTED] -----------------------------------------------------------------------------
