Re: OODL: Any array classes

[DeRobertis]

At 11:02 PM -0400 on 7/23/99, [EMAIL PROTECTED] wrote:
><<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.

No he can't. He's not doing an exact match for the size, but rather the
best-fitting block. I don't believe the STL will do that.

He will need, in all likelyhood, to write his on tree implementation.