trackler 2.2.1.140 → 2.2.1.141

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3a62c88fac34309c111a0502963d5822d523f4fc
-  data.tar.gz: aada3879b2d773e6dbc351bafb9a250a2b209d0a
+  metadata.gz: a7cf22fee63634a6ddbb2c0ff044ad5174d22bb7
+  data.tar.gz: e209001452daff690ba4dfc7f29b8c0c11284e07
 SHA512:
-  metadata.gz: 9ce8cd0a7ea03a56184febc3d0bcb850d36a7a4d1fe0e8c46454e4df9e64f4c2d663a02bfe34cf588e258806c4d0f8c9717ece6e313e29289377636cf3786c10
-  data.tar.gz: 298c7e83badf8b099995f688d5c95bc4981c8c2a2e9a1094f8b1126c5084add6d50b0b75ce8a4fa678babb180a53814cd3b619eb4182dd98f5e240b379a523df
+  metadata.gz: 74402845d18b577782f1ee514fd96b9da9996d9ef680713b5cc8e9adb283d76549be3393b6637f11111a7ccf3790b99f7d26382de41c729fe61a8b870979e2b4
+  data.tar.gz: 1f4d3162f330135563701b4922da64abcb28a65764e16444f702e5dc21c4a5c58710a5ab6e30a3a6c7a563fc30a35cdde0154175ce59b4fdbe606da7aa85ea5c

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.140"
+  VERSION = "2.2.1.141"
 end

data/tracks/clojure/appveyor.yml

@@ -0,0 +1,11 @@
+version: 1.0.{build}
+install:
+- cmd: >-
+    choco install lein
+build: off
+test_script:
+- cmd: >-
+    cd %APPVEYOR_BUILD_FOLDER%
+
+    lein test
+    

data/tracks/clojure/config.json

@@ -597,6 +597,14 @@
       "topics": null,
       "unlocked_by": null,
       "uuid": "7df7ff1c-74ab-4f4e-aaf0-257b6e1cbc18"
+    },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "dominoes",
+      "topics": null,
+      "unlocked_by": null,
+      "uuid": "db6162c0-adff-401e-9dd6-a0322ca10dcf"
     }
   ],
   "foregone": [],

data/tracks/clojure/exercises/dominoes/README.md

@@ -0,0 +1,16 @@
+Make a chain of dominoes.
+
+Compute a way to order a given set of dominoes in such a way that they form a
+correct domino chain (the dots on one half of a stone match the dots on the
+neighbouring half of an adjacent stone) and that dots on the halfs of the stones
+which don't have a neighbour (the first and last stone) match each other.
+
+For example given the stones `[2|1]`, `[2|3]` and `[1|3]` you should compute something
+like `[1|2] [2|3] [3|1]` or `[3|2] [2|1] [1|3]` or `[1|3] [3|2] [2|1]` etc, where the first and last numbers are the same.
+
+For stones `[1|2]`, `[4|1]` and `[2|3]` the resulting chain is not valid: `[4|1] [1|2] [2|3]`'s first and last numbers are not the same. 4 != 3
+
+Some test cases may use duplicate stones in a chain solution, assume that multiple Domino sets are being used.
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/clojure/exercises/dominoes/project.clj

@@ -0,0 +1,4 @@
+(defproject dominoes "0.1.0-SNAPSHOT"
+  :description "dominoes exercise."
+  :url "https://github.com/exercism/clojure/tree/master/exercises/dominoes"
+  :dependencies [[org.clojure/clojure "1.9.0"]])

data/tracks/clojure/exercises/dominoes/src/dominoes.clj

@@ -0,0 +1,3 @@
+(ns dominoes)
+
+(defn can-chain? [])

data/tracks/clojure/exercises/dominoes/src/example.clj

