[Haskell-cafe] Value-weak hash tables in Haskell ?

[Alessandro Vermeulen]

There is supposed to be some weak hash map implementation somewhere.

However, if you can't find it you can easily create it yourself. However, you will need to use the map in IO so I suggest that you use the hashtables[1] package in combination with the weak pointers mentioned by Erik.

- Alessandro

[1]: http://hackage.haskell.org/package/hashtables

On 10 aug. 2013, at 21:08, Erik Hesselink <hesselink at gmail.com> wrote:

> I'm not sure, but there are weak pointer [0], though I have never used them.
> 
> Erik
> 
> [0] http://www.haskell.org/ghc/docs/latest/html/libraries/base/System-Mem-Weak.html
> 
> On Sat, Aug 10, 2013 at 7:13 PM, Aleksey Uymanov <s9gf4ult at gmail.com> wrote:
>> Hello, haskellers.
>> 
>> Is there any package implementing magic hash tables weak in value? I
>> mean when the value is garbage collected, then this key+value
>> authomatically removes from the hash table.
>> 
>> --
>> Aleksey Uymanov <s9gf4ult at gmail.com>
>> 
>> _______________________________________________
>> Haskell-Cafe mailing list
>> Haskell-Cafe at haskell.org
>> http://www.haskell.org/mailman/listinfo/haskell-cafe
> 
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130810/1d80c21d/attachment.htm>