trackler 2.1.0.14 → 2.1.0.15

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4133c47757d7a255d9a21636f63b479e766488b1
-  data.tar.gz: 54b3438d332c5590e545bccb26376e435c27bcef
+  metadata.gz: 4cc8feb981bb581bf3e184bc80c36e688a053780
+  data.tar.gz: 99ba32cbd4a8150d8e61cd98529c24e0b9e84560
 SHA512:
-  metadata.gz: 87f951253be363fa194a43de8f2fd4b68bdc1e41d08f71e0e7a514d3bfabc8948b452768090215954a1b73e293e28f863cccce2d0a3cce4d149beacc1b2bb8fa
-  data.tar.gz: e669c4d8420d092bf9e5ce12dabc7ed89bc67a7cdb8ba3537af6895b31e6a1fe71c1a125b723d1a1365bfc93589efb1cf47d5895d7172028c257870ae55a82cd
+  metadata.gz: 8ff2e026ea8852d5d536b4c2e2438fe61d73a7f0a3fa5f7722960f9a78425178b9aff48121fbce323625b136869339cf0f2edf407fe56cd72c47c2b3892fce52
+  data.tar.gz: d96344f2ceb0c6e8179c1b23c5f1c914ecf329e7ab49a8fc0bcd6afae2e41c304296c1a26efe5414d1eea88df30ed6ed9d924f6364c09610c7f4ff302c4483f4

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.1.0.14"
+  VERSION = "2.1.0.15"
 end

data/tracks/csharp/exercises/acronym/AcronymTest.cs

@@ -15,7 +15,7 @@ public void Lowercase_words()
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Camelcase()
+    public void PascalCase()
     {
         Assert.Equal("HTML", Acronym.Abbreviate("HyperText Markup Language"));
     }
@@ -43,4 +43,4 @@ public void Hyphenated()
     {
         Assert.Equal("CMOS", Acronym.Abbreviate("Complementary metal-oxide semiconductor"));
     }
-}
+}

data/tracks/ecmascript/config.json

@@ -66,7 +66,8 @@
     "two-bucket",
     "diamond",
     "isogram",
