trackler 2.2.0.0 → 2.2.0.1

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

@@ -1,99 +1,99 @@
-export default function solve(puzzle) {
-  let parts = puzzle
-    .split(/[+|==]/g)
-    .map(o => o.trim())
-    .filter(o => o !== "");
-
-  if(parts.length < 3) {
-    return null;
-  }
-
-  const uniqueLetters = new Set(parts.join('').split(''));
-  const firstLetters = new Set(parts.map(p => p[0]));
-
-  const numberCombinations = getNumberCombinations([0,1,2,3,4,5,6,7,8,9], uniqueLetters.size);
-
-  while(numberCombinations.length) {
-    const permutations = generate(Array(uniqueLetters.size).fill().map((_, i) => i));
-    const numberCombination = numberCombinations.pop();
-    for(const permutation of permutations) {
-      const newNumbers = assignNumbers(numberCombination, uniqueLetters, permutation);
-      if(testNumbers(newNumbers, parts, firstLetters)) {
-        return newNumbers;
-      }
-    }
-  }
-  return null;
-}
-
-function assignNumbers(numberCombination, uniqueLetters, permutation) {
-  let output = {};
-  let i = 0;
-  for(let letter of uniqueLetters.values()) {
-    output[letter] = numberCombination[permutation[i++]];
-  }
-  return output;
-}
-
-function testNumbers(numbers, puzzleParts, firstLetters) {
-  var keys = Object.keys(numbers);
-  for(const key of keys) {
-    if(numbers[key] === 0 && firstLetters.has(key)) {
-      return false;
-    }
-  }
-  let replaceRegex = new RegExp('[' + keys.join('') + ']', 'g');
-
-  puzzleParts = puzzleParts.join(',')
-    .replace(replaceRegex, input => numbers[input])
-    .split(',')
-    .map(t => parseInt(t));
-
-  let total = puzzleParts.slice(puzzleParts.length-1)[0];
-  return total === puzzleParts
-      .slice(0,puzzleParts.length-1)
-      .reduce((acc, val) => acc + val, 0);
-}
-function* generate(A) {
-  let c = [];
-  let n = A.length;
-  yield A;
-  for(let i = 0; i < n; i++) {
-    c[i] = 0;
-  }
-  let i = 0;
-  while(i < n) {
-    if(c[i] < i) {
-      if(i % 2 === 0) {
-        swap(A, 0, i);
-      } else {
-        swap(A, c[i], i);
-      }
-      yield A;
-      c[i]+=1;
-      i = 0;
-    } else {
-      c[i] = 0;
-      i+= 1;
-    }
-  }
-}
-function swap(list, x, y) {
-  let tmp = list[x];
-  list[x] = list[y];
-  list[y] = tmp;
-  return list;
-}
-
-function getNumberCombinations(arr, size) {
-  let len = arr.length;
-
-  if (size == len) return [arr];
-
-  return arr.reduce((acc, val, i) => {
-    let res = getNumberCombinations(arr.slice(i + 1), size - 1)
-      .map(comb => [val].concat(comb));
-
-    return acc.concat(res);
-  }, []);
-}
+export default function solve(puzzle) {
+  const parts = puzzle
+    .split(/[+|==]/g)
+    .map(o => o.trim())
+    .filter(o => o !== '');
+
+  if (parts.length < 3) {
+    return null;
+  }
+
+  const uniqueLetters = new Set(parts.join('').split(''));
+  const firstLetters = new Set(parts.map(p => p[0]));
+
+  const numberCombinations = getNumberCombinations([0, 1, 2, 3, 4, 5, 6, 7, 8, 9], uniqueLetters.size);
+
+  while (numberCombinations.length) {
+    const permutations = generate(Array(uniqueLetters.size).fill().map((_, i) => i));
+    const numberCombination = numberCombinations.pop();
+    for (const permutation of permutations) {
+      const newNumbers = assignNumbers(numberCombination, uniqueLetters, permutation);
+      if (testNumbers(newNumbers, parts, firstLetters)) {
+        return newNumbers;
+      }
+    }
+  }
+  return null;
+}
+
+function assignNumbers(numberCombination, uniqueLetters, permutation) {
+  const output = {};
+  let i = 0;
+  for (const letter of uniqueLetters.values()) {
+    output[letter] = numberCombination[permutation[i++]];
+  }
+  return output;
+}
+
+function testNumbers(numbers, puzzleParts, firstLetters) {
+  const keys = Object.keys(numbers);
+  for (const key of keys) {
+    if (numbers[key] === 0 && firstLetters.has(key)) {
+      return false;
+    }
+  }
+  const replaceRegex = new RegExp(`[${keys.join('')}]`, 'g');
+
+  puzzleParts = puzzleParts.join(',')
+    .replace(replaceRegex, input => numbers[input])
+    .split(',')
+    .map(t => parseInt(t));
+
+  const total = puzzleParts.slice(puzzleParts.length - 1)[0];
+  return total === puzzleParts
+      .slice(0, puzzleParts.length - 1)
+      .reduce((acc, val) => acc + val, 0);
+}
+function* generate(A) {
+  const c = [];
+  const n = A.length;
+  yield A;
+  for (let i = 0; i < n; i++) {
+    c[i] = 0;
+  }
+  let i = 0;
+  while (i < n) {
+    if (c[i] < i) {
+      if (i % 2 === 0) {
+        swap(A, 0, i);
+      } else {
+        swap(A, c[i], i);
+      }
+      yield A;
+      c[i] += 1;
+      i = 0;
+    } else {
+      c[i] = 0;
+      i += 1;
+    }
+  }
+}
+function swap(list, x, y) {
+  const tmp = list[x];
+  list[x] = list[y];
+  list[y] = tmp;
+  return list;
+}
+
+function getNumberCombinations(arr, size) {
+  const len = arr.length;
+
+  if (size == len) return [arr];
+
+  return arr.reduce((acc, val, i) => {
+    const res = getNumberCombinations(arr.slice(i + 1), size - 1)
+      .map(comb => [val].concat(comb));
+
+    return acc.concat(res);
+  }, []);
+}

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

