trackler 2.2.1.33 → 2.2.1.34

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c9c8ae37971bf7a2186d96f3c5d082012f459e60
-  data.tar.gz: 196ea444efe286f403f2147b74d4a79451e18b9c
+  metadata.gz: 94f1ec75e4a06728b2a24c14a1bd8943129753a1
+  data.tar.gz: e6db1170c98f5378116c98e2187104208f59435b
 SHA512:
-  metadata.gz: f203dcc11d774161bbc350ccc03e6fb6bf61df951c26e9394fd5793da0a0c9702dc9845b923a526d7091cc561ead1802919d8ef86888149d732b4a4d5dd08734
-  data.tar.gz: 827c7f3889b71dadfe6fdffa7f0b55a4517a0ea44256ce7cacb44f20c5020b87791a3c2560e0b1d6588d502c8f61de3d29f7cd1ad7fc54348acfc115e81aa3be
+  metadata.gz: 3a1f5ee1c91b627cec5a1131fe8d9601608db6189818c6e27ef5b1c5822cb80293b3c2017c462a506f580b52f224e32cf6e40b0758f31364c036509eacfd4e94
+  data.tar.gz: e9a86d47b1a8497216affb89a5bffcae2f1515ce692c565b802488a672bc22e3215e5e62e4b958dbc499e36b8b20ba491dd052708356b28eca0d771e65843f0b

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.33"
+  VERSION = "2.2.1.34"
 end

data/problem-specifications/README.md

@@ -180,6 +180,6 @@ npm test
 
 Run for single exercise:
 ```shell
-npm test-one exercises/<exercise>/canonical-data.json
+npm run test-one exercises/<exercise>/canonical-data.json
 ```
 Replace `<exercise>` by the name of exercise which you want to check.

data/problem-specifications/exercises/palindrome-products/description.md

@@ -21,12 +21,18 @@ palindromic product of factors within that range, along with all the factors in
 
 Given the range `[1, 9]` (both inclusive)...
 
-The smallest product is `1`. Its factors are `(1, 1)`.
-The largest product is `9`. Its factors are `(1, 9)`, and `(3, 3)`.
+And given the list of all possible products within this range:
+`[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 15, 21, 24, 27, 20, 28, 32, 36, 25, 30, 35, 40, 45, 42, 48, 54, 49, 56, 63, 64, 72, 81]`
+
+The palindrome products are all single digit numbers (in this case):
+`[1, 2, 3, 4, 5, 6, 7, 8, 9]`
+
+The smallest palindrome product is `1`. Its factors are `(1, 1)`.
+The largest palindrome product is `9`. Its factors are `(1, 9)` and `(3, 3)`.
 
 ## Example 2
 
 Given the range `[10, 99]` (both inclusive)...
 
 The smallest palindrome product is `121`. Its factors are `(11, 11)`.
-The largest palindrome product is `9009`. Its factors are `(91, 99)` and `(99, 91)`.
+The largest palindrome product is `9009`. Its factors are `(91, 99)`.

data/tracks/c/exercises/hamming/src/example.c

@@ -2,15 +2,16 @@
 #include <string.h>
 #include "hamming.h"
 
-size_t compute(const char *lhs, const char *rhs)
+int compute(const char *lhs, const char *rhs)
 {
-   size_t lhs_len = strlen(lhs);
-   size_t rhs_len = strlen(rhs);
-   size_t count = 0;
-   size_t i = 0;
-   for (i = 0; i < lhs_len && i < rhs_len; ++i) {
-      if (lhs[i] != rhs[i]) {
-         ++count;
+   int count = -1;
+   if (lhs && rhs && (strlen(lhs) == strlen(rhs))) {
+      count = 0;
+      int length = (int)strlen(lhs);
+      for (int i = 0; i < length; ++i) {
+         if (lhs[i] != rhs[i]) {
+            ++count;
+         }
       }
    }
    return count;

data/tracks/c/exercises/hamming/src/example.h

@@ -1,6 +1,6 @@
 #ifndef HAMMING_H
 #define HAMMING_H
 
-size_t compute(const char *lhs, const char *rhs);
+int compute(const char *lhs, const char *rhs);
 
 #endif

data/tracks/c/exercises/hamming/test/test_hamming.c

@@ -1,11 +1,31 @@
 #include "vendor/unity.h"
 #include "../src/hamming.h"
 
+void test_empty_strands(void)
+{
+   TEST_ASSERT_EQUAL(0, compute("", ""));
+}
+
+void test_rejects_null_strand(void)
+{
+   TEST_ASSERT_EQUAL(-1, compute(NULL, "A"));
+}
+
+void test_rejects_other_null_strand(void)
+{
+   TEST_ASSERT_EQUAL(-1, compute("A", NULL));
+}
+
 void test_no_difference_between_identical_strands(void)
 {
    TEST_ASSERT_EQUAL(0, compute("A", "A"));
 }
 
+void test_identical_long_strands(void)
+{
+   TEST_ASSERT_EQUAL(0, compute("GGACTGA", "GGACTGA"));
+}
+
 void test_hamming_distance_for_single_nucleotide_strand(void)
 {
    TEST_ASSERT_EQUAL(1, compute("A", "G"));
@@ -26,14 +46,14 @@ void test_small_hamming_distance_in_longer_strand(void)
    TEST_ASSERT_EQUAL(1, compute("GGACG", "GGTCG"));
 }
 
-void test_ignores_extra_length_on_first_strand_when_longer(void)
+void test_rejects_extra_length_on_first_strand_when_longer(void)
 {
-   TEST_ASSERT_EQUAL(0, compute("AAAG", "AAA"));
+   TEST_ASSERT_EQUAL(-1, compute("AAAG", "AAA"));
 }
 
-void test_ignores_extra_length_on_other_strand_when_longer(void)
+void test_rejects_extra_length_on_other_strand_when_longer(void)
 {
-   TEST_ASSERT_EQUAL(0, compute("AAA", "AAAG"));
+   TEST_ASSERT_EQUAL(-1, compute("AAA", "AAAG"));
 }
 
 void test_large_hamming_distance(void)
@@ -48,15 +68,19 @@ void test_hamming_distance_in_very_long_strand(void)
 
 int main(void)
 {
-   UnityBegin("hamming.c");
+   UnityBegin("test/test_hamming.c");
 
+   RUN_TEST(test_empty_strands);
    RUN_TEST(test_no_difference_between_identical_strands);
+   RUN_TEST(test_rejects_null_strand);
+   RUN_TEST(test_rejects_other_null_strand);
+   RUN_TEST(test_identical_long_strands);
    RUN_TEST(test_hamming_distance_for_single_nucleotide_strand);
    RUN_TEST(test_complete_hamming_distance_for_small_strand);
    RUN_TEST(test_small_hamming_distance);
    RUN_TEST(test_small_hamming_distance_in_longer_strand);
-   RUN_TEST(test_ignores_extra_length_on_first_strand_when_longer);
-   RUN_TEST(test_ignores_extra_length_on_other_strand_when_longer);
+   RUN_TEST(test_rejects_null_strand);
+   RUN_TEST(test_rejects_other_null_strand);
    RUN_TEST(test_large_hamming_distance);
    RUN_TEST(test_hamming_distance_in_very_long_strand);
 

data/tracks/clojure/config.json

@@ -65,6 +65,16 @@
 
       ]
     },
+    {
+      "uuid": "c14ef548-c5f6-43a9-84e2-c7248705fc8e",
+      "slug": "collatz-conjecture",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "66d97ae9-36ac-47c6-8b9f-e77ce498fc70",
       "slug": "nucleotide-count",

data/tracks/clojure/exercises/collatz-conjecture/README.md

@@ -0,0 +1,34 @@
+## Collatz Conjecture.
+
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+## Examples
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+
+## Source
+
+An unsolved problem in mathematics named after mathematician Lothar Collatz
+see more at [collatz conjecture wikipedia](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
+
+## 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/collatz-conjecture/project.clj

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

data/tracks/clojure/exercises/collatz-conjecture/src/collatz_conjecture.clj

@@ -0,0 +1,3 @@
+(ns collatz-conjecture)
+
+(defn collatz [n])

data/tracks/clojure/exercises/collatz-conjecture/src/example.clj

@@ -0,0 +1,13 @@
+(ns collatz-conjecture)
+
+(defn collatz-helper [n]
+  (cond (= 1 n)   1
+        (even? n) (/ n 2)
+        :else     (inc (* 3 n))))
+
+(defn collatz [n]
+  (if (> n 0)
+    (count (take-while #(not= 1 %)
+                       (iterate collatz-helper n)))
+    (throw (IllegalArgumentException.
+             "Just defined for numbers greater than 0."))))

data/tracks/clojure/exercises/collatz-conjecture/test/collatz_conjecture_test.clj

@@ -0,0 +1,29 @@
+(ns collatz-conjecture-test
+  (require [clojure.test :refer [deftest is testing]]
+           [collatz-conjecture :refer [collatz]]))
+
+(deftest steps-for-1
+  (testing "zero steps for one"
+    (is (= 0 (collatz 1)))))
+
+(deftest steps-for-16
+  (testing "divide if even"
+    (is (= 4 (collatz 16)))))
+
+(deftest steps-for-12
+  (testing "even and odd steps"
+    (is (= 9 (collatz 12)))))
+
+(deftest steps-for-1000000
+  (testing "Large number of even and odd steps"
+    (is (= 152 (collatz 1000000)))))
+
+(deftest steps-for-0
+  (testing "zero is an error"
+    (is (thrown? IllegalArgumentException
+                 (collatz 0)))))
+
+(deftest steps-for-negative
+  (testing "negative value is an error"
+    (is (thrown? IllegalArgumentException
+                 (collatz -15)))))

data/tracks/coldfusion/.gitignore

@@ -2,3 +2,4 @@
 .DS_Store
 bin/configlet
 bin/configlet.exe
+testbox

data/tracks/coldfusion/.travis.yml

@@ -1,6 +1,18 @@
 ---
-language: bash
+language: java
+sudo: required
+jdk:
+  - oraclejdk8
+cache:
+  directories:
+  - $HOME/.CommandBox
+before_install:
+  - sudo apt-key adv --keyserver keys.gnupg.net --recv 6DA70622
+  - sudo echo "deb http://downloads.ortussolutions.com/debs/noarch /" | sudo tee -a /etc/apt/sources.list.d/commandbox.list
+install:
+  - sudo apt-get update && sudo apt-get --assume-yes install commandbox
 script:
-- bin/fetch-configlet
-- bin/configlet lint .
-sudo: false
+  - bin/fetch-configlet
+  - bin/configlet lint .
+  - box task run tasks/TestAllSolutions
+

data/tracks/coldfusion/CONTRIBUTING.md

@@ -0,0 +1,10 @@
+## Contributing to the ColdFusion Exercism Track
+
+Welcome to the ColdFusion Exercism track!  We are happy you want to help out and would love to have your contributions.  Here's some basic steps to get you going:
+
+1. Familiarize yourself with Exercism by completing a few exercises.
+2. Check out the `README.md` file in this repo for additional information on our exercises are built.
+3. Read the Style Guide in the readme and ensure your exercises follow it.
+3. Fork this repo, or `git rebase` your existing fork
+4. Create a new branch for all changes
+5. Please ask if you have any questions and happy contributing!

data/tracks/coldfusion/README.md

@@ -1,13 +1,92 @@
-# xColdFusion
+# Exercism ColdFusion Track
 
-Exercism problems in ColdFusion.
+[![Build Status](https://travis-ci.org/exercism/coldfusion.svg?branch=master)](https://travis-ci.org/exercism/coldfusion)
 
-## TODO
+Exercism problems in ColdFusion.  There are two major CFML engines in existence:
 
-_Document how to contribute to the ColdFusion track._
+* **[Lucee Server](http://lucee.org/)** - A free open source CFML engine
+* **[Adobe ColdFusion](http://www.adobe.com/products/coldfusion-family.html)** - A commercially supported Enterprise CF engine
 
-## Contributing Guide
+These exercises should teach the basics of CFML in a way that can be transferred to either engine.  The CommandBox CLI will run your tests against Lucee Server by default.  
+
+## Setup
+
+The only thing you will need to run these exercises is [CommandBox CLI](https://ortus.gitbooks.io/commandbox-documentation/content/getting_started_guide.html) and [Java 7+](https://java.com/en/download/) installed.  CommandBox CLI is supported on Mac, Linux, and Windows, and the installation guide can be found here:
+
+[https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html)
+
+An example of getting CommandBox CLI setup if you're a Homebrew user on Mac would be:
+
+```bash
+brew install commandbox
+```
+
+## Anatomy of an Exercise
+
+The files for an exercise live in `/exercises/<slug>`. The slug for an exercise is a unique nickname composed of a-z (lowercase) and -, e.g. `leap` or `hello-world`. Inside its directory, each exercise has:
+
+* `<exercise_name>Test.cfc` - The test suite
+* `<exercise_name>.cfc` - Implementation stub, omitted for the later exercises 
+* `SolutionTest.cfc` - A test suite that runs the Solution
+* `Solution.cfc` - An example solution
+* `TestRunner.cfc` - A CLI task runner to run the unit test with
+* `box.json` - A package descriptor that lists dependencies
+* `index.cfm` - A web-based test runner for students wishing to start a web server  
+
+## Running the Tests
+
+To run the test for a given exercise, `cd` into the 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
+```
+
+If you want to run the test suite against the solution: 
+
+```bash 
+box task run TestRunner --solution
+```
 
-Please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
+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/)
+
+## Pull Requests
+
+We welcome pull requests that provide fixes to existing test suites (missing tests, interesting edge cases, improved APIs), as well as new problems.
+
+If you're unsure, then go ahead and open a GitHub issue, and we'll discuss the change.
+
+Please submit changes to a single problem per pull request unless you're submitting a general change across many of the problems (e.g. formatting).
+
+## Style Guide
+The exercise tests, solutions, and filenames will follow this ColdFusion style guide.
+
+[ColdFusion (CFML) Standards & Best Practices](https://github.com/Ortus-Solutions/coding-standards/blob/master/coldfusion.md)
+
+
+Here's the TL;DR; version.
+
+* Component names are camel-cased ( `LeapTest.cfc` )
+* Variable names are headless camel-cased ( `greetingService` )
+* Variable names should avoid abbreviations and be descriptive ( `maximumAccountBalance` )
+* Indentation uses a tab character
+* Remove trailing whitespace from lines 
+* Block statements will use the [`1TBS`](https://en.wikipedia.org/wiki/Indent_style#Variant:_1TBS_.28OTBS.29) with space padding all parens and brackets as follows:
+ 
+```js
+if( condition || otherCondition ) {
+	myStruct[ key ] = doSomething( param1, param2, true, 'Tuesday' );
+} else {
+	return false;
+}
+```
+
+TODO: Configure task runner to lint exercises and clean trailing whitespace and tabs/spaces.  Allow this to be run on all exercises or a single one.
+
+
+## Contributing Guide
 
+Please see the [contributing guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md)

data/tracks/coldfusion/config.json

@@ -1,20 +1,205 @@
 {
   "language": "ColdFusion",
-  "active": false,
-  "test_pattern": "_tests.cfc",
+  "blurb" : "ColdFusion (CFML) is an open source and commercial (JIT) compiled dynamic and loosely typed JVM scripting language that embodies classic OO, and functional programming, making it easy to learn, fun to use.  CFML brings the power and scalability of the J2EE ecosystem but without the boilerplate of Java.",
+  "active": true,
+  "solution_pattern": "Solution.cfc",
+  "ignore_pattern": "Solution",
   "foregone": [
-
   ],
-  "exercises": [
+  "exercises":[
     {
-      "uuid": "03a98e5b-03b7-45e5-a580-611ef5dab4e5",
-      "slug": "leap",
-      "core": false,
-      "unlocked_by": null,
+      "uuid": "ab04a390-0969-4a17-8081-c852b23ed88c",
       "difficulty": 1,
+      "slug": "hello-world",
       "topics": [
-
+        
+      ]
+    },
+    {
+      "uuid":"03a98e5b-03b7-45e5-a580-611ef5dab4e5",
+      "slug":"leap",
+      "core":false,
+      "unlocked_by":null,
+      "difficulty":1,
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"raindrops",
+      "uuid":"9273C0A7-CB7E-4F3F-8993-F1621CE1F700",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"scrabble-score",
+      "uuid":"1065F8DF-E6C6-4473-A633-4FA4B49A5314",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"difference-of-squares",
+      "uuid":"4E91AD44-8F3D-40DC-899E-253C91B134F6",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"secret-handshake",
+      "uuid":"0AC79782-B370-4954-8455-6300A734E1B8",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"space-age",
+      "uuid":"0B14F23A-DAD4-4965-8ABD-8A107DFD6C00",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"acronym",
+      "uuid":"9894F2F7-2DBE-4001-885B-FD2C029C6731",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"rna-transcription",
+      "uuid":"11C48AFF-4A54-4B3C-AF5E-53048D4BA98B",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"pangram",
+      "uuid":"113A2FF7-E72E-49DD-A2CF-0EB25894707D",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"hamming",
+      "uuid":"4063A554-424C-4173-81EE-FEAC7CC51E8A",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"gigasecond",
+      "uuid":"00B82E7F-804C-4401-BB7F-0565DEA02567",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"sum-of-multiples",
+      "uuid":"C6F38ACB-A6BD-41EE-A2F8-A9680B3F61D2",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"luhn",
+      "uuid":"685ADB7B-1DC9-4409-993D-51034DF6F744",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"triangle",
+      "uuid":"8D0FA71A-3314-432E-BF1F-E6A5F823FC36",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"largest-series-product",
+      "uuid":"A35C9BE1-F26A-40C8-8C05-99C33C552E6F",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"grains",
+      "uuid":"E25686EE-B888-4533-86C2-5A5D96F5270E",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"atbash-cipher",
+      "uuid":"C35391BD-900F-4756-8DFE-A96EA04250F8",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"nth-prime",
+      "uuid":"15151E41-195C-40DD-B296-C2C19B38CAEA",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"pig-latin",
+      "uuid":"3FDDA0E3-AE90-4834-B6DC-A5E367A5A029",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"flatten-array",
+      "uuid":"B0E72A09-49E2-4973-BFF4-88C678F4BE55",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"saddle-points",
+      "uuid":"063C4BB9-3280-4C69-B164-237732AE00EF",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"diamond",
+      "uuid":"DECA4C79-DA5D-43A8-90B8-3A5BE73EAFF5",
+      "topics":[
+        
+      ]
+    },
+    {
+      "difficulty":1,
+      "slug":"isogram",
+      "uuid":"FC8922A3-E29D-451D-9947-A2781C0FF787",
+      "topics":[
+        
       ]
     }
   ]
-}
+}