[Haskell-cafe] Value-weak hash tables in Haskell ?
Trevor L. McDonell
tmcdonell at cse.unsw.edu.au
Sun Aug 11 07:14:41 CEST 2013
This paper explains how to implement them and gives example code:
I'm not aware of a package that does it for you, but I implemented one as part of my own work so that may be able to provide another example.
On 11/08/2013, at 6:03 AM, Alessandro Vermeulen <a.vermeulen at students.uu.nl> wrote:
> 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 package in combination with the weak pointers mentioned by Erik.
> - Alessandro
> : 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 , though I have never used them.
>>  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
>> Haskell-Cafe mailing list
>> Haskell-Cafe at haskell.org
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe