trackler 2.2.1.13 → 2.2.1.14

data/tracks/groovy/config.json

@@ -78,6 +78,17 @@
         "logical operators"
       ]
     },
+    {
+      "uuid": "3227f4a2-0ffc-1480-5018-4ef3479dbcffdcf3f2b",
+      "slug": "two-fer",
+      "core": true,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "strings",
+        "control-flow (if-else statements)"
+      ]
+    },
     {
       "uuid": "307f0a89-f185-41de-9ab7-f8d7ebfa3a2b",
       "slug": "nth-prime",

data/tracks/groovy/exercises/two-fer/Example.groovy

@@ -0,0 +1,6 @@
+class TwoFer {
+
+    static String twoFer(String name) {
+        return name == null || name.isEmpty() ? "One for you, one for me." : "One for ${name}, one for me."
+    }
+}

data/tracks/groovy/exercises/two-fer/README.md

@@ -0,0 +1,62 @@
+# Two Fer
+
+`Two-fer` or `2-fer` is short for two for one. One for you and one for me.
+
+```
+"One for X, one for me."
+```
+
+When X is a name or "you".
+
+If the given name is "Alice", the result should be "One for Alice, one for me."
+If no name is given, the result should be "One for you, one for me."
+
+
+## Test-Driven Development
+
+As programmers mature, they eventually want to test their code.
+
+Here at Exercism we simulate [Test-Driven
+Development](http://en.wikipedia.org/wiki/Test-driven_development) (TDD), where
+you write your tests before writing any functionality. The simulation comes in
+the form of a pre-written test suite, which will signal that you have solved
+the problem.
+
+It will also provide you with a safety net to explore other solutions without
+breaking the functionality.
+
+### A typical TDD workflow on Exercism:
+
+1. Run the test file and pick one test that's failing.
+2. Write some code to fix the test you picked.
+3. Re-run the tests to confirm the test is now passing.
+4. Repeat from step 1.
+5. Submit your solution (`exercism submit /path/to/file`)
+
+## Instructions
+
+Submissions are encouraged to be general, within reason. Having said that, it's
+also important not to over-engineer a solution.
+
+It's important to remember that the goal is to make code as expressive and
+readable as we can.
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/groovy).
+
+Run the tests by executing the test script.
+
+```
+$ groovy ./TwoFerSpec.groovy
+```
+
+After the first test(s) pass, continue by commenting out or removing the `@Ignore` annotations prepending other tests.
+
+When all tests pass, congratulations!
+
+## Source
+
+This is an exercise to introduce users to basic programming constructs, just after hello World. [https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/groovy/exercises/two-fer/TwoFer.groovy

@@ -0,0 +1,6 @@
+class TwoFer {
+
+    static String twoFer(String name) {
+        throw UnsupportedOperionExcetion('Method is not implemented')
+    }
+}

data/tracks/groovy/exercises/two-fer/TwoFerSpec.groovy

@@ -0,0 +1,24 @@
+@Grab('org.spockframework:spock-core:1.0-groovy-2.4')
+
+import spock.lang.Specification
+
+class TwoFerSpec extends Specification {
+
+    def 'no name given'() {
+        expect: TwoFer.twoFer() == 'One for you, one for me.'
+    }
+
+    def 'empty name given'() {
+        expect: TwoFer.twoFer('') == 'One for you, one for me.'
+    }
+
+    def 'Alice given as a name'() {
+        expect:  TwoFer.twoFer('Alice') == 'One for Alice, one for me.'
+    }
+
+    def 'Bob given as name'() {
+        expect: TwoFer.twoFer('Bob') == 'One for Bob, one for me.'
+    }
+
+
+}

data/tracks/java/.travis.yml

@@ -4,7 +4,8 @@ jdk:
   - oraclejdk8
 env:
   - SCRIPT=bin/unit-tests.sh
-  - SCRIPT=bin/journey-test.sh
+
+  - SCRIPT=bin/run-journey-test-from-ci.sh
 
 # http://docs.travis-ci.com/user/migrating-from-legacy
 sudo: false
@@ -17,7 +18,6 @@ addons:
 before_install:
   - rvm install 2.2.5
   - rvm use 2.2.5
-  - bin/build-jq.sh  # we want jq 1.5 features; not avail through pkg repo.
 
 # https://docs.travis-ci.com/user/customizing-the-build#Skipping-the-Installation-Step
 install: true  # if we don't skip install, ./gradlew assemble is invoked, but this task is not available.

data/tracks/java/bin/journey-test.sh

@@ -4,6 +4,7 @@ TRACK=java
 TRACK_REPO="$TRACK"
 TRACK_SRC_EXT="java"
 CPU_CORES=`getconf NPROCESSORS_ONLN 2>/dev/null || getconf _NPROCESSORS_ONLN 2>/dev/null || echo 1`
+EXERCISES_TO_SOLVE=$@
 
 on_exit() {
   echo ">>> on_exit()"
@@ -256,6 +257,42 @@ solve_all_exercises() {
   popd
 }
 
+solve_single_exercise() {
+  local exercism_exercises_dir="$1"
+  local exercism_configfile="$2"
+  local exercise_to_solve="$3"
+  echo ">>> solve_all_exercises(exercism_exercises_dir=\"${exercism_exercises_dir}\", exercism_configfile=\"${exercism_configfile}\", exercise_to_solve=\"$exercise_to_solve\")"
+
+  local track_root=$( pwd )
+  local exercism_cli="./exercism --config ${exercism_configfile}"
+  local tempfile="${TMPDIR:-/tmp}/journey-test.sh-unignore_all_tests.txt"
+
+  pushd ${exercism_exercises_dir}
+
+  echo -e "\n\n"
+  echo "=================================================="
+  echo "Solving ${exercise_to_solve}"
+  echo "=================================================="
+
+  ${exercism_cli} fetch ${TRACK} $exercise_to_solve
+  cp -R -H ${track_root}/exercises/${exercise_to_solve}/src/example/${TRACK}/* ${exercism_exercises_dir}/${TRACK}/${exercise_to_solve}/src/main/${TRACK}/
+
+  pushd ${exercism_exercises_dir}/${TRACK}/${exercise_to_solve}
+  # Check that tests compile before we strip @Ignore annotations
+  "$EXECPATH"/gradlew compileTestJava
+  # Ensure we run all the tests (as delivered, all but the first is @Ignore'd)
+  for testfile in `find . -name "*Test.${TRACK_SRC_EXT}"`; do
+    # Strip @Ignore annotations to ensure we run the tests (as delivered, all but the first is @Ignore'd).
+    # Note that unit-test.sh also strips @Ignore annotations via the Gradle task copyTestsFilteringIgnores.
+    # The stripping implementations here and in copyTestsFilteringIgnores should be kept consistent.
+    sed 's/@Ignore\(\(.*\)\)\{0,1\}//' ${testfile} > "${tempfile}" && mv "${tempfile}" "${testfile}"
+  done
+  "$EXECPATH"/gradlew test
+  popd
+
+  popd
+}
+
 main() {
   # all functions assume current working directory is repository root.
   cd "${SCRIPTPATH}/.."
@@ -296,7 +333,13 @@ main() {
   # Create a CLI install and config just for this build; this script does not use your CLI install.
   configure_exercism_cli "${exercism_home}" "${exercism_configfile}" "${xapi_port}"
 
-  solve_all_exercises "${exercism_home}" "${exercism_configfile}"
+  if [[ $EXERCISES_TO_SOLVE == "" ]]; then
+    solve_all_exercises "${exercism_home}" "${exercism_configfile}"
+  else
+    for exercise in $EXERCISES_TO_SOLVE
+      do solve_single_exercise "${exercism_home}" "${exercism_configfile}" "${exercise}"
+    done
+  fi
 }
 
 ##########################################################################

data/tracks/java/bin/run-journey-test-from-ci.sh

@@ -0,0 +1,28 @@
+#!/bin/bash
+
+bin/build-jq.sh
+
+pr_files_json=`curl -s https://api.github.com/repos/exercism/java/pulls/${TRAVIS_PULL_REQUEST}/files`
+
+# if jq fails to get the required data, then that means TRAVIS_PULL_REQUEST was not set (not run in travis-ci),
+# or was false (not a pull request). In that case, we should fall back with testing every exercise
+
+modded_files=`echo $pr_files_json | bin/jq -r '.[].filename'` || bin/journey-test.sh
+
+for file in $modded_files
+  do if [[ $file == exercises* ]] || [[ $file == config.json ]]
+    then
+    for file2 in $modded_files
+      do if [[ $file2 == exercises* ]]
+        then modded_exercise=${file2#exercises/}
+        modded_exercise=${modded_exercise%%/*}
+        if [[ $last_modded_exercise != $modded_exercise ]]
+          then modded_exercises=$modded_exercises$modded_exercise$'\n'
+        fi
+        last_modded_exercise=$modded_exercise
+      fi
+    done
+    bin/journey-test.sh $modded_exercises
+    break
+  fi
+done

data/tracks/java/exercises/change/src/test/java/ChangeCalculatorTest.java

@@ -8,6 +8,9 @@ import static java.util.Collections.emptyList;
 import static java.util.Collections.singletonList;
 import static org.junit.Assert.assertEquals;
 
+/*
+ * version: 1.1.0
+ */
 public class ChangeCalculatorTest {
 
     @Rule
@@ -35,7 +38,7 @@ public class ChangeCalculatorTest {
     @Ignore("Remove to run test")
     @Test
     // https://en.wikipedia.org/wiki/Change-making_problem#Greedy_method
-    public void testLilliputianCurrencyForWhichGreedyAlgorithmFails() {
+    public void testLilliputianCurrency() {
         ChangeCalculator changeCalculator = new ChangeCalculator(asList(1, 4, 15, 20, 50));
 
         assertEquals(
@@ -46,7 +49,7 @@ public class ChangeCalculatorTest {
     @Ignore("Remove to run test")
     @Test
     // https://en.wikipedia.org/wiki/Change-making_problem#Greedy_method
-    public void testLowerElbonianCurrencyForWhichGreedyAlgorithmFails() {
+    public void testLowerElbonianCurrency() {
         ChangeCalculator changeCalculator = new ChangeCalculator(asList(1, 5, 10, 21, 25));
 
         assertEquals(
@@ -64,6 +67,28 @@ public class ChangeCalculatorTest {
                 changeCalculator.computeMostEfficientChange(999));
     }
 
+    @Ignore("Remove to run test")
+    @Test
+    // https://en.wikipedia.org/wiki/Change-making_problem#Greedy_method
+    public void testPossibleChangeWithoutUnitCoinAvailable() {
+        ChangeCalculator changeCalculator = new ChangeCalculator(asList(2, 5, 10, 20, 50));
+
+        assertEquals(
+                asList(2, 2, 2, 5, 10),
+                changeCalculator.computeMostEfficientChange(21));
+    }
+
+    @Ignore("Remove to run test")
+    @Test
+    // https://en.wikipedia.org/wiki/Change-making_problem#Greedy_method
+    public void testAnotherPossibleChangeWithoutUnitCoinAvailable() {
+        ChangeCalculator changeCalculator = new ChangeCalculator(asList(4, 5));
+
+        assertEquals(
+                asList(4, 4, 4, 5, 5, 5),
+                changeCalculator.computeMostEfficientChange(27));
+    }
+
     @Ignore("Remove to run test")
     @Test
     public void testZeroChange() {

data/tracks/java/exercises/pig-latin/src/example/java/PigLatinTranslator.java

@@ -2,26 +2,23 @@ import java.util.Arrays;
 import java.util.List;
 import java.util.stream.Collectors;
 
-public class PigLatinTranslator {
-
-    public static final String AY = "ay";
-    public static final String THR = "thr";
-    public static final String SCH = "sch";
-    public static final String CH = "ch";
-    public static final String QU = "qu";
-    public static final String TH = "th";
-    public static final String QUAY = "quay";
-    public static final String XR = "xr";
-    public static final String YT = "yt";
-    public static final String VOWELS_REGEX = "[aeiou]";
-
-    public String translate(String sentence) {
-        List<String> translatedWords = Arrays.asList(sentence.split(" "))
-                .stream()
-                .map(x -> translateWord(x))
-                .collect(Collectors.toList());
-
-        return String.join(" ", translatedWords);
+class PigLatinTranslator {
+
+    private static final String AY = "ay";
+    private static final String THR = "thr";
+    private static final String SCH = "sch";
+    private static final String CH = "ch";
+    private static final String QU = "qu";
+    private static final String TH = "th";
+    private static final String QUAY = "quay";
+    private static final String XR = "xr";
+    private static final String YT = "yt";
+    private static final String VOWELS_REGEX = "[aeiou]";
+
+    String translate(String sentence) {
+        return Arrays.stream(sentence.split(" "))
+                .map(this::translateWord)
+                .collect(Collectors.joining(" "));
     }
 
     private String translateWord(String word) {

data/tracks/kotlin/exercises/accumulate/README.md

@@ -25,10 +25,7 @@ Keep your hands off that collect/map/fmap/whatchamacallit functionality
 provided by your standard library!
 Solve this one yourself using other basic tools instead.
 
-Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
-as this is idiomatic Lisp, not a library function.
-
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/acronym/README.md

@@ -8,7 +8,7 @@ Help generate some jargon by writing a program that converts a long name
 like Portable Network Graphics to its acronym (PNG).
 
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/all-your-base/README.md

@@ -31,7 +31,7 @@ I think you got the idea!
 
 *Yes. Those three numbers above are exactly the same. Congratulations!*
 
-
+
 
 
 ## Submitting Incomplete Solutions

data/tracks/kotlin/exercises/allergies/README.md

@@ -30,7 +30,7 @@ ignore those components of the score.  For example, if the allergy
 score is 257, your program should only report the eggs (1) allergy.
 
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/anagram/README.md

@@ -6,7 +6,7 @@ Given `"listen"` and a list of candidates like `"enlists" "google"
 "inlets" "banana"` the program should return a list containing
 `"inlets"`.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/atbash-cipher/README.md

@@ -27,7 +27,7 @@ things based on word boundaries.
 - Decoding `gvhg` gives `test`
 - Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/bank-account/README.md

@@ -26,7 +26,7 @@ it.
 
 Have fun!
 
-
+
 
 
 ## Submitting Incomplete Solutions

data/tracks/kotlin/exercises/beer-song/README.md

@@ -320,7 +320,7 @@ are some additional things you could try:
 Then please share your thoughts in a comment on the submission. Did this
 experiment make the code better? Worse? Did you learn anything from it?
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/binary-search/README.md

@@ -34,7 +34,7 @@ A binary search halves the number of items to check with each iteration,
 so locating an item (or determining its absence) takes logarithmic time.
 A binary search is a dichotomic divide and conquer search algorithm.
 
-
+
 
 ## Source