trackler 2.2.1.81 → 2.2.1.82

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 67d0e697aee437549490f2f2fa2317d50c6928c9
-  data.tar.gz: 3c8676d47566866f6c39a3b8a40d62d22b61dfce
+  metadata.gz: 77a630fcfa462bfc7fa0f65bb947f2b899102fac
+  data.tar.gz: 0c4d25df70028b4bfcd486fb3841743c031f638e
 SHA512:
-  metadata.gz: d20743d31dae794881a3465cd25511a31be7061dc41c022479d5b1ad90dd87eb3fd76c7eb9c024ec72a31b4a475758a7a7c80727c44ee3da8d7d3eaf84fd26fb
-  data.tar.gz: 335ed690b69a16707ac760378e2edcfe159c77edc1a6fe1ca438e11fa285f47da5a60dbe1e7f80958a6ff94aa9950ee87cc426df202c60f6c06bf99562351463
+  metadata.gz: 84d23785bb597fcd2212917cfb1237ae8065a302e8765877fa87f5837f04d54ed3187ba34553463429f2a5207b00b2b8ddd76db76728580f5042bf2b3b415bc5
+  data.tar.gz: 3d1c4fd648179adeffa83eb0acca07a547a807285d93d99a9acf8d0d238b7c6fb25fe2bcd9601fd7a7cdf2dce75264ceec9949dfc7c2e0ac9ab15b73102e4c51

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.81"
+  VERSION = "2.2.1.82"
 end

data/tracks/bash/exercises/triangle/triangle_test.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bats
 
 # Test Equilateral
 @test "true if all sides are equal" {

data/tracks/common-lisp/config.json

@@ -10,7 +10,7 @@
         "transforming"
       ],
       "unlocked_by": null,
-      "uuid": "6efa02be-0f9e-1d80-7efb-536d383535c98b1d883"
+      "uuid": "a999c375-f2e2-4d47-a9e2-5af923cd46d1"
     },
     {
       "core": true,
@@ -456,4 +456,4 @@
     "bank-account"
   ],
   "language": "Common Lisp"
-}
+}

data/tracks/cpp/config.json

@@ -407,7 +407,7 @@
         "strings"
       ],
       "unlocked_by": null,
-      "uuid": "ba4e0186-0389-af80-d3e4-695dfc4e63bff1fa503"
+      "uuid": "15c741a0-944d-4b06-a096-6af63137347a"
     },
     {
       "core": false,
@@ -418,7 +418,7 @@
         "stacks"
       ],
       "unlocked_by": null,
-      "uuid": "ce9fd8ac-0beb-1a80-4ff6-be19ce1540d905c31b7"
+      "uuid": "4a517292-3472-40f2-b4b8-5c8c25219ea5"
     },
     {
       "core": false,
@@ -429,11 +429,11 @@
         "strings"
       ],
       "unlocked_by": null,
-      "uuid": "ea8d6224-0440-6d80-1569-a04127908a200d2ecf0"
+      "uuid": "22ada9c4-a2b5-4a54-83d6-597dc3b90b89"
     }
   ],
   "foregone": [
     "point-mutations"
   ],
   "language": "C++"
-}
+}

data/tracks/elixir/config.json

@@ -803,7 +803,7 @@
         "transforming"
       ],
       "unlocked_by": null,