-    "all-your-base"
+    "all-your-base",
+    "connect"
   ],
   "exercises": [
     {
@@ -440,6 +441,12 @@
       "difficulty": 1,
       "topics": [
       ]
+    },
+	{
+      "slug": "connect",
+      "difficulty": 7,
+      "topics": [
+      ]
     }
   ],
   "deprecated": [

data/tracks/ecmascript/exercises/connect/connect.spec.js

@@ -0,0 +1,110 @@
+import Board from './connect';
+
+describe('Judging a game of connect', () => {
+
+  it("an empty board has no winner", () => {
+    let board = [
+      ". . . . .",
+      " . . . . .",
+      "  . . . . .",
+      "   . . . . .",
+      "    . . . . ."
+    ];
+    expect(new Board(board).winner()).toEqual("");
+  });
+
+  xit("X can win on a 1x1 board", () => {
+    let board =  [
+      "X"
+    ];
+    expect(new Board(board).winner()).toEqual("X");
+  });
+
+  xit("O can win on a 1x1 board", () => {
+    let board =  [
+      "O"
+    ];
+    expect(new Board(board).winner()).toEqual("O");
+  });
+
+  xit( "only edges does not make a winner", () => {
+    let board =   [
+      "O O O X",
+      " X . . X",
+      "  X . . X",
+      "   X O O O"
+    ];
+    expect(new Board(board).winner()).toEqual("");
+  });
+
+  xit("illegal diagonal does not make a winner", () => {
+    let board =  [
+      "X O . .",
+      " O X X X",
+      "  O X O .",
+      "   . O X .",
+      "    X X O O"
+    ];
+    expect(new Board(board).winner()).toEqual("");
+  });
+
+  xit("nobody wins crossing adjacent angles", () => {
+    let board =  [
+      "X . . .",
+      " . X O .",
+      "  O . X O",
+      "   . O . X",
+      "    . . O ."
+    ];
+    expect(new Board(board).winner()).toEqual("");
+  });
+
+  xit("X wins crossing from left to right", () => {
+    let board =  [
+      ". O . .",
+      " O X X X",
+      "  O X O .",
+      "   X X O X",
+      "    . O X ."
+    ];
+    expect(new Board(board).winner()).toEqual("X");
+  });
+
+  xit("O wins crossing from top to bottom", () => {
+    let board =  [
+      ". O . .",
+      " O X X X",
+      "  O O O .",
+      "   X X O X",
+      "    . O X ."
+    ];
+    expect(new Board(board).winner()).toEqual("O");
+  });
+
+  xit("X wins using a convoluted path", () => {
+    let board =  [
+      ". X X . .",
+      " X . X . X",
+      "  . X . X .",
+      "   . X X . .",
+      "    O O O O O"
+    ];
+    expect(new Board(board).winner()).toEqual("X");
+  });
+
+  xit("X wins using a spiral path", () => {
+    let board =   [
+      "O X X X X X X X X",
+      " O X O O O O O O O",
+      "  O X O X X X X X O",
+      "   O X O X O O O X O",
+      "    O X O X X X O X O",
+      "     O X O O O X O X O",
+      "      O X X X X X O X O",
+      "       O O O O O O O X O",
+      "        X X X X X X X X O"
+    ];
+    expect(new Board(board).winner()).toEqual("X");
+  });
+
+});

data/tracks/ecmascript/exercises/connect/example.js

@@ -0,0 +1,68 @@
+/**
+ * "Player O" plays from top to bottom, "Player X" plays from left to right.
+ * @param board
+ */
+export default class {
+  constructor(board) {
+    this.board = board.map((b) => [...b]);
+  }
+  winner() {
+    const players = ['X','O'];
+    for(let player of players) {
+      if(this.checkWin(player)) {
+        return player;
+      }
+    }
+    return "";
+  }
+  checkWin(player) {
+    let positions = this.startPositions(player);
+    for(let position of positions) {
+      if(this.search(position, player,[])) {
+        return true;
+      }
+    }
+    return false;
+  }
+  search(pos, XorO, checked) {
+    if(! this.matches(pos, XorO)) {
+      return false;
+    }
+    if(this.winningSpot(pos, XorO)) {
+      return true;
+    }
+    checked = checked.slice(0);
+    checked.push(pos);
+    const matches = this.neighbors(pos).filter(({x,y}) => {
+      return this.matches({x,y}, XorO) && checked.filter((spot) => spot.x === x && spot.y === y).length === 0;
+    });
+    if(matches.length === 0) return false;
+    return matches.filter(spot => this.search(spot, XorO, checked)).length > 0;
+  }
+  neighbors({x,y}) {
+    return [
+      {x, y: y + 2},
+      {x, y: y - 2},
+
+      {x: x + 1, y: y + 1},
+      {x: x - 1, y: y + 1},
+
+      {x: x + 1, y: y - 1},
+      {x: x - 1, y: y - 1}
+    ];
+  }
+  startPositions(XorO) {
+    return XorO === "X" ?
+      this.board.map((pos, i) => ({x:i,y:i})) :
+      this.board[0].map((pos, i) => ({x:0, y:i}));
+  }
+  winningSpot({x,y},XorO) {
+    return XorO === "X" ?
+      y === this.board[0].length - 1 + x:
+      x === this.board.length - 1;
+  }
+  matches({x,y}, XorO) {
+    return this.board[x] !== undefined && this.board[x][y] === XorO;
+  }
+}
+

data/tracks/ecmascript/exercises/connect/package.json

@@ -0,0 +1,82 @@
+{
+  "name": "xecmascript",
+  "version": "0.0.0",
+  "description": "Exercism exercises in ECMAScript 6.",
+  "author": "Katrina Owen",
+  "private": true,
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/exercism/xecmascript"
+  },
+  "devDependencies": {
+    "babel-jest": "^19.0.0",
+    "babel-preset-env": "^1.3.3",
+    "eslint": "^3.19.0",
+    "jest": "^19.0.2"
+  },
+  "jest": {
+    "modulePathIgnorePatterns": [
+      "package.json"
+    ]
+  },
+  "babel": {
+    "presets": [
+      "env"
+    ]
+  },
+  "scripts": {
+    "test": "jest --no-cache ./*",
+    "watch": "jest --no-cache --watch ./*",
+    "lint": "eslint *.js; exit 0;",
+    "lint-test": "eslint *.js && jest --no-cache ./* "
+  },
+  "eslintConfig": {
+    "parserOptions": {
+      "ecmaVersion": 6,
+      "sourceType": "module"
+    },
+    "rules": {
+      "comma-dangle": [
+        2,
+        "never"
+      ],
+      "no-cond-assign": [
+        2,
+        "always"
+      ],
+      "no-console": 2,
+      "no-constant-condition": 2,
+      "no-control-regex": 2,
+      "no-debugger": 2,
+      "no-dupe-args": 2,
+      "no-dupe-keys": 2,
+      "no-duplicate-case": 2,
+      "no-empty-character-class": 2,
+      "no-empty": 2,
+      "no-ex-assign": 2,
+      "no-extra-boolean-cast": 2,
+      "no-extra-parens": 2,
+      "no-extra-semi": 2,
+      "no-func-assign": 2,
+      "no-inner-declarations": [
+        2,
+        "both"
+      ],
+      "no-invalid-regexp": 2,
+      "no-irregular-whitespace": 2,
+      "no-negated-in-lhs": 2,
+      "no-obj-calls": 2,
+      "no-regex-spaces": 2,
+      "no-sparse-arrays": 2,
+      "no-unexpected-multiline": 2,
+      "no-unreachable": 2,
+      "use-isnan": 2,
+      "valid-jsdoc": 2,
+      "valid-typeof": 2
+    }
+  },
+  "licenses": [
+    "MIT"
+  ],
+  "dependencies": {}
+}

