trackler 2.1.0.53 → 2.1.0.54

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

@@ -13,7 +13,8 @@ function Bob() {
     return message[message.length - 1] === '?';
   }
 
-  this.hey = function(message) {
+  this.hey = function(input) {
+    var message = input.trim();
     if (isSilence(message)) {
       return 'Fine. Be that way!';
     } else if (isShouting(message)) {

data/tracks/javascript/exercises/list-ops/example.js

@@ -0,0 +1,76 @@
+'use strict';
+
+function List(arr) {
+  this.values = arr || [];
+}
+
+List.prototype = {
+  append: function (otherList) {
+    var appended = this.values;
+
+    for (var i = 0; i < otherList.length(); i++) {
+      appended.push(otherList.values[i]);
+    }
+
+    return new List(appended);
+  },
+
+  concat: function (otherList) {
+    return this.append(otherList);
+  },
+
+  cons: function (item, arr) {
+    var x = new List([item]);
+    var xs = new List(arr)
+    return x.append(xs).values;
+  },
+
+  foldl: function (func, start) {
+    var acc = start;
+
+    for (var i = 0; i < this.length(); i++) {
+      acc = func(this.values[i], acc);
+    }
+
+    return acc;
+  },
+
+  foldr: function (func, start) {
+    var acc = start;
+
+    for (var i = this.length() - 1; i >= 0; i--) {
+      acc = func(this.values[i], acc);
+    }
+
+    return acc;
+  },
+
+  length: function () {
+    var count = 0;
+    this.values.forEach(function () { count++; });
+
+    return count;
+  },
+
+  reverse: function () {
+    return new List(this.foldl(this.cons, []));
+  },
+
+  map: function (func, arr) {
+    var applyFuncThenCons = function (x, acc) {
+      return this.cons(func(x), acc);
+    }
+
+    return new List(this.foldr(applyFuncThenCons.bind(this), []));
+  },
+
+  filter: function (pred) {
+    var consIfPred = function (x, acc) {
+      return pred(x) ? this.cons(x, acc) : acc;
+    };
+
+    return new List(this.foldr(consIfPred.bind(this), []));
+  }
+}
+
+module.exports = List;

data/tracks/javascript/exercises/list-ops/list-ops.spec.js

@@ -0,0 +1,168 @@
+var List = require('./list-ops');
+
+describe('List', function () {
+  // predicates to filter by & functions to map
+  var isOdd = function (x) {
+    return x % 2 === 1;
+  }
+
+  var plusOne = function (x) {
+    return x + 1;
+  };
+
+  var divide = function (x, acc) {
+    return x / acc;
+  };
+
+  describe('append', function () {
+    it('appends two empty lists', function () {
+      var emptyList = new List();
+      expect(emptyList.append(emptyList).values).toEqual([]);
+    });
+
+    xit('appends an empty list to a non-empty list', function () {
+      var emptyList = new List();
+      var nonEmptyList = new List([1, 2, 3, 4]);
+      expect(emptyList.append(nonEmptyList).values).toEqual([1, 2, 3, 4]);
+    });
+
+    xit('appends two non-empty lists', function () {
+      var list1 = new List([1, 2]);
+      var list2 = new List([2, 3, 4, 5]);
+      expect(list1.append(list2).values).toEqual([1, 2, 2, 3, 4, 5]);
+    });
+  });
+
+  describe('concat', function () {
+    xit('concatenates an empty list', function () {
+      var emptyList = new List();
+      expect(emptyList.concat(emptyList).values).toEqual([]);
+    });
+
+    xit('concatenates a list of lists', function () {
+      var list1 = new List([1, 2]);
+      var list2 = new List([3]);
+      var list3 = new List([]);
+      var list4 = new List([4, 5, 6]);
+      expect(list1
+        .concat(list2)
+        .concat(list3)
+        .concat(list4).values
+      ).toEqual([1, 2, 3, 4, 5, 6]);
+    });
+  });
+
+  describe('filter', function () {
+    xit('filters an empty list by a function', function () {
+      var list = new List();
+      expect(list.filter(isOdd).values).toEqual([]);
+    });
+
+    xit('filters a non-empty list by a function', function () {
+      var list = new List([1, 2, 3, 5]);
+      expect(list.filter(isOdd).values).toEqual([1, 3, 5]);
+    });
+  });
+
+  describe('length', function () {
+    xit('finds the length of a empty list', function () {
+      var list = new List();
+      expect(list.length()).toEqual(0);
+    });
+
+    xit('finds the length of a non-empty list', function () {
+      var list = new List([1, 2, 3, 4]);
+      expect(list.length()).toEqual(4);
+    });
+  });
+
+  describe('map', function () {
+    xit('maps a function over an empty list', function () {
+      var list = new List([]);
+      expect(list.map(plusOne).values).toEqual([]);
+    });
+
+    xit('maps a function over a non-empty list', function () {
+      var list = new List([1, 3, 5, 7]);
+      expect(list.map(plusOne).values).toEqual([2, 4, 6, 8]);
+    });
+  });
+
+  describe('foldl', function () {
+    xit('folds an empty list from the left with the given function', function () {
+      var list = new List([]);
+      expect(list.foldl(divide, 2)).toEqual(2);
+    });
+
+    xit('folds a non-empty list from the left with the given function', function () {
+      var list = new List([1, 2, 3, 4]);
+      expect(list.foldl(divide, 24)).toEqual(64);
+    });
+  });
+
+  describe('foldr', function () {
+    xit('folds an empty list from the right with the given function', function () {
+      var list = new List([]);
+      expect(list.foldr(divide, 2)).toEqual(2);
+    });
+
+    xit('folds a non-empty list from the right with the given function', function () {
+      var list = new List([1, 2, 3, 4]);
+      expect(list.foldr(divide, 24)).toEqual(9);
+    });
+  });
+
+  describe('reverse', function () {
+    xit('reverses an empty list', function () {
+      var list = new List([]);
+      expect(list.reverse().values).toEqual([]);
+    });
+
+    xit('reverses a non-empty list', function () {
+      var list = new List([1, 3, 5, 7]);
+      expect(list.reverse().values).toEqual([7, 5, 3, 1]);
+    });
+  });
+
+  describe('must not call native Array function', function () {
+    var list = new List([1, 2, 3, 4]);
+    var list2 = new List([5, 1]);
+
+    beforeAll(function () {
+      spyOn(list.values, 'map').and.callThrough();
+      spyOn(list.values, 'filter').and.callThrough();
+      spyOn(list.values, 'reduce').and.callThrough();
+      spyOn(list.values, 'reduceRight').and.callThrough();
+      spyOn(list.values, 'reverse').and.callThrough();
+      spyOn(list.values, 'concat').and.callThrough();
+
+      list.length();
+      list.append(list2);
+      list.concat(list2);
+      list.reverse();
+      list.filter(isOdd);
+      list.map(plusOne);
+      list.foldl(divide, 24);
+      list.foldr(divide, 24);
+    });
+
+    xit('Array.prototype.map()', function () {
+      expect(list.values.map).not.toHaveBeenCalled();
+    });
+    xit('Array.prototype.filter()', function () {
+      expect(list.values.filter).not.toHaveBeenCalled();
+    });
+    xit('Array.prototype.reduce()', function () {
+      expect(list.values.reduce).not.toHaveBeenCalled();
+    });
+    xit('Array.prototype.reduceRight()', function () {
+      expect(list.values.reduceRight).not.toHaveBeenCalled();
+    });
+    xit('Array.prototype.concat()', function () {
+      expect(list.values.concat).not.toHaveBeenCalled();
+    });
+    xit('Array.prototype.reverse()', function () {
+      expect(list.values.reverse).not.toHaveBeenCalled();
+    });
+  });
+});

data/tracks/kotlin/bin/README.md

@@ -0,0 +1,3 @@
+# Cross-track consistency
+
+Many of these scripts are shared between the Java and Kotlin tracks. If you make an update to a script in one of these tracks, please also update the same script in the other track if appropriate. Thank you!

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

@@ -1,7 +1,5 @@
 #!/usr/bin/env bash
 
-# This script is shared between the Java and Kotlin tracks.  If you make an update to this script on
-# one track, please create a companion PR to merge it in to the other.  Thank you!
 TRACK=kotlin
 TRACK_REPO="$TRACK"
 TRACK_SRC_EXT="kt"
@@ -154,7 +152,7 @@ make_local_trackler() {
   local version=$( grep -m 1 'trackler' ${xapi_home}/Gemfile.lock | sed 's/.*(//' | sed 's/)//' )
 
   git checkout v${version}
-  git submodule init -- common
+  git submodule init -- problem-specifications
   git submodule update
 
   # Bake in local copy of this track; this is what we are testing.

data/tracks/kotlin/bin/unit-tests.sh

@@ -2,10 +2,14 @@
 set -e
 ./gradlew --version
 
+# Clean up any left-over files from a previous invocation, to avoid configlet
+# erroring when it finds an unexpected directory inside exercises.
+rm -rf ./exercises/build
+
 echo ""
 echo ">>> Running configlet..."
 bin/fetch-configlet
-bin/configlet .
+bin/configlet lint .
 
 pushd exercises
 echo ""

data/tracks/kotlin/config.json

@@ -83,6 +83,13 @@
 
       ]
     },
+    {
+      "difficulty": 3,
+      "slug": "secret-handshake",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 3,
       "slug": "perfect-numbers",
@@ -120,6 +127,13 @@
 
       ]
     },
+    {
+      "difficulty": 4,
+      "slug": "grains",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 4,
       "slug": "sieve",
@@ -141,6 +155,13 @@
 
       ]
     },
