trackler 2.1.0.19 → 2.1.0.20

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 2d6ac1a44061082046f6a5d3b58fd73dfebf3fbd
-  data.tar.gz: 96a6b24af274b1524bfc6264aabf63f6fb3d9bb8
+  metadata.gz: f87268f3d1befaae03d6be8ac007d0728f59a122
+  data.tar.gz: 54c2c7df1d551ac6082730d8daa399d82fc18886
 SHA512:
-  metadata.gz: 0e5f615e31da2f867efd6f40d40e526ca1497c909670527e226bf3c21568ac232845a36bd293c7bc3acb537adff990c83c9316bae4890361b3619629ba81046c
-  data.tar.gz: 1ccb4b4aa381b721b6acf5337ded3154970e7c00f80011db5c9212ed73c6e37c67e5461a1101a004fd5c82da8d447ea1a3d942148d5b6074058b73616da5a6f1
+  metadata.gz: 4f32ea0316601002cd7b6e36d6d67b2ebacc550f8e975761b436a33b5679e26f76da9aa8be03bbce38b58c2574dfd5c67b8f43a07da8ec97954a89e0eb0dee28
+  data.tar.gz: afa5fb4fda304732356033a7fc863a5417427e3f8ab0a2512922572a31418a7cd17c2bb67da348ae89c41a434949e7c6f7f9553138802e4a53c90b95c69197fb

data/bin/verify-metadata

@@ -6,7 +6,7 @@ require_relative '../lib/trackler'
 
 missing_problems = []
 Trackler.tracks.reject do |track|
-  missing_problems += track.problems.reject(&:exists?)
+  missing_problems += track.implementations.reject(&:exists?)
 end
 
 missing_problems = missing_problems.uniq

data/lib/trackler/implementation.rb

@@ -13,6 +13,7 @@ module Trackler
 
     extend Forwardable
     def_delegators :@problem, :name, :blurb, :description, :source_markdown, :slug, :source, :metadata, :root, :active?, :deprecated?, :source_url, :description_url, :canonical_data_url, :metadata_url
+    def_delegators :@track, :language
 
     def initialize(track, problem)
       @track = track
@@ -39,15 +40,6 @@ module Trackler
       }].merge("README.md" => readme)
     end
 
-    def files=(value)
-      warn "DEPRECATION WARNING: 'Implementation#files=' is no longer public, please use 'implementation.merge_files' instead."
-      @files = value
-    end
-
-    def merge_files(new_files)
-      files.merge!(new_files)
-    end
-
     def zip
       @zip ||= file_bundle.zip do |io|
         io.put_next_entry('README.md')

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.1.0.19"
+  VERSION = "2.1.0.20"
 end

data/tracks/go/exercises/tree-building/tree_test.go

@@ -226,7 +226,7 @@ func TestMakeTreeSuccess(t *testing.T) {
 		}
 		if !reflect.DeepEqual(actual, tt.expected) {
 			t.Fatalf("Build for test case %q returned %s but was expected to return %s.",
-				tt.name, tt.expected, actual)
+				tt.name, actual, tt.expected)
 		}
 	}
 }

data/tracks/haskell/.travis.yml

@@ -6,6 +6,7 @@ addons:
       - libgmp-dev       # Stack's GHC depends on this.
 
 cache:
+  timeout: 600           # The cache is too big to upload in 180 seconds.
   directories:
     - $HOME/.stack       # Global stack's cache.
     - $HOME/.foldercache # Per exercise `.stack-work` cache.

data/tracks/haskell/bin/test-example

@@ -22,7 +22,15 @@ cleanup() {
 }
 trap cleanup EXIT INT TERM
 
