Re: Hashtables in guile.

[mike@olan.com (Michael N. Livshin)]

Jim Blandy <jimb@red-bean.com> writes:

[ snip ]

> Volunteers are welcome.  Go dust off that copy of Knuth and post your
> best hash table implementation!

Not entirely on the subject, but still:

I did an STL (C++'s standard container/iterator/algorithm lib)
knockoff of sorts some time ago.  I even intended to release it
but just never got around to documenting it properly.  I don't
know if I'm able to document it any time soon, so maybe I should
just release the thing to contrib?

Pros include: completely wrapped and auto-growing hash containers,
completely uniform iterator interfaces, lots of algorithms
(I just translated <algo.h>, and tried to make the result readable),
etc.

Trouble is, I'm afraid it's only understandable to folks that
were exposed to STL.  And it's quite efficient, but only in
terms of time-complexity :).  'Cause it dispatches every call.
And it depends on a non-standard (heh) "object system" (PINT).
And it's a *dog* to load, though unexec helps.

Anyone interested?

peace,
mike.