data/tracks/haskell/exercises/difference-of-squares/package.yaml

@@ -1,5 +1,5 @@
 name: difference-of-squares
-version: 1.0.0.3
+version: 1.1.0.4
 
 dependencies:
   - base

data/tracks/haskell/exercises/difference-of-squares/test/Tests.hs

@@ -12,19 +12,18 @@ specs :: Spec
 specs = do
 
     describe "squareOfSums" $ do
+      it "square of sum 1"   $ squareOfSums   1 `shouldBe`        1
       it "square of sum 5"   $ squareOfSums   5 `shouldBe`      225
-      it "square of sum 10"  $ squareOfSums  10 `shouldBe`     3025
       it "square of sum 100" $ squareOfSums 100 `shouldBe` 25502500
 
     describe "sumOfSquares" $ do
+      it "sum of squares 1"   $ sumOfSquares   1 `shouldBe`      1
       it "sum of squares 5"   $ sumOfSquares   5 `shouldBe`     55
-      it "sum of squares 10"  $ sumOfSquares  10 `shouldBe`    385
       it "sum of squares 100" $ sumOfSquares 100 `shouldBe` 338350
 
     describe "differenceOfSquares" $ do
-      it "difference of squares 0"   $ difference   0 `shouldBe`        0
+      it "difference of squares 1"   $ difference   1 `shouldBe`        0
       it "difference of squares 5"   $ difference   5 `shouldBe`      170
-      it "difference of squares 10"  $ difference  10 `shouldBe`     2640
       it "difference of squares 100" $ difference 100 `shouldBe` 25164150
 
     -- Track-specific tests.

data/tracks/java/exercises/all-your-base/src/test/java/BaseConverterTest.java

@@ -7,7 +7,7 @@ import java.util.Arrays;
 
 import static org.junit.Assert.assertArrayEquals;
 
