trackler 2.2.1.91 → 2.2.1.92

data/tracks/fortran/README.md

@@ -62,7 +62,7 @@ Please keep the following in mind:
 - Exercises should use only the Fortran core libraries.
 
 - Please do not add a README or README.md file to the exercise directory. The READMEs are constructed using shared metadata, which lives in the
-[exercism/x-common](https://github.com/exercism/x-common) repository. Further explanation can be found in [fixing-exercise-readmes](https://github.com/exercism/exercism.io/blob/master/docs/fixing-exercise-readmes.md)
+[exercism/x-common](https://github.com/exercism/x-common) repository. Further explanation can be found in [fixing-exercise-readmes](https://github.com/exercism/docs/blob/master/language-tracks/exercises/anatomy/readmes.md)
 
 - Each exercise should have a test suite, an example solution, a template file for the real implementation and ... (anything else that needs to go with each exercise for this track). The CI build expects files to be named using the following convention: (describe the Fortran convention for naming the various files that make up an exercise).
 

data/tracks/fsharp/config/exercise_readme.go.tmpl

@@ -4,9 +4,6 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
 {{- with .Spec.Credits -}}
 ## Source
 

data/tracks/java/exercises/acronym/.meta/version

@@ -1 +1 @@
-1.1.0
+1.2.0

data/tracks/java/exercises/acronym/src/test/java/AcronymTest.java

@@ -6,7 +6,7 @@ import static org.junit.Assert.assertEquals;
 public class AcronymTest {
 
     @Test
-    public void fromTitleCasedPhrases() {
+    public void basic() {
         final String phrase = "Portable Network Graphics";
         final String expected = "PNG";
         assertEquals(expected, new Acronym(phrase).get());
@@ -14,7 +14,7 @@ public class AcronymTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void fromOtherTitleCasedPhrases() {
+    public void lowercaseWords() {
         final String phrase = "Ruby on Rails";
         final String expected = "ROR";
         assertEquals(expected, new Acronym(phrase).get());
@@ -22,7 +22,7 @@ public class AcronymTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void fromPhrasesWithPunctuation() {
+    public void punctuation() {
         final String phrase = "First In, First Out";
         final String expected = "FIFO";
         assertEquals(expected, new Acronym(phrase).get());
@@ -30,7 +30,7 @@ public class AcronymTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void fromOtherPhrasesWithPunctuation() {
+    public void allCapsWords() {
         final String phrase = "PHP: Hypertext Preprocessor";
         final String expected = "PHP";
         assertEquals(expected, new Acronym(phrase).get());
@@ -38,7 +38,7 @@ public class AcronymTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void fromPhrasesWithNonAcronymAllCapsWord() {
+    public void NonAcronymAllCapsWord() {
         final String phrase = "GNU Image Manipulation Program";
         final String expected = "GIMP";
         assertEquals(expected, new Acronym(phrase).get());
@@ -46,7 +46,7 @@ public class AcronymTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void fromPhrasesWithPunctuationAndSentenceCasing() {
+    public void hyphenated() {
         final String phrase = "Complementary metal-oxide semiconductor";
         final String expected = "CMOS";
         assertEquals(expected, new Acronym(phrase).get());

data/tracks/java/exercises/raindrops/.meta/version

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

data/tracks/java/exercises/raindrops/src/test/java/RaindropConverterTest.java

@@ -20,18 +20,20 @@ public class RaindropConverterTest {
         return Arrays.asList(new Object[][]{
                 // Non-primes
                 {1, "1"},
+                {8, "8"},
                 {52, "52"},
-                {12121, "12121"},
 
                 // Numbers with 3 as a prime factor
                 {3, "Pling"},
                 {6, "Pling"},
                 {9, "Pling"},
+                {27, "Pling"},
 
                 // Numbers with 5 as a prime factor
                 {5, "Plang"},
                 {10, "Plang"},
                 {25, "Plang"},
+                {3125, "Plang"},
 
                 // Numbers with 7 as a prime factor
                 {7, "Plong"},

data/tracks/java/exercises/transpose/src/test/java/TransposeTest.java

@@ -23,7 +23,7 @@ public class TransposeTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void twoCharsInARow() {
+    public void twoCharactersInARow() {
         String input = "A1";
 
         String expected = "A" +
@@ -34,7 +34,7 @@ public class TransposeTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void twoCharsInAColumn() {
+    public void twoCharactersInAColumn() {
         String input = "A\n" +
                        "1";
 
@@ -45,7 +45,7 @@ public class TransposeTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void simpleMatrix() {
+    public void simple() {
         String input = "ABC\n" +
                        "123";
 
@@ -79,7 +79,7 @@ public class TransposeTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void firstLineLongerThanSecond() {
+    public void firstLineLongerThanSecondLine() {
         String input = "The fourth line.\n" +
                        "The fifth line.";
 
@@ -105,7 +105,7 @@ public class TransposeTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void secondLineLongerThanFirst() {
+    public void secondLineLongerThanFirstLine() {
         String input = "The first line.\n" +
                        "The second line.";
 

data/tracks/java/exercises/word-count/.meta/src/reference/java/WordCount.java

@@ -7,7 +7,7 @@ public class WordCount {
 
     public Map<String, Integer> phrase( String input ) {
         Map<String, Integer> countMap = new HashMap<>();
-        input = input.trim().toLowerCase().replaceAll("[\\W]", " ");
+        input = input.trim().toLowerCase().replaceAll("([^A-Za-z0-9']|\\B'|'\\B)", " ");
         final String[] tokenizedInput = input.split("\\s+");
         for( String aWord : tokenizedInput ) {
             Integer count = countMap.get(aWord);

data/tracks/java/exercises/word-count/.meta/version

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

data/tracks/java/exercises/word-count/src/test/java/WordCountTest.java

@@ -34,7 +34,7 @@ public class WordCountTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void countOneOfEach() {
+    public void countOneOfEachWord() {
         expectedWordCount.put("one", 1);
         expectedWordCount.put("of", 1);
         expectedWordCount.put("each", 1);
@@ -47,7 +47,7 @@ public class WordCountTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void countMultipleOccurrences() {
+    public void multipleOccurrencesOfAWord() {
         expectedWordCount.put("one", 1);
         expectedWordCount.put("fish", 4);
         expectedWordCount.put("two", 1);
@@ -59,6 +59,32 @@ public class WordCountTest {
             expectedWordCount, actualWordCount
         );
     }
+    
+    @Ignore("Remove to run test")
+    @Test
+    public void handlesCrampedLists() {
+        expectedWordCount.put("one", 1);
+        expectedWordCount.put("two", 1);
+        expectedWordCount.put("three", 1);
+
+        actualWordCount = wordCount.phrase("one,two,three");
+        assertEquals(
+            expectedWordCount, actualWordCount
+        );
+    }
+    
+    @Ignore("Remove to run test")
+    @Test
+    public void handlesExpandedLists() {
+        expectedWordCount.put("one", 1);
+        expectedWordCount.put("two", 1);
+        expectedWordCount.put("three", 1);
+
+        actualWordCount = wordCount.phrase("one,\ntwo,\nthree");
+        assertEquals(
+            expectedWordCount, actualWordCount
+        );
+    }
 
     @Ignore("Remove to run test")
     @Test
@@ -93,8 +119,52 @@ public class WordCountTest {
     @Test
     public void normalizeCase() {
         expectedWordCount.put("go", 3);
+        expectedWordCount.put("stop", 2);
+
+        actualWordCount = wordCount.phrase("go Go GO Stop stop");
+        assertEquals(
+            expectedWordCount, actualWordCount
+        );
+    }
+    
+    @Ignore("Remove to run test")
+    @Test
+    public void withApostrophes() {
+        expectedWordCount.put("first", 1);
+        expectedWordCount.put("don't", 2);
+        expectedWordCount.put("laugh", 1);
+        expectedWordCount.put("then", 1);
+        expectedWordCount.put("cry", 1);
+
+        actualWordCount = wordCount.phrase("First: don't laugh. Then: don't cry.");
+        assertEquals(
+            expectedWordCount, actualWordCount
+        );
+    }
+    
+    @Ignore("Remove to run test")
+    @Test
+    public void withQuotations() {
+        expectedWordCount.put("joe", 1);
+        expectedWordCount.put("can't", 1);
+        expectedWordCount.put("tell", 1);
+        expectedWordCount.put("between", 1);
+        expectedWordCount.put("large", 2);
+        expectedWordCount.put("and", 1);
+
+        actualWordCount = wordCount.phrase("Joe can't tell between 'large' and large.");
+        assertEquals(
+            expectedWordCount, actualWordCount
+        );
+    }
+    
+    @Ignore("Remove to run test")
+    @Test
+    public void multipleSpacesNotDetectedAsAWord() {
+        expectedWordCount.put("multiple", 1);
+        expectedWordCount.put("whitespaces", 1);
 
-        actualWordCount = wordCount.phrase("go Go GO");
+        actualWordCount = wordCount.phrase(" multiple   whitespaces");
         assertEquals(
             expectedWordCount, actualWordCount
         );

data/tracks/mips/config/exercise_readme.go.tmpl

@@ -4,9 +4,6 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
 {{- with .Spec.Credits -}}
 ## Source
 

data/tracks/perl5/config/exercise_readme.go.tmpl

@@ -4,9 +4,6 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
 {{- with .Spec.Credits -}}
 ## Source
 

data/tracks/php/exercises/roman-numerals/roman-numerals_test.php

@@ -111,7 +111,7 @@ class RomanTest extends PHPUnit\Framework\TestCase
         $this->assertSame('MXXIV', toRoman(1024));
     }
 
-    public function test2014()
+    public function test1998()
     {
         $this->markTestSkipped();
         $this->assertSame('MCMXCVIII', toRoman(1998));

data/tracks/pony/config/exercise_readme.go.tmpl

@@ -4,9 +4,6 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
 {{- with .Spec.Credits -}}
 ## Source
 

data/tracks/python/config.json

@@ -80,6 +80,20 @@
         "transforming"
       ]
     },
+    {
+      "uuid": "7961c852-c87a-44b0-b152-efea3ac8555c",
+      "slug": "isbn-verifier",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "type_conversion",
+        "conditionals",
+        "strings",
+        "integers",
+        "parsing"
+      ]
+    },
     {
       "uuid": "8648fa0c-d85f-471b-a3ae-0f8c05222c89",
       "slug": "hamming",

data/tracks/python/exercises/isbn-verifier/README.md

@@ -0,0 +1,43 @@
+# Isbn Verifier
+
+Check if a given ISBN-10 is valid.
+
+## Functionality
+
+Given an unkown string the program should check if the provided string is a valid ISBN-10.
+Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
+
+The program should allow for ISBN-10 without the separating dashes to be verified as well.
+
+## ISBN
+
+Let's take a random ISBN-10 number, say `3-598-21508-8` for this.
+The first digit block indicates the group where the ISBN belongs. Groups can consist of shared languages, geographic regions or countries. The leading '3' signals this ISBN is from a german speaking country.
+The following number block is to identify the publisher. Since this is a three digit publisher number there is a 5 digit title number for this book.
+The last digit in the ISBN is the check digit which is used to detect read errors.
+
+The first 9 digits in the ISBN have to be between 0 and 9.
+The check digit can additionally be an 'X' to allow 10 to be a valid check digit as well.
+
+A valid ISBN-10 is calculated with this formula `(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0`
+So for our example ISBN this means:
+(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 = 0
+
+Which proves that the ISBN is valid.
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory.
+
+For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`.
+
+
+For more detailed information about running tests, code style and linting,
+please see the [help page](http://exercism.io/languages/python).
+
+## Source
+
+Converting a string into a number and some basic processing utilizing a relatable real world example. [https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation](https://en.wikipedia.org/wiki/International_Standard_Book_Number)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/python/exercises/isbn-verifier/example.py

@@ -0,0 +1,8 @@
+def verify(isbn):
+    chars = list(isbn.replace('-', ''))
+    if chars and chars[-1] == 'X':
+        chars[-1] = '10'
+    if not len(chars) == 10 or not all(c.isdigit() for c in chars):
+        return False
+    indices = list(range(10, 0, -1))
+    return sum(int(c) * i for c, i in zip(chars, indices)) % 11 == 0

data/tracks/python/exercises/isbn-verifier/isbn_verifier.py

@@ -0,0 +1,2 @@
+def verify(isbn):
+    pass