Re: [Caml-list] RE: understanding weak

2008-11-01 Thread kirillkh
On Sat, Nov 1, 2008 at 12:37 PM, Stefano Zacchiroli <[EMAIL PROTECTED]> wrote: > On Sat, Nov 01, 2008 at 01:08:17AM +, Jon Harrop wrote: > > > You will be interested in the following important article: > > > http://portal.acm.org/citation.cfm?id=1411308 > > Is this freely available anywhere? >

Re: [Caml-list] RE: understanding weak

2008-11-01 Thread Stefano Zacchiroli
On Sat, Nov 01, 2008 at 01:08:17AM +, Jon Harrop wrote: > > You will be interested in the following important article: > > http://portal.acm.org/citation.cfm?id=1411308 > Is this freely available anywhere? Seriously, you SPAM everybody here with periodical announces of non-free issues of the

Re: [Caml-list] RE: understanding weak

2008-10-31 Thread Jon Harrop
On Thursday 30 October 2008 18:48:26 CUOQ Pascal wrote: > Warren Harris <[EMAIL PROTECTED]> wrote: > > I'd like to understand better how ocaml's weak pointers operate. > > You will be interested in the following important article: > http://portal.acm.org/citation.cfm?id=1411308 Is this freely avai

[Caml-list] Re: understanding weak

2008-10-31 Thread Rémi Vanicat
Alain Frisch <[EMAIL PROTECTED]> writes: > Warren Harris wrote: >> On Oct 30, 2008, at 11:48 AM, CUOQ Pascal - [EMAIL PROTECTED] wrote: >>> In short: don't use weak pointers to make caches. >> >> Thanks for the advice -- but I thought this was exactly what weak >> hash tables were intended for. >

Re: [Caml-list] RE: understanding weak

2008-10-30 Thread Alain Frisch
Warren Harris wrote: On Oct 30, 2008, at 11:48 AM, CUOQ Pascal - [EMAIL PROTECTED] wrote: In short: don't use weak pointers to make caches. Thanks for the advice -- but I thought this was exactly what weak hash tables were intended for. Although there is some similarity between a weak table

Re: [Caml-list] RE: understanding weak

2008-10-30 Thread Warren Harris
On Oct 30, 2008, at 11:48 AM, CUOQ Pascal - [EMAIL PROTECTED] wrote: Warren Harris <[EMAIL PROTECTED]> wrote: I'd like to understand better how ocaml's weak pointers operate. You will be interested in the following important article: http://portal.acm.org/citation.cfm?id=1411308 :) Thank

Re: [Caml-list] RE: understanding weak

2008-10-30 Thread Daniel Bünzli
Le 30 oct. 08 à 19:48, CUOQ Pascal a écrit : First, although it doesn't seem to be specified in the documentation, I assume that weak pointers will *not* be reclaimed (e.g. from a weak hash table) if the program retains some other reference to the object. Exactly. The documentation should

[Caml-list] RE: understanding weak

2008-10-30 Thread CUOQ Pascal
Warren Harris <[EMAIL PROTECTED]> wrote: > I'd like to understand better how ocaml's weak pointers operate. You will be interested in the following important article: http://portal.acm.org/citation.cfm?id=1411308 :) >First, although it doesn't seem to be specified in the documentation, >I as