-public final class BaseConverterTest {
+public class BaseConverterTest {
 
     /*
      * See https://github.com/junit-team/junit4/wiki/Rules for information on JUnit Rules in general and

data/tracks/java/exercises/bracket-push/src/test/java/BracketCheckerTest.java

@@ -5,7 +5,7 @@ import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.assertFalse;
 import static org.junit.Assert.assertTrue;
 
-public final class BracketCheckerTest {
+public class BracketCheckerTest {
 
     @Test
     public void testPairedSquareBrackets() {

data/tracks/java/exercises/wordy/src/test/java/WordProblemSolverTest.java

@@ -6,7 +6,7 @@ import org.junit.rules.ExpectedException;
 
 import static org.junit.Assert.assertEquals;
 
-public final class WordProblemSolverTest {
+public class WordProblemSolverTest {
 
     /*
      * See https://github.com/junit-team/junit4/wiki/Rules for information on JUnit Rules in general and

data/tracks/lisp/.travis.yml

@@ -3,34 +3,32 @@ language: lisp
 
 env:
   matrix:
-    - LISP=sbcl
-    - LISP=ccl
+    - LISP=sbcl-bin
+    - LISP=ccl-bin
     - LISP=ecl
     - LISP=clisp
-    - LISP=abcl
-    - LISP=ccl32
-    - LISP=clisp32
-    - LISP=sbcl32
-    # - LISP=allegro
-    # - LISP=cmucl
+    - LISP=abcl-bin
+    - LISP=allegro
+    # - LISP=clasp
+    # - LISP=cmu-bin
 
 matrix:
   fast_finish: true
   allow_failures:
-    - env: LISP=abcl
-    - env: LISP=ccl32
-    - env: LISP=clisp32
-    - env: LISP=sbcl32
+    - env: LISP=abcl-bin
+    - env: LISP=allegro
+    # - env: LISP=cmu-bin
+    # - env: LISP=clasp
 
 install:
-  - bin/cl-travis-install.sh
+  - curl -L 'https://raw.githubusercontent.com/snmsts/roswell/release/scripts/install-for-ci.sh' | sh
 
 before_script:
   - bin/fetch-configlet
   - bin/configlet .
 
 script:
-  - cl -f 'bin/xlisp-test.lisp' -e '(xlisp-test:travis-build)'
+  - ros run -l 'bin/xlisp-test.lisp' -e '(xlisp-test:travis-build)' -q
 
 # Cut and paste above to run all tests locally.
 

data/tracks/lisp/README.md

@@ -50,25 +50,18 @@ All changes will be built under several implementations via the
 to be able to run at least some of those same builds locally before
 submitting the changes.
 
-A contributor will need to install
-[CIM](https://github.com/KeenS/CIM),
-[QuickLisp](https://www.quicklisp.org/beta/), and a few Lisp
-implementations.
+A contributor will need to install:
 
-###### CIM
+* [Roswell](https://github.com/roswell/roswell)
+* [QuickLisp](https://www.quicklisp.org/beta/)
+* and a few Lisp implementations.
 
-Instructions for installing CIM can be found in its
-[README](https://github.com/KeenS/CIM#install). The simplest form is:
 
-```
-curl -L https://raw.github.com/KeenS/CIM/master/scripts/cim_installer | /bin/sh
-cim config sh >> ~/.bashrc
-```
+###### Roswell
 
-Note: the xLisp team does not currently advise using CIM for
-installing implementations. While it works well as a
-multi-implementation runner, it is not currently sufficient as a
-multi-implementation installation and upgrade system.
+Instructions for installing Roswell can be found in
+its
+[README](https://github.com/roswell/roswell#installation-dependency--usage).
 
 ###### Lisp Implementations
 
@@ -76,33 +69,13 @@ It is beyond the scope of this document to describe how to install
 different Lisp implementations. Please find those instructions on
 those implementations' websites.
 
-After installing Lisp implementations. Check that CIM can see them by
-running `cim list use`. This should list the implementation names
-suffixed with `-system` (designating that CIM did not install them).
-Then to ensure CIM can use them properly run:
-
-```
-for i in `cim list use`; do cim use $i; done
-```
+After installing Lisp implementations. Check that Roswell can see them by
+running `ros list installed`.
 
 ###### QuickLisp
 
-Instructions to install QuickLisp can be found on this
-[website](https://www.quicklisp.org/beta/#installation). Following
-these instructions will install the QuickLisp system into
-`~/.quicklisp`.
-
-To ensure CIM and all your implementations know and use QuickLisp you
-can run the following commands:
-
-```
-ln ~/quicklisp ~/.cim/quicklisp
-cim for all do -l ~/.quicklisp/setup.lisp -e '(ql:add-to-init-file)'
-```
-
-(the last command will, for each implementation, install QuickLisp
-setup code into that implementation's startup file. It will prompt the
-user for confirmation before doing so.
+Although [QuickLisp](https://www.quicklisp.org/beta/) is
+required, Roswell will install and configure it for you, by default.
 
 ##### Creating a new exercise.
 
@@ -120,16 +93,11 @@ Travis build.  This build will run all exercises on many Common Lisp
 implementations. To run the build yourself on your implementation load
 `bin/xlisp-test.lisp` and then evaluate `(xlisp-test:full-build)`.
 
-If CIM is installed then running all the tests for one implementation
-can be done with (this will return with a non-zero error code if there
-are problems):
-
-	cl -f bin/xlisp-test.lisp -e '(xlisp-test:travis-build)'
-
-To run all the tests for *all* the implementations use this command
-line:
+If Roswell is installed then running all the tests for one
+implementation can be done with (this will return with a non-zero
+error code if there are problems):
 
-	cim for all do -f bin/xlisp-test.lisp -e '(xlisp-test:travis-build)'
+    ros run -l 'bin/xlisp-test.lisp' -e '(xlisp-test:travis-build)' -q
 
 ##### Style Guidelines