<<Well, my first suggestion would be not to do a linear search for free
space. Keep all the free blocks in a balanced tree, sorted by size. You can
then quickly search for a block of the propper size.>>

Just as a note for Uli if you do this, you can just use a map with the block 
size as the key. Standard library maps are implemented as balanced trees 
everywhere I have cared to look.

Brian

Reply via email to