-      "uuid": "b0216103-000b-8480-556d-816ddca02c40810d1e9"
+      "uuid": "cf28d2b2-763e-404b-90b0-637263d3bba6"
     }
   ],
   "foregone": [

data/tracks/go/exercises/bob/.meta/gen.go

@@ -22,8 +22,10 @@ func main() {
 type js struct {
 	Cases []struct {
 		Description string
-		Input       string
-		Expected    string
+		Input       struct {
+			HeyBob string
+		}
+		Expected string
 	}
 }
 
@@ -39,7 +41,7 @@ var testCases = []struct {
 }{
 {{range .J.Cases}}{
 	{{printf "%q" .Description}},
-	{{printf "%q" .Input}},
+	{{printf "%q" .Input.HeyBob}},
 	{{printf "%q" .Expected}},
 },
 {{end}}}

data/tracks/go/exercises/bob/cases_test.go

@@ -1,8 +1,8 @@
 package bob
 
 // Source: exercism/problem-specifications
-// Commit: fef09f6 Bob: Add fifth rule (#1025)
-// Problem Specifications Version: 1.1.0
+// Commit: 6dc2014 bob: apply "input" policy
+// Problem Specifications Version: 1.2.0
 
 var testCases = []struct {
 	description string

data/tracks/go/exercises/isbn-verifier/.meta/gen.go

@@ -20,8 +20,10 @@ func main() {
 
 type OneCase struct {
 	Description string
-	Input       string
-	Expected    bool
+	Input       struct {
+		ISBN string
+	}
+	Expected bool
 }
 
 // The JSON structure we expect to be able to unmarshal into
@@ -39,6 +41,6 @@ var testCases = []struct {
 	expected bool
 	description string
 }{
-{{range .J.Cases}}{ "{{.Input}}", {{.Expected}}, "{{.Description}}"},
+{{range .J.Cases}}{ "{{.Input.ISBN}}", {{.Expected}}, "{{.Description}}"},
 {{end}}}
 `

data/tracks/go/exercises/isbn-verifier/cases_test.go

@@ -1,8 +1,8 @@
 package isbn
 
 // Source: exercism/problem-specifications
-// Commit: 3251fa6 Rename property for isbn-verifier exercise
-// Problem Specifications Version: 2.0.0
+// Commit: 4288ee0 isbn-verifier: add empty isbn case
+// Problem Specifications Version: 2.2.0
 
 var testCases = []struct {
 	isbn        string
@@ -22,4 +22,5 @@ var testCases = []struct {
 	{"3-598-21507", false, "isbn without check digit"},
 	{"3-598-21507-XX", false, "too long isbn"},
 	{"3-598-21515-X", false, "check digit of X should not be used for 0"},
+	{"", false, "empty isbn"},
 }

data/tracks/go/exercises/luhn/.meta/gen.go

@@ -22,8 +22,10 @@ func main() {
 type js struct {
 	Cases []struct {
 		Description string
-		Input       string
-		Expected    bool
+		Input       struct {
+			Value string
+		}
+		Expected bool
 	}
 }
 
@@ -39,7 +41,7 @@ var testCases = []struct {
 }{
 {{range .J.Cases}}{
 	{{printf "%q" .Description}},
-	{{printf "%q" .Input}},
+	{{printf "%q" .Input.Value}},
 	{{.Expected}},
 },
 {{end}}

data/tracks/go/exercises/luhn/cases_test.go

@@ -1,8 +1,8 @@
 package luhn
 
 // Source: exercism/problem-specifications
-// Commit: c826372 luhn: Make canonical-data.json compliant
-// Problem Specifications Version: 1.0.0
+// Commit: e0358d3 luhn: Apply new "input" policy (#1054)
+// Problem Specifications Version: 1.1.0
 
 var testCases = []struct {
 	description string
@@ -15,7 +15,7 @@ var testCases = []struct {
 		false,
 	},
 	{
-		"A single zero is invalid",
+		"a single zero is invalid",
 		"0",
 		false,
 	},

data/tracks/go/exercises/simple-cipher/simple_cipher_test.go

@@ -96,7 +96,7 @@ func TestShift(t *testing.T) {
 	// invalid shifts
 	for _, s := range []int{-27, -26, 0, 26, 27} {
 		if NewShift(s) != nil {
-			t.Fatal("NewShift(%d) returned non-nil, "+
+			t.Fatalf("NewShift(%d) returned non-nil, "+
 				"Want nil return for invalid argument.", s)
 		}
 	}

data/tracks/java/config.json

@@ -874,6 +874,18 @@
       "unlocked_by": "bank-account",
       "uuid": "38a405e8-619d-400f-b53c-2f06461fdf9d"
     },
+    {
+      "core": false,
+      "difficulty": 6,
+      "slug": "rail-fence-cipher",
+      "topics": [
+        "strings",
+        "loops",
+        "conditionals"
+      ],
+      "unlocked_by": "rotational-cipher",
+      "uuid": "6e4ad4ed-cc02-4132-973d-b9163ba0ea3d"
+    },
     {
       "core": false,
       "difficulty": 7,

data/tracks/java/exercises/parallel-letter-frequency/.meta/HINTS.md

@@ -1,3 +1,5 @@
 Single-threaded (non-concurrent) solutions can pass all tests [but the last.](https://www.youtube.com/watch?v=mJZZNHekEQw)  Your solution will be tested for concurrency by submitting it as a [Runnable](https://docs.oracle.com/javase/7/docs/api/java/lang/Runnable.html) to an [ExecutorService.](https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ExecutorService.html) Your solution must leverage multiple [Threads](https://docs.oracle.com/javase/7/docs/api/java/lang/Thread.html) to pass the final test.
 
 Java documentation on [parallel streams](https://docs.oracle.com/javase/tutorial/collections/streams/parallelism.html) may provide some help.
+
+As a stretch goal, consider if your implementation will work for characters with [diacritics or accents](https://en.wikipedia.org/wiki/Diacritic). For example, such solutions should not consider e and ë the same character. An example text for this case is [Wilhelmus](https://en.wikipedia.org/wiki/Wilhelmus), the Dutch national anthem.

data/tracks/java/exercises/parallel-letter-frequency/README.md

@@ -13,6 +13,7 @@ Single-threaded (non-concurrent) solutions can pass all tests [but the last.](ht
 
 Java documentation on [parallel streams](https://docs.oracle.com/javase/tutorial/collections/streams/parallelism.html) may provide some help.
 
+As a stretch goal, consider if your implementation will work for characters with [diacritics or accents](https://en.wikipedia.org/wiki/Diacritic). For example, such solutions should not consider e and ë the same character. An example text for this case is [Wilhelmus](https://en.wikipedia.org/wiki/Wilhelmus), the Dutch national anthem.
 
 # Running the tests
 

data/tracks/java/exercises/parallel-letter-frequency/src/test/java/ParallelLetterFrequencyTest.java

@@ -8,28 +8,6 @@ import java.util.*;
 
 public class ParallelLetterFrequencyTest {
 
-    // Poem by Friedrich Schiller. The corresponding music is the European Anthem.
-    private String OdeAnDieFreude =
-            "Freude schöner Götterfunken\n" +
-                    "Tochter aus Elysium,\n" +
-                    "Wir betreten feuertrunken,\n" +
-                    "Himmlische, dein Heiligtum!\n" +
-                    "Deine Zauber binden wieder\n" +
-                    "Was die Mode streng geteilt;\n" +
-                    "Alle Menschen werden Brüder,\n" +
-                    "Wo dein sanfter Flügel weilt.";
-
-    // Dutch national anthem
-    private String Wilhelmus =
-            "Wilhelmus van Nassouwe\n" +
-                    "ben ik, van Duitsen bloed,\n" +
-                    "den vaderland getrouwe\n" +
-                    "blijf ik tot in den dood.\n" +
-                    "Een Prinse van Oranje\n" +
-                    "ben ik, vrij, onverveerd,\n" +
-                    "den Koning van Hispanje\n" +
-                    "heb ik altijd geëerd.";
-
     // American national anthem
     private String StarSpangledBanner =
             "O say can you see by the dawn's early light,\n" +
@@ -118,7 +96,7 @@ public class ParallelLetterFrequencyTest {
     @Ignore("Remove to run test")
     @Test
     public void punctuationDoesntCount() {
-        ParallelLetterFrequency p = new ParallelLetterFrequency(OdeAnDieFreude);
+        ParallelLetterFrequency p = new ParallelLetterFrequency(StarSpangledBanner);
 
         assertFalse(p.letterCounts().containsKey((int) ','));
     }
@@ -131,21 +109,6 @@ public class ParallelLetterFrequencyTest {
         assertFalse(p.letterCounts().containsKey((int) '1'));
     }
 
-    @Ignore("Remove to run test")
-    @Test
-    public void allThreeAnthemsTogetherProduceCorrectCounts() {
-        StringBuilder b = new StringBuilder();
-        b.append(OdeAnDieFreude);
-        b.append(Wilhelmus);
-        b.append(StarSpangledBanner);
-
-        ParallelLetterFrequency p = new ParallelLetterFrequency(b.toString());
-
-        assertEquals(new Integer(49), p.letterCounts().get((int) 'a'));
-        assertEquals(new Integer(56), p.letterCounts().get((int) 't'));
-        assertEquals(new Integer(2), p.letterCounts().get((int) 'ü'));
-    }
-
     @Ignore("Remove to run test")
     @Test
     public void multipleThreadsGetUsed()

data/tracks/java/exercises/rail-fence-cipher/.meta/src/reference/java/RailFenceCipher.java

@@ -0,0 +1,64 @@
+import java.util.Arrays;
+
+class RailFenceCipher {
+
+    private int key;
+
+    RailFenceCipher(int key) {
+        this.key = key;
+    }
+
+    String getEncryptedData(String message) {
+        String[] lines = splitIntoLines(message, false);
+        StringBuilder result = new StringBuilder();
+        for (String line : lines) {
+            result.append(line);
+        }
+        return result.toString();
+    }
+
+    String getDecryptedData(String message) {
+        String[] lines = splitIntoLines(message, true);
+
+        int charCount = 0;
+        for (int i = 0; i < key; ++i) {
+            while (lines[i].contains("?")) {
+                String letter = String.valueOf(message.charAt(charCount));
+                lines[i] = lines[i].replaceFirst("\\?", letter);
+                charCount++;
+            }
+        }
+
+        StringBuilder result = new StringBuilder();
+        int lineCount = 0;
+        int direction = -1;
+        for (int i = 0; i < message.length(); ++i) {
+            String letter = String.valueOf(lines[lineCount].charAt(0));
+            lines[lineCount] = lines[lineCount].substring(1);
+            result.append(letter);
+            direction *= lineCount == 0 || lineCount == key - 1 ? -1 : 1;
+            lineCount += direction;
+        }
+        return result.toString();
+    }
+
+    private String[] splitIntoLines(String message, boolean encrypted) {
+        String[] result = generateEmptyStrings(key);
+        int lineCount = 0;
+        int direction = -1;
+        for (char c : message.toCharArray()) {
+            String letter = String.valueOf(c);
+            result[lineCount] += encrypted ? "?" : letter;
+            direction *= lineCount == 0 || lineCount == key - 1 ? -1 : 1;
+            lineCount += direction;
+        }
+        return result;
+    }
+
+    private String[] generateEmptyStrings(int num) {
+        String[] strings = new String[num];
+        Arrays.fill(strings, "");
+        return strings;
+    }
+
+}

data/tracks/java/exercises/rail-fence-cipher/README.md

@@ -0,0 +1,78 @@
+# Rail Fence Cipher
+
+Implement encoding and decoding for the rail fence cipher.
+
+The Rail Fence cipher is a form of transposition cipher that gets its name from
+the way in which it's encoded. It was already used by the ancient Greeks.
+
+In the Rail Fence cipher, the message is written downwards on successive "rails"
+of an imaginary fence, then moving up when we get to the bottom (like a zig-zag).
+Finally the message is then read off in rows.
+
+For example, using three "rails" and the message "WE ARE DISCOVERED FLEE AT ONCE",
+the cipherer writes out:
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. E . R . D . S . O . E . E . F . E . A . O . C .
+. . A . . . I . . . V . . . D . . . E . . . N . .
+```
+
+Then reads off:
+
+```text
+WECRLTEERDSOEEFEAOCAIVDEN
+```
+
+To decrypt a message you take the zig-zag shape and fill the ciphertext along the rows.
+
+```text
+? . . . ? . . . ? . . . ? . . . ? . . . ? . . . ?
+. ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? .
+. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
+```
+
+The first row has seven spots that can be filled with "WECRLTE".
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? .
+. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
+```
+
+Now the 2nd row takes "ERDSOEEFEAOC".
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. E . R . D . S . O . E . E . F . E . A . O . C .
+. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
+```
+
+Leaving "AIVDEN" for the last row.
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. E . R . D . S . O . E . E . F . E . A . O . C .
+. . A . . . I . . . V . . . D . . . E . . . N . .
+```
+
+If you now read along the zig-zag shape you can read the original message.
+
+
+
+To run the tests:
+
+```sh
+$ gradle test
+```
+
+For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
+
+
+## Source
+
+[Wikipedia](https://en.wikipedia.org/wiki/Transposition_cipher#Rail_Fence_cipher)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+i

data/tracks/java/exercises/rail-fence-cipher/build.gradle

@@ -0,0 +1,17 @@
+apply plugin: "java"
+apply plugin: "eclipse"
+apply plugin: "idea"
+
+repositories {
+    mavenCentral()
+}
+
+dependencies {
+    testCompile "junit:junit:4.12"
+}
+test {
+    testLogging {
+        exceptionFormat = 'full'
+        events = ["passed", "failed", "skipped"]
+    }
+}

data/tracks/java/exercises/rail-fence-cipher/src/test/java/RailFenceCipherTest.java

@@ -0,0 +1,55 @@
+import org.junit.Assert;
+import org.junit.Ignore;
+import org.junit.Test;
+
+public class RailFenceCipherTest {
+
+	private RailFenceCipher railFenceCipher;
+
+	@Test
+	public void encodeWithTwoRails() {
+		railFenceCipher = new RailFenceCipher(2);
+		Assert.assertEquals("XXXXXXXXXOOOOOOOOO", 
+			railFenceCipher.getEncryptedData("XOXOXOXOXOXOXOXOXO"));
+	}
+
+	@Ignore("Remove to run test")
+	@Test
+	public void encodeWithThreeRails() {
+		railFenceCipher = new RailFenceCipher(3);
+		Assert.assertEquals("WECRLTEERDSOEEFEAOCAIVDEN", 
+			railFenceCipher.getEncryptedData("WEAREDISCOVEREDFLEEATONCE"));
+	}
+
+	@Ignore("Remove to run test")
+	@Test
+	public void encodeWithEndingInTheMiddle() {
+		railFenceCipher = new RailFenceCipher(4);
+		Assert.assertEquals("ESXIEECSR", 
+			railFenceCipher.getEncryptedData("EXERCISES"));
+	}
+
+	@Ignore("Remove to run test")
+	@Test
+	public void decodeWithThreeRails() {
+		railFenceCipher = new RailFenceCipher(3);
+		Assert.assertEquals("THEDEVILISINTHEDETAILS", 
+			railFenceCipher.getDecryptedData("TEITELHDVLSNHDTISEIIEA"));
+	}
+
+	@Ignore("Remove to run test")
+	@Test
+	public void decodeWithFiveRails() {
+		railFenceCipher = new RailFenceCipher(5);
+		Assert.assertEquals("EXERCISMISAWESOME", 
+			railFenceCipher.getDecryptedData("EIEXMSMESAORIWSCE"));
+	}
+
+	@Ignore("Remove to run test")
+	@Test
+	public void decodeWithSixRails() {
+		railFenceCipher = new RailFenceCipher(6);
+		Assert.assertEquals("112358132134558914423337761098715972584418167651094617711286", 
+			railFenceCipher.getDecryptedData("133714114238148966225439541018335470986172518171757571896261"));
+	}
+}

data/tracks/java/exercises/settings.gradle

@@ -61,6 +61,7 @@ include 'protein-translation'
 include 'proverb'
 include 'pythagorean-triplet'
 include 'queen-attack'
+include 'rail-fence-cipher'
 include 'raindrops'
 include 'rectangles'
 include 'reverse-string'

data/tracks/ruby/Gemfile

@@ -1,7 +1,7 @@
 source 'https://rubygems.org'
 
 gem 'minitest'
-gem 'rubocop', '0.36.0'
-gem 'simplecov'
 gem 'rake'
 gem 'require_all'
+gem 'rubocop', '0.36.0'
+gem 'simplecov'

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.81
+  version: 2.2.1.82
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-12-31 00:00:00.000000000 Z
+date: 2018-01-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -7556,6 +7556,11 @@ files:
 - tracks/java/exercises/queen-attack/build.gradle
 - tracks/java/exercises/queen-attack/src/main/java/.keep
 - tracks/java/exercises/queen-attack/src/test/java/QueenAttackCalculatorTest.java
+- tracks/java/exercises/rail-fence-cipher/.meta/src/reference/java/RailFenceCipher.java
+- tracks/java/exercises/rail-fence-cipher/README.md
+- tracks/java/exercises/rail-fence-cipher/build.gradle
+- tracks/java/exercises/rail-fence-cipher/src/main/java/.keep
+- tracks/java/exercises/rail-fence-cipher/src/test/java/RailFenceCipherTest.java
 - tracks/java/exercises/raindrops/.meta/src/reference/java/RaindropConverter.java
 - tracks/java/exercises/raindrops/README.md
 - tracks/java/exercises/raindrops/build.gradle
@@ -11535,7 +11540,6 @@ files:
 - tracks/racket/exercises/word-count/word-count.rkt
 - tracks/racket/img/icon.png
 - tracks/ruby/.git
-- tracks/ruby/.github/ISSUE_TEMPLATE.md
 - tracks/ruby/.github/stale.yml
 - tracks/ruby/.gitignore
 - tracks/ruby/.rubocop.yml

data/tracks/ruby/.github/ISSUE_TEMPLATE.md

@@ -1,43 +0,0 @@
-<!--- Provide a general summary of the issue in the Title above -->
-
-## Expected Behavior
-<!--- If you're describing a bug, tell us what should happen -->
-<!--- If you're suggesting a change/improvement, tell us how it should work -->
-
-## Current Behavior
-<!--- If describing a bug, tell us what happens instead of the expected behavior -->
-<!--- If suggesting a change/improvement, explain the difference from current behavior -->
-
-## Possible Solution
-<!--- Not obligatory, but suggest a fix/reason for the bug, -->
-<!--- or ideas how to implement the addition or change -->
-
-## Steps to Reproduce (for bugs)
-<!--- Provide a link to a live example, or an unambiguous set of steps to -->
-<!--- reproduce this bug. Include code to reproduce, if relevant -->
-1.
-2.
-3.
-4.
-
-## Context
-<!--- How has this issue affected you? What are you trying to accomplish? -->
-<!--- Providing context helps us come up with a solution that is most useful in the real world -->
-
-## Your Environment
-<!--- Include as many relevant details about the environment you experienced the bug in -->
-* Version used:
-* Environment name and version (e.g. Chrome 39, node.js 5.4):
-* Operating System and version (desktop or mobile):
-* Link to your project:
-
-## Task List
-
-* [ ] First Task
-* [ ] Second Task
-* [ ] Third Task
-
-## References and Closures
-
-<!--- references #000 -->
-<!--- closes #000 -->