[Haskell-cafe] Types and hashes of hashes, trouble for a Java-programmer...

[John Van Enk]

> But it would be like cheating :-)

In this case, the IO method *is* cheating.

/jve
On Mon, Apr 13, 2009 at 12:27 PM, John Smith <smithsnorth at gmail.com> wrote:

> If you mean using a non-destructive map where the IO-problem is
> absent, that is a doable thing. But it would be like cheating :-)
>
> What I try do do is something like:
>
> test = do
>   h <- HashTable.new (==) (\key -> key)
>   h1 <- HashTable.new (==) (\key -> key)
>   HashTable.insert h 3 h1
>   HashTable.insert h1 1 1000
>   res <- case HashTable.lookup h 3 of
>       Nothing -> Nothing
>       Just outer -> HashTable.lookup outer 1000
>   return res
>  _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>



-- 
/jve
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090413/c659a270/attachment.htm