fix sgf and linked list exercise

Author: grzegorz-bielski

bin/test-in-docker

@@ -47,12 +47,12 @@ object Sgf extends RegexParsers {
 
   private val propValue: Parser[String] =
     "[" ~ rep1(propValuePart) ~ "]" ^^ {
-      case _ ~ values ~ _ => values mkString
+      case _ ~ values ~ _ => values.mkString
     } named "propValue"
 
   private val propValuePart: Parser[String] = {
     implicit class AsStringParser(self: String) { def p: Parser[String] = self }
-    val ignore = const("") _
+    val ignore = const("")
 
     val escapedNewline: Parser[String] = "\\\n".p ^^ ignore
     val escapedChar: Parser[String] = """\\.""".r ^^ (_.takeRight(1))

exercises/practice/sgf-parsing/.meta/Example.scala

@@ -72,7 +72,7 @@ class SimpleLinkedListTest extends AnyFlatSpec with Matchers with ScalaCheckDriv
 
   it should "handle reverse arbitrary list " in {
     pending
-    forAll { seq: Seq[Int] =>
+    forAll { (seq: Seq[Int]) =>
       assert(SimpleLinkedList.fromSeq(seq).reverse.toSeq == seq.reverse)
     }
   }
@@ -90,7 +90,7 @@ class SimpleLinkedListTest extends AnyFlatSpec with Matchers with ScalaCheckDriv
       (0 until i).foldLeft(list)((acc, j) => acc.next).value
     }
 
-    forAll { xs: Seq[Int]  =>
+    forAll { (xs: Seq[Int]) =>
       whenever(xs.nonEmpty) {
         val list = SimpleLinkedList.fromSeq(xs)
         xs.indices.foreach {
@@ -102,15 +102,15 @@ class SimpleLinkedListTest extends AnyFlatSpec with Matchers with ScalaCheckDriv
 
   it should "return original arbitrary list from added list elements" in {
     pending
-    forAll { xs: Seq[Int] =>
+    forAll { (xs: Seq[Int]) =>
       val list = xs.foldLeft(SimpleLinkedList[Int]())(_.add(_))
       assert(list.toSeq == xs)
     }
   }
 
   it should "handle arbitrary generics" in {
     pending
-    forAll { xs: Seq[String] =>
+    forAll { (xs: Seq[String]) =>
       assert(SimpleLinkedList.fromSeq(xs).toSeq == xs)
     }
   }