Andres Kroonmaa wrote:
> I'm wondering how portable memalign() is?
Not very. It is not covered by "the Single Unix Specification Version
2".
But regarless, quite efficient searching can be implemented using trees
or hashes (trees is probably more suited as we do not know the amount or
distribution).
I would suggest using a tree with about 5 branches per internal node.
Or you could use garbage collection to hide the overhead from normal
operations. Simply put the free nodes in a bucket, and only look in
detail if you need to actually reclaim memory.
/ Henrik
Received on Thu Apr 12 2001 - 14:01:52 MDT
This archive was generated by hypermail pre-2.1.9 : Tue Dec 09 2003 - 16:13:45 MST