[Haskell-cafe] [Haskell] ANNOUNCE: polymap

Carlo Nucera meditans at gmail.com
Wed Nov 4 17:53:59 UTC 2015

I had the time to take another glance at this library: the behavior I
was referring to is caused by functions like `findIndex` which have
return type `Maybe Int`. So basically it seems that partially
overlappable edges are not possible in this version.

If you want partially overlappable edges, you may turn the `findIndex`
functions in `findIndexes` functions, which
 return `[Int]`, as I did in this fork: https://github.com/meditans/hs-polymap

Now, I'll go ahead and add a `Data.IntMap` instance for `Storage`, to
better the asymptotics of the search.

2015-11-04 15:59 GMT+01:00 Carlo Nucera <meditans at gmail.com>:
> From reading the code, it depends on what structures are used for
> `Storage`. For example, using `[ ]`, in the moral equivalent of the
> map [("foo",1), ("bar",1)], you cannot get "bar" when querying for 1.
> In fact, I think the most important information to add are examples on
> how to obtain different behaviors with different `Storage` types.
> 2015-11-03 17:19 GMT+01:00 Chaddaï Fouché <chaddai.fouche at gmail.com>:
>> My question would be : what happen if I try to insert a Relation that shares
>> a side with a Relation already in the Polymap ? That seems a vital
>> information.
>> _______________________________________________
>> Haskell-Cafe mailing list
>> Haskell-Cafe at haskell.org
>> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe

More information about the Haskell-Cafe mailing list