trackler 2.2.1.3 → 2.2.1.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f2d3bdebe9f23b4e4bd76015bdf93718291556cd
-  data.tar.gz: 663c332d00958e9c5e98dbbf5a39b8b1860bea20
+  metadata.gz: 97638638dc6720c36ddae0926221e2947f683e95
+  data.tar.gz: caf86db5732ca7d826613d9b8cb4dbfa00702339
 SHA512:
-  metadata.gz: 98a6ee04e6e779216a3d1edb522674cde1a6d6b537cbff42a48fd4ec09ea78fe155dbdb346dbea5f9e39caaa35300648ac851d0c193e940593c967f4ca2ec247
-  data.tar.gz: f19ff52e7647ce38e231d8145703fe95d51ca3c664bc82e562d1b54342cad092e3fe51eb81b50b2e5ea1c45c78f95de7f10c8feab32fe2e2047943fafe3aeb08
+  metadata.gz: 48d697aabfd7dd44f0247c4c9e0b44bf945016206525280fe09e513cfbab292ea5b1d644e82072c6f27a25ae927cc6710c813a4ae0a860f7a070a57f84f99ee0
+  data.tar.gz: 661a015ebfc069b4f9c00be5dc44b2ab2c91813f97b407bb3fa9205d9393c8eb653a22593f63070458678f540c98cf59475e7cf19e5e40311f1ceaa2732cc354

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.3"
+  VERSION = "2.2.1.4"
 end

data/tracks/java/exercises/sum-of-multiples/src/example/java/SumOfMultiples.java

@@ -1,3 +1,6 @@
+import java.util.Arrays;
+import java.util.stream.IntStream;
+
 public class SumOfMultiples {
     private final int sum;
 
@@ -11,22 +14,9 @@ public class SumOfMultiples {
 
     private int calculateSum(int number, int[] set) {
 
-        int sum = 0;
-        int count = 0;
-
-        for (int i = 1; i < number; i++) {
-
-            for (int j = 0; j < set.length; j++) {
-                if (i % set[j] == 0) {
-                    count++;
-                }
-            }
-
-            if (count > 0) {
-                sum = sum + i;
-                count = 0;
-            }
-        }
+        int sum = IntStream.range(1,number)
+                .filter(i -> Arrays.stream(set).filter(j -> i % j == 0).count() > 0)
+                .sum();
 
         return sum;
     }

data/tracks/ruby/config.json

@@ -872,6 +872,19 @@
         "Strings"
       ]
     },
