At 4:00 AM -0400 on 7/24/99, [EMAIL PROTECTED] wrote:
><<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.>>
>
>Ah, I see that now. I can supply some source. I'll cook something up tomorrow
>which finds the "closest" match in a red/black tree.

Remember it's got to be closest, erroring upward -- that is, it's always
got to be bigger (or equal) than the request.

Reply via email to