+1 to just generalizing filterM in Data.Sequence

On Sun, Dec 28, 2014 at 12:22 AM, David Feuer <david.feuer@gmail.com> wrote:

This can be given exactly the same implementation as the one for lists:

filterM :: (Applicative f) => (a -> f Bool) -> Seq a -> f (Seq a)
filterM p = foldr go (pure empty)
  where
    go x r = f <$> p x <*> r
      where
        f flg ys = if flg then x <| ys else ys


Bikeshed all you like over the name.
_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://www.haskell.org/mailman/listinfo/libraries

_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://www.haskell.org/mailman/listinfo/libraries