remove unnecessary-semicolons (#2451)

typelevel · Sep 1, 2018 · 6ac776c · 6ac776c
1 parent 380f721
commit 6ac776c
Show file tree

Hide file tree

Showing 3 changed files with 3 additions and 3 deletions.
diff --git a/core/src/main/scala/cats/data/Chain.scala b/core/src/main/scala/cats/data/Chain.scala
@@ -276,7 +276,7 @@ sealed abstract class Chain[+A] {
       c match {
         case Singleton(a) =>
           val b = f(a)
-          if (b) return ();
+          if (b) return ()
           c =
             if (rights.isEmpty) Empty
             else rights.reduceLeft((x, y) => Append(y, x))

diff --git a/core/src/main/scala/cats/instances/sortedMap.scala b/core/src/main/scala/cats/instances/sortedMap.scala
@@ -120,7 +120,7 @@ class SortedMapHash[K, V](implicit V: Hash[V], O: Order[K], K: Hash[K]) extends
   import scala.util.hashing.MurmurHash3._
   def hash(x: SortedMap[K, V]): Int = {
     var a, b, n = 0
-    var c = 1;
+    var c = 1
     x foreach { case (k, v) =>
       val h = StaticMethods.product2Hash(K.hash(k), V.hash(v))
       a += h

diff --git a/kernel/src/main/scala/cats/kernel/instances/map.scala b/kernel/src/main/scala/cats/kernel/instances/map.scala
@@ -26,7 +26,7 @@ class MapHash[K, V](implicit V: Hash[V]) extends MapEq[K, V]()(V) with Hash[Map[
   import scala.util.hashing.MurmurHash3._
   def hash(x: Map[K, V]): Int = {
     var a, b, n = 0
-    var c = 1;
+    var c = 1
     x foreach { case (k, v) =>
       // use the default hash on keys because that's what Scala's Map does
       val h = StaticMethods.product2Hash(k.hashCode(), V.hash(v))