in reply to Efficient random hash stuff

You should check out Dan Schmidt's article Building a Better Hash. He is trying to solve exactly the same problem. He comes up with a Perl module that implements a data structure with fast indexed access for search, insert, and delete (like a hash) but also fast random key selection.

Replies are listed 'Best First'.
Re: Re: Efficient random hash stuff
by japhy (Canon) on Nov 17, 2000 at 01:30 UTC
    I've seen his article in TPJ -- I don't have it on me, and I'm looking for a random-access-only data structure. tye helped come up with it. It's swimmingly cool.

    $monks{japhy}++ while $posting;