Skip to content

Commit

Permalink
Fix compilation, docs and tests
Browse files Browse the repository at this point in the history
  • Loading branch information
joroKr21 committed Aug 12, 2022
1 parent 9f06f53 commit 43a2226
Show file tree
Hide file tree
Showing 4 changed files with 4 additions and 5 deletions.
2 changes: 1 addition & 1 deletion core/src/main/scala/cats/instances/seq.scala
Original file line number Diff line number Diff line change
Expand Up @@ -207,7 +207,7 @@ trait SeqInstances extends cats.kernel.instances.SeqInstances {
}

implicit def catsStdShowForSeq[A: Show]: Show[Seq[A]] =
Show.show(_.iterator.map(Show[A].show).mkString("Seq(", ", ", ")"))
Show.show(_.map(Show[A].show).toString)

implicit def catsStdNonEmptyParallelForSeqZipSeq: NonEmptyParallel.Aux[Seq, ZipSeq] =
new NonEmptyParallel[Seq] {
Expand Down
2 changes: 1 addition & 1 deletion docs/typeclasses/invariantmonoidal.md
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ def unit: Semigroup[Unit] =
Semigroup.instance((_, _) => ())

def product[A, B](fa: Semigroup[A], fb: Semigroup[B]): Semigroup[(A, B)] =
Semigroup.instances { case ((xa, xb), (ya, yb)) =>
Semigroup.instance { case ((xa, xb), (ya, yb)) =>
fa.combine(xa, ya) -> fb.combine(xb, yb)
}
```
Expand Down
1 change: 0 additions & 1 deletion docs/typeclasses/monoid.md
Original file line number Diff line number Diff line change
Expand Up @@ -103,7 +103,6 @@ implicit def optionMonoid[A: Semigroup]: Monoid[Option[A]] =
}
}
)
}
```

This is the `Monoid` for `Option`: for any `Semigroup[A]`, there is a `Monoid[Option[A]]`.
Expand Down
4 changes: 2 additions & 2 deletions free/src/test/scala/cats/free/FreeTSuite.scala
Original file line number Diff line number Diff line change
Expand Up @@ -302,9 +302,9 @@ trait FreeTSuiteInstances {
override def map[A, B](fa: JustFunctor[A])(f: A => B): JustFunctor[B] = JustFunctor(f(fa.a))
}

implicit def freeTOptionEq[A](implicit A: Eq[A], OM: Monad[Option]): Eq[FreeTOption[A]] =
implicit def freeTOptionEq[A](implicit A: Eq[A]): Eq[FreeTOption[A]] =
Eq.by(_.runM(identity))

implicit def freeTStateEq[A](implicit A: Eq[A], SM: Monad[IntState]): Eq[FreeTState[A]] =
implicit def freeTStateEq[A](implicit A: Eq[A]): Eq[FreeTState[A]] =
Eq.by(_.runM(identity))
}

0 comments on commit 43a2226

Please sign in to comment.