Hi all, I've tried my hand at writing a `sequence` function for pipes, i.e. sequencePipes [p1,p2] would be equivalent to:
for p1 $ \x1 -> for p2 $ \x2 -> yield [x1,x2] You can see my code and attempts to benchmark it at https://gist.github.com/erantapaa/26f437d6e9ab76464d85 My questions are: 1. Any comments on my definition of sequencePipes? If there a similar function already available in one of the pipes libraries? 2. Unfortunately it seems that my implementation runs significantly slower than a hand-generated loop. For instance, compare the timings of test3a vs. test3b. Any comments on this? Thanks, Erik -- You received this message because you are subscribed to the Google Groups "Haskell Pipes" group. To unsubscribe from this group and stop receiving emails from it, send an email to haskell-pipes+unsubscr...@googlegroups.com. To post to this group, send email to haskell-pipes@googlegroups.com.