+    {
+      "uuid": "dc6c3e44-1027-4d53-9653-ba06824f8bcf",
+      "slug": "change",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
+      "topics": [
+        "Algorithms",
+        "Control-flow (conditionals)",
+        "Control-flow (loops)",
+        "Logic"
+      ]
+    },
     {
       "uuid": "cae4e000-3aac-41f7-b727-f9cce12d058d",
       "slug": "octal",

data/tracks/ruby/exercises/change/.meta/.version

@@ -0,0 +1 @@
+1

data/tracks/ruby/exercises/change/.meta/generator/change_case.rb

@@ -0,0 +1,9 @@
+require 'generator/exercise_case'
+
+class ChangeCase < Generator::ExerciseCase
+
+  def workload
+    assert_equal { "Change.generate(#{coins}, #{target})" }
+  end
+
+end

data/tracks/ruby/exercises/change/.meta/solutions/change.rb

@@ -0,0 +1,58 @@
+module BookKeeping
+  VERSION = 1
+end
+
+class Change
+  attr_reader :coins, :target
+
+  def initialize(coins, target)
+    @coins  = coins.sort.reverse
+    @target = target
+    @total_change = []
+  end
+
+  def generate
+    return [] if target.zero?
+
+    calculate_change(coins, [], target)
+
+    total_change.any? ? total_change.sort : -1
+  end
+
+  def self.generate(coins, target)
+    new(coins, target).generate
+  end
+
+  private
+
+  attr_accessor :total_change
+
+  def calculate_change(current_coins, current_change, current_value)
+    available_coins = current_coins.reject {|d| d > current_value } 
+
+    save_change(current_change) if current_value.zero?
+
+    return if has_more_coins?(current_change)
+
+    each_group(available_coins) do |coin, group|
+      calculate_change(group, current_change + [coin], current_value - coin)
+    end
+  end
+
+  def save_change(contents)
+    return if has_more_coins?(contents)
+
+    self.total_change = contents
+  end
+
+  def has_more_coins?(contents)
+    total_change.any? && (total_change.length < contents.length)
+  end
+
+  def each_group(array)
+    array.length.times do |n|
+      yield(array[n], array[n..-1])
+    end
+  end
+
+end

data/tracks/ruby/exercises/change/change_test.rb

@@ -0,0 +1,77 @@
+require 'minitest/autorun'
+require_relative 'change'
+
+# Common test data version: 1.0.0 3d8b5b3
+class ChangeTest < Minitest::Test
+  def test_single_coin_change
+    # skip
+    assert_equal [25], Change.generate([1, 5, 10, 25, 100], 25)
+  end
+
+  def test_multiple_coin_change
+    skip
+    assert_equal [5, 10], Change.generate([1, 5, 10, 25, 100], 15)
+  end
+
+  def test_change_with_lilliputian_coins
+    skip
+    assert_equal [4, 4, 15], Change.generate([1, 4, 15, 20, 50], 23)
+  end
+
+  def test_change_with_lower_elbonia_coins
+    skip
+    assert_equal [21, 21, 21], Change.generate([1, 5, 10, 21, 25], 63)
+  end
+
+  def test_large_target_values
+    skip
+    assert_equal [2, 2, 5, 20, 20, 50, 100, 100, 100, 100, 100, 100, 100, 100, 100], Change.generate([1, 2, 5, 10, 20, 50, 100], 999)
+  end
+
+  def test_possible_change_without_unit_coins_available
+    skip
+    assert_equal [2, 2, 2, 5, 10], Change.generate([2, 5, 10, 20, 50], 21)
+  end
+
+  def test_no_coins_make_0_change
+    skip
+    assert_equal [], Change.generate([1, 5, 10, 21, 25], 0)
+  end
+
+  def test_error_testing_for_change_smaller_than_the_smallest_of_coins
+    skip
+    assert_equal -1, Change.generate([5, 10], 3)
+  end
+
+  def test_error_if_no_combination_can_add_up_to_target
+    skip
+    assert_equal -1, Change.generate([5, 10], 94)
+  end
+
+  def test_cannot_find_negative_change_values
+    skip
+    assert_equal -1, Change.generate([1, 2, 5], -5)
+  end
+
+  # Problems in exercism evolve over time, as we find better ways to ask
+  # questions.
+  # The version number refers to the version of the problem you solved,
+  # not your solution.
+  #
+  # Define a constant named VERSION inside of the top level BookKeeping
+  # module, which may be placed near the end of your file.
+  #
+  # In your file, it will look like this:
+  #
+  # module BookKeeping
+  #   VERSION = 1 # Where the version number matches the one in the test.
+  # end
+  #
+  # If you are curious, read more about constants on RubyDoc:
+  # http://ruby-doc.org/docs/ruby-doc-bundle/UsersGuide/rg/constants.html
+
+  def test_bookkeeping
+    skip
+    assert_equal 1, BookKeeping::VERSION
+  end
+end

data/tracks/rust/config.json

@@ -70,6 +70,16 @@
         "loop"
       ]
     },
+    {
+      "uuid": "504f9033-6433-4508-aebb-60ee77b800b9",
+      "slug": "proverb",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "format"
+      ]
+    },
     {
       "uuid": "aee49878-f727-400b-8fb5-eaf83447cf87",
       "slug": "difference-of-squares",
@@ -103,6 +113,16 @@
         "panic"
       ]
     },
