trackler 2.2.1.45 → 2.2.1.46

data/tracks/cfml/exercises/secret-handshake/README.md

@@ -0,0 +1,51 @@
+# Secret Handshake
+
+> There are 10 types of people in the world: Those who understand
+> binary, and those who don't.
+
+You and your fellow cohort of those in the "know" when it comes to
+binary decide to come up with a secret "handshake".
+
+```
+1 = wink
+10 = double blink
+100 = close your eyes
+1000 = jump
+
+
+10000 = Reverse the order of the operations in the secret handshake.
+```
+
+Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.
+
+Here's a couple of examples:
+
+Given the input 3, the function would return the array
+["wink", "double blink"] because 3 is 11 in binary.
+
+Given the input 19, the function would return the array
+["double blink", "wink"] because 19 is 10011 in binary.
+Notice that the addition of 16 (10000 in binary)
+has caused the array to be reversed.
+
+* * * *
+
+To run the code in this exercise, you will only need to have [CommandBox CLI installed](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html).  This binary runs CFML code from the command line.
+
+To run the tests, `cd` into the exercise folder and run the following:
+
+```bash 
+box task run TestRunner
+# Or start up a test watcher that will rerun when files change
+box task run TestRunner --:watcher
+```
+
+The tests leverage a library called TestBox which supports xUnit and BDD style of testing.  All test suites will be written in the [BDD style](https://testbox.ortusbooks.com/content/primers/bdd/specs.html) which uses closures to define test specs.  You won't need to worry about installing TestBox.  The CLI test runner will take care of that for you.  You just need to be connected to the internet the first time you run it.  You can read more about it here:
+
+[https://testbox.ortusbooks.com/content/](https://testbox.ortusbooks.com/content/)
+## Source
+
+Bert, in Mary Poppins [http://www.imdb.com/character/ch0011238/quotes](http://www.imdb.com/character/ch0011238/quotes)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/cfml/exercises/space-age/README.md

@@ -0,0 +1,41 @@
+# Space Age
+
+Given an age in seconds, calculate how old someone would be on:
+
+   - Earth: orbital period 365.25 Earth days, or 31557600 seconds
+   - Mercury: orbital period 0.2408467 Earth years
+   - Venus: orbital period 0.61519726 Earth years
+   - Mars: orbital period 1.8808158 Earth years
+   - Jupiter: orbital period 11.862615 Earth years
+   - Saturn: orbital period 29.447498 Earth years
+   - Uranus: orbital period 84.016846 Earth years
+   - Neptune: orbital period 164.79132 Earth years
+
+So if you were told someone were 1,000,000,000 seconds old, you should
+be able to say that they're 31.69 Earth-years old. Round all ages to
+the nearest hundredth of a year.
+
+If you're wondering why Pluto didn't make the cut, go watch [this
+youtube video](http://www.youtube.com/watch?v=Z_2gbGXzFbs).
+
+* * * *
+
+To run the code in this exercise, you will only need to have [CommandBox CLI installed](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html).  This binary runs CFML code from the command line.
+
+To run the tests, `cd` into the exercise folder and run the following:
+
+```bash 
+box task run TestRunner
+# Or start up a test watcher that will rerun when files change
+box task run TestRunner --:watcher
+```
+
+The tests leverage a library called TestBox which supports xUnit and BDD style of testing.  All test suites will be written in the [BDD style](https://testbox.ortusbooks.com/content/primers/bdd/specs.html) which uses closures to define test specs.  You won't need to worry about installing TestBox.  The CLI test runner will take care of that for you.  You just need to be connected to the internet the first time you run it.  You can read more about it here:
+
+[https://testbox.ortusbooks.com/content/](https://testbox.ortusbooks.com/content/)
+## Source
+
+Partially inspired by Chapter 1 in Chris Pine's online Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=01](http://pine.fm/LearnToProgram/?Chapter=01)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/cfml/exercises/sum-of-multiples/README.md

@@ -0,0 +1,34 @@
+# Sum Of Multiples
+
+Given a number, find the sum of all the multiples of particular numbers up to
+but not including that number.
+
+If we list all the natural numbers up to but not including 20 that are
+multiples of either 3 or 5, we get 3, 5, 6 and 9, 10, 12, 15, and 18.
+
+The sum of these multiples is 78.
+
+Given a number, find the sum of the multiples of a given set of numbers,
+up to but not including that number.
+
+* * * *
+
+To run the code in this exercise, you will only need to have [CommandBox CLI installed](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html).  This binary runs CFML code from the command line.
+
+To run the tests, `cd` into the exercise folder and run the following:
+
+```bash 
+box task run TestRunner
+# Or start up a test watcher that will rerun when files change
+box task run TestRunner --:watcher
+```
+
+The tests leverage a library called TestBox which supports xUnit and BDD style of testing.  All test suites will be written in the [BDD style](https://testbox.ortusbooks.com/content/primers/bdd/specs.html) which uses closures to define test specs.  You won't need to worry about installing TestBox.  The CLI test runner will take care of that for you.  You just need to be connected to the internet the first time you run it.  You can read more about it here:
+
+[https://testbox.ortusbooks.com/content/](https://testbox.ortusbooks.com/content/)
+## Source
+
+A variation on Problem 1 at Project Euler [http://projecteuler.net/problem=1](http://projecteuler.net/problem=1)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/cfml/exercises/triangle/README.md

@@ -0,0 +1,42 @@
+# Triangle
+
+Determine if a triangle is equilateral, isosceles, or scalene.
+
+An _equilateral_ triangle has all three sides the same length.<br/>
+An _isosceles_ triangle has at least two sides the same length. (It is sometimes
+specified as having exactly two sides the same length, but for the purposes of
+this exercise we'll say at least two.)<br/>
+A _scalene_ triangle has all sides of different lengths.
+
+## Note
+
+For a shape to be a triangle at all, all sides have to be of length > 0, and 
+the sum of the lengths of any two sides must be greater than or equal to the 
+length of the third side. See [Triangle Inequality](https://en.wikipedia.org/wiki/Triangle_inequality).
+
+## Dig Deeper
+
+The case where the sum of the lengths of two sides _equals_ that of the 
+third is known as a _degenerate_ triangle - it has zero area and looks like 
+a single line. Feel free to add your own code/tests to check for degenerate triangles.
+* * * *
+
+To run the code in this exercise, you will only need to have [CommandBox CLI installed](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html).  This binary runs CFML code from the command line.
+
+To run the tests, `cd` into the exercise folder and run the following:
+
+```bash 
+box task run TestRunner
+# Or start up a test watcher that will rerun when files change
+box task run TestRunner --:watcher
+```
+
+The tests leverage a library called TestBox which supports xUnit and BDD style of testing.  All test suites will be written in the [BDD style](https://testbox.ortusbooks.com/content/primers/bdd/specs.html) which uses closures to define test specs.  You won't need to worry about installing TestBox.  The CLI test runner will take care of that for you.  You just need to be connected to the internet the first time you run it.  You can read more about it here:
+
+[https://testbox.ortusbooks.com/content/](https://testbox.ortusbooks.com/content/)
+## Source
+
+The Ruby Koans triangle project, parts 1 & 2 [http://rubykoans.com](http://rubykoans.com)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/cfml/exercises/word-count/README.md

@@ -0,0 +1,35 @@
+# Word Count
+
+Given a phrase, count the occurrences of each word in that phrase.
+
+For example for the input `"olly olly in come free"`
+
+```plain
+olly: 2
+in: 1
+come: 1
+free: 1
+```
+
+
+* * * *
+
+To run the code in this exercise, you will only need to have [CommandBox CLI installed](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html).  This binary runs CFML code from the command line.
+
+To run the tests, `cd` into the exercise folder and run the following:
+
+```bash 
+box task run TestRunner
+# Or start up a test watcher that will rerun when files change
+box task run TestRunner --:watcher
+```
+
+The tests leverage a library called TestBox which supports xUnit and BDD style of testing.  All test suites will be written in the [BDD style](https://testbox.ortusbooks.com/content/primers/bdd/specs.html) which uses closures to define test specs.  You won't need to worry about installing TestBox.  The CLI test runner will take care of that for you.  You just need to be connected to the internet the first time you run it.  You can read more about it here:
+
+[https://testbox.ortusbooks.com/content/](https://testbox.ortusbooks.com/content/)
+## Source
+
+This is a classic toy problem, but we were reminded of it by seeing it in the Go Tour.
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/clojure/config.json

@@ -295,6 +295,16 @@
 
       ]
     },
+    {
+      "uuid": "d42g42d7-21b1-4daf-8ddc-a2ab9ee07c98",
+      "slug": "spiral-matrix",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "recursivity"
+      ]
+    },
     {
       "uuid": "068a0997-d333-48cb-a82a-c5082e85115d",
       "slug": "prime-factors",

data/tracks/clojure/exercises/spiral-matrix/README.md

@@ -0,0 +1,32 @@
+Given the size, return a square matrix of numbers in spiral order.
+
+The matrix should be filled with natural numbers, starting from 1
+in the top-left corner, increasing in an inward, clockwise spiral order,
+like these examples:
+
+###### Spiral matrix of size 3
+
+```plain
+1 2 3
+8 9 4
+7 6 5
+```
+
+###### Spiral matrix of size 4
+
+```plain
+ 1  2  3 4
+12 13 14 5
+11 16 15 6
+10  9  8 7
+```
+
+
+## Source
+
+Reddit r/dailyprogrammer challenge #320 [Easy] Spiral Ascension
+[https://www.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/](https://www.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/)
+
+## 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/spiral-matrix/project.clj

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

data/tracks/clojure/exercises/spiral-matrix/src/example.clj

@@ -0,0 +1,11 @@
+(ns spiral-matrix)
+
+(defn spiral-matrix [m n & [s]]
+  (let [row (list (map #(+ s %) (range m)))]
+    (if (= 1 n) row
+      (->> (spiral-matrix (dec n) m (+ s m))
+           (apply map list)
+           (map reverse)
+           (concat row)))))
+
+(defn spiral [n] (if (zero? n) '() (spiral-matrix n n 1)))

data/tracks/clojure/exercises/spiral-matrix/src/spiral_matrix.clj

@@ -0,0 +1,3 @@
+(ns spiral-matrix)
+
+(defn spiral [n])

data/tracks/clojure/exercises/spiral-matrix/test/spiral_matrix_test.clj

@@ -0,0 +1,58 @@
+(ns spiral-matrix-test
+  (require [clojure.test  :refer [deftest is testing]]
+           [spiral-matrix :refer [spiral]]))
+
+(deftest spiral-matrix-of-0
+  (testing "spiral matrix of 0"
+    (is (= (spiral 0)
+           '()))))
+
+(deftest spiral-matrix-of-1
+  (testing "spiral matrix of 1"
+    (is (= (spiral 1)
+           '((1))))))
+
+(deftest spiral-matrix-of-2
+  (testing "spiral matrix of 2"
+    (is (= (spiral 2)
+           '((1 2)
+             (4 3))))))
+
+(deftest spiral-matrix-of-3
+  (testing "spiral matrix of 3"
+    (is (= (spiral 3)
+           '((1 2 3)
+             (8 9 4)
+             (7 6 5))))))
+
+(deftest spiral-matrix-of-4
+  (testing "spiral matrix of 4"
+    (is (= (spiral 4)
+           '((1  2  3  4)
+             (12 13 14 5)
+             (11 16 15 6)
+             (10 9  8  7))))))
+
+(deftest spiral-matrix-of-20
+  (testing "spiral matrix of 20"
+    (is (= (spiral 20)
+           '((1  2   3   4   5   6   7   8   9   10  11  12  13  14  15  16  17  18  19  20)
+             (76 77  78  79  80  81  82  83  84  85  86  87  88  89  90  91  92  93  94  21)
+             (75 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 95  22)
+             (74 143 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 161 96  23)
+             (73 142 203 256 257 258 259 260 261 262 263 264 265 266 267 268 219 162 97  24)
+             (72 141 202 255 300 301 302 303 304 305 306 307 308 309 310 269 220 163 98  25)
+             (71 140 201 254 299 336 337 338 339 340 341 342 343 344 311 270 221 164 99  26)
+             (70 139 200 253 298 335 364 365 366 367 368 369 370 345 312 271 222 165 100 27)
+             (69 138 199 252 297 334 363 384 385 386 387 388 371 346 313 272 223 166 101 28)
+             (68 137 198 251 296 333 362 383 396 397 398 389 372 347 314 273 224 167 102 29)
+             (67 136 197 250 295 332 361 382 395 400 399 390 373 348 315 274 225 168 103 30)
+             (66 135 196 249 294 331 360 381 394 393 392 391 374 349 316 275 226 169 104 31)
+             (65 134 195 248 293 330 359 380 379 378 377 376 375 350 317 276 227 170 105 32)
+             (64 133 194 247 292 329 358 357 356 355 354 353 352 351 318 277 228 171 106 33)
+             (63 132 193 246 291 328 327 326 325 324 323 322 321 320 319 278 229 172 107 34)
+             (62 131 192 245 290 289 288 287 286 285 284 283 282 281 280 279 230 173 108 35)
+             (61 130 191 244 243 242 241 240 239 238 237 236 235 234 233 232 231 174 109 36)
+             (60 129 190 189 188 187 186 185 184 183 182 181 180 179 178 177 176 175 110 37)
+             (59 128 127 126 125 124 123 122 121 120 119 118 117 116 115 114 113 112 111 38)
+             (58 57  56  55  54  53  52  51  50  49  48  47  46  45  44  43  42  41  40  39))))))

data/tracks/common-lisp/config.json

@@ -2,6 +2,16 @@
   "language": "Common Lisp",
   "active": true,
   "exercises": [
+    {
+      "uuid": "d4af6cfa-d468-15b5-dcdf-7d717ddf6556",
+      "slug": "hello-world",
+      "core": true,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "Strings"
+      ]
+    },
     {
       "uuid": "c029678b-9b9f-4fb2-958f-3a118efa16a9",
       "slug": "hamming",
@@ -216,6 +226,16 @@
         "Mathematics"
       ]
     },
+    {
+      "uuid": "b3ad38c2-2962-4b47-9b15-15ca262ebff6",
+      "slug": "perfect-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "Number theory"
+      ]
+    },
     {
       "uuid": "6c702aa9-70f3-41d0-bc76-4323a08f8fbf",
       "slug": "meetup",

data/tracks/common-lisp/exercises/hello-world/README.md

@@ -0,0 +1,68 @@
+# Hello World
+
+The classical introductory exercise. Just say "Hello, World!".
+
+["Hello, World!"](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) is
+the traditional first program for beginning programming in a new language
+or environment.
+
+The objectives are simple:
+
+- Write a function that returns the string "Hello, World!".
+- Run the test suite and make sure that it succeeds.
+- Submit your solution and check it at the website.
+
+If everything goes well, you will be ready to fetch your first real exercise.
+
+## Setup
+
+Check out [Exercism Help](http://exercism.io/languages/lisp) for instructions to
+get started writing Common Lisp. That page will explain how to install and setup
+a Lisp implementation and how to run the tests.
+
+## Formatting
+
+While Common Lisp doesn't care about indentation and layout of code,
+nor whether you use spaces or tabs, this is an important consideration
+for submissions to exercism.io. Excercism.io's code widget cannot
+handle mixing of tab and space characters well so using only spaces is recommended to make
+the code more readable to the human reviewers. Please review your
+editors settings on how to accomplish this. Below are instructions for
+popular editors for Common Lisp.
+
+### VIM
+
+Use the following commands to ensure VIM uses only spaces for
+indentation:
+
+```vimscript
+:set tabstop=2
+:set shiftwidth=2
+:set expandtab
+```
+
+(or as a oneliner `:set tabstop=2 shiftwidth=2 expandtab`). This can
+be added to your `~/.vimrc` file to use it all the time.
+
+### Emacs
+
+Emacs is very well suited for editing Common Lisp and has many
+powerful add-on packages available. The only thing that one needs to
+do with a stock emacs to make it work well with exercism.io is to
+evaluate the following code:
+
+`(setq indent-tab-mode nil)`
+
+This can be placed in your `~/.emacs` (or `~/.emacs.d/init.el`) in
+order to have it set whenever Emacs is launched.
+
+One suggested add-on for Emacs and Common Lisp is
+[SLIME](https://github.com/slime/slime) which offers tight integration
+with the REPL; making iterative coding and testing very easy.
+
+## Source
+
+This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.