+    {
+      "difficulty": 4,
+      "slug": "saddle-points",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 4,
       "slug": "diamond",
@@ -190,6 +211,13 @@
 
       ]
     },
+    {
+      "difficulty": 5,
+      "slug": "spiral-matrix",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 5,
       "slug": "robot-name",
@@ -197,6 +225,13 @@
 
       ]
     },
+    {
+      "difficulty": 5,
+      "slug": "prime-factors",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 5,
       "slug": "allergies",
@@ -274,6 +309,13 @@
 
       ]
     },
+    {
+      "difficulty": 6,
+      "slug": "robot-simulator",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 6,
       "slug": "binary-search",
@@ -281,6 +323,13 @@
 
       ]
     },
+    {
+      "difficulty": 6,
+      "slug": "minesweeper",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 6,
       "slug": "all-your-base",
@@ -295,6 +344,13 @@
 
       ]
     },
+    {
+      "difficulty": 7,
+      "slug": "sublist",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 7,
       "slug": "clock",
@@ -309,6 +365,13 @@
 
       ]
     },
+    {
+      "difficulty": 8,
+      "slug": "complex-numbers",
+      "topics": [
+
+      ]
+    },
     {
       "difficulty": 8,
       "slug": "change",

data/tracks/kotlin/exercises/complex-numbers/build.gradle

@@ -0,0 +1,28 @@
+buildscript {
+  ext.kotlin_version = '1.1.1'
+  repositories {
+    mavenCentral()
+  }
+  dependencies {
+    classpath "org.jetbrains.kotlin:kotlin-gradle-plugin:$kotlin_version"
+  }
+}
+
+apply plugin: 'kotlin'
+
+repositories {
+  mavenCentral()
+}
+
+dependencies {
+  compile "org.jetbrains.kotlin:kotlin-stdlib:$kotlin_version"
+
+  testCompile 'junit:junit:4.12'
+  testCompile "org.jetbrains.kotlin:kotlin-test-junit:$kotlin_version"
+}
+test {
+  testLogging {
+    exceptionFormat = 'full'
+    events = ["passed", "failed", "skipped"]
+  }
+}