an executive summary ;-) of:
Hehe, OK :)
> - how good ol’ weak hash tables related to the new weak sets and weak
> tables?
All of the uses of weak hash tables in Guile were in a multithreaded
context. Weak sets and weak tables now include locking, so that user
code doesn't have to lock.
API unchanged.
> To do that I had to reimplement the weak hash tables, to make them not
> use them. I did that, reimplementing them as open-addressed hash
> tables, with robin hood linear probing on collision. It seems to work
> well. Besides the performance improvement you get wit
Hi,
A follow-up to the weak table work.
On Mon 24 Oct 2011 19:19, Andy Wingo writes:
> I [reimplemented weak hash tables] as open-addressed hash tables, with
> robin hood linear probing on collision
The tables work well. There are a couple of drawbacks currently:
(1) Movin
Hi,
While doing the recent retagging work I realized that I really wanted to
kill weak pairs. They look like pairs but you can't actually access
their fields using car and cdr -- terrible things. To do that I had to
reimplement the weak hash tables, to make them not use them. I did