-cp -R -L ${exercisedir}/stack.yaml ${exercisedir}/test ${exampledir}/* "${buildfolder}"
+cp -R -L                      \
+    ${exercisedir}/stack.yaml \
+    ${exercisedir}/test       \
+    ${exampledir}/*           \
+    "${buildfolder}"
+
+if [ -d ${exercisedir}/bench ]; then
+    cp -R -L ${exercisedir}/bench "${buildfolder}"
+fi
 
 cd $buildfolder
 
@@ -39,10 +47,12 @@ exampletype=$(echo "$examplename" | cut -d- -f1)
 
 runstack () {
     # SET_RESOLVER passed by .travis.yml - sets --resolver if not current.
-    stack "$@" ${SET_RESOLVER} `# Select the correct resolver. `\
-               --install-ghc   `# Download GHC if not in cache.`\
-               --no-terminal   `# Terminal detection is broken.`\
-               --pedantic      `# Enable -Wall and -Werror.    `
+    stack "$@" ${SET_RESOLVER}     `# Select the correct resolver. `\
+               --install-ghc       `# Download GHC if not in cache.`\
+               --no-terminal       `# Terminal detection is broken.`\
+               --bench             `# Build benchmarks, but        `\
+               --no-run-benchmarks `# do not run them.             `\
+               --pedantic          `# Enable -Wall and -Werror.    `
 }
 
 if [ "$exampletype" = "success" ]; then
@@ -66,6 +76,8 @@ elif [ "$exampletype" = "error" ]; then
     if runstack "test" "--no-run-tests"; then
         echo "${exampledir} build succeeded unexpectedly"
         exit 1
+    else
+        rm -rf "${examplecache}"
     fi
 else
     echo "unknown example type: ${exampledir}"

data/tracks/haskell/bin/test-stub

@@ -20,7 +20,16 @@ cleanup() {
 }
 trap cleanup EXIT INT TERM
 
-cp -R -L ${exercisedir}/stack.yaml ${exercisedir}/package.yaml ${exercisedir}/src ${exercisedir}/test "${buildfolder}"
+cp -R -L                        \
+    ${exercisedir}/stack.yaml   \
+    ${exercisedir}/package.yaml \
+    ${exercisedir}/src          \
+    ${exercisedir}/test         \
+    "${buildfolder}"
+
+if [ -d ${exercisedir}/bench ]; then
+    cp -R -L ${exercisedir}/bench "${buildfolder}"
+fi
 
 cd $buildfolder
 
@@ -38,6 +47,8 @@ if [ -f "${exercisedir}/.meta/DONT-TEST-STUB" ]; then
     echo "only building stub"
     stack build ${SET_RESOLVER} --install-ghc --no-terminal
 else
-    echo "testing stub"
-    stack test ${SET_RESOLVER} --install-ghc --no-terminal --no-run-tests
+    echo "building stub with everything else"
+    stack build ${SET_RESOLVER} --install-ghc --no-terminal \
+                --test  --no-run-tests                      \
+                --bench --no-run-benchmarks
 fi

data/tracks/java/exercises/build.gradle

@@ -9,14 +9,14 @@ subprojects { project ->
       java.srcDirs = ["src/example/java"]
     }
     project["compileJava"].doFirst { compileTask ->
-      println "  (source = " + compileTask.source.asPath + ")"
+      println "  (source = ${compileTask.source.asPath})"
     }
 
     starterSource {
       java.srcDirs = ["src/main/java"]
     }
     project["compileStarterSourceJava"].doFirst { compileTask ->
-      println "  (source = " + compileTask.source.asPath + ")"
+      println "  (source = ${compileTask.source.asPath})"
     }
 
     // In lieu of being able to disable @Ignore in JUnit tests, we filter
@@ -25,7 +25,7 @@ subprojects { project ->
       java.srcDirs = ["build/gen/test/java"]
     }
     project["compileTestJava"].doFirst { compileTask ->
-      println "  (source = " + compileTask.source.asPath + ")"
+      println "  (source = ${compileTask.source.asPath})"
     }
   }
 

data/tracks/java/exercises/difference-of-squares/src/test/java/DifferenceOfSquaresCalculatorTest.java

@@ -7,7 +7,7 @@ import static org.junit.Assert.assertEquals;
 /*
  * version: 1.1.0
  */
