trackler 2.2.1.70 → 2.2.1.71

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: db1dac190572a67ad1c9066086bc27f651d43512
-  data.tar.gz: e7f6a561bcfec5e8f015f3f234592119a786764f
+  metadata.gz: 035f344758e70ee0d97c2246e5cfdf0878ec339b
+  data.tar.gz: 7b52f923df0cb958c251e599a75de951173521ee
 SHA512:
-  metadata.gz: d881520b55a7e22887cb9cf931583c9d84db97deda9bbe370ab89a3ae2ff9782cd05f31947246fa2874803229c0a54fc87126488ed5b011ed232fac9127d4929
-  data.tar.gz: 970a8aed655deaf30103ccf71a6891350aefbad2263c4e5f9950e753b3e8fa55dcccaf79083db80fcab3a69e253ddb57dff30b79242e5c546841d9d3170691a1
+  metadata.gz: cdbc6ff2470de2c426509584b99d3853b3f59c25f6942883f8902a3acc8baae255f23b8f202758f3ea646d63c98d11acec4cedf6c78d5c64731737390b0ebb99
+  data.tar.gz: a47dc3a6adc5811139e22b25216924c2b669088bc12def99668fb36fec8cc69dbbb8571b4281981c5bdb427cb9373289e931c6df766732230dabafd286cb3cb8

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.70"
+  VERSION = "2.2.1.71"
 end

data/tracks/c/exercises/all-your-base/src/example.c

@@ -8,7 +8,7 @@ size_t rebase(int8_t digits[DIGITS_ARRAY_SIZE], int16_t from_base,
    uint16_t denary = 0;
    size_t new_num_digits = 0;
 
-   if ((from_base <= 1) || (to_base <= 1) || (num_digits <= 0))
+   if ((from_base <= 1) || (to_base <= 1) || (num_digits == 0))
       return 0;                 /* invalid bases or length */
    if (digits[0] == 0)
       return 0;                 /* leading zeros */

data/tracks/c/exercises/beer-song/src/example.c

@@ -24,8 +24,8 @@ static unsigned int get_verse(char *buffer, unsigned int verse_number)
    } else if (verse_number <= 99) {
       bytes_written =
           sprintf(buffer,
-                  "%d bottles of beer on the wall, %d bottles of beer.\n"
-                  "Take one down and pass it around, %d bottles of beer on the wall.\n",
+                  "%u bottles of beer on the wall, %u bottles of beer.\n"
+                  "Take one down and pass it around, %u bottles of beer on the wall.\n",
                   verse_number, verse_number, verse_number - 1);
    }
 

data/tracks/c/exercises/meetup/src/example.c

