>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.
But this would leave you with the inability to look for a block that is 12k
or larger. You'd only be able to search for blocks that are exactly 12k if
I'm not mistaken. Or is there a call to look for a key or larger?
Cheers,
-- M. Uli Kusterer
------------------------------------------------------------
http://www.weblayout.com/witness
'The Witnesses of TeachText are everywhere...'
--- HELP SAVE HYPERCARD: ---
Details at: http://www.hyperactivesw.com/SaveHC.html
Sign: http://www.giguere.uqam.ca/petition/hcpetition.html
- 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 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: Any array classes 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
