[m-dev.] For review: hash table implementation

[Thomas Conway]

On Fri, Feb 02, 2001 at 09:07:30PM EST, Ralph Becket wrote:
> I agree that tries are better for large structures; if I need them
> I'll take a look at the runtime implementation and see how it might
> be teased out into user space.

I you have lazy lists, a good strategy would be for a "key-sequence"
getting function to return a lazy list of key-pieces. An adaption
of this to Mercury might be possible, but efficiency is probably
the key concern here.

-- 
  Thomas Conway )O+
 <conway at cs.mu.oz.au>       499 User error! Replace user, and press any key.
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------