trackler 2.2.0.0 → 2.2.0.1

data/tracks/ecmascript/exercises/pangram/pangram.spec.js

@@ -1,50 +1,48 @@
 import Pangram from './pangram';
 
 describe('Pangram()', () => {
-
   test('empty sentence', () => {
     const pangram = new Pangram('');
     expect(pangram.isPangram()).toBe(false);
   });
 
   xtest('pangram with only lower case', () => {
-    const pangram = new Pangram("the quick brown fox jumps over the lazy dog");
+    const pangram = new Pangram('the quick brown fox jumps over the lazy dog');
     expect(pangram.isPangram()).toBe(true);
   });
 
   xtest("missing character 'x'", () => {
-    const pangram = new Pangram("a quick movement of the enemy will jeopardize five gunboats");
+    const pangram = new Pangram('a quick movement of the enemy will jeopardize five gunboats');
     expect(pangram.isPangram()).toBe(false);
   });
 
   xtest("another missing character 'x'", () => {
-    const pangram = new Pangram("the quick brown fish jumps over the lazy dog");
+    const pangram = new Pangram('the quick brown fish jumps over the lazy dog');
     expect(pangram.isPangram()).toBe(false);
   });
 
-  xtest("pangram with underscores", () => {
-    const pangram = new Pangram("the_quick_brown_fox_jumps_over_the_lazy_dog");
+  xtest('pangram with underscores', () => {
+    const pangram = new Pangram('the_quick_brown_fox_jumps_over_the_lazy_dog');
     expect(pangram.isPangram()).toBe(true);
   });
 
-  xtest("pangram with numbers", () => {
-    const pangram = new Pangram("the 1 quick brown fox jumps over the 2 lazy dogs");
+  xtest('pangram with numbers', () => {
+    const pangram = new Pangram('the 1 quick brown fox jumps over the 2 lazy dogs');
     expect(pangram.isPangram()).toBe(true);
   });
 
   xtest('missing letters replaced by numbers', () => {
-    const pangram = new Pangram("7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog");
+    const pangram = new Pangram('7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog');
     expect(pangram.isPangram()).toBe(false);
   });
 
   xtest('pangram with mixed case and punctuation', () => {
-    const pangram = new Pangram("\"Five quacking Zephyrs jolt my wax bed.\"");
+    const pangram = new Pangram('"Five quacking Zephyrs jolt my wax bed."');
     expect(pangram.isPangram()).toBe(true);
   });
 
   xtest('pangram with non-ascii characters', () => {
-    const pangram = new Pangram("Victor jagt zwölf Boxkämpfer quer über den großen Sylter Deich.");
+    const pangram = new Pangram('Victor jagt zwölf Boxkämpfer quer über den großen Sylter Deich.');
     expect(pangram.isPangram()).toBe(true);
   });
-
 });

data/tracks/ecmascript/exercises/pascals-triangle/example.js

@@ -9,9 +9,9 @@ class Triangle {
   }
 
   fillRows(rows) {
-    let result = [[ 1 ]];
+    const result = [[1]];
     for (let x = 1; x < rows; x++) {
-      let newRow = [ 1 ];
+      const newRow = [1];
       result[x - 1].forEach(this.sumElements, newRow);
       result.push(newRow);
     }

data/tracks/ecmascript/exercises/pascals-triangle/pascals-triangle.spec.js

@@ -1,30 +1,28 @@
 import Triangle from './pascals-triangle';
 
 describe('Triangle', () => {
-
   test('with one row', () => {
-    expect(new Triangle(1).rows).toEqual([[ 1 ]]);
+    expect(new Triangle(1).rows).toEqual([[1]]);
   });
 
   xtest('with two rows', () => {
-    expect(new Triangle(2).rows).toEqual([ [ 1 ], [ 1, 1 ] ]);
+    expect(new Triangle(2).rows).toEqual([[1], [1, 1]]);
   });
 
   xtest('with three rows', () => {
-    expect(new Triangle(3).rows).toEqual([ [ 1 ], [ 1, 1 ], [ 1, 2, 1 ] ]);
+    expect(new Triangle(3).rows).toEqual([[1], [1, 1], [1, 2, 1]]);
   });
 
   xtest('last row', () => {
-    expect(new Triangle(4).lastRow).toEqual([ 1, 3, 3, 1 ]);
+    expect(new Triangle(4).lastRow).toEqual([1, 3, 3, 1]);
   });
 
   xtest('fifth row', () => {
-    expect(new Triangle(5).lastRow).toEqual([ 1, 4, 6, 4, 1 ]);
+    expect(new Triangle(5).lastRow).toEqual([1, 4, 6, 4, 1]);
   });
 
   xtest('twentieth row', () => {
-    const twentieth = [ 1, 19, 171, 969, 3876, 11628, 27132, 50388, 75582, 92378, 92378, 75582, 50388, 27132, 11628, 3876, 969, 171, 19, 1 ];
+    const twentieth = [1, 19, 171, 969, 3876, 11628, 27132, 50388, 75582, 92378, 92378, 75582, 50388, 27132, 11628, 3876, 969, 171, 19, 1];
     expect(new Triangle(20).lastRow).toEqual(twentieth);
   });
-
 });

data/tracks/ecmascript/exercises/perfect-numbers/example.js

@@ -7,9 +7,8 @@ export default class PerfectNumbers {
    * @returns {array} array that contains the divisors for a given number NOT including the number itself.
    */
   getDivisors(number) {
-
     let i;
-    let divs = new Array();
+    const divs = new Array();
 
     // Accepts only natural numbers greater than 1.
     if (number <= 1) {
@@ -21,7 +20,6 @@ export default class PerfectNumbers {
 
     // Calculate the divisors up the the half of the number + 1
     for (i = 2; i <= number / 2; i++) {
-
       if (number % i === 0) {
         divs.push(i);
       }
@@ -37,8 +35,8 @@ export default class PerfectNumbers {
    * @returns {string} - string that contains the number classification (perfect, abundant or deficient).
    */
   classify(number) {
-
-    let sum, result;
+    let sum,
+      result;
 
     // Check if the input is valid
     if (number <= 0) {

data/tracks/ecmascript/exercises/perfect-numbers/perfect-numbers.spec.js

@@ -1,11 +1,9 @@
 import PerfectNumbers from './perfect-numbers';
 
 describe('Exercise - Perfect Numbers', () => {
-
   const perfectNumbers = new PerfectNumbers();
 
   describe('Perfect Numbers', () => {
-
     test('Smallest perfect number is classified correctly', () => {
       expect(perfectNumbers.classify(6)).toEqual('perfect');
     });
@@ -17,11 +15,9 @@ describe('Exercise - Perfect Numbers', () => {
     xtest('Large perfect number is classified correctly', () => {
       expect(perfectNumbers.classify(33550336)).toEqual('perfect');
     });
-
   });
 
   describe('Abundant Numbers', () => {
-
     xtest('Smallest abundant number is classified correctly', () => {
       expect(perfectNumbers.classify(12)).toEqual('abundant');
     });
@@ -33,11 +29,9 @@ describe('Exercise - Perfect Numbers', () => {
     xtest('Large abundant number is classified correctly', () => {
       expect(perfectNumbers.classify(33550335)).toEqual('abundant');
     });
-
   });
 
   describe('Deficient Numbers', () => {
-
     xtest('Smallest prime deficient number is classified correctly', () => {
       expect(perfectNumbers.classify(2)).toEqual('deficient');
     });
@@ -57,11 +51,9 @@ describe('Exercise - Perfect Numbers', () => {
     xtest('Edge case (no factors other than itself) is classified correctly', () => {
       expect(perfectNumbers.classify(1)).toEqual('deficient');
     });
-
   });
 
   describe('Invalid Inputs', () => {
-
     xtest('Zero is rejected (not a natural number)', () => {
       expect(() => perfectNumbers.classify(0))
         .toThrow('Classification is only possible for natural numbers.');
@@ -71,7 +63,5 @@ describe('Exercise - Perfect Numbers', () => {
       expect(() => perfectNumbers.classify(-1))
         .toThrow('Classification is only possible for natural numbers.');
     });
-
   });
-
 });

data/tracks/ecmascript/exercises/phone-number/example.js

@@ -5,7 +5,7 @@ export default class PhoneNumber {
   }
 
   number() {
-    if(/[a-zA-Z]/.test(this.rawNumber)) {
+    if (/[a-zA-Z]/.test(this.rawNumber)) {
       return null;
     }
 
@@ -13,7 +13,7 @@ export default class PhoneNumber {
   }
 
   _cleanedNumber() {
-    let num = this.rawNumber.replace(/\D/g,'');
+    const num = this.rawNumber.replace(/\D/g, '');
 
     if (num.length === 10) {
       return num;

data/tracks/ecmascript/exercises/phone-number/phone-number.spec.js

@@ -1,7 +1,6 @@
 import PhoneNumber from './phone-number';
 
 describe('PhoneNumber()', () => {
-
   test('cleans the number', () => {
     const phone = new PhoneNumber('(123) 456-7890');
     expect(phone.number()).toEqual('1234567890');
@@ -51,5 +50,4 @@ describe('PhoneNumber()', () => {
     const phone = new PhoneNumber('1a2b3c4d5e6f7g8h9i0j');
     expect(phone.number()).toEqual(null);
   });
-
 });

data/tracks/ecmascript/exercises/pig-latin/example.js

@@ -1,16 +1,16 @@
 const LANGUAGE_RULES_REGEXP = /^([^aeiou]?qu|[^aeiou]*)(.+)/;
 
 function translateWord(word) {
-  const [ , beginning, ending ] = word.match(LANGUAGE_RULES_REGEXP);
+  const [, beginning, ending] = word.match(LANGUAGE_RULES_REGEXP);
 
   if (beginning.length === 0) {
-    return word + 'ay';
+    return `${word}ay`;
   }
-  return ending + beginning + 'ay';
+  return `${ending + beginning}ay`;
 }
 
 class PigLatin {
-  translate (english) {
+  translate(english) {
     return english
       .split(' ')
       .map(translateWord)

data/tracks/ecmascript/exercises/pig-latin/pig-latin.spec.js

@@ -47,5 +47,4 @@ describe('Pig Latin', () => {
     expect(translator.translate('quick fast run'))
       .toEqual('ickquay astfay unray');
   });
-
 });

data/tracks/ecmascript/exercises/prime-factors/example.js

@@ -1,6 +1,6 @@
 class PrimeFactors {
-  for (num) {
-    const factors=[];
+  for(num) {
+    const factors = [];
     let currentFactor = 2;
 
     while (num !== 1) {

data/tracks/ecmascript/exercises/prime-factors/prime-factors.spec.js

@@ -2,7 +2,6 @@ import PrimeFactors from './prime-factors';
 const primeFactors = new PrimeFactors();
 
 describe('primeFactors', () => {
-
   test('returns an empty array for 1', () => expect(primeFactors.for(1)).toEqual([]));
 
   xtest('factors 2', () => expect(primeFactors.for(2)).toEqual([2]));
@@ -24,5 +23,4 @@ describe('primeFactors', () => {
   xtest('factors 901255', () => expect(primeFactors.for(901255)).toEqual([5, 17, 23, 461]));
 
   xtest('factors 93819012551', () => expect(primeFactors.for(93819012551)).toEqual([11, 9539, 894119]));
-
 });

data/tracks/ecmascript/exercises/pythagorean-triplet/pythagorean-triplet.spec.js

@@ -1,7 +1,6 @@
 import Triplet from './pythagorean-triplet';
 
 describe('Triplet', () => {
-
   test('calculates the sum', () => {
     expect(new Triplet(3, 4, 5).sum()).toBe(12);
   });
@@ -20,26 +19,19 @@ describe('Triplet', () => {
 
   xtest('can make triplets up to 10', () => {
     const triplets = Triplet.where({ maxFactor: 10 });
-    const products = triplets.sort().map(triplet => {
-      return triplet.product();
-    });
+    const products = triplets.sort().map(triplet => triplet.product());
     expect(products).toEqual([60, 480]);
   });
 
   xtest('can make triplets 11 through 20', () => {
     const triplets = Triplet.where({ minFactor: 11, maxFactor: 20 });
-    const products = triplets.sort().map(triplet => {
-      return triplet.product();
-    });
+    const products = triplets.sort().map(triplet => triplet.product());
     expect(products).toEqual([3840]);
   });
 
   xtest('can filter on sum', () => {
     const triplets = Triplet.where({ sum: 180, maxFactor: 100 });
-    const products = triplets.sort().map(triplet => {
-      return triplet.product();
-    });
+    const products = triplets.sort().map(triplet => triplet.product());
     expect(products).toEqual([118080, 168480, 202500]);
   });
-
 });

data/tracks/ecmascript/exercises/queen-attack/example.js

@@ -1,23 +1,23 @@
 const W = 8,
   H = 8,
-  STARTING = { black : [7,3], white: [0,3] };
+  STARTING = { black: [7, 3], white: [0, 3] };
 
-const QueenAttack = ( params = STARTING )  => {
+const QueenAttack = (params = STARTING) => {
   const self = this instanceof QueenAttack ? this : Object.getPrototypeOf(QueenAttack);
-  if (params && params.white === params.black){
-    throw new Error("Queens cannot share the same space");
+  if (params && params.white === params.black) {
+    throw new Error('Queens cannot share the same space');
   }
 
-  self.black=params.black;
-  self.white=params.white;
+  self.black = params.black;
+  self.white = params.white;
   self.board = constructBoard();
   placePieces(self);
 
   self.canAttack = () => {
-    if (self.black[0] === self.white[0] || self.black[1] === self.white[1]){
+    if (self.black[0] === self.white[0] || self.black[1] === self.white[1]) {
       return true;
     }
-    return Math.abs(self.black[0]-self.white[0]) === Math.abs(self.black[1]-self.white[1]);
+    return Math.abs(self.black[0] - self.white[0]) === Math.abs(self.black[1] - self.white[1]);
   };
 
   self.toString = () => self.board.join('');
@@ -25,22 +25,22 @@ const QueenAttack = ( params = STARTING )  => {
   return self;
 };
 
-function constructBoard(){
-  let row = buildRow("_ ", W).join('');
-  row = row.substring(0, row.length-1)+"\n";
+function constructBoard() {
+  let row = buildRow('_ ', W).join('');
+  row = `${row.substring(0, row.length - 1)}\n`;
   return concatRows(row, H);
 }
 
-function placePieces(self){
-  self.board[self.black[0]*W*2+self.black[1]*2]='B';
-  self.board[self.white[0]*W*2+self.white[1]*2]='W';
+function placePieces(self) {
+  self.board[self.black[0] * W * 2 + self.black[1] * 2] = 'B';
+  self.board[self.white[0] * W * 2 + self.white[1] * 2] = 'W';
 }
 
-function buildRow(cell, colCount){
-  return Array.apply(null, Array(colCount)).map(() => cell);
+function buildRow(cell, colCount) {
+  return Array(...Array(colCount)).map(() => cell);
 }
 
-function concatRows(row, rowCount){
+function concatRows(row, rowCount) {
   return [...Array.prototype.concat.apply(buildRow(row, rowCount)).join('')];
 }
 

data/tracks/ecmascript/exercises/queen-attack/queen-attack.spec.js

@@ -8,23 +8,23 @@ describe('Queens', () => {
   });
 
   xtest('initialized with specific placement', () => {
-    const queens = new Queens({white: [3,7], black: [6,1]});
+    const queens = new Queens({ white: [3, 7], black: [6, 1] });
     expect(queens.white).toEqual([3, 7]);
     expect(queens.black).toEqual([6, 1]);
   });
 
   xtest('cannot occupy the same space', () => {
-    const positioning = {white: [2,4], black: [2,4]};
+    const positioning = { white: [2, 4], black: [2, 4] };
 
     try {
       new Queens(positioning);
-    } catch(error) {
+    } catch (error) {
       expect(error).toEqual('Queens cannot share the same space');
     }
   });
 
   xtest('toString representation', () => {
-    const positioning = {white: [2, 4], black: [6, 6]};
+    const positioning = { white: [2, 4], black: [6, 6] };
     const queens = new Queens(positioning);
     const board = '_ _ _ _ _ _ _ _\n\
 _ _ _ _ _ _ _ _\n\
@@ -39,17 +39,17 @@ _ _ _ _ _ _ _ _\n\
   });
 
   xtest('queens cannot attack', () => {
-    const queens = new Queens({ white: [2,3], black: [4,7] });
+    const queens = new Queens({ white: [2, 3], black: [4, 7] });
     expect(queens.canAttack()).toEqual(false);
   });
 
   xtest('queens can attack when they are on the same row', () => {
-    const queens = new Queens({ white: [2,4], black: [2,7] });
+    const queens = new Queens({ white: [2, 4], black: [2, 7] });
     expect(queens.canAttack()).toEqual(true);
   });
 
   xtest('queens can attack when they are on the same column', () => {
-    const queens = new Queens({ white: [5,4], black: [2,4] });
+    const queens = new Queens({ white: [5, 4], black: [2, 4] });
     expect(queens.canAttack()).toEqual(true);
   });
 
@@ -77,5 +77,4 @@ _ _ _ _ _ _ _ _\n\
     const queens = new Queens({ white: [2, 6], black: [5, 3] });
     expect(queens.canAttack()).toEqual(true);
   });
-
 });

data/tracks/ecmascript/exercises/raindrops/example.js

@@ -11,7 +11,7 @@ const Raindrops = () => ({
       result += 'Plong';
     }
     return result === '' ? n.toString() : result;
-  }
+  },
 });
 
 export default Raindrops;

data/tracks/ecmascript/exercises/raindrops/raindrops.spec.js

@@ -1,6 +1,6 @@
 import Raindrops from './raindrops';
 
-describe('Raindrops', ()  => {
+describe('Raindrops', () => {
   const drops = new Raindrops();
 
   test('converts 1', () => expect(drops.convert(1)).toEqual('1'));
@@ -34,5 +34,4 @@ describe('Raindrops', ()  => {
   xtest('converts 105', () => expect(drops.convert(105)).toEqual('PlingPlangPlong'));
 
   xtest('converts 12121', () => expect(drops.convert(12121)).toEqual('12121'));
-
 });

data/tracks/ecmascript/exercises/rna-transcription/example.js

@@ -1,13 +1,13 @@
 const DNA_TO_RNA = {
-  G: "C",
-  C: "G",
-  T: "A",
-  A: "U"
+  G: 'C',
+  C: 'G',
+  T: 'A',
+  A: 'U',
 };
 
 export default class Transcriptor {
   toRna(dna) {
-    let rna = dna.replace(/./g, nucleotide => DNA_TO_RNA[nucleotide])
+    const rna = dna.replace(/./g, nucleotide => DNA_TO_RNA[nucleotide]);
 
     if (rna.length !== dna.length) {
       // invalid characters in the strand

data/tracks/ecmascript/exercises/rna-transcription/rna-transcription.spec.js

@@ -1,7 +1,7 @@
 import Transcriptor from './rna-transcription';
 
 describe('Transcriptor', () => {
-  let transcriptor = new Transcriptor();
+  const transcriptor = new Transcriptor();
 
   test('transcribes cytosine to guanine', () => {
     expect(transcriptor.toRna('C')).toEqual('G');
@@ -26,20 +26,19 @@ describe('Transcriptor', () => {
 
   xtest('correctly handles invalid input', () => {
     expect(() => transcriptor.toRna('U')).toThrow(
-      new Error('Invalid input DNA.')
+      new Error('Invalid input DNA.'),
     );
   });
 
   xtest('correctly handles completely invalid input', () => {
     expect(() => transcriptor.toRna('XXX')).toThrow(
-      new Error('Invalid input DNA.')
+      new Error('Invalid input DNA.'),
     );
   });
 
   xtest('correctly handles partially invalid input', () => {
     expect(() => transcriptor.toRna('ACGTXXXCTTAA')).toThrow(
-      new Error('Invalid input DNA.')
+      new Error('Invalid input DNA.'),
     );
   });
-
 });

data/tracks/ecmascript/exercises/robot-name/example.js

@@ -1,19 +1,19 @@
 const ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-      BASE = 10,
-      usedNames ={};
+  BASE = 10,
+  usedNames = {};
 
-const random = (max) => Math.floor(Math.random()*max);
+const random = max => Math.floor(Math.random() * max);
 
 const generateName = () => {
   let name = ALPHA.charAt(random(ALPHA.length))
-    +ALPHA.charAt(random(ALPHA.length))
-    +random(BASE)+random(BASE)+random(BASE);
+    + ALPHA.charAt(random(ALPHA.length))
+    + random(BASE) + random(BASE) + random(BASE);
   usedNames[name] ? name = generateName() : usedNames[name] = true;
   return name;
 };
 
 export default class Robot {
-  constructor(){
+  constructor() {
     this.robotName = generateName();
   }
 

data/tracks/ecmascript/exercises/robot-name/robot-name.spec.js

@@ -44,7 +44,7 @@ describe('Robot', () => {
   });
 
   xtest('internal name cannot be modified', () => {
-    const modifyInternal = () => robot.name += "a modification";
+    const modifyInternal = () => robot.name += 'a modification';
     expect(modifyInternal).toThrow();
   });
 
@@ -69,7 +69,7 @@ describe('Robot', () => {
     expect(areSequential(name3, name3)).toBe(true);
   });
 
-  //This test is optional.
+  // This test is optional.
   xtest('there can be lots of robots with different names each', () => {
     const NUMBER_OF_ROBOTS = 10000;
     const usedNames = new Set();
@@ -81,20 +81,19 @@ describe('Robot', () => {
 
     expect(usedNames.size).toEqual(NUMBER_OF_ROBOTS);
   });
-
 });
 
 const areSequential = (name1, name2) => {
-  const alpha1 = name1.substr(0,2);
-  const alpha2 = name2.substr(0,2);
-  const num1 = +name1.substr(2,3);
-  const num2 = +name2.substr(2,3);
+  const alpha1 = name1.substr(0, 2);
+  const alpha2 = name2.substr(0, 2);
+  const num1 = +name1.substr(2, 3);
+  const num2 = +name2.substr(2, 3);
 
-  const numDiff = num2-num1;
-  const alphaDiff = (alpha2.charCodeAt(0)-alpha1.charCodeAt(0))*26
-    + (alpha2.charCodeAt(1)-alpha1.charCodeAt(1));
+  const numDiff = num2 - num1;
+  const alphaDiff = (alpha2.charCodeAt(0) - alpha1.charCodeAt(0)) * 26
+    + (alpha2.charCodeAt(1) - alpha1.charCodeAt(1));
 
-  const totalDiff = alphaDiff*1000 + numDiff;
+  const totalDiff = alphaDiff * 1000 + numDiff;
 
   return Math.abs(totalDiff) <= 1;
 };

data/tracks/ecmascript/exercises/robot-simulator/example.js

@@ -10,7 +10,7 @@ class Robot {
 
   orient(direction) {
     this.bearing = direction;
-    return 'The robot is pointed ' + direction;
+    return `The robot is pointed ${direction}`;
   }
 
   advance() {