On Sun, Jun 13, 2010 at 01:09:24PM +0100, Andrew Coppin wrote:
Does anybody have a less-insane way of doing this?
Did you take a look at happstack-ixset[1]?
[1] http://hackage.haskell.org/package/happstack-ixset
--
Felipe.
___
Haskell-Cafe mailing
What I ended up writing is this:
http://www.hpaste.org/fastcgi/hpaste.fcgi/view?id=25782
lookup :: KeyID - Key - Container - Maybe Value
Does anybody have a less-insane way of doing this?
Sure:
type MyMap = Map (KeyID, Key) Value
Don't use multiple keys. Put the keys into a tuple and
Felipe Lessa wrote:
On Sun, Jun 13, 2010 at 01:09:24PM +0100, Andrew Coppin wrote:
Does anybody have a less-insane way of doing this?
Did you take a look at happstack-ixset[1]?
No. I'll take a look at it.
(From the looks of it, it seems to be using TH and/or run-time checks to
On 13 June 2010 15:23, Andrew Coppin andrewcop...@btinternet.com wrote:
Felipe Lessa wrote:
On Sun, Jun 13, 2010 at 01:09:24PM +0100, Andrew Coppin wrote:
Does anybody have a less-insane way of doing this?
Did you take a look at happstack-ixset[1]?
No. I'll take a look at it.
(From
Marc Weber wrote:
Does anybody have a less-insane way of doing this?
Sure:
type MyMap = Map (KeyID, Key) Value
Don't use multiple keys. Put the keys into a tuple and use that as key.
Let me know whether this is what you were looking for.
Trouble is, this requires you to have
Philippa Cowderoy wrote:
On 13/06/2010 14:52, Andrew Coppin wrote:
Marc Weber wrote:
Does anybody have a less-insane way of doing this?
Sure:
type MyMap = Map (KeyID, Key) Value
Don't use multiple keys. Put the keys into a tuple and use that as key.
Let me know whether this is what you
Hello,
My idea for solving this problem was to try to use something similar
to a kd-tree. I have a proof of concept for 2 keys here:
http://src.seereason.com/haskell-kdmap/
But, to extend it to an arbitrary number of keys may need template
haskell.
The basic concept is to build a
Excerpts from Jeremy Shaw's message of Sun Jun 13 19:16:02 +0200 2010:
Hello,
My idea for solving this problem was to try to use something similar
to a kd-tree. I have a proof of concept for 2 keys here:
http://src.seereason.com/haskell-kdmap/
But, to extend it to an arbitrary number