Christian Maeder wrote:
Set.intersection is neither left- nor right-biased but biased towards
the smaller set. I think that needs to be changed (and that may require
a function splitLookup).
Below is my code proposal. I'm not sure if splitLookup should be
exported. And I'm not sure if splitMe
Christian Maeder wrote:
When trying to use 'Set.intersection s $ singleton e' I just noticed
that intersection is not left-biased (see below)!
Set.intersection is neither left- nor right-biased but biased towards
the smaller set. I think that needs to be changed (and that may require
a functi
Serge D. Mechveliani wrote:
How do you think, maybe, Data.Set also needs to provide
`lookup' ?
Admittingly, using 'Set.filter (==e) s' to find the matching element may
be a bit slower.
When trying to use 'Set.intersection s $ singleton e' I just noticed
that intersection is not left-biase
Dear GHC developers,
How do you think, maybe, Data.Set also needs to provide
`lookup' ?
For example, I have data D = D Int String,
with the instances Eq and Ord defined by the first coordinate.
I do use Map Int String, and for a certain reason, also use
Set D.
Then, for example, the fu