+    {
+      "uuid": "9f649818-0c82-4b79-b912-4d65b9f60e10",
+      "slug": "prime-factors",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "math"
+      ]
+    },
     {
       "uuid": "4ba35adb-230b-49a6-adc9-2d3cd9a4c538",
       "slug": "say",

data/tracks/rust/exercises/prime-factors/Cargo.lock

@@ -0,0 +1,4 @@
+[root]
+name = "prime_factors"
+version = "1.0.0"
+

data/tracks/rust/exercises/prime-factors/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "prime_factors"
+version = "1.0.0"
+authors = ["sacherjj <sacherjj@gmail.com>"]
+
+[dependencies]

data/tracks/rust/exercises/prime-factors/README.md

@@ -0,0 +1,68 @@
+# Prime Factors
+
+Compute the prime factors of a given natural number.
+
+A prime number is only evenly divisible by itself and 1.
+
+Note that 1 is not a prime number.
+
+## Example
+
+What are the prime factors of 60?
+
+- Our first divisor is 2. 2 goes into 60, leaving 30.
+- 2 goes into 30, leaving 15.
+  - 2 doesn't go cleanly into 15. So let's move on to our next divisor, 3.
+- 3 goes cleanly into 15, leaving 5.
+  - 3 does not go cleanly into 5. The next possible factor is 4.
+  - 4 does not go cleanly into 5. The next possible factor is 5.
+- 5 does go cleanly into 5.
+- We're left only with 1, so now, we're done.
+
+Our successful divisors in that computation represent the list of prime
+factors of 60: 2, 2, 3, and 5.
+
+You can check this yourself:
+
+- 2 * 2 * 3 * 5
+- = 4 * 15
+- = 60
+- Success!
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored.  After you get the first test to
+pass, remove the ignore flag (`#[ignore]`) from the next test and get the tests
+to pass again.  The test file is located in the `tests` directory.   You can
+also remove the ignore flag from all the tests to get them to run all at once
+if you wish.
+
+Make sure to read the [Crates and Modules](https://doc.rust-lang.org/stable/book/crates-and-modules.html) chapter if you
+haven't already, it will help you with organizing your files.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the [rust track team](https://github.com/orgs/exercism/teams/rust) are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: http://exercism.io/languages/rust
+[crates-and-modules]: http://doc.rust-lang.org/stable/book/crates-and-modules.html
+
+## Source
+
+The Prime Factors Kata by Uncle Bob [http://butunclebob.com/ArticleS.UncleBob.ThePrimeFactorsKata](http://butunclebob.com/ArticleS.UncleBob.ThePrimeFactorsKata)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/rust/exercises/prime-factors/example.rs

@@ -0,0 +1,13 @@
+pub fn factors(n: u64) -> Vec<u64> {
+    let mut val = n;
+    let mut out: Vec<u64> = vec![];
+    let mut possible:u64 = 2;
+    while val > 1 {
+        while val % possible == 0 {
+            out.push(possible);
+            val /= possible;
+        }
+        possible += 1;
+    }
+    out
+}

data/tracks/rust/exercises/prime-factors/tests/prime-factors.rs

@@ -0,0 +1,44 @@
+extern crate prime_factors;
+
+use prime_factors::factors;
+
+#[test]
+fn test_no_factors() {
+    assert_eq!(factors(1), vec![]);
+}
+
+#[test]
+#[ignore]
+fn test_prime_number() {
+    assert_eq!(factors(2), vec![2]);
+}
+
+#[test]
+#[ignore]
+fn test_square_of_a_prime() {
+    assert_eq!(factors(9), vec![3, 3]);
+}
+
+#[test]
+#[ignore]
+fn test_cube_of_a_prime() {
+    assert_eq!(factors(8), vec![2, 2, 2]);
+}
+
+#[test]
+#[ignore]
+fn test_product_of_primes_and_non_primes() {
+    assert_eq!(factors(12), vec![2, 2, 3]);
+}
+
+#[test]
+#[ignore]
+fn test_product_of_primes() {
+    assert_eq!(factors(901255), vec![5, 17, 23, 461]);
+}
+
+#[test]
+#[ignore]
+fn test_factors_include_large_prime() {
+    assert_eq!(factors(93819012551), vec![11, 9539, 894119]);
+}

data/tracks/rust/exercises/proverb/Cargo.lock

@@ -0,0 +1,4 @@
+[root]
+name = "proverb"
+version = "0.0.0"
+

data/tracks/rust/exercises/proverb/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "proverb"
+version = "0.0.0"
+authors = ["sacherjj <sacherjj@gmail.com>"]
+
+[dependencies]

data/tracks/rust/exercises/proverb/README.md

@@ -0,0 +1,50 @@
+# Proverb
+
+For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output
+the full text of this proverbial rhyme:
+
+> For want of a nail the shoe was lost.  
+> For want of a shoe the horse was lost.  
+> For want of a horse the rider was lost.  
+> For want of a rider the message was lost.  
+> For want of a message the battle was lost.  
+> For want of a battle the kingdom was lost.  
+> And all for the want of a horseshoe nail.
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored.  After you get the first test to
+pass, remove the ignore flag (`#[ignore]`) from the next test and get the tests
+to pass again.  The test file is located in the `tests` directory.   You can
+also remove the ignore flag from all the tests to get them to run all at once
+if you wish.
+
+Make sure to read the [Crates and Modules](https://doc.rust-lang.org/stable/book/crates-and-modules.html) chapter if you
+haven't already, it will help you with organizing your files.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the [rust track team](https://github.com/orgs/exercism/teams/rust) are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: http://exercism.io/languages/rust
+[crates-and-modules]: http://doc.rust-lang.org/stable/book/crates-and-modules.html
+
+## Source
+
+Wikipedia [http://en.wikipedia.org/wiki/For_Want_of_a_Nail](http://en.wikipedia.org/wiki/For_Want_of_a_Nail)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/rust/exercises/proverb/example.rs

@@ -0,0 +1,17 @@
+pub fn build_proverb(list: Vec<&str>) -> String {
+    if list.len() == 0 {
+        return String::new();
+    }
+    let mut out: Vec<String> = vec![];
+    for i in 1..list.len() {
+        out.push(format!("For want of a {} the {} was lost.", list[i-1], list[i]));
+    }
+    let end: String;
+    if list.len() > 2 {
+        end = format!("{}{} {}", list[2], list[1], list[0]);
+    } else {
+        end = format!("{}", list[0]);
+    }
+    out.push(format!("And all for the want of a {}.", end));
+    out.join("\n")
+}

data/tracks/rust/exercises/proverb/tests/proverb.rs

@@ -0,0 +1,52 @@
+extern crate proverb;
+
+use proverb::build_proverb;
+
+#[test]
+fn test_two_pieces() {
+    let input = vec!["nail", "shoe"];
+    let expected = vec!["For want of a nail the shoe was lost.",
+                        "And all for the want of a nail."].join("\n");
+    assert_eq!(build_proverb(input), expected);
+}
+
+// Notice the change in the last line at three pieces.
+#[test]
+#[ignore]
+fn test_three_pieces() {
+    let input = vec!["nail", "shoe", "horse"];
+    let expected = vec!["For want of a nail the shoe was lost.",
+                        "For want of a shoe the horse was lost.",
+                        "And all for the want of a horseshoe nail."].join("\n");
+    assert_eq!(build_proverb(input), expected);
+}
+
+#[test]
+#[ignore]
+fn test_one_piece() {
+    let input = vec!["nail"];
+    let expected = String::from("And all for the want of a nail.");
+    assert_eq!(build_proverb(input), expected);
+}
+
+#[test]
+#[ignore]
+fn test_zero_pieces() {
+    let input: Vec<&str> = vec![];
+    let expected = String::new();
+    assert_eq!(build_proverb(input), expected);
+}
+
+#[test]
+#[ignore]
+fn test_full() {
+    let input = vec!["nail", "shoe", "horse", "rider", "message", "battle", "kingdom"];
+    let expected = vec!["For want of a nail the shoe was lost.",
+                        "For want of a shoe the horse was lost.",
+                        "For want of a horse the rider was lost.",
+                        "For want of a rider the message was lost.",
+                        "For want of a message the battle was lost.",
+                        "For want of a battle the kingdom was lost.",
+                        "And all for the want of a horseshoe nail."].join("\n");
+    assert_eq!(build_proverb(input), expected);
+}

data/tracks/scala/exercises/pascals-triangle/example.scala

@@ -1,5 +1,5 @@
 object PascalsTriangle {
-  def triangle(n: Int): List[List[Int]] =
+  def rows(n: Int): List[List[Int]] =
     (for (row <- 1 to n) yield triRow(row)).toList
 
   private def triRow(row: Int): List[Int] = {

data/tracks/scala/exercises/pascals-triangle/src/test/scala/PascalsTriangleTest.scala

@@ -1,37 +1,34 @@
-import org.scalatest.{Matchers, FlatSpec}
+import org.scalatest.{Matchers, FunSuite}
 
-class PascalsTriangleTest extends FlatSpec with Matchers {
-  it should "handle 1 row" in {
-    PascalsTriangle.triangle(1) should be (List(List(1)))
+/** @version 1.0.0 */
+class PascalsTriangleTest extends FunSuite with Matchers {
+
+  test("zero rows") {
+    PascalsTriangle.rows(0) should be (List())
   }
 
-  it should "handle 2 rows" in {
+  test("single row") {
     pending
-    PascalsTriangle.triangle(2) should be (List(List(1), List(1, 1)))
+    PascalsTriangle.rows(1) should be (List(List(1)))
   }
 
-  it should "handle 3 rows" in {
+  test("two rows") {
     pending
-    PascalsTriangle.triangle(3) should be (List(List(1), List(1, 1), List(1, 2, 1)))
+    PascalsTriangle.rows(2) should be (List(List(1), List(1, 1)))
   }
 
-  it should "handle 4 rows" in {
+  test("three rows") {
     pending
-    PascalsTriangle.triangle(4) should be (List(List(1), List(1, 1),
-      List(1, 2, 1), List(1, 3, 3, 1)))
+    PascalsTriangle.rows(3) should be (List(List(1), List(1, 1), List(1, 2, 1)))
   }
 
-  it should "handle 5 rows" in {
+  test("four rows") {
     pending
-    PascalsTriangle.triangle(5) should be (List(List(1), List(1, 1),
-      List(1, 2, 1), List(1, 3, 3, 1), List(1, 4, 6, 4, 1)))
+    PascalsTriangle.rows(4) should be (List(List(1), List(1, 1), List(1, 2, 1), List(1, 3, 3, 1)))
   }
 
-  it should "handle 20 rows" in {
+  test("negative rows") {
     pending
-    PascalsTriangle.triangle(20).takeRight(1).head should be (List(1, 19,
-      171, 969, 3876, 11628, 27132, 50388, 75582, 92378,
-      92378, 75582, 50388, 27132, 11628, 3876, 969, 171,
-      19, 1))
+    PascalsTriangle.rows(-1) should be (List())
   }
-}
+}

data/tracks/scala/exercises/run-length-encoding/src/test/scala/RunLengthEncodingTests.scala

@@ -1,52 +1,69 @@
-import org.scalatest.FunSuite
-import org.scalatest.Matchers
+import org.scalatest.{Matchers, FunSuite}
 
-class RunLengthEncodingTests extends FunSuite with Matchers {
+/** @version 1.0.0 */
+class RunLengthEncodingTest extends FunSuite with Matchers {
 
-  test("encode empty string") {
+  test("encode - empty string") {
     RunLengthEncoding.encode("") should be ("")
   }
 
-  test("encode single characters only") {
+  test("encode - single characters only are encoded without count") {
     pending
     RunLengthEncoding.encode("XYZ") should be ("XYZ")
   }
 
-  test("decode empty string") {
+  test("encode - string with no single characters") {
     pending
-    RunLengthEncoding.decode("") should be ("")
+    RunLengthEncoding.encode("AABBBCCCC") should be ("2A3B4C")
   }
 
-  test("decode single characters only") {
+  test("encode - single characters mixed with repeated characters") {
     pending
-    RunLengthEncoding.decode("XYZ") should be ("XYZ")
+    RunLengthEncoding.encode("WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB") should be ("12WB12W3B24WB")
   }
 
-  test("encode simple") {
+  test("encode - multiple whitespace mixed in string") {
     pending
-    RunLengthEncoding.encode("AABBBCCCC") should be ("2A3B4C")
+    RunLengthEncoding.encode("  hsqq qww  ") should be ("2 hs2q q2w2 ")
   }
 
-  test("decode simple") {
+  test("encode - lowercase characters") {
     pending
-    RunLengthEncoding.decode("2A3B4C") should be ("AABBBCCCC")
+    RunLengthEncoding.encode("aabbbcccc") should be ("2a3b4c")
   }
 
-  test("encode with single values") {
+  test("decode - empty string") {
     pending
-    RunLengthEncoding.encode("WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB") should
-      be ("12WB12W3B24WB")
+    RunLengthEncoding.decode("") should be ("")
+  }
+
+  test("decode - single characters only") {
+    pending
+    RunLengthEncoding.decode("XYZ") should be ("XYZ")
   }
 
-  test("decode with single values") {
+  test("decode - string with no single characters") {
+    pending
+    RunLengthEncoding.decode("2A3B4C") should be ("AABBBCCCC")
+  }
+
+  test("decode - single characters with repeated characters") {
     pending
     RunLengthEncoding.decode("12WB12W3B24WB") should be ("WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB")
   }
 
-  test("decode(encode(...)) combination") {
+  test("decode - multiple whitespace mixed in string") {
     pending
-    RunLengthEncoding.decode(
-        RunLengthEncoding.encode("zzz ZZ  zZ")) should be ("zzz ZZ  zZ")
+    RunLengthEncoding.decode("2 hs2q q2w2 ") should be ("  hsqq qww  ")
   }
 
-}
+  test("decode - lower case string") {
+    pending
+    RunLengthEncoding.decode("2a3b4c") should be ("aabbbcccc")
+  }
+
+  test("consistency - encode followed by decode gives original string") {
+    pending
+    RunLengthEncoding.decode(RunLengthEncoding.encode("zzz ZZ  zZ")) should be ("zzz ZZ  zZ")
+  }
+}

data/tracks/scala/testgen/src/main/scala/PascalsTriangleTestGenerator.scala

@@ -0,0 +1,51 @@
+import java.io.File
+
+import testgen.TestSuiteBuilder._
+import testgen._
+
+object PascalsTriangleTestGenerator {
+  def main(args: Array[String]): Unit = {
+    val file = new File("src/main/resources/pascals-triangle.json")
+
+    def toStr(any: Any): String = {
+      any match {
+        case list: List[_] =>
+          val vals = list.map(s => toStr(s)).mkString(", ")
+          s"List($vals)"
+        case n: Int =>
+          if (n == -1)
+            "List()"
+          else
+            n.toString
+        case v => throw new IllegalStateException("Unexpected value - " + v)
+      }
+    }
+
+    def toString(expected: CanonicalDataParser.Expected): String = {
+        expected match {
+          case Left(error) => throw new IllegalStateException("Unexpected error - " + error)
+          case Right(exp) => toStr(exp)
+        }
+    }
+
+    def withLabeledTestOption(argNames: String*): ToOptionTestCaseData =
+      withLabeledTestOpt { sut =>
+        labeledTest =>
+          if (labeledTest.result.valuesIterator.contains(null)) {
+            None
+          } else {
+            val args = sutArgs(labeledTest.result, argNames: _*)
+            val property = labeledTest.property
+            val sutCall =
+              s"""$sut.$property($args)"""
+            val expected = toString(labeledTest.expected)
+            Some(TestCaseData(labeledTest.description, sutCall, expected))
+          }
+      }
+
+    val code = TestSuiteBuilder.buildFromOption(file, withLabeledTestOption("count"))
+    println(s"-------------")
+    println(code)
+    println(s"-------------")
+  }
+}

data/tracks/scala/testgen/src/main/scala/RunLengthEncodingTestGenerator.scala

@@ -0,0 +1,34 @@
+import java.io.File
+
+import testgen.TestSuiteBuilder.{toString, _}
+import testgen._
+
+object RunLengthEncodingTestGenerator {
+  private def toString(expected: CanonicalDataParser.Expected): String =
+    expected.fold(_ => "", TestSuiteBuilder.toString)
+
+  def fromLabeledTestAlt(propArgs: (String, Seq[String])*): ToTestCaseData =
+    withLabeledTest { sut => labeledTest =>
+      val sutFunction = labeledTest.property
+      val args = sutArgsAlt(labeledTest.result, propArgs:_*)
+      val sutCall =
+        if (sutFunction.toString == "consistency")
+          s"$sut.decode($sut.encode($args))"
+        else
+          s"$sut.$sutFunction($args)"
+      val expected = toString(labeledTest.expected)
+
+      TestCaseData(s"$sutFunction - ${labeledTest.description}", sutCall, expected)
+    }
+
+  def main(args: Array[String]): Unit = {
+    val file = new File("src/main/resources/run-length-encoding.json")
+
+    val code = TestSuiteBuilder.build(file,
+        fromLabeledTestAlt("encode" -> Seq("input"), "decode" -> Seq("input"),
+          "consistency" -> Seq("input")))
+    println(s"-------------")
+    println(code)
+    println(s"-------------")
+  }
+}

data/tracks/scala/testgen/src/main/scala/testgen/TestSuiteBuilder.scala

@@ -10,6 +10,7 @@ object TestSuiteBuilder {
 
   type TestSuiteTemplate = Template1[TestSuiteData, Txt]
   type ToTestCaseData = String => LabeledTestItem => TestCaseData
+  type ToOptionTestCaseData = String => LabeledTestItem => Option[TestCaseData]
 
   private val DefaultTemplate: TestSuiteTemplate =
     txt.funSuiteTemplate.asInstanceOf[Template1[TestSuiteData, Txt]]
@@ -29,9 +30,27 @@ object TestSuiteBuilder {
     template.render(testSuiteData).toString
   }
 
+  def buildFromOption(file: File, toTestCaseData: ToOptionTestCaseData, imports: Seq[String] = Seq())(
+    implicit template: TestSuiteTemplate = DefaultTemplate): String =
+  {
+    val exercise @ Exercise(name, version, cases, comments) =
+      CanonicalDataParser.parse(file)
+    val tsName = testSuiteName(name)
+    val testCasesAllPending = cases.map(toTestCaseData(sutName(name))).flatten
+    val testCases =
+      testCasesAllPending updated(0, testCasesAllPending.head.copy(pending = false))
+    val testSuiteData =
+      TestSuiteData(tsName, version, imports, testCases)
+
+    template.render(testSuiteData).toString
+  }
+
   def withLabeledTest(f: String => LabeledTest => TestCaseData): ToTestCaseData =
     sut => item => f(sut)(item.asInstanceOf[LabeledTest])
 
+  def withLabeledTestOpt(f: String => LabeledTest => Option[TestCaseData]): ToOptionTestCaseData =
+    sut => item => f(sut)(item.asInstanceOf[LabeledTest])
+
   def fromLabeledTest(argNames: String*): ToTestCaseData =
     withLabeledTest { sut => labeledTest =>
       val sutFunction = labeledTest.property

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.3
+  version: 2.2.1.4
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-07-26 00:00:00.000000000 Z
+date: 2017-07-28 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -9342,6 +9342,10 @@ files:
 - tracks/ruby/exercises/bracket-push/.meta/solutions/bracket_push.rb
 - tracks/ruby/exercises/bracket-push/README.md
 - tracks/ruby/exercises/bracket-push/bracket_push_test.rb
+- tracks/ruby/exercises/change/.meta/.version
+- tracks/ruby/exercises/change/.meta/generator/change_case.rb
+- tracks/ruby/exercises/change/.meta/solutions/change.rb
+- tracks/ruby/exercises/change/change_test.rb
 - tracks/ruby/exercises/circular-buffer/.meta/solutions/circular_buffer.rb
 - tracks/ruby/exercises/circular-buffer/README.md
 - tracks/ruby/exercises/circular-buffer/circular_buffer_test.rb
@@ -9974,6 +9978,12 @@ files:
 - tracks/rust/exercises/pig-latin/example.rs
 - tracks/rust/exercises/pig-latin/src/lib.rs
 - tracks/rust/exercises/pig-latin/tests/pig-latin.rs
+- tracks/rust/exercises/prime-factors/Cargo.lock
+- tracks/rust/exercises/prime-factors/Cargo.toml
+- tracks/rust/exercises/prime-factors/README.md
+- tracks/rust/exercises/prime-factors/example.rs
+- tracks/rust/exercises/prime-factors/src/lib.rs
+- tracks/rust/exercises/prime-factors/tests/prime-factors.rs
 - tracks/rust/exercises/protein-translation/.gitignore
 - tracks/rust/exercises/protein-translation/Cargo.lock
 - tracks/rust/exercises/protein-translation/Cargo.toml
@@ -9981,6 +9991,12 @@ files:
 - tracks/rust/exercises/protein-translation/example.rs
 - tracks/rust/exercises/protein-translation/src/lib.rs
 - tracks/rust/exercises/protein-translation/tests/proteins.rs
+- tracks/rust/exercises/proverb/Cargo.lock
+- tracks/rust/exercises/proverb/Cargo.toml
+- tracks/rust/exercises/proverb/README.md
+- tracks/rust/exercises/proverb/example.rs
+- tracks/rust/exercises/proverb/src/lib.rs
+- tracks/rust/exercises/proverb/tests/proverb.rs
 - tracks/rust/exercises/queen-attack/.gitignore
 - tracks/rust/exercises/queen-attack/Cargo.lock
 - tracks/rust/exercises/queen-attack/Cargo.toml
@@ -10485,7 +10501,7 @@ files:
 - tracks/scala/exercises/run-length-encoding/README.md
 - tracks/scala/exercises/run-length-encoding/build.sbt
 - tracks/scala/exercises/run-length-encoding/example.scala
-- tracks/scala/exercises/run-length-encoding/src/main/scala/RunLengthEncoding.scala
+- tracks/scala/exercises/run-length-encoding/src/main/scala/.keep
 - tracks/scala/exercises/run-length-encoding/src/test/scala/RunLengthEncodingTests.scala
 - tracks/scala/exercises/saddle-points/README.md
 - tracks/scala/exercises/saddle-points/build.sbt
@@ -10621,12 +10637,14 @@ files:
 - tracks/scala/testgen/src/main/scala/LeapTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/NucleotideCountTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/PangramsTestGenerator.scala
+- tracks/scala/testgen/src/main/scala/PascalsTriangleTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/PerfectNumbersTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/PhoneNumberTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/PrimeFactorsTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/RailFenceCipherTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/RaindropsTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/RnaTranscriptionTestGenerator.scala
+- tracks/scala/testgen/src/main/scala/RunLengthEncodingTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/ScrabbleScoreTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/SecretHandshakeTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/SeriesTestGenerator.scala

data/tracks/scala/exercises/run-length-encoding/src/main/scala/RunLengthEncoding.scala

@@ -1,6 +0,0 @@
-object RunLengthEncoding {
-
-  def encode(str: String): String = ???
-
-  def decode(str: String): String = ???
-}