[Haskell-cafe] Faster set intersections?

[Brandon Allbery]

I suspect not. Maybe with fromAscList or fromDistinctAscList so it can know
the list won't pop a smaller (here, duplicate) value on it, if it's lazy
enough (I haven't checked). Lists don't record that they were generated
from enumerations.

On Sat, Dec 8, 2018 at 7:46 PM Jeffrey Brown <jeffbrown.the at gmail.com>
wrote:

> The following expressions both cause GHCI to hang:
>
> > S.intersection (S.fromList [1,2]) (S.fromList [1..])
> fromList ^CInterrupted.
> > S.intersection (S.fromList [1..]) (S.fromList [1,2])
> fromList ^CInterrupted.
> >
>
> Is there a smarter way to take the intersection of sets when at least one
> of them is small (but I don't know which one that is)?
>
> --
> Jeff Brown | Jeffrey Benjamin Brown
> Website <https://msu.edu/~brown202/>   |   Facebook
> <https://www.facebook.com/mejeff.younotjeff>   |   LinkedIn
> <https://www.linkedin.com/in/jeffreybenjaminbrown>(spammy, so I often
> miss messages here)   |   Github <https://github.com/jeffreybenjaminbrown>
>
> _______________________________________________
> Haskell-Cafe mailing list
> To (un)subscribe, modify options or view archives go to:
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
> Only members subscribed via the mailman list are allowed to post.



-- 
brandon s allbery kf8nh
allbery.b at gmail.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20181208/e429c7a6/attachment.html>