Skip to content

Fix implied double count of partitioned collections #524

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

Merged
merged 1 commit into from
May 3, 2016
Merged

Fix implied double count of partitioned collections #524

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion overviews/collections/trait-traversable.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -82,7 +82,7 @@ The `foreach` method is meant to traverse all elements of the collection, and ap
| **Subdivisions:** | |
| `xs splitAt n` |Split `xs` at a position, giving the pair of collections `(xs take n, xs drop n)`.|
| `xs span p` |Split `xs` according to a predicate, giving the pair of collections `(xs takeWhile p, xs.dropWhile p)`.|
| `xs partition p` |Split `xs` into a pair of two collections; one with elements that satisfy the predicate `p`, the other with elements that do not, giving the pair of collections `(xs filter p, xs.filterNot p)`|
| `xs partition p` |Split `xs` into a pair of collections; one with elements that satisfy the predicate `p`, the other with elements that do not, giving the pair of collections `(xs filter p, xs.filterNot p)`|
| `xs groupBy f` |Partition `xs` into a map of collections according to a discriminator function `f`.|
| **Element Conditions:** | |
| `xs forall p` |A boolean indicating whether the predicate `p` holds for all elements of `xs`.|
Expand Down