New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Partition TypedPipe in two according to a predicate #986

Closed

rubanm opened this issue Jul 31, 2014 · 1 comment

Contributor

rubanm commented Jul 31, 2014

Similar to scala collections.

def partition(p: T => Boolean): (TypedPipe[T], TypedPipe[T]) =
  (filter(p), filterNot(p))

I've run into this use-case a few of times. Seems handy to have. I can send a PR if this sounds sensible. Thanks.

Collaborator

johnynek commented Jul 31, 2014

Sure that would be a good PR, but the implementation should probably be:

val forked = fork
(forked.filter(p), forked.filterNot(p))

Also we should comment that sometimes groupBy is what you really want in these cases.

rubanm mentioned this issue

Typedpipe partition #987

Merged

rubanm closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment