trackler 2.2.1.110 → 2.2.1.111

data/tracks/javascript/exercises/simple-linked-list/simple-linked-list.spec.js

@@ -16,9 +16,11 @@ describe('simple-linked-list', function () {
       var el = new Element(1);
       expect(el).toBeDefined();
 
+      /* eslint-disable new-cap */
       expect(function () {
-        var el = Element(1);
+        el = Element(1);
       }).toThrow();
+      /* eslint-enable new-cap */
     });
 
     xit('requires an argument', function () {
@@ -26,7 +28,7 @@ describe('simple-linked-list', function () {
       expect(el).toBeDefined();
 
       expect(function () {
-        var el = new Element();
+        el = new Element();
       }).toThrow();
     });
 
@@ -47,9 +49,9 @@ describe('simple-linked-list', function () {
     expect(elTwo.next).toBe(elOne);
   });
 
+  /* eslint-disable no-unused-vars */
   xit('requires an instance of Element as next element', function () {
     expect(function () {
-      var el = new Element(1, true);
       var el = new Element(1, false);
     }).toThrow();
     expect(function () {
@@ -62,6 +64,7 @@ describe('simple-linked-list', function () {
       var el = new Element(1, {});
     }).toThrow();
   });
+  /* eslint-enable no-unused-vars */
 
   describe('List', function () {
     xit('is a constructor', function () {

data/tracks/javascript/exercises/variable-length-quantity/README.md

@@ -0,0 +1,62 @@
+# Variable Length Quantity
+
+Implement variable length quantity encoding and decoding.
+
+The goal of this exercise is to implement [VLQ](https://en.wikipedia.org/wiki/Variable-length_quantity) encoding/decoding.
+
+In short, the goal of this encoding is to encode integer values in a way that would save bytes.
+Only the first 7 bits of each byte is significant (right-justified; sort of like an ASCII byte).
+So, if you have a 32-bit value, you have to unpack it into a series of 7-bit bytes.
+Of course, you will have a variable number of bytes depending upon your integer.
+To indicate which is the last byte of the series, you leave bit #7 clear.
+In all of the preceding bytes, you set bit #7.
+
+So, if an integer is between `0-127`, it can be represented as one byte.
+Although VLQ can deal with numbers of arbitrary sizes, for this exercise we will restrict ourselves to only numbers that fit in a 32-bit unsigned integer.
+Here are examples of integers as 32-bit values, and the variable length quantities that they translate to:
+
+```text
+ NUMBER        VARIABLE QUANTITY
+00000000              00
+00000040              40
+0000007F              7F
+00000080             81 00
+00002000             C0 00
+00003FFF             FF 7F
+00004000           81 80 00
+00100000           C0 80 00
+001FFFFF           FF FF 7F
+00200000          81 80 80 00
+08000000          C0 80 80 00
+0FFFFFFF          FF FF FF 7F
+```
+
+## Setup
+
+Go through the setup instructions for JavaScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/javascript
+
+## Making the Test Suite Pass
+
+Execute the tests with:
+
+    jasmine <exercise-name>.spec.js
+
+Replace `<exercise-name>` with the name of the current exercise. E.g., to
+test the Hello World exercise:
+
+    jasmine hello-world.spec.js
+
+In many test suites all but the first test have been skipped.
+
+Once you get a test passing, you can unskip the next one by
+changing `xit` to `it`.
+
+## Source
+
+A poor Splice developer having to implement MIDI encoding/decoding. [https://splice.com](https://splice.com)
+
+## 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/variable-length-quantity/example.js

@@ -0,0 +1,51 @@
+var LENGTH = 7;
+var CONT_BITS = 1 << LENGTH;
+var DATA_BITS = CONT_BITS - 1;
+
+var encodeOne = function (val) {
+  var buf = [];
+  var left = val;
+
+  while (left) {
+    var bits = left & DATA_BITS | CONT_BITS; // set continuation everywhere
+    left = left >>> LENGTH;
+    buf.push(bits);
+  }
+  buf[0] = buf[0] & DATA_BITS; // cancel the last continuation
+  return buf.reverse();
+};
+
+var decodeOne = function (buf) {
+  var val = 0;
+
+  for (var i = 0; i < buf.length; i++) {
+    val = val << LENGTH | buf[i] & DATA_BITS;
+  }
+  return val >>> 0; // convert to unsigned 32-bit
+};
+
+module.exports = {
+  encode: function encode(data) {
+    var buf = [];
+
+    for (var i = 0; i < data.length; i++) {
+      buf = buf.concat(encodeOne(data[i]));
+    }
+    return buf;
+  },
+  decode: function decode(data) {
+    var start = 0;
+    var vals = [];
+
+    for (var i = 0; i < data.length; i++) {
+      if (~data[i] & CONT_BITS) {
+        vals.push(decodeOne(data.slice(start, i + 1)));
+        start = i + 1;
+      }
+    }
+    if (start < data.length) {
+      throw new Error('Incomplete sequence');
+    }
+    return vals;
+  }
+};

data/tracks/javascript/exercises/variable-length-quantity/variable-length-quantity.spec.js

@@ -0,0 +1,115 @@
+var VLQ = require('./variable-length-quantity');
+
+describe('VariableLengthQuantity', function () {
+  describe('Encode a series of integers, producing a series of bytes.', function () {
+    it('zero', function () {
+      expect(VLQ.encode([0])).toEqual([0]);
+    });
+
+    it('arbitrary single byte', function () {
+      expect(VLQ.encode([0x40])).toEqual([0x40]);
+    });
+
+    it('largest single byte', function () {
+      expect(VLQ.encode([0x7f])).toEqual([0x7f]);
+    });
+
+    it('smallest double byte', function () {
+      expect(VLQ.encode([0x80])).toEqual([0x81, 0]);
+    });
+
+    it('arbitrary double byte', function () {
+      expect(VLQ.encode([0x2000])).toEqual([0xc0, 0]);
+    });
+
+    it('largest double byte', function () {
+      expect(VLQ.encode([0x3fff])).toEqual([0xff, 0x7f]);
+    });
+
+    it('smallest triple byte', function () {
+      expect(VLQ.encode([0x4000])).toEqual([0x81, 0x80, 0]);
+    });
+
+    it('arbitrary triple byte', function () {
+      expect(VLQ.encode([0x100000])).toEqual([0xc0, 0x80, 0]);
+    });
+
+    it('largest triple byte', function () {
+      expect(VLQ.encode([0x1fffff])).toEqual([0xff, 0xff, 0x7f]);
+    });
+
+    it('smallest quadruple byte', function () {
+      expect(VLQ.encode([0x200000])).toEqual([0x81, 0x80, 0x80, 0]);
+    });
+
+    it('arbitrary quadruple byte', function () {
+      expect(VLQ.encode([0x8000000])).toEqual([0xc0, 0x80, 0x80, 0]);
+    });
+
+    it('largest quadruple byte', function () {
+      expect(VLQ.encode([0xfffffff])).toEqual([0xff, 0xff, 0xff, 0x7f]);
+    });
+
+    it('smallest quintuple byte', function () {
+      expect(VLQ.encode([0x10000000])).toEqual([0x81, 0x80, 0x80, 0x80, 0]);
+    });
+
+    it('arbitrary quintuple byte', function () {
+      expect(VLQ.encode([0xff000000])).toEqual([0x8f, 0xf8, 0x80, 0x80, 0]);
+    });
+
+    it('maximum 32-bit integer input', function () {
+      expect(VLQ.encode([0xffffffff])).toEqual([0x8f, 0xff, 0xff, 0xff, 0x7f]);
+    });
+
+    it('two single-byte values', function () {
+      expect(VLQ.encode([0x40, 0x7f])).toEqual([0x40, 0x7f]);
+    });
+
+    it('two multi-byte values', function () {
+      expect(VLQ.encode([0x4000, 0x123456])).toEqual([0x81, 0x80, 0, 0xc8, 0xe8, 0x56]);
+    });
+
+    it('many multi-byte values', function () {
+      var input = [0x2000, 0x123456, 0xfffffff, 0, 0x3fff, 0x4000];
+      var expected = [0xc0, 0, 0xc8, 0xe8, 0x56, 0xff, 0xff, 0xff, 0x7f, 0, 0xff, 0x7f, 0x81, 0x80, 0];
+      expect(VLQ.encode(input)).toEqual(expected);
+    });
+  });
+
+  describe('Decode a series of bytes, producing a series of integers.', function () {
+    it('one byte', function () {
+      expect(VLQ.decode([0x7f])).toEqual([0x7f]);
+    });
+
+    it('two bytes', function () {
+      expect(VLQ.decode([0xc0, 0])).toEqual([0x2000]);
+    });
+
+    it('three bytes', function () {
+      expect(VLQ.decode([0xff, 0xff, 0x7f])).toEqual([0x1fffff]);
+    });
+
+    it('four bytes', function () {
+      expect(VLQ.decode([0x81, 0x80, 0x80, 0])).toEqual([0x200000]);
+    });
+
+    it('maximum 32-bit integer', function () {
+      expect(VLQ.decode([0x8f, 0xff, 0xff, 0xff, 0x7f])).toEqual([0xffffffff]);
+    });
+
+    it('incomplete sequence causes error', function () {
+      expect(function () { VLQ.decode([0xff]); }).toThrow(new Error('Incomplete sequence'));
+    });
+
+    it('incomplete sequence causes error, even if value is zero', function () {
+      expect(function () { VLQ.decode([0x80]); }).toThrow(new Error('Incomplete sequence'));
+    });
+
+    it('multiple values', function () {
+      var input = [0xc0, 0, 0xc8, 0xe8, 0x56, 0xff, 0xff, 0xff, 0x7f, 0, 0xff, 0x7f, 0x81, 0x80, 0];
+      var expected = [0x2000, 0x123456, 0xfffffff, 0, 0x3fff, 0x4000];
+      expect(VLQ.decode(input)).toEqual(expected);
+    });
+  });
+});

data/tracks/javascript/package.json

@@ -21,9 +21,11 @@
     "lint-fix": "eslint . --fix"
   },
   "eslintConfig": {
-    "plugins": ["jasmine"],
+    "plugins": [
+      "jasmine"
+    ],
     "env": {
-      "jasmine": true 
+      "jasmine": true
     },
     "extends": "eslint-config-airbnb-es5",
     "rules": {

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

@@ -4,10 +4,21 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
-{{- with .Spec.Credits -}}
+* * * *
+
+For installation and learning resources, refer to the [exercism help page][].
+
+[exercism help page]: http://exercism.io/languages/lfe
+
+To run the provided tests, you will need `make`.
+Open a terminal window and run the following from the exercise directory:
+
+```sh
+make test
+```
+
+You should now be able to see the results of the test suite for the exercise.
+{{ with .Spec.Credits }}
 ## Source
 
 {{ . }}

data/tracks/lfe/exercises/accumulate/README.md

@@ -25,9 +25,6 @@ Keep your hands off that collect/map/fmap/whatchamacallit functionality
 provided by your standard library!
 Solve this one yourself using other basic tools instead.
 
-Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
-as this is idiomatic Lisp, not a library function.
-
 * * * *
 
 For installation and learning resources, refer to the [exercism help page][].

data/tracks/lfe/exercises/allergies/README.md

@@ -29,7 +29,6 @@ allergens that score 256, 512, 1024, etc.).  Your program should
 ignore those components of the score.  For example, if the allergy
 score is 257, your program should only report the eggs (1) allergy.
 
-
 * * * *
 
 For installation and learning resources, refer to the [exercism help page][].

data/tracks/lfe/exercises/atbash-cipher/README.md

@@ -9,7 +9,7 @@ letter, the second with the second-last, and so on.
 
 An Atbash cipher for the Latin alphabet would be as follows:
 
-```plain
+```text
 Plain:  abcdefghijklmnopqrstuvwxyz
 Cipher: zyxwvutsrqponmlkjihgfedcba
 ```
@@ -23,6 +23,7 @@ being 5 letters, and punctuation is excluded. This is to make it harder to guess
 things based on word boundaries.
 
 ## Examples
+
 - Encoding `test` gives `gvhg`
 - Decoding `gvhg` gives `test`
 - Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`

data/tracks/lfe/exercises/bank-account/README.md

@@ -41,6 +41,5 @@ make test
 
 You should now be able to see the results of the test suite for the exercise.
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/lfe/exercises/beer-song/README.md

@@ -1,10 +1,10 @@
 # Beer Song
 
-Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.
+Recite the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.
 
 Note that not all verses are identical.
 
-```plain
+```text
 99 bottles of beer on the wall, 99 bottles of beer.
 Take one down and pass it around, 98 bottles of beer on the wall.
 

data/tracks/lfe/exercises/binary/README.md

@@ -7,10 +7,12 @@ string, your program should produce a decimal output. The
 program should handle invalid inputs.
 
 ## Note
+
 - Implement the conversion yourself.
   Do not use something else to perform the conversion for you.
 
 ## About Binary (Base-2)
+
 Decimal is a base-10 system.
 
 A number 23 in base 10 notation can be understood

data/tracks/lfe/exercises/circular-buffer/README.md

@@ -31,18 +31,25 @@ If the buffer has 7 elements then it is completely full:
 When the buffer is full an error will be raised, alerting the client
 that further writes are blocked until a slot becomes free.
 
-The client can opt to overwrite the oldest data with a forced write. In
-this case, two more elements — A & B — are added and they overwrite the
-3 & 4:
+When the buffer is full, the client can opt to overwrite the oldest
+data with a forced write. In this case, two more elements — A & B —
+are added and they overwrite the 3 & 4:
 
     [6][7][8][9][A][B][5]
 
-Finally, if two elements are now removed then what would be returned is
-not 3 & 4 but 5 & 6 because A & B overwrote the 3 & the 4 yielding the
-buffer with:
+3 & 4 have been replaced by A & B making 5 now the oldest data in the
+buffer. Finally, if two elements are removed then what would be
+returned is 5 & 6 yielding the buffer:
 
     [ ][7][8][9][A][B][ ]
 
+Because there is space available, if the client again uses overwrite
+to store C & D then the space where 5 & 6 were stored previously will
+be used not the location of 7 & 8. 7 is still the oldest element and
+the buffer is once again full.
+
+    [D][7][8][9][A][B][C]
+
 * * * *
 
 For installation and learning resources, refer to the [exercism help page][].

data/tracks/lfe/exercises/etl/README.md

@@ -1,8 +1,9 @@
-# Etl
+# ETL
 
 We are going to do the `Transform` step of an Extract-Transform-Load.
 
 ### ETL
+
 Extract-Transform-Load (ETL) is a fancy way of saying, "We have some crufty, legacy data over in this system, and now we need it in this shiny new system over here, so
 we're going to migrate this."
 
@@ -11,6 +12,7 @@ once." That's then typically followed by much forehead slapping and
 moaning about how stupid we could possibly be.)
 
 ### The goal
+
 We're going to extract some scrabble scores from a legacy system.
 
 The old system stored a list of letters per score:

data/tracks/lfe/exercises/grade-school/README.md

@@ -21,7 +21,6 @@ In the end, you should be able to:
 Note that all our students only have one name.  (It's a small town, what
 do you want?)
 
-
 ## For bonus points
 
 Did you get the tests passing and the code clean? If you want to, these