Generate the leap, saddle-points and kindergarten-garden suites (#903)

* Add a test generator that renders suites from the canonical data

Ports the generator @IsaacG wrote for the awk, jq and tcl tracks
(exercism/jq bin/test-generator), which he pointed at in #896, rather than
writing another one. His case handling is kept as-is: `reimplements`
chains, `include = false`, the problem-specifications lookup and the
`git pull`.

Two things are added on top.

A `--check` mode, and CI gating on it, which his tracks do not have. That
is the point of the exercise: `configlet sync --tests` compares tests.toml
against problem-specifications and never compares the suite against
either, so an exercise whose tests.toml is complete reads as in sync
however thin its suite is. That is how the five exercises in #894, #896,
#898, #900 and #901 drifted, and it covers 17 exercises and 67 cases.
A generated suite cannot drift again.

And a refusal to generate when tests.toml is missing canonical cases. The
`reimplements` links live in tests.toml, so a stale one silently emits
superseded cases: anagram would have emitted 3, phone-number 4,
grade-school 1. Thirteen exercises are in that state today. Erroring out
and pointing at `configlet sync --tests` is better than generating from a
partial picture.

darts is converted as the first exercise; nothing changes for the rest.
Its 13 test bodies are byte for byte what was already committed, and only
the header differs, now saying the file is generated.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>

* Generate the leap, saddle-points and kindergarten-garden suites

Converts the three exercises whose suites were synced by hand in #894,
#896 and #900, now that the generator exists. darts was converted with it,
so these complete the set.

Writing a template for a suite that already exists is the honest check on
whether the abstraction can express what the track writes. It could, with
two shared macros: `assert_be` for `subject should be(expected)`, on one
line while it fits and wrapped otherwise, and `test_open` for a `test(...)`
line with a long description.

The templates reproduce the committed suites apart from the header, which
now says the file is generated, and three details:

  - saddle-points had two lines wrapped although they fit within the width;
    the generator leaves them on one line
  - kindergarten-garden's grouped test names now read outermost group
    first, "partial garden - multiple students ... - second student's
    garden", rather than the reversed order the hand-written file used

Every generated line is well inside the 160 columns .scalafmt.conf allows;
the longest is 108.

Each template carries the mapping no generator can infer: saddle-points
translates the canonical one-based {row, column} objects into this track's
zero-based tuples, and kindergarten-garden maps the plant names onto the
Plant enumeration. leap needed nothing beyond the shared macros.

Verified with `bin/test leap darts saddle-points kindergarten-garden`
(48 tests) and `bin/generate-tests --check`.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>

---------

Co-authored-by: Jegors Cemisovs <jcemisovs@evolution.com>
Co-authored-by: Claude Opus 5 <noreply@anthropic.com>

Author: 3 people

exercises/practice/kindergarten-garden/.meta/template.j2

@@ -0,0 +1,27 @@
+{%- import "macros.j2" as macros -%}
+{%- set PLANT = {"violets": "Plant.Violets", "clover": "Plant.Clover",
+                 "radishes": "Plant.Radishes", "grass": "Plant.Grass"} -%}
+{%- macro plants(expected) -%}
+List({% for p in expected %}{{ PLANT[p] }}{% if not loop.last %}, {% endif %}{% endfor %})
+{%- endmacro -%}
+{{ macros.header("KindergartenGarden") }}
+{% for case in cases %}
+{% set diagram = case.input.diagram | scala %}
+{% set student = case.input.student | scala %}
+{% set inline = "Garden.defaultGarden(" ~ diagram ~ ").plants(" ~ student ~ ")" %}
+
+{{ macros.test_open(case) }}
+{% if not loop.first %}
+    pending
+{% endif %}
+{% if ("    " ~ inline ~ " should be(") | length <= 100 %}
+    {{ inline }} should be(
+{% else %}
+    Garden
+      .defaultGarden({{ diagram }})
+      .plants({{ student }}) should be(
+{% endif %}
+      {{ plants(case.expected) }})
+  }
+{% endfor %}
+}

exercises/practice/kindergarten-garden/src/test/scala/GardenTest.scala

@@ -1,8 +1,10 @@
 import org.scalatest.funsuite.AnyFunSuite
 import org.scalatest.matchers.should.Matchers
 
