On Mon, 05 Dec 2011 23:07:09 +0200, dsimcha <dsim...@yahoo.com> wrote:
I understand the problem, but please elaborate on the proposed solution. You've basically got a bunch of pools, each of which represents a range of memory addresses, not a single address (so a basic hashtable is out). You need to know which range some pointer fits in. How would you beat binary search/O(log N) for this?
A tree, with a few bits of the address space per level. It becomes bound to the size of the address space, not the number of pools.
-- Best regards, Vladimir mailto:vladi...@thecybershadow.net