@@ -1,82 +1,80 @@
 import Anagram from './anagram.js';
 
 describe('Anagram', () => {
-
-  test("no matches", () => {
-    let subject = new Anagram("diaper");
-    let matches = subject.matches([ "hello", "world", "zombies", "pants"]);
+  test('no matches', () => {
+    const subject = new Anagram('diaper');
+    const matches = subject.matches(['hello', 'world', 'zombies', 'pants']);
 
     expect(matches).toEqual([]);
   });
 
-  xtest("detects simple anagram", () => {
-    let subject = new Anagram("ant");
-    let matches = subject.matches(['tan', 'stand', 'at']);
+  xtest('detects simple anagram', () => {
+    const subject = new Anagram('ant');
+    const matches = subject.matches(['tan', 'stand', 'at']);
 
     expect(matches).toEqual(['tan']);
   });
 
-  xtest("does not detect false positives", () => {
-    let subject = new Anagram("galea");
-    let matches = subject.matches(["eagle"]);
+  xtest('does not detect false positives', () => {
+    const subject = new Anagram('galea');
+    const matches = subject.matches(['eagle']);
 
     expect(matches).toEqual([]);
   });
 
-  xtest("detects multiple anagrams", () => {
-    let subject = new Anagram("master");
-    let matches = subject.matches(['stream', 'pigeon', 'maters']);
+  xtest('detects multiple anagrams', () => {
+    const subject = new Anagram('master');
+    const matches = subject.matches(['stream', 'pigeon', 'maters']);
 
     expect(matches).toEqual(['stream', 'maters']);
   });
 
-  xtest("does not detect anagram subsets", () => {
-    let subject = new Anagram("good");
-    let matches = subject.matches(['dog', 'goody']);
+  xtest('does not detect anagram subsets', () => {
+    const subject = new Anagram('good');
+    const matches = subject.matches(['dog', 'goody']);
 
     expect(matches).toEqual([]);
   });
 
-  xtest("detects anagram", () => {
-    let subject = new Anagram("listen");
-    let matches = subject.matches(['enlists', 'google', 'inlets', 'banana']);
+  xtest('detects anagram', () => {
+    const subject = new Anagram('listen');
+    const matches = subject.matches(['enlists', 'google', 'inlets', 'banana']);
 
     expect(matches).toEqual(['inlets']);
   });
 
-  xtest("detects multiple anagrams", () => {
-    let subject = new Anagram("allergy");
-    let matches = subject.matches(['gallery', 'ballerina', 'regally', 'clergy', 'largely', 'leading']);
+  xtest('detects multiple anagrams', () => {
+    const subject = new Anagram('allergy');
+    const matches = subject.matches(['gallery', 'ballerina', 'regally', 'clergy', 'largely', 'leading']);
 
     expect(matches).toEqual(['gallery', 'regally', 'largely']);
   });
 
-  xtest("detects anagrams case-insensitively", () => {
-    let subject = new Anagram("Orchestra");
-    let matches = subject.matches(['cashregister', 'Carthorse', 'radishes']);
+  xtest('detects anagrams case-insensitively', () => {
+    const subject = new Anagram('Orchestra');
+    const matches = subject.matches(['cashregister', 'Carthorse', 'radishes']);
 
     expect(matches).toEqual(['Carthorse']);
   });
 
-  xtest("does not detect a word as its own anagram", () => {
-    let subject = new Anagram("banana");
-    let matches = subject.matches(['Banana']);
+  xtest('does not detect a word as its own anagram', () => {
+    const subject = new Anagram('banana');
+    const matches = subject.matches(['Banana']);
 
     expect(matches).toEqual([]);
   });
 
-  xtest("matches() accepts string arguments", () => {
-    let subject = new Anagram("ant");
-    let matches = subject.matches("stand", "tan", "at");
+  xtest('matches() accepts string arguments', () => {
+    const subject = new Anagram('ant');
+    const matches = subject.matches('stand', 'tan', 'at');
 
-    expect(matches).toEqual(["tan"]);
+    expect(matches).toEqual(['tan']);
   });
 
-  xtest("matches() accepts single string argument", () => {
-    let subject = new Anagram("ant");
-    let matches = subject.matches("tan");
+  xtest('matches() accepts single string argument', () => {
+    const subject = new Anagram('ant');
+    const matches = subject.matches('tan');
 
-    expect(matches).toEqual(["tan"]);
+    expect(matches).toEqual(['tan']);
   });
-
 });

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

@@ -15,9 +15,7 @@ export default class Anagram {
   matches(words) {
     words = Array.isArray(words) ? words : Array.from(arguments);
 
-    return words.filter(candidate => {
-      return !sameWord(this.word, candidate) && isAnagram(this.word, candidate);
-    });
+    return words.filter(candidate => !sameWord(this.word, candidate) && isAnagram(this.word, candidate));
   }
 }
 

data/tracks/ecmascript/exercises/atbash-cipher/atbash-cipher.spec.js

@@ -1,7 +1,6 @@
 import atbash from './atbash-cipher';
 
 describe('encode', () => {
-
   test('encodes no', () => expect(atbash.encode('no')).toEqual('ml'));
 
   xtest('encodes yes', () => expect(atbash.encode('yes')).toEqual('bvh'));
@@ -18,7 +17,6 @@ describe('encode', () => {
   xtest('encodes sentences', () => expect(atbash.encode('Truth is fiction.')).toEqual('gifgs rhurx grlm'));
 
   xtest('encodes all the things', () => expect(atbash.encode('The quick brown fox jumps over the lazy dog.'))
-    .toEqual('gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt')
+    .toEqual('gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt'),
   );
-
 });

data/tracks/ecmascript/exercises/atbash-cipher/example.js

@@ -2,7 +2,7 @@ const LETTERS = 'abcdefghijklmnopqrstuvwxyz';
 const REVERSED_LETTERS = [...LETTERS].reverse().join('');
 
 function insertSpacing(s, interval) {
-  const matcher = new RegExp('.{1,' + interval + '}', 'g');
+  const matcher = new RegExp(`.{1,${interval}}`, 'g');
   return s.match(matcher).join(' ');
 }
 
@@ -15,11 +15,11 @@ function invert(character) {
 }
 
 export default {
-  encode:  (s) => {
+  encode: (s) => {
     let encoded;
     const characters = [];
     [...s.toLowerCase()].forEach(invert, characters);
     encoded = insertSpacing(characters.join(''), 5);
     return encoded;
-  }
+  },
 };

data/tracks/ecmascript/exercises/beer-song/beer-song.spec.js

@@ -1,7 +1,6 @@
 import Beer from './beer-song';
 
 describe('Beer', () => {
-
   test('prints an arbitrary verse', () => {
     const expected = `8 bottles of beer on the wall, 8 bottles of beer.
 Take one down and pass it around, 7 bottles of beer on the wall.
@@ -356,5 +355,4 @@ No more bottles of beer on the wall, no more bottles of beer.
 Go to the store and buy some more, 99 bottles of beer on the wall.
 `);
   });
-
 });

data/tracks/ecmascript/exercises/beer-song/example.js

@@ -7,7 +7,7 @@ function bottles(number) {
     return '1 bottle';
   }
 
-  return number + ' bottles';
+  return `${number} bottles`;
 }
 
 function action(currentVerse) {
@@ -15,12 +15,12 @@ function action(currentVerse) {
     return 'Go to the store and buy some more, ';
   }
 
-  let sbj = currentVerse === 1 ? 'it' : 'one';
-  return 'Take ' + sbj + ' down and pass it around, ';
+  const sbj = currentVerse === 1 ? 'it' : 'one';
+  return `Take ${sbj} down and pass it around, `;
 }
 
 function nextBottle(currentVerse) {
-  return bottles(nextVerse(currentVerse)).toLowerCase() + ' of beer on the wall.\n';
+  return `${bottles(nextVerse(currentVerse)).toLowerCase()} of beer on the wall.\n`;
 }
 
 function nextVerse(currentVerse) {
@@ -29,16 +29,16 @@ function nextVerse(currentVerse) {
 
 class BeerSong {
   static verse(number) {
-    let line1 = bottles(number) + ' of beer on the wall, ';
-    let line2 = bottles(number).toLowerCase() + ' of beer.\n';
-    let line3 = action(number);
-    let line4 = nextBottle(number);
+    const line1 = `${bottles(number)} of beer on the wall, `;
+    const line2 = `${bottles(number).toLowerCase()} of beer.\n`;
+    const line3 = action(number);
+    const line4 = nextBottle(number);
 
     return [line1, line2, line3, line4].join('');
   }
 
   static sing(first = 99, last = 0) {
-    let verses = [];
+    const verses = [];
     for (let i = first; i >= last; i--) {
       verses.push(this.verse(i));
     }

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

@@ -1,4 +1,4 @@
-import Binary from'./binary';
+import Binary from './binary';
 
 describe('binary', () => {
   test('0 is decimal 0', () => expect(new Binary('0').toDecimal()).toEqual(0));
@@ -26,5 +26,4 @@ describe('binary', () => {
     expect(new Binary('nope10').toDecimal()).toEqual(0);
     expect(new Binary('10nope10').toDecimal()).toEqual(0);
   });
-
 });

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

@@ -1,7 +1,7 @@
-//classy solution, eh?
+// classy solution, eh?
 
-class Binary{
-  constructor(binary){
+class Binary {
+  constructor(binary) {
     this.binary = binary.match(/^[01]*$/) ? parseInt(binary, 2) : 0;
   }
   toDecimal() {

data/tracks/ecmascript/exercises/binary-search/binary-search.spec.js

@@ -1,12 +1,11 @@
 import BinarySearch from './binary-search';
 
 describe('BinarySearch', () => {
-
   const sortedArray = [1, 2, 3, 4, 5, 6];
   const sortedArrayOfOddLength = [0, 1, 2, 2, 3, 10, 12];
   const unsortedArray = [10, 2, 5, 1];
 
-  it ('should require a sorted array', () => {
+  it('should require a sorted array', () => {
     const invalidBinarySearch = new BinarySearch(unsortedArray);
     const validBinarySearch = new BinarySearch(sortedArray);
 
@@ -25,6 +24,5 @@ describe('BinarySearch', () => {
   xtest('should return -1 for a value not in the array', () => {
     expect(new BinarySearch(sortedArray).indexOf(10)).toEqual(-1);
   });
-
 });
 

data/tracks/ecmascript/exercises/binary-search-tree/binary-search-tree.spec.js

@@ -1,21 +1,20 @@
 import BinarySearchTree from './binary-search-tree';
 
 function recordAllData(bst) {
-  let out = [];
+  const out = [];
 
-  bst.each((data) => out.push(data));
+  bst.each(data => out.push(data));
 
   return out;
 }
 
 describe('BinarySearchTree', () => {
-
   test('data is retained', () => {
     expect(new BinarySearchTree(4).data).toEqual(4);
   });
 
   xtest('inserting less', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(2);
 
     expect(four.data).toEqual(4);
@@ -23,7 +22,7 @@ describe('BinarySearchTree', () => {
   });
 
   xtest('inserting same', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(4);
 
     expect(four.data).toEqual(4);
@@ -31,7 +30,7 @@ describe('BinarySearchTree', () => {
   });
 
   xtest('inserting right', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(5);
 
     expect(four.data).toEqual(4);
@@ -39,7 +38,7 @@ describe('BinarySearchTree', () => {
   });
 
   xtest('complex tree', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(2);
     four.insert(6);
     four.insert(1);
@@ -57,25 +56,25 @@ describe('BinarySearchTree', () => {
   });
 
   xtest('iterating one element', () => {
-    expect(recordAllData(new BinarySearchTree(4))).toEqual([ 4 ]);
+    expect(recordAllData(new BinarySearchTree(4))).toEqual([4]);
   });
 
   xtest('iterating over smaller element', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(2);
 
-    expect(recordAllData(four)).toEqual([ 2, 4 ]);
+    expect(recordAllData(four)).toEqual([2, 4]);
   });
 
   xtest('iterating over larger element', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(5);
 
-    expect(recordAllData(four)).toEqual([ 4, 5 ]);
+    expect(recordAllData(four)).toEqual([4, 5]);
   });
 
   xtest('iterating over complex tree', () => {
-    let four = new BinarySearchTree(4);
+    const four = new BinarySearchTree(4);
     four.insert(2);
     four.insert(1);
     four.insert(3);
@@ -83,7 +82,6 @@ describe('BinarySearchTree', () => {
     four.insert(7);
     four.insert(5);
 
-    expect(recordAllData(four)).toEqual([ 1, 2, 3, 4, 5, 6, 7 ]);
+    expect(recordAllData(four)).toEqual([1, 2, 3, 4, 5, 6, 7]);
   });
-
 });

data/tracks/ecmascript/exercises/binary-search-tree/example.js

@@ -1,7 +1,7 @@
 class BinarySearchTree {
   constructor(data) {
-    this.data  = data;
-    this.left  = undefined;
+    this.data = data;
+    this.left = undefined;
     this.right = undefined;
   }
 

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

@@ -1,7 +1,6 @@
 import Bob from './bob.js';
 
 describe('Bob', () => {
-
   const bob = new Bob();
 
   test('stating something', () => {
@@ -84,10 +83,9 @@ describe('Bob', () => {
     expect(result).toEqual('Fine. Be that way!');
   });
 
-   xtest('prolonged silence', () => {
+  xtest('prolonged silence', () => {
     const result = bob.hey('   ');
     expect(result).toEqual('Fine. Be that way!');
   });
-
 });
 

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

@@ -1,6 +1,6 @@
-let isSilence = (message) => message.replace(/\s+/g, '') === '';
-let isShouting = (message) => message.toUpperCase() === message && /[A-Z]/.test(message);
-let isAQuestion = (message) => message[message.length - 1] === '?';
+const isSilence = message => message.replace(/\s+/g, '') === '';
+const isShouting = message => message.toUpperCase() === message && /[A-Z]/.test(message);
+const isAQuestion = message => message[message.length - 1] === '?';
 
 class Bob {
   hey(message) {

data/tracks/ecmascript/exercises/bracket-push/example.js

@@ -1,4 +1,4 @@
-const bracketPush = input =>  {
+const bracketPush = (input) => {
   if (input.length === 0) {
     return true;
   }
@@ -20,7 +20,7 @@ const bracketPush = input =>  {
     }
   }
 
-  const topNumber = Math.max.apply(Math, iArr);
+  const topNumber = Math.max(...iArr);
 
   for (let k = 0; k < 3; k++) {
     if (bracketArray[topNumber] === openArray[k]) {