[Caml-list] application scope for hashtable on weak pointers

[Caml-list] application scope for hashtable on weak pointers

[Philippe Strauss]

I'm puzzled by this superb sentence in the refman:

"A weak hash table is a hashed set of values.
Each value may magically disappear from the
set when it is not used by the rest of the program any more."

I have a use case for an hashtable of values who'll needs to get aged and removed after a while,
what can I reuse of the standard lib, under which conditions are the values collected by the GC ?

my use case would be to first age out when a threshold of number of bindings is reached, also, after some wall time, flush oldest entries (LRU). 


--
Philippe Strauss
http://www.strauss-acoustics.ch/

Re: [Caml-list] application scope for hashtable on weak pointers

[Daniel Bünzli]

Le samedi, 3 mars 2012 à 19:21, Philippe Strauss a écrit :

> I have a use case for an hashtable of values who'll needs to get aged and removed after a while,
That's not a good use case for weak hash tables. I explain why in this answer [1].  

Best,

Daniel

[1] http://stackoverflow.com/questions/4933729/how-are-weak-arrays-used/4935518#4935518

Re: [Caml-list] application scope for hashtable on weak pointers

[Tiphaine Turpin]

Le 03/03/2012 19:21, Philippe Strauss a écrit :
> I'm puzzled by this superb sentence in the refman:
>
> "A weak hash table is a hashed set of values.
> Each value may magically disappear from the
> set when it is not used by the rest of the program any more."
>
> I have a use case for an hashtable of values who'll needs to get aged and removed after a while,
> what can I reuse of the standard lib, under which conditions are the values collected by the GC ?
A value in a weak hash-table may be collected provided :
- it is not reachable (from the roots of the reachable heap, i.e., the
stack, C-registered pointers, etc.) except through paths having a
weak-pointer (which is the case for the weak hash-table)
- the triggering conditions for the GC are met.
A typical use-case is hash-consing (physical sharing of
structuraly-equal data, for memory-efficiency).

> my use case would be to first age out when a threshold of number of bindings is reached, also, after some wall time, flush oldest entries (LRU). 
Maybe you can have a "LRU-sorted" (normal) array of not-too-old data and
a weak array (or hash-table) of aged data that the GC may collect, if no
one else points to it, but which you can still use until the next collection

Tiphaine