Skip to content
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

Fix typo in SemigroupK scaladoc #1875

Merged
merged 2 commits into from
Sep 1, 2017
Merged

Fix typo in SemigroupK scaladoc #1875

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
5274ab3
Fix typo in SemigroupK scaladoc
Aug 29, 2017
714d5aa
Change spelling in other files as well
Aug 30, 2017
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 core/src/main/scala/cats/MonoidK.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ import simulacrum.typeclass
* This type class is useful when its type parameter F[_] has a
* structure that can be combined for any particular type, and which
* also has an "empty" representation. Thus, MonoidK is like a Monoid
* for kinds (i.e. parameterized types).
* for kinds (i.e. parametrized types).
*
* A MonoidK[F] can produce a Monoid[F[A]] for any type A.
*
Expand Down
2 changes: 1 addition & 1 deletion core/src/main/scala/cats/SemigroupK.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ import simulacrum.typeclass
*
* This type class is useful when its type parameter F[_] has a
* structure that can be combined for any particular type. Thus,
* SemigroupK is like a Semigroup for kinds (i.e. parameterized
* SemigroupK is like a Semigroup for kinds (i.e. parametrized
* types).
*
* A SemigroupK[F] can produce a Semigroup[F[A]] for any type A.
Expand Down
4 changes: 2 additions & 2 deletions docs/src/main/tut/typeclasses/monoidk.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@ scaladoc: "#cats.MonoidK"
This type class is useful when its type parameter `F[_]` has a
structure that can be combined for any particular type, and which
also has an "empty" representation. Thus, `MonoidK` is like a `Monoid`
for kinds (i.e. parameterized types).
for kinds (i.e. parametrized types).

A `MonoidK[F]` can produce a `Monoid[F[A]]` for any type `A`.

Expand All @@ -35,7 +35,7 @@ import cats.{Monoid, MonoidK}
import cats.implicits._
```

Just like `Monoid[A]`, `MonoidK[F]` has an `empty` method, but it is parameterized on the type of the element contained in `F`:
Just like `Monoid[A]`, `MonoidK[F]` has an `empty` method, but it is parametrized on the type of the element contained in `F`:

```tut:book
Monoid[List[String]].empty
Expand Down
2 changes: 1 addition & 1 deletion docs/src/main/tut/typeclasses/typeclasses.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -199,7 +199,7 @@ combine(x, combine(y, z)) = combine(combine(x, y), z)
combine(x, id) = combine(id, x) = x
```

With these laws in place, functions parameterized over a `Monoid` can leverage them for say, performance
With these laws in place, functions parametrized over a `Monoid` can leverage them for say, performance
reasons. A function that collapses a `List[A]` into a single `A` can do so with `foldLeft` or
`foldRight` since `combine` is assumed to be associative, or it can break apart the list into smaller
lists and collapse in parallel, such as
Expand Down