-public final class DifferenceOfSquaresCalculatorTest {
+public class DifferenceOfSquaresCalculatorTest {
 
     private DifferenceOfSquaresCalculator calculator;
 

data/tracks/javascript/config.json

@@ -75,7 +75,8 @@
     "diamond",
     "all-your-base",
     "run-length-encoding",
-    "minesweeper"
+    "minesweeper",
+    "alphametics"
   ],
   "exercises": [
     {
@@ -151,30 +152,41 @@
       "slug": "isogram",
       "difficulty": 1,
       "topics": [
+        "Strings",
+        "Filtering"
       ]
     },
     {
       "slug": "beer-song",
       "difficulty": 1,
       "topics": [
+        "Looping",
+        "Conditionals",
+        "Strings"
       ]
     },
     {
       "slug": "phone-number",
       "difficulty": 1,
       "topics": [
+        "Parsing",
+        "Transforming"
       ]
     },
     {
       "slug": "anagram",
       "difficulty": 1,
       "topics": [
+        "Strings",
+        "Filtering"
       ]
     },
     {
       "slug": "food-chain",
       "difficulty": 1,
       "topics": [
+        "Text formatting",
+        "Algorithms"
       ]
     },
     {
@@ -540,6 +552,14 @@
         "arrays",
         "algorithms"
       ]
+    },
+    {
+      "slug": "alphametics",
+      "difficulty": 7,
+      "topics": [
+        "games",
+        "algorithms"
+      ]
     }
   ],
   "deprecated": [

data/tracks/javascript/exercises/alphametics/alphametics.spec.js

@@ -0,0 +1,95 @@
+var solve = require('./alphametics');
+
+describe("Solve the alphametics puzzle", function() {
+
+  it("puzzle with three letters", function() {
+    var puzzle = "I + BB == ILL";
+    var expected = {
+      "I": 1,
+      "B": 9,
+      "L": 0
+    };
+    expect(solve(puzzle)).toEqual(expected);
+  });
+
+  xit("solution must have unique value for each letter", function() {
+    var puzzle = "A == B";
+    expect(solve(puzzle)).toBeNull();
+  });
+
+  xit("leading zero solution is invalid", function() {
+    var puzzle = "ACA + DD == BD";
+    expect(solve(puzzle)).toBeNull();
+  });
+
+  xit("puzzle with four letters", function() {
+    var puzzle = "AS + A == MOM";
+    var expected =  {
+      "A": 9,
+      "S": 2,
+      "M": 1,
+      "O": 0
+    };
+    expect(solve(puzzle)).toEqual(expected);
+  });
+
+  xit("puzzle with six letters", function() {
+    var puzzle = "NO + NO + TOO == LATE";
+    var expected =  {
+      "N": 7,
+      "O": 4,
+      "T": 9,
+      "L": 1,
+      "A": 0,
+      "E": 2
+    };
+    expect(solve(puzzle)).toEqual(expected);
+  });
+
+  xit("puzzle with seven letters", function() {
+    var puzzle = "HE + SEES + THE == LIGHT";
+    var expected =  {
+      "E": 4,
+      "G": 2,
+      "H": 5,
+      "I": 0,
+      "L": 1,
+      "S": 9,
+      "T": 7
+    };
+    expect(solve(puzzle)).toEqual(expected);
+  });
+
+  xit("puzzle with eight letters", function() {
+    var puzzle = "SEND + MORE == MONEY";
+    var expected =  {
+      "S": 9,
+      "E": 5,
+      "N": 6,
+      "D": 7,
+      "M": 1,
+      "O": 0,
+      "R": 8,
+      "Y": 2
+    };
+    expect(solve(puzzle)).toEqual(expected);
+  });
+
+  xit("puzzle with ten letters", function() {
+    var puzzle = "AND + A + STRONG + OFFENSE + AS + A + GOOD == DEFENSE";
+    var expected =   {
+      "A": 5,
+      "D": 3,
+      "E": 4,
+      "F": 7,
+      "G": 8,
+      "N": 0,
+      "O": 2,
+      "R": 1,
+      "S": 6,
+      "T": 9
+    };
+    expect(solve(puzzle)).toEqual(expected);
+  });
+
+});

data/tracks/javascript/exercises/alphametics/example.js

@@ -0,0 +1,107 @@
+function solve(puzzle) {
+  var parts = puzzle
+    .split(/[+|==]/g)
+    .map(function(o) { return o.trim(); })
+    .filter(function(o) { return o !== ""; });
+
+  if(parts.length < 3) {
+    return null;
+  }
+
+  var uniqueLetters = getUniqueLetters(parts.join(''));
+  var firstLetters = getFirstLetters(parts);
+
+  var numberCombinations = getNumberCombinations([0,1,2,3,4,5,6,7,8,9], uniqueLetters.length);
+  var permutations = getPermutations(Array(uniqueLetters.length).fill().map(function(_, i) {return i; }));
+
+  while(numberCombinations.length) {
+    var numberCombination = numberCombinations.pop();
+    for(var k = 0; k < permutations.length; k++) {
+      var newNumbers = assignNumbers(numberCombination, uniqueLetters, permutations[k]);
+      if(testNumbers(newNumbers, parts, firstLetters)) {
+        return newNumbers;
+      }
+    }
+  }
+  return null;
+}
+
+function getFirstLetters(words) {
+  return words
+    .map(function(word) { return word[0]; })
+    .filter(function (val, i, arr) { return arr.indexOf(val) === i; });
+}
+
+function assignNumbers(numbers, letters, orders) {
+  var output = {};
+  for(var i = 0; i < letters.length; i++) {
+    output[letters[i]] = numbers[orders[i]];
+  }
+  return output;
+}
+
+function getUniqueLetters(string) {
+  return string.split('').filter(function (val, i, arr) { return arr.indexOf(val) === i; });
+}
+
+function testNumbers(numbers, puzzleParts, firstLetters) {
+  var keys = Object.keys(numbers);
+  for(var i = 0; i < keys.length; i++) {
+    if(numbers[keys[i]] === 0 && firstLetters.indexOf(keys[i]) !== -1) {
+      return false;
+    }
+  }
+  var replaceRegex = new RegExp('[' + keys.join('') + ']', 'g');
+
+  puzzleParts = puzzleParts.join(',')
+    .replace(replaceRegex, function(input) { return numbers[input]; })
+    .split(',')
+    .map(function(t) {return parseInt(t);});
+
+  var total = puzzleParts.slice(puzzleParts.length-1)[0];
+  return total === puzzleParts
+      .slice(0,puzzleParts.length-1)
+      .reduce(function(acc, val) { return acc + val; },0);
+}
+
+function getPermutations(inputArr) {
+  var results = [];
+  function permute(arr, memo) {
+    var cur, memo = memo || [];
+    for (var i = 0; i < arr.length; i++) {
+      cur = arr.splice(i, 1);
+      if (arr.length === 0) {
+        results.push(memo.concat(cur));
+      }
+      permute(arr.slice(), memo.concat(cur));
+      arr.splice(i, 0, cur[0]);
+    }
+    return results;
+  }
+  return permute(inputArr);
+}
+
+function getNumberCombinations(set, k) {
+  var i, j, combs, head, tailcombs;
+  if (k > set.length || k <= 0) {
+    return [];
+  }
+  if (k === 1) {
+    combs = [];
+    for (i = 0; i < set.length; i++) {
+      combs.push([set[i]]);
+    }
+    return combs;
+  }
+  combs = [];
+  for (i = 0; i < set.length - k + 1; i++) {
+    head = set.slice(i, i + 1);
+    tailcombs = getNumberCombinations(set.slice(i + 1), k - 1);
+    for (j = 0; j < tailcombs.length; j++) {
+      combs.push(head.concat(tailcombs[j]));
+    }
+  }
+  return combs;
+}
+
+module.exports = solve;