Re: [gobo-eiffel-develop] HATs: Hashed Array Trees

[Eric B. <er...@go...>]

Eric Bezault wrote:
> 
> Berend de Boer wrote:
> >
> > The latest DDJ (#326) has a nice article about fast and small
> > resizable arrays. Something for Gobo?
> >
> > (or is it already there and I don't know it :-) )
> 
> No, it's not in Gobo yet. Do you know if this article
> is (or will be) on-line?

I just read the article and a similar mechanism, although
not as sophisticated (e.g. no power of two), is already
used in the class DS_MULTIARRAYED_HASH_TABLE. It is
implemented using arrays of arrays, arrays on the second
level  being created only when first accessed. I used
this class to hold over 17 million objects and it worked
quite well. As I said it's not as sophisticated as the
algorithm described in the article, but it was good enough
for my needs. I was also planning to implement a class
DS_MULTIARRAYED_STACK, but I didn't have time to implement
it in Gobo 2.0.

-- 
Eric Bezault
mailto:er...@go...
http://www.gobosoft.com