-
-/** @version 1.1.1 */
+/** Generated from the canonical data in problem-specifications.
+  *
+  * Do not edit by hand: change .meta/template.j2 and run bin/generate-tests.
+  */
 class KindergartenGardenTest extends AnyFunSuite with Matchers {
 
   test("partial garden - garden with single student") {
@@ -23,14 +25,14 @@ class KindergartenGardenTest extends AnyFunSuite with Matchers {
   }
 
   test(
-    "multiple students for the same garden with three students, partial garden - second student's garden") {
+    "partial garden - multiple students for the same garden with three students - second student's garden") {
     pending
     Garden.defaultGarden("VVCCGG\nVVCCGG").plants("Bob") should be(
       List(Plant.Clover, Plant.Clover, Plant.Clover, Plant.Clover))
   }
 
   test(
-    "multiple students for the same garden with three students, partial garden - third student's garden") {
+    "partial garden - multiple students for the same garden with three students - third student's garden") {
     pending
     Garden.defaultGarden("VVCCGG\nVVCCGG").plants("Charlie") should be(
       List(Plant.Grass, Plant.Grass, Plant.Grass, Plant.Grass))

exercises/practice/leap/.meta/template.j2

@@ -0,0 +1,12 @@
+{%- import "macros.j2" as macros -%}
+{{ macros.header("Leap") }}
+{% for case in cases %}
+
+{{ macros.test_open(case) }}
+{% if not loop.first %}
+    pending
+{% endif %}
+    Leap.leapYear({{ case.input.year }}) should be ({{ case.expected | scala }})
+  }
+{% endfor %}
+}

exercises/practice/leap/src/test/scala/LeapTest.scala

@@ -1,8 +1,10 @@
 import org.scalatest.funsuite.AnyFunSuite
 import org.scalatest.matchers.should.Matchers
 
-
-/** @version 1.3.0 */
+/** Generated from the canonical data in problem-specifications.
+  *
+  * Do not edit by hand: change .meta/template.j2 and run bin/generate-tests.
+  */
 class LeapTest extends AnyFunSuite with Matchers {
 
   test("year not divisible by 4 in common year") {

exercises/practice/saddle-points/.meta/template.j2

@@ -0,0 +1,17 @@
+{%- import "macros.j2" as macros -%}
+{#- The canonical data indexes rows and columns from 1; this track uses
+    zero-based (row, column) tuples, so the expectations are translated. -#}
+{%- macro points(expected) -%}
+{% if expected %}Set({% for p in expected %}({{ p.row - 1 }}, {{ p.column - 1 }}){% if not loop.last %}, {% endif %}{% endfor %}){% else %}Set(){% endif %}
+{%- endmacro -%}
+{{ macros.header("SaddlePoints") }}
+{% for case in cases %}
+
+{{ macros.test_open(case) }}
+{% if not loop.first %}
+    pending
+{% endif %}
+{{ macros.assert_be("Matrix(" ~ (case.input.matrix | scala) ~ ").saddlePoints", points(case.expected)) }}
+  }
+{% endfor %}
+}

exercises/practice/saddle-points/src/test/scala/SaddlePointsTest.scala

@@ -1,13 +1,14 @@
 import org.scalatest.funsuite.AnyFunSuite
 import org.scalatest.matchers.should.Matchers
 
-
-/** @version 1.1.0 */
+/** Generated from the canonical data in problem-specifications.
+  *
+  * Do not edit by hand: change .meta/template.j2 and run bin/generate-tests.
+  */
 class SaddlePointsTest extends AnyFunSuite with Matchers {
 
   test("Can identify single saddle point") {
-    Matrix(List(List(9, 8, 7), List(5, 3, 2), List(6, 6, 7))).saddlePoints should be(
-      Set((1, 0)))
+    Matrix(List(List(9, 8, 7), List(5, 3, 2), List(6, 6, 7))).saddlePoints should be(Set((1, 0)))
   }
 
   test("Can identify that empty matrix has no saddle points") {
@@ -17,8 +18,7 @@ class SaddlePointsTest extends AnyFunSuite with Matchers {
 
   test("Can identify lack of saddle points when there are none") {
     pending
-    Matrix(List(List(1, 2, 3), List(3, 1, 2), List(2, 3, 1))).saddlePoints should be(
-      Set())
+    Matrix(List(List(1, 2, 3), List(3, 1, 2), List(2, 3, 1))).saddlePoints should be(Set())
   }
 
   test("Can identify multiple saddle points in a column") {
@@ -35,25 +35,22 @@ class SaddlePointsTest extends AnyFunSuite with Matchers {
 
   test("Can identify saddle point in bottom right corner") {
     pending
-    Matrix(List(List(8, 7, 9), List(6, 7, 6), List(3, 2, 5))).saddlePoints should be(
-      Set((2, 2)))
+    Matrix(List(List(8, 7, 9), List(6, 7, 6), List(3, 2, 5))).saddlePoints should be(Set((2, 2)))
   }
 
   test("Can identify saddle points in a non square matrix") {
     pending
-    Matrix(List(List(3, 1, 3), List(3, 2, 4))).saddlePoints should be(
-      Set((0, 2), (0, 0)))
+    Matrix(List(List(3, 1, 3), List(3, 2, 4))).saddlePoints should be(Set((0, 2), (0, 0)))
   }
 
-  test("Can identify that saddle points in a single column matrix are those with the minimum value") {
+  test(
+    "Can identify that saddle points in a single column matrix are those with the minimum value") {
     pending
-    Matrix(List(List(2), List(1), List(4), List(1))).saddlePoints should be(
-      Set((1, 0), (3, 0)))
+    Matrix(List(List(2), List(1), List(4), List(1))).saddlePoints should be(Set((1, 0), (3, 0)))
   }
 
   test("Can identify that saddle points in a single row matrix are those with the maximum value") {
     pending
-    Matrix(List(List(2, 5, 3, 5))).saddlePoints should be(
-      Set((0, 1), (0, 3)))
+    Matrix(List(List(2, 5, 3, 5))).saddlePoints should be(Set((0, 1), (0, 3)))
   }
 }