Re: weak key hash versus display

2003-01-31 Thread Kevin Ryde
Mikael Djurfeldt [EMAIL PROTECTED] writes: We should probably replace this vector with a weak vector, or (perhaps more efficient) clear the references from the vector. Sounds wise, to avoid any chance of a program being badly bloated by big structure kept around just because it was printed.

Re: weak key hash versus display

2003-01-30 Thread Mikael Djurfeldt
Kevin Ryde [EMAIL PROTECTED] writes: In guile 1.6.1 or the cvs on a recent i386 debian, I noticed that doing a display of a weak key hash table can seemingly prevent a key from being garbage collected. For instance (define h (make-weak-key-hash-table 7)) (define k mykey)

weak key hash versus display

2003-01-29 Thread Kevin Ryde
In guile 1.6.1 or the cvs on a recent i386 debian, I noticed that doing a display of a weak key hash table can seemingly prevent a key from being garbage collected. For instance (define h (make-weak-key-hash-table 7)) (define k mykey) (hash-set! h (string-copy k) 12345)