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.
- Re: OODL: Any array classes M. Uli Kusterer
- Re: OODL: Any array classes DeRobertis
- Re: OODL: Any array classes M. Uli Kusterer
- Re: OODL: Any array classes DeRobertis
- Re: OODL: Any array classes M. Uli Kusterer
- Re: OODL: Any array classes DeRobertis
- Re: OODL: Any array classes Yennie
- Re: OODL: Any array classes DeRobertis
- Re: OODL: Any array classes M. Uli Kusterer
- Re: OODL: Any array classes Yennie
- Re: OODL: bison DeRobertis
- Re: OODL: bison DeRobertis
- Re: OODL: bison spierings
- Re: OODL: bison DeRobertis
- Re: OODL: bison DeRobertis
- Re: OODL: bison M. Uli Kusterer
- Re: OODL: bison spierings
- Re: OODL: bison DeRobertis
- Re: OODL: Requests for OTVar DeRobertis
- Re: Re: OODL: Any array classes MP0werd
- Re: Re: OODL: Any array classes DeRobertis