@@ -108,16 +108,15 @@ int meetup_day_of_month(unsigned int year, unsigned int month, const char *week,
                         const char *day_of_week)
 {
    int day_of_month = BAD_DATE_REQUESTED;
-   int baseline_day_of_week;
    int days_in_test_month = days_in_month(year, month);
-   int day_offset;
-   int reference_day = 1;       // used to calculate a baseline day of week given a target date.
 
    int which_week_of_month = get_week_of_month(week);
    int target_day_in_week = get_requested_day_of_week(day_of_week);
 
    // check for valid lookup...
    if ((which_week_of_month >= 0) && (target_day_in_week >= 0)) {
+      int day_offset;
+      int reference_day = 1;    // used to calculate a baseline day of week given a target date.
       // first - fifth Xday of month
       if (which_week_of_month <= 5) {
          day_offset = 1 + ((which_week_of_month - 1) * 7);
@@ -130,7 +129,7 @@ int meetup_day_of_month(unsigned int year, unsigned int month, const char *week,
          }
          day_offset = reference_day;
       }
-      baseline_day_of_week =
+      int baseline_day_of_week =
           get_day_of_week_from_date(year, month, reference_day);
       day_of_month =
           day_offset + ((target_day_in_week + 7 - baseline_day_of_week) % 7);

data/tracks/c/exercises/nucleotide-count/src/example.c

@@ -36,7 +36,7 @@ char *count(const char *dna_strand)
    }
 
    if (!invalid_char) {
-      sprintf(count_results, "A:%zd C:%zd G:%zd T:%zd", nucleotide_a_count,
+      sprintf(count_results, "A:%zu C:%zu G:%zu T:%zu", nucleotide_a_count,
               nucleotide_c_count, nucleotide_g_count, nucleotide_t_count);
    }
    return count_results;

data/tracks/c/exercises/raindrops/src/example.c

@@ -15,7 +15,7 @@ char *convert(char result[], int drops)
       strcat(result, "Plong");
    }
    if (strlen(result) == 0) {
-      char drops_string[12] = "";
+      char drops_string[12] = "\0";
       sprintf(drops_string, "%d", drops);
       strcat(result, drops_string);
    }

data/tracks/c/exercises/sieve/src/example.c

@@ -6,14 +6,13 @@
 unsigned int sieve(const unsigned int limit, primes_array_t primes)
 {
    unsigned int number_of_primes = 0;
-   unsigned char *number_is_prime;
 
    // clear the results
    memset(primes, 0, sizeof(*primes));
 
    if (limit > 1) {
       //allocate 1 more than limit for convenience so the number and the index are same
-      number_is_prime = malloc(limit + 1);
+      unsigned char *number_is_prime = malloc(limit + 1);
       memset(number_is_prime, 1, limit + 1);
 
       unsigned int max_factor = sqrt(limit) + 1;

data/tracks/delphi/docs/EXERCISE_README_INSERT.md

@@ -1,7 +1,7 @@
 ## Testing
 
 In order to run the tests for this track, you will need to install
-DUnitX. Please see the [installation](http://www.exercism.io/languages/delphi/installing) instructions for more information.
+DUnitX. Please see the [installation](http://www.exercism.io/languages/delphi/installation) instructions for more information.
 
 ### Loading Exercises into Delphi
 

data/tracks/java/exercises/binary-search-tree/.meta/src/reference/java/BinarySearchTree.java

@@ -9,20 +9,20 @@ class BinarySearchTree<T extends Comparable<T>> {
         if (root == null) {
             root = new Node<>(value);
         } else {
-            this.insert(this.root, value);
+            insert(root, value);
         }
-        this.nodeCount++;
+        nodeCount++;
     }
 
     List<T> getAsSortedList() {
-        List<T> result = new ArrayList<>(this.nodeCount);
-        this.putInSortedOrderToList(this.root, result);
+        List<T> result = new ArrayList<>(nodeCount);
+        putInSortedOrderToList(root, result);
         return Collections.unmodifiableList(result);
     }
 
     List<T> getAsLevelOrderList() {
-        List<T> result = new ArrayList<>(this.nodeCount);
-        this.putInLevelOrderToList(this.root, result);
+        List<T> result = new ArrayList<>(nodeCount);
+        putInLevelOrderToList(root, result);
         return Collections.unmodifiableList(result);
     }
 
@@ -33,13 +33,13 @@ class BinarySearchTree<T extends Comparable<T>> {
     private void insert(Node<T> node, T value) {
         if (value.compareTo(node.getData()) <= 0) {
             if (node.getLeft() == null) {
-                node.setLeft(new Node<T>(value));
+                node.setLeft(new Node<>(value));
             } else {
                 insert(node.getLeft(), value);
             }
         } else {
             if (node.getRight() == null) {
-                node.setRight(new Node<T>(value));
+                node.setRight(new Node<>(value));
             } else {
                 insert(node.getRight(), value);
             }

data/tracks/java/exercises/book-store/.meta/src/reference/java/BookStore.java

@@ -4,47 +4,47 @@ import java.util.stream.Collectors;
 
 class BookStore {
 
-  private static final int BOOK_PRICE = 8, MAX_GROUP_SIZE = 5;
+    private static final int BOOK_PRICE = 8, MAX_GROUP_SIZE = 5;
 
-  private static double[] DISCOUNT_TIERS = {0, 5, 10, 20, 25};
+    private static double[] DISCOUNT_TIERS = {0, 5, 10, 20, 25};
 
-  double calculateBasketCost(final List<Integer> books) {
-    return calculateBasketCost(books, 0);
-  }
-
-  private double calculateBasketCost(final List<Integer> books, final double priceSoFar) {
-    if (books.size() == 0) {
-      return priceSoFar;
+    double calculateBasketCost(final List<Integer> books) {
+        return calculateBasketCost(books, 0);
     }
 
-    List<Integer> availableBookNumbers = books.stream()
-        .distinct()
-        .collect(Collectors.toList());
+    private double calculateBasketCost(final List<Integer> books, final double priceSoFar) {
+        if (books.size() == 0) {
+            return priceSoFar;
+        }
 
-    double minPrice = Double.MAX_VALUE;
+        List<Integer> availableBookNumbers = books.stream()
+            .distinct()
+            .collect(Collectors.toList());
 
-    for (int i = 0; i < availableBookNumbers.size(); i++) {
-      List<Integer> newGroupBooks = new ArrayList<>(availableBookNumbers.subList(0, i + 1));
-      List<Integer> remainingBooks = new ArrayList<>(books);
+        double minPrice = Double.MAX_VALUE;
 
-      for (final Integer newGroupBook : newGroupBooks) {
-        //noinspection UseBulkOperation - we want to remove _one_ of each book number, not _all_ of each book number.
-        remainingBooks.remove(newGroupBook);
-      }
+        for (int i = 0; i < availableBookNumbers.size(); i++) {
+            List<Integer> newGroupBooks = new ArrayList<>(availableBookNumbers.subList(0, i + 1));
+            List<Integer> remainingBooks = new ArrayList<>(books);
 
-      double price = calculateBasketCost(remainingBooks, priceSoFar + costOfGroupSize(newGroupBooks.size()));
-      minPrice = Math.min(minPrice, price);
-    }
+            for (final Integer newGroupBook : newGroupBooks) {
+                //noinspection UseBulkOperation - we want to remove _one_ of each book number, not _all_ of each book number.
+                remainingBooks.remove(newGroupBook);
+            }
 
-    return minPrice;
-  }
+            double price = calculateBasketCost(remainingBooks, priceSoFar + costOfGroupSize(newGroupBooks.size()));
+            minPrice = Math.min(minPrice, price);
+        }
 
-  private double costOfGroupSize(int groupSize) {
-    if (groupSize < 1 || groupSize > MAX_GROUP_SIZE) {
-      throw new IllegalStateException("Invalid group size : " + groupSize);
+        return minPrice;
     }
 
-    return BOOK_PRICE * groupSize * (100 - DISCOUNT_TIERS[groupSize - 1]) / 100;
-  }
+    private double costOfGroupSize(int groupSize) {
+        if (groupSize < 1 || groupSize > MAX_GROUP_SIZE) {
+            throw new IllegalStateException("Invalid group size : " + groupSize);
+        }
+
+        return BOOK_PRICE * groupSize * (100 - DISCOUNT_TIERS[groupSize - 1]) / 100;
+    }
 
 }

data/tracks/java/exercises/bowling/.meta/src/reference/java/BowlingGame.java

@@ -1,16 +1,16 @@
 import java.util.ArrayList;
 import java.util.List;
 
-public class BowlingGame {
+class BowlingGame {
     private static final int NUMBER_OF_FRAMES = 10;
     private static final int MAXIMUM_FRAME_SCORE = 10;
-    private List<Integer> rolls = new ArrayList<Integer>();
+    private List<Integer> rolls = new ArrayList<>();
 
-    public void roll(int pins) {
+    void roll(int pins) {
         rolls.add(pins);
     }
 
-    public int score() {
+    int score() {
         int score = 0;
         int frameIndex = 0;
 

data/tracks/java/exercises/bowling/src/test/java/BowlingTest.java

@@ -150,7 +150,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void rollsCanNotScoreNegativePoints() throws IllegalStateException {
+    public void rollsCanNotScoreNegativePoints() {
         int[] rolls = {-1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
 
         playGame(rolls);
@@ -163,7 +163,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void aRollCanNotScoreMoreThan10Points() throws IllegalStateException {
+    public void aRollCanNotScoreMoreThan10Points() {
         int[] rolls = {11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
 
         playGame(rolls);
@@ -176,7 +176,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void twoRollsInAFrameCanNotScoreMoreThan10Points() throws IllegalStateException {
+    public void twoRollsInAFrameCanNotScoreMoreThan10Points() {
         int[] rolls = {5, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
 
         playGame(rolls);
@@ -189,7 +189,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void twoBonusRollsAfterAStrikeInTheLastFrameCanNotScoreMoreThan10Points() throws IllegalStateException {
+    public void twoBonusRollsAfterAStrikeInTheLastFrameCanNotScoreMoreThan10Points() {
         int[] rolls = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 5, 6};
 
         playGame(rolls);
@@ -202,7 +202,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void twoBonusRollsAfterAStrikeInTheLastFrameCanScoreMoreThan10PointsIfOneIsAStrike() throws IllegalStateException {
+    public void twoBonusRollsAfterAStrikeInTheLastFrameCanScoreMoreThan10PointsIfOneIsAStrike() {
         int[] rolls = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 10, 6};
 
         playGame(rolls);
@@ -212,7 +212,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void anUnstartedGameCanNotBeScored() throws IllegalStateException {
+    public void anUnstartedGameCanNotBeScored() {
         int[] rolls = new int[0];
 
         playGame(rolls);
@@ -225,7 +225,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void anIncompleteGameCanNotBeScored() throws IllegalStateException {
+    public void anIncompleteGameCanNotBeScored() {
         int[] rolls = {0, 0};
 
         playGame(rolls);
@@ -238,7 +238,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void aGameWithMoreThanTenFramesCanNotBeScored() throws IllegalStateException {
+    public void aGameWithMoreThanTenFramesCanNotBeScored() {
         int[] rolls = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
 
         playGame(rolls);
@@ -251,7 +251,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void bonusRollsForAStrikeInTheLastFrameMustBeRolledBeforeScoreCanBeCalculated() throws IllegalStateException {
+    public void bonusRollsForAStrikeInTheLastFrameMustBeRolledBeforeScoreCanBeCalculated() {
         int[] rolls = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10};
 
         playGame(rolls);
@@ -264,7 +264,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void bothBonusRollsForAStrikeInTheLastFrameMustBeRolledBeforeScoreCanBeCalculated() throws IllegalStateException {
+    public void bothBonusRollsForAStrikeInTheLastFrameMustBeRolledBeforeScoreCanBeCalculated() {
         int[] rolls = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 10};
 
         playGame(rolls);
@@ -277,7 +277,7 @@ public class BowlingTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void bonusRollForASpareInTheLastFrameMustBeRolledBeforeScoreCanBeCalculated() throws IllegalStateException {
+    public void bonusRollForASpareInTheLastFrameMustBeRolledBeforeScoreCanBeCalculated() {
         int[] rolls = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 3};
 
         playGame(rolls);

data/tracks/java/exercises/collatz-conjecture/src/main/java/CollatzCalculator.java

@@ -0,0 +1,7 @@
+class CollatzCalculator {
+
+    int computeStepCount(int start) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+}

data/tracks/java/exercises/difference-of-squares/src/main/java/DifferenceOfSquaresCalculator.java

@@ -0,0 +1,15 @@
+class DifferenceOfSquaresCalculator {
+
+    int computeSquareOfSumTo(int input) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    int computeSumOfSquaresTo(int input) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    int computeDifferenceOfSquares(int input) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+}

data/tracks/python/exercises/beer-song/example.py

@@ -8,8 +8,8 @@ def song(first, last=0):
 
 def verse(number):
     return ''.join([
-        "%s of beer on the wall, " % _bottles(number).capitalize(),
-        "%s of beer.\n" % _bottles(number),
+        "{} of beer on the wall, ".format(_bottles(number).capitalize()),
+        "{} of beer.\n".format(_bottles(number)),
         _action(number),
         _next_bottle(number),
     ])
@@ -19,13 +19,15 @@ def _action(current_verse):
     if current_verse == 0:
         return "Go to the store and buy some more, "
     else:
-        return "Take %s down and pass it around, " % (
-            "one" if current_verse > 1 else "it"
+        return "Take {} down and pass it around, ".format(
+            "one" if current_verse > 1 else "it",
         )
 
 
 def _next_bottle(current_verse):
-    return "%s of beer on the wall.\n" % _bottles(_next_verse(current_verse))
+    return "{} of beer on the wall.\n".format(
+        _bottles(_next_verse(current_verse)),
+    )
 
 
 def _bottles(number):
@@ -34,7 +36,7 @@ def _bottles(number):
     if number == 1:
         return '1 bottle'
     else:
-        return '%d bottles' % number
+        return '{} bottles'.format(number)
 
 
 def _next_verse(current_verse):

data/tracks/python/exercises/clock/example.py

@@ -8,7 +8,7 @@ class Clock(object):
         self.cleanup()
 
     def __repr__(self):
-        return "%02d:%02d" % (self.hour, self.minute)
+        return "{:02d}:{:02d}".format(self.hour, self.minute)
 
     def __eq__(self, other):
         return repr(self) == repr(other)

data/tracks/python/exercises/nucleotide-count/example.py

@@ -15,4 +15,4 @@ def nucleotide_counts(strand):
 
 def _validate(abbreviation):
     if abbreviation not in NUCLEOTIDES:
-        raise ValueError('%s is not a nucleotide.' % abbreviation)
+        raise ValueError('{} is not a nucleotide.'.format(abbreviation))

data/tracks/python/exercises/phone-number/example.py

@@ -9,15 +9,15 @@ class Phone(object):
         self.subscriber_number = self.number[-4:]
 
     def pretty(self):
-        return "(%s) %s-%s" % (
+        return "({}) {}-{}".format(
             self.area_code,
             self.exchange_code,
-            self.subscriber_number
+            self.subscriber_number,
         )
 
     def _clean(self, number):
         return self._normalize(
-            re.sub(r'[^\d]', '', number)
+            re.sub(r'[^\d]', '', number),
         )
 
     def _normalize(self, number):

data/tracks/python/exercises/protein-translation/example.py

@@ -8,7 +8,7 @@ CODONS = {'AUG': "Methionine", 'UUU': "Phenylalanine",
 
 def of_codon(codon):
     if codon not in CODONS:
-        raise ValueError('Invalid codon: %s' % codon)
+        raise ValueError('Invalid codon: {}'.format(codon))
     return CODONS[codon]
 
 

data/tracks/python/exercises/say/example.py

@@ -12,7 +12,7 @@ def say(number, recursive=False):
     if number < 0:
         raise ValueError('number is negative')
     if number >= t:
-        raise ValueError('number is too large: %s' % str(number))
+        raise ValueError('number is too large: {}'.format(number))
 
     if number < 20:
         return small[number] if not recursive else 'and ' + small[number]

data/tracks/python/exercises/two-fer/example.py

@@ -2,4 +2,4 @@ def two_fer(name=""):
     if not name.strip():
         return "One for you, one for me."
     else:
-        return "One for %s, one for me." % name
+        return "One for {}, one for me.".format(name)

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

@@ -64,7 +64,7 @@ class Board
   def validate_size
     len = rows.first.length
     if rows.any? { |row| row.length != len }
-      fail ValueError, 'Invalid board'
+      fail ArgumentError, 'Invalid board'
     end
   end
 
@@ -73,7 +73,7 @@ class Board
       invalid = row.chars.any? do |char|
         !VALID_BORDERS.include?(char)
       end
-      fail ValueError, 'Invalid board' if invalid
+      fail ArgumentError, 'Invalid board' if invalid
     end
   end
 
@@ -82,9 +82,7 @@ class Board
       invalid = row.chars.any? do |char|
         !VALID_DATA.include?(char)
       end
-      fail ValueError, 'Invalid board' if invalid
+      fail ArgumentError, 'Invalid board' if invalid
     end
   end
 end
-
-ValueError = Class.new(StandardError)

data/tracks/ruby/exercises/minesweeper/minesweeper_test.rb

@@ -73,7 +73,7 @@ class MinesweeperTest < Minitest::Test
   def test_different_len
     skip
     inp = ['+-+', '| |', '|*  |', '|  |', '+-+']
-    assert_raises(ValueError) do
+    assert_raises(ArgumentError) do
       Board.transform(inp)
     end
   end
@@ -81,7 +81,7 @@ class MinesweeperTest < Minitest::Test
   def test_faulty_border
     skip
     inp = ['+-----+', '*   * |', '+-- --+']
-    assert_raises(ValueError) do
+    assert_raises(ArgumentError) do
       Board.transform(inp)
     end
   end
@@ -89,7 +89,7 @@ class MinesweeperTest < Minitest::Test
   def test_invalid_char
     skip
     inp = ['+-----+', '|X  * |', '+-----+']
-    assert_raises(ValueError) do
+    assert_raises(ArgumentError) do
       Board.transform(inp)
     end
   end

data/tracks/scala/config.json

@@ -34,18 +34,6 @@
         "Mathematics"
       ]
     },
-    {
-      "uuid": "825e94e5-6fc8-4dce-befe-74e1516fae14",
-      "slug": "flatten-array",
-      "core": true,
-      "unlocked_by": null,
-      "difficulty": 2,
-      "topics": [
-        "Recursion",
-        "Lists",
-        "Pattern matching"
-      ]
-    },
     {
       "uuid": "57b76aba-a485-464d-84ba-e9a445b25be6",
       "slug": "bob",
@@ -94,6 +82,18 @@
         "Transforming"
       ]
     },
+    {
+      "uuid": "825e94e5-6fc8-4dce-befe-74e1516fae14",
+      "slug": "flatten-array",
+      "core": true,
+      "unlocked_by": "accumulate",
+      "difficulty": 2,
+      "topics": [
+        "Recursion",
+        "Lists",
+        "Pattern matching"
+      ]
+    },
     {
       "uuid": "65a76aba-a485-222d-84ba-e9a445b25be6",
       "slug": "collatz-conjecture",

data/tracks/scala/exercises/flatten-array/src/test/scala/FlattenArrayTest.scala

@@ -1,18 +1,15 @@
 import org.scalatest.{Matchers, FunSuite}
 
+/** @version 1.1.0 */
 class FlattenArrayTest extends FunSuite with Matchers {
-  test("empty list") {
-    FlattenArray.flatten(List()) should equal(List())
-  }
 
   test("no nesting") {
-    pending
-    FlattenArray.flatten(List(0, 1, 2)) should equal(List(0, 1, 2))
+    FlattenArray.flatten(List(0, 1, 2)) should be(List(0, 1, 2))
   }
 
   test("flattens array with just integers present") {
     pending
-    FlattenArray.flatten(List(1, List(2, 3, 4, 5, 6, 7), 8)) should equal(
+    FlattenArray.flatten(List(1, List(2, 3, 4, 5, 6, 7), 8)) should be(
       List(1, 2, 3, 4, 5, 6, 7, 8))
   }
 
@@ -21,7 +18,7 @@ class FlattenArrayTest extends FunSuite with Matchers {
     FlattenArray.flatten(List(0,
                               2,
                               List(List(2, 3), 8, 100, 4, List(List(List(50)))),
-                              -2)) should equal(
+                              -2)) should be(
       List(0, 2, 2, 3, 8, 100, 4, 50, -2))
   }
 
@@ -30,7 +27,7 @@ class FlattenArrayTest extends FunSuite with Matchers {
     FlattenArray.flatten(List(
       1,
       List(2, List(List(3)), List(4, List(List(5))), 6, 7),
-      8)) should equal(List(1, 2, 3, 4, 5, 6, 7, 8))
+      8)) should be(List(1, 2, 3, 4, 5, 6, 7, 8))
   }
 
   test("6 level nest list with null values") {
@@ -39,7 +36,7 @@ class FlattenArrayTest extends FunSuite with Matchers {
       List(0,
            2,
            List(List(2, 3), 8, List(List(100)), null, List(List(null))),
-           -2)) should equal(List(0, 2, 2, 3, 8, 100, -2))
+           -2)) should be(List(0, 2, 2, 3, 8, 100, -2))
   }
 
   test("all values in nested list are null") {
@@ -50,6 +47,6 @@ class FlattenArrayTest extends FunSuite with Matchers {
            null,
            null,
            List(List(null, null), null),
-           null)) should equal(List())
+           null)) should be(List())
   }
 }

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

@@ -0,0 +1,44 @@
+import java.io.File
+
+import testgen.TestSuiteBuilder._
+import testgen._
+
+object FlattenArrayTestGenerator {
+  def main(args: Array[String]): Unit = {
+    val file = new File("src/main/resources/flatten-array.json")
+
+    def sutArgs(parseResult: CanonicalDataParser.ParseResult, argNames: String*): String =
+      argNames map (name => toArgString(parseResult(name))) mkString ", "
+
+    def toArgString(any: Any): String = {
+      any match {
+        case xs: List[Any] => s"List(${xs.map(x => toArgString(x)).mkString(", ")})"
+        case null => "null"
+        case _ => any.toString
+      }
+    }
+
+    def toExpectedString(expected: CanonicalDataParser.Expected): String = {
+      expected match {
+        case Left(_) => throw new IllegalStateException()
+        case Right(xs: List[Any]) => s"List(${xs.mkString(", ")})"
+      }
+    }
+
+    def fromLabeledTest(argNames: String*): ToTestCaseData =
+      withLabeledTest { sut =>
+        labeledTest =>
+          val args = sutArgs(labeledTest.result, argNames: _*)
+          val property = labeledTest.property
+          val sutCall =
+            s"""$sut.$property($args)"""
+          val expected = toExpectedString(labeledTest.expected)
+          TestCaseData(labeledTest.description, sutCall, expected)
+      }
+
+    val code = TestSuiteBuilder.build(file, fromLabeledTest("input"))
+    println(s"-------------")
+    println(code)
+    println(s"-------------")
+  }
+}

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.70
+  version: 2.2.1.71
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-11-22 00:00:00.000000000 Z
+date: 2017-11-23 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -7103,7 +7103,7 @@ files:
 - tracks/java/exercises/collatz-conjecture/.meta/version
 - tracks/java/exercises/collatz-conjecture/README.md
 - tracks/java/exercises/collatz-conjecture/build.gradle
-- tracks/java/exercises/collatz-conjecture/src/main/java/.keep
+- tracks/java/exercises/collatz-conjecture/src/main/java/CollatzCalculator.java
 - tracks/java/exercises/collatz-conjecture/src/test/java/CollatzCalculatorTest.java
 - tracks/java/exercises/complex-numbers/.meta/src/reference/java/ComplexNumber.java
 - tracks/java/exercises/complex-numbers/.meta/version
@@ -7132,7 +7132,7 @@ files:
 - tracks/java/exercises/difference-of-squares/.meta/version
 - tracks/java/exercises/difference-of-squares/README.md
 - tracks/java/exercises/difference-of-squares/build.gradle
-- tracks/java/exercises/difference-of-squares/src/main/java/.keep
+- tracks/java/exercises/difference-of-squares/src/main/java/DifferenceOfSquaresCalculator.java
 - tracks/java/exercises/difference-of-squares/src/test/java/DifferenceOfSquaresCalculatorTest.java
 - tracks/java/exercises/etl/.meta/src/reference/java/Etl.java
 - tracks/java/exercises/etl/README.md
@@ -12808,6 +12808,7 @@ files:
 - tracks/scala/testgen/src/main/scala/DifferenceOfSquaresTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/DominoesTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/EtlTestGenerator.scala
+- tracks/scala/testgen/src/main/scala/FlattenArrayTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/FoodChainTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/ForthTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/GigasecondTestGenerator.scala