@@ -0,0 +1,20 @@
+(ns dominoes)
+
+(defn rm [xs x]
+  (let [i (.indexOf xs x)]
+    (if (= -1 i) xs (vec (concat (take i xs) (drop (inc i) xs))))))
+
+(defn connects [[a b] [c d]]
+  (cond (= b c) [c d]
+        (= b d) [d c]
+        :else   nil))
+
+(defn backtrack [rem chain]
+  (or (and (empty? rem) (= (ffirst chain) (second (peek chain))))
+      (and (not (empty? rem))
+           (some #(let [c (connects (peek chain) %)]
+                    (and c (backtrack (rm rem %) (conj chain c))))
+                 rem))))
+
+(defn can-chain? [xs]
+  (or (empty? xs) (some #(backtrack (rm xs %) [%]) xs)))

data/tracks/clojure/exercises/dominoes/test/dominoes_test.clj

@@ -0,0 +1,39 @@
+(ns dominoes-test
+  (:require [clojure.test :refer [deftest is]]
+            [dominoes     :refer [can-chain?]]))
+
+(deftest empty-input-empty-output
+  (is (can-chain? [])))
+
+(deftest singleton-input-singleton-output
+  (is (can-chain? [[1 1]])))
+
+(deftest singleton-that-cant-be-chained
+  (is ((comp not can-chain?) [[1 2]])))
+
+(deftest three-elements
+  (is (can-chain?  [[1 2] [3 1] [2 3]])))
+
+(deftest can-reverse-dominoes
+  (is (can-chain? [[1 2] [1 3] [2 3]])))
+
+(deftest cant-be-chained
+  (is ((comp not can-chain?) [[1 2] [4 1] [2 3]])))
+
+(deftest disconnected-simple
+  (is ((comp not can-chain?) [[1 1] [2 2]])))
+
+(deftest disconnected-double-loop
+  (is ((comp not can-chain?) [[1 2] [2 1] [3 4] [4 3]])))
+
+(deftest disconnected-single-isolated
+  (is ((comp not can-chain?) [[1 2] [2 3] [3 1] [4 4]])))
+
+(deftest need-backtrack
+  (is (can-chain? [[1 2] [2 3] [3 1] [2 4] [2 4]])))
+
+(deftest separate-loops
+  (is (can-chain? [[1 2] [2 3] [3 1] [1 1] [2 2] [3 3]])))
+
+(deftest nine-elements
+  (is (can-chain? [[1 2] [5 3] [3 1] [1 2] [2 4] [1 6] [2 3] [3 4] [5 6]])))

data/tracks/clojure/exercises/minesweeper/test/minesweeper_test.clj

@@ -3,30 +3,32 @@
             [clojure.string :refer [join]]
             [minesweeper :refer [draw]]))
 
+(def line-separator (System/getProperty "line.separator"))
+
 (deftest zero-size-board
   (is (= (draw "") "")))
 
 (deftest empty-board
-  (is (= (draw (join \newline ["   "
+  (is (= (draw (join line-separator ["   "
                                "   "
                                "   "]))
-         (join \newline ["   "
+         (join line-separator ["   "
                          "   "
                          "   "]))))
 
 (deftest surrounded
-  (is (= (draw (join \newline ["***"
+  (is (= (draw (join line-separator ["***"
                                "* *"
                                "***"]))
-         (join \newline ["***"
+         (join line-separator ["***"
                          "*8*"
                          "***"]))))
 
 (deftest board-full-of-mines
-  (is (= (draw (join \newline ["***"
+  (is (= (draw (join line-separator ["***"
                                "***"
                                "***"]))
-         (join \newline ["***"
+         (join line-separator ["***"
                          "***"
                          "***"]))))
 
@@ -35,24 +37,24 @@
          "1*2*1")))
 
 (deftest vertical-line
-  (is (= (draw (join \newline [" "
+  (is (= (draw (join line-separator [" "
                                "*"
                                " "
                                "*"
                                " "]))
-         (join \newline ["1"
+         (join line-separator ["1"
                          "*"
                          "2"
                          "*"
                          "1"]))))
 
 (deftest cross
-  (is (= (draw (join \newline ["  *  "
+  (is (= (draw (join line-separator ["  *  "
                                "  *  "
                                "*****"
                                "  *  "
                                "  *  "]))
-         (join \newline [" 2*2 "
+         (join line-separator [" 2*2 "
                          "25*52"
                          "*****"
                          "25*52"

data/tracks/coq/docs/LEARNING.md

@@ -0,0 +1,10 @@
+Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
+
+There are some free resources for learning Coq, such as:
+
+* Software Foundations series:
+    + [Volume 1: Logical Foundations](https://softwarefoundations.cis.upenn.edu/lf-current/index.html)
+    + [Volume 2: Programming Language Foundations](https://softwarefoundations.cis.upenn.edu/plf-current/index.html)
+    + [Volume 3: Verified Functional Algorithms](https://softwarefoundations.cis.upenn.edu/vfa-current/index.html)
+* Certified Programming with Dependent Types:
+    + Which is avalaible for free in [Adam Chipala's site](http://adam.chlipala.net/cpdt/).

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.140
+  version: 2.2.1.141
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-05-05 00:00:00.000000000 Z
+date: 2018-05-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -1538,6 +1538,7 @@ files:
 - tracks/clojure/_src/clock_generator.clj
 - tracks/clojure/_src/generator.clj
 - tracks/clojure/_test/check_exercises.clj
+- tracks/clojure/appveyor.yml
 - tracks/clojure/bin/fetch-configlet
 - tracks/clojure/bin/restructure.clj
 - tracks/clojure/config.json
@@ -1654,6 +1655,11 @@ files:
 - tracks/clojure/exercises/difference-of-squares/src/difference_of_squares.clj
 - tracks/clojure/exercises/difference-of-squares/src/example.clj
 - tracks/clojure/exercises/difference-of-squares/test/difference_of_squares_test.clj
+- tracks/clojure/exercises/dominoes/README.md
+- tracks/clojure/exercises/dominoes/project.clj
+- tracks/clojure/exercises/dominoes/src/dominoes.clj
+- tracks/clojure/exercises/dominoes/src/example.clj
+- tracks/clojure/exercises/dominoes/test/dominoes_test.clj
 - tracks/clojure/exercises/etl/README.md
 - tracks/clojure/exercises/etl/project.clj
 - tracks/clojure/exercises/etl/src/etl.clj