[Haskell-cafe] Where is SNMap for stable names?
Alberto G. Corona
agocorona at gmail.com
Fri Sep 23 11:54:02 CEST 2011
How do you do that, since Stable Names have not an Ord instance?. Using the
Eq instance the lookup should be O(n).
The paper suggest that SNMap is a hash table, presumably with
This should work more or less . using Data.HashTable
table :: HashTable StableName Dynamic
table= new (==) hashStableName
2011/9/22 Edward Kmett <ekmett at gmail.com>
> I have a "stable-maps" package that provides lookup and inserting into a
> map via stable names.
> On Thu, Sep 22, 2011 at 5:47 AM, Sean Leather <leather at cs.uu.nl> wrote:
>> There is an abstract type called SNMap for stable names referred to in
>> . This has apparently disappeared from GHC a long time ago. Is it still
>> available somewhere, or is there a suitable replacement for it?
>>  "Stretching the storage manager: weak pointers and stable names in
>> Haskell" - http://research.microsoft.com/apps/pubs/default.aspx?id=67497
>> 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