Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
RE: understanding weak
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2008-10-30 (19:14)
From: Daniel_Bünzli <daniel.buenzli@e...>
Subject: Re: [Caml-list] RE: understanding weak

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 be fixed, as it really doesn't make that  
point clear. It says "A weak pointer is a value that the garbage  
collector may erase at any time" and this isn't what you want if you  
are looking for weak references.