> If you have a list of chunks, you could do a linear search by checking the
address and the size of each one. If (chunk addr <= ptr) and (chunk addr +
chunk size >= ptr) then the pointer is in that chunk.
Right .. but I don't HAVE the list of chunks. I had no reason to save that
list in the original implementation. So now, I've got a problem that I
don't really want to deal with, which is that I have to go back and modify
all the code that relied on the basic assumption that I could easily obtain
the chunk ptr. I'd have to put in my own dynamic tracking routines, which
tears up a nicely architected set of dynamic table-driven functions.
Aaaaarrrggghhhh.
> Invent your own resource format. It's easy. :-)
Right again. But, then I have to also provide all the supporting
functionality to create and edit the lists that comes free with Constructor.
I suppose I could use Constructor to create/edit the lists in tAIS format,
then copy them to my own tAIS-like resource format. But, what a pain in the
butt, for such a simple need.
--
For information on using the Palm Developer Forums, or to unsubscribe, please see
http://www.palmos.com/dev/tech/support/forums/
