[Haskell-cafe] Re: computing lists of pairs

[Daniel Fischer]

Am Mittwoch 02 Dezember 2009 17:10:02 schrieb Christian Maeder:
> Thanks a lot, works as expected and is super short!

You're welcome.

However, according to a couple of tests, the "funkyName" version is somewhat faster and 
allocates less.
>
> Cheers Christian
>
> Daniel Fischer schrieb:
> > Or:
> >
> > fpairs p s l = sequence [[(a,b) | b <- filter (p a) l] | a <- s]