trackler 2.2.1.1 → 2.2.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 68a8bf6a80d4d09c6f6ef2633603442d8c32e4ab
-  data.tar.gz: 0f744d531bc32b4f007c97c87dd91db623f7c29a
+  metadata.gz: 3460c4854b0b5a786a64101a2f58df547f5823f5
+  data.tar.gz: adf79c90fe9ab7f504196911f62c4590b8354881
 SHA512:
-  metadata.gz: b60df628387892e6d23efab51fd3dd331e49b36a24cef70f7cb3d2f748500c62c6ff980888d30654008d17be4e9a430a8a0daa03022502364ef650bd67942469
-  data.tar.gz: dad16962f596965cb69e0f57a681d6a38087be463d68ae194d7c950748ef53f1cdd4965d3f5c01d4d772e8692278ed99b447b501b75d6bba637f7d70aa1da821
+  metadata.gz: ab8eb54d3b072d1f3821f9e4ea3694499498bea1b8680639c0c3c01a1e2d4dfa24849f1aea7f695a22a5caf871c369cb9126e30fed1d50842ae95e840e850a81
+  data.tar.gz: 2717972c9833a923d7899e8a32f7573d9b6b311a355e14d15a6d55e4b34d4af3b65d78bfb51860cddabdd7d3f602674e5646bfd6312b8c4b3f9def3d0d38aa31

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.1"
+  VERSION = "2.2.1.2"
 end

data/tracks/erlang/config/maintainers.json

@@ -0,0 +1,29 @@
+{
+  "maintainers": [
+    {
+      "github_username": "xymbol",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "etrepum",
+      "show_on_website": false,
+      "alumnus": true
+    },
+    {
+      "github_username": "NobbZ",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ]
+}

data/tracks/go/config.json

@@ -15,10 +15,7 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-        "Control-flow (conditionals)",
-        "Optional values",
-        "Strings",
-        "Text formatting"
+        "Strings"
       ]
     },
     {
@@ -354,9 +351,13 @@
       "slug": "food-chain",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 4,
       "topics": [
-
+        "Control-flow (conditionals)",
+        "Control-flow (loops)",
+        "Recursion",
+        "Strings",
+        "Text Formatting"
       ]
     },
     {
@@ -364,9 +365,11 @@
       "slug": "largest-series-product",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Integers",
+        "Sequences",
+        "Algorithms"
       ]
     },
     {

data/tracks/haskell/config/maintainers.json

@@ -0,0 +1,44 @@
+{
+  "maintainers": [
+    {
+      "github_username": "etrepum",
+      "show_on_website": false,
+      "alumnus": true,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "petertseng",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "abo64",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "rbasso",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ]
+}

data/tracks/java/docs/TESTS.md

@@ -37,7 +37,7 @@ Choose your operating system:
    C:\Users\JohnDoe>gradle test
    ```
    *(Don't worry about the tests failing, at first, this is how you begin each exercise.)*
-5. Solve the exercise.  Find and work through the `GETTING_STARTED.md` guide ([view on GitHub](https://github.com/exercism/java/blob/master/exercises/hello-world/GETTING_STARTED.md)).
+5. Solve the exercise.  Find and work through the `TUTORIAL.md` guide ([view on GitHub](https://github.com/exercism/java/blob/master/exercises/hello-world/TUTORIAL.md)).
 
 
 Good luck!  Have fun!
@@ -70,7 +70,7 @@ If you get stuck, at any point, don't forget to reach out for [help](http://exer
   $ gradle test
   ```
    *(Don't worry about the tests failing, at first, this is how you begin each exercise.)*
-4. Solve the exercise.  Find and work through the `GETTING_STARTED.md` guide ([view on GitHub](https://github.com/exercism/java/blob/master/exercises/hello-world/GETTING_STARTED.md)).
+4. Solve the exercise.  Find and work through the `TUTORIAL.md` guide ([view on GitHub](https://github.com/exercism/java/blob/master/exercises/hello-world/TUTORIAL.md)).
 
 Good luck!  Have fun!
 
@@ -102,7 +102,7 @@ If you get stuck, at any point, don't forget to reach out for [help](http://exer
   $ gradle test
   ```
    *(Don't worry about the tests failing, at first, this is how you begin each exercise.)*
-4. Solve the exercise.  Find and work through the `GETTING_STARTED.md` guide ([view on GitHub](https://github.com/exercism/java/blob/master/exercises/hello-world/GETTING_STARTED.md)).
+4. Solve the exercise.  Find and work through the `TUTORIAL.md` guide ([view on GitHub](https://github.com/exercism/java/blob/master/exercises/hello-world/TUTORIAL.md)).
 
 Good luck!  Have fun!
 

data/tracks/javascript/config.json

@@ -188,6 +188,17 @@
         "Integers"
       ]
     },
+    {
+      "uuid": "4a83a72c-db0a-45b6-b77c-1949cb24fbae",
+      "slug": "sublist",
+      "difficulty": 4,
+      "core": false,
+      "unlocked_by": "linked-list",
+      "topics": [
+        "Lists",
+        "Arrays"
+      ]
+    },
     {
       "uuid": "b668e11a-a8ce-4e94-ba68-3a1f0fa3f6c8",
       "slug": "space-age",
@@ -310,7 +321,7 @@
       "uuid": "f1943e87-182a-44f5-a885-3d68a0c0a0dc",
       "slug": "circular-buffer",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "linked-list",
       "difficulty": 8,
       "topics": [
         "Control flow (conditionals)",
@@ -690,7 +701,7 @@
       "uuid": "5991c379-f033-4b46-9702-6b7fd03640e8",
       "slug": "binary-search",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "linked-list",
       "difficulty": 7,
       "topics": [
         "Control flow (conditionals)",
@@ -1018,7 +1029,7 @@
       "uuid": "c21ab6e8-b845-49d0-a2f6-1c89c7a07626",
       "slug": "simple-linked-list",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "linked-list",
       "difficulty": 8,
       "topics": [
         "Arrays",

data/tracks/javascript/exercises/sublist/README.md

@@ -0,0 +1,50 @@
+# Sublist
+
+Given two lists determine if the first list is contained within the second
+list, if the second list is contained within the first list, if both lists are
+contained within each other or if none of these are true.
+
+Specifically, a list A is a sublist of list B if by dropping 0 or more elements
+from the front of B and 0 or more elements from the back of B you get a list
+that's completely equal to A.
+
+Examples:
+
+ * A = [1, 2, 3], B = [1, 2, 3, 4, 5], A is a sublist of B
+ * A = [3, 4, 5], B = [1, 2, 3, 4, 5], A is a sublist of B
+ * A = [3, 4], B = [1, 2, 3, 4, 5], A is a sublist of B
+ * A = [1, 2, 3], B = [1, 2, 3], A is equal to B
+ * A = [1, 2, 3, 4, 5], B = [2, 3, 4], A is a superlist of B
+ * A = [1, 2, 4], B = [1, 2, 3, 4, 5], A is not a superlist of, sublist of or equal to B
+
+## Setup
+
+Go through the setup instructions for ECMAScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/ecmascript
+
+## Requirements
+
+Install assignment dependencies:
+
+```bash
+$ npm install -g jasmine
+```
+
+## Making the test suite pass
+
+Execute the tests with:
+
+```bash
+$ jasmine sublist.spec.js
+```
+
+In the test suites all tests but the first have been skipped.
+
+Once you get a test passing, you can enable the next one by
+changing `xit` to `it`.
+
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -0,0 +1,31 @@
+function List(list) {
+  this.list = list || [];
+
+  return {
+    list: this.list,
+    compare: function(other){
+        return {
+          '-1': isSublist(other.list, this.list)
+                  ? 'SUBLIST'
+                  : 'UNEQUAL',
+          '0':  isSublist(other.list, this.list)
+                  ? 'EQUAL'
+                  : 'UNEQUAL',
+          '1':  isSublist(this.list, other.list)
+                  ? 'SUPERLIST'
+                  : 'UNEQUAL'
+        }[lengthDiff(this, other)];
+    }
+  }
+}
+
+function lengthDiff(one, two){
+  return String(Math.sign(one.list.length - two.list.length));
+}
+
+function isSublist(one, two){
+  return one.join().match(two.join());
+}
+
+
+module.exports = List;

data/tracks/javascript/exercises/sublist/sublist.spec.js

@@ -0,0 +1,126 @@
+var List = require('./sublist');
+
+
+describe('sublist', function() {
+
+  it('two empty lists are equal', function() {
+    var listOne = new List();
+    var listTwo = new List();
+
+    expect(listOne.compare(listTwo)).toEqual('EQUAL');
+  });
+
+  xit('an empty list is a sublist of a non-empty list', function() {
+    var listOne = new List();
+    var listTwo = new List([1, 2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xit('non empty list contains empty list', function() {
+    var listOne = new List([1, 2, 3]);
+    var listTwo = new List();
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xit('a non-empty list equals itself', function() {
+    var listOne = new List([1, 2, 3]);
+    var listTwo = new List([1, 2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('EQUAL');
+  });
+
+  xit('two different lists are unequal', function() {
+    var listOne = new List([1, 2, 3]);
+    var listTwo = new List([2, 3, 4]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xit('false start', function() {
+    var listOne = new List([1, 2, 5]);
+    var listTwo = new List([0, 1, 2, 3, 1, 2, 5, 6]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+
+  });
+
+  xit('consecutive', function() {
+    var listOne = new List([1, 1, 2]);
+    var listTwo = new List([0, 1, 1, 1, 2, 1, 2]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xit('sublist at start', function() {
+    var listOne = new List([0, 1, 2]);
+    var listTwo = new List([0, 1, 2, 3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xit('sublist in middle', function() {
+    var listOne = new List([2, 3, 4]);
+    var listTwo = new List([0, 1, 2, 3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xit('sublist at end', function() {
+    var listOne = new List([3, 4, 5]);
+    var listTwo = new List([0, 1, 2, 3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xit('at start of superlist', function() {
+    var listOne = new List([0, 1, 2, 3, 4, 5]);
+    var listTwo = new List([0, 1, 2]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xit('in middle of superlist', function() {
+    var listOne = new List([0, 1, 2, 3, 4, 5]);
+    var listTwo = new List([2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xit('at end of superlist', function() {
+    var listOne = new List([0, 1, 2, 3, 4, 5]);
+    var listTwo = new List([3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xit('first list missing element from second list', function() {
+    var listOne = new List([1, 3]);
+    var listTwo = new List([1, 2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xit('second list missing element from first list', function() {
+    var listOne = new List([1, 2, 3]);
+    var listTwo = new List([1, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xit('order matters to a list', function() {
+    var listOne = new List([1, 2, 3]);
+    var listTwo = new List([3, 2, 1]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xit('same digits but different numbers', function() {
+    var listOne = new List([1, 0, 1]);
+    var listTwo = new List([10, 1]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+});

data/tracks/pony/README.md

@@ -6,7 +6,7 @@ Exercism exercises in Pony.
 
 ## Contributing Guide
 
-Please see the [contributing guide](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md).
+Please see the [contributing guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
 
 
 ### Pony icon

data/tracks/pony/config.json

@@ -1,7 +1,5 @@
 {
-  "slug": "pony",
   "language": "Pony",
-  "repository": "https://github.com/exercism/pony",
   "active": false,
   "exercises": [
     {

data/tracks/pony/config/exercise_readme.go.tmpl

@@ -0,0 +1,16 @@
+# {{ .Spec.Name }}
+
+{{ .Spec.Description -}}
+{{- with .Hints }}
+{{ . }}
+{{ end }}
+{{- with .TrackInsert }}
+{{ . }}
+{{ end }}
+{{- with .Spec.Credits -}}
+## Source
+
+{{ . }}
+{{ end }}
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.