trackler 2.2.1.59 → 2.2.1.60

data/tracks/haskell/exercises/nucleotide-count/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/nucleotide-count/test/Tests.hs

@@ -23,6 +23,12 @@ specs = do
                                                , ('G', 0)
                                                , ('T', 0) ]
 
+            it "can count one nucleotide in single-character input" $
+              nucleotideCounts "G" `matchesMap` [ ('A', 0)
+                                                , ('C', 0)
+                                                , ('G', 1)
+                                                , ('T', 0) ]
+
             it "repetitive-sequence-has-only-guanosine" $
               nucleotideCounts "GGGGGGGG" `matchesMap` [ ('A', 0)
                                                        , ('C', 0)

data/tracks/haskell/exercises/ocr-numbers/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/octal/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/palindrome-products/README.md

@@ -9,7 +9,7 @@ Given a range of numbers, find the largest and smallest palindromes which
 are products of numbers within that range.
 
 Your solution should return the largest and smallest palindromes, along with the
-factors of each within the range. If the largest or smallest palindrome has more 
+factors of each within the range. If the largest or smallest palindrome has more
 than one pair of factors within the range, then return all the pairs.
 
 ## Example 1

data/tracks/haskell/exercises/palindrome-products/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/pangram/package.yaml

@@ -1,5 +1,5 @@
 name: pangram
-version: 1.1.0.3
+version: 1.3.0.5
 
 dependencies:
   - base

data/tracks/haskell/exercises/pangram/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/pangram/test/Tests.hs

@@ -24,6 +24,10 @@ cases = [ Case { description = "sentence empty"
                , input       = ""
                , expected    = False
                }
+        , Case { description = "recognizes a perfect lower case pangram"
+               , input       = "abcdefghijklmnopqrstuvwxyz"
+               , expected    = True
+               }
         , Case { description = "pangram with only lower case"
                , input       = "the quick brown fox jumps over the lazy dog"
                , expected    = True
@@ -32,8 +36,8 @@ cases = [ Case { description = "sentence empty"
                , input       = "a quick movement of the enemy will jeopardize five gunboats"
                , expected    = False
                }
-        , Case { description = "another missing character 'x'"
-               , input       = "the quick brown fish jumps over the lazy dog"
+        , Case { description = "another missing character, e.g. 'h'"
+               , input       = "five boxing wizards jump quickly at it"
                , expected    = False
                }
         , Case { description = "pangram with underscores"

data/tracks/haskell/exercises/parallel-letter-frequency/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/pascals-triangle/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/perfect-numbers/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/phone-number/README.md

@@ -14,7 +14,7 @@ The format is usually represented as
 
 where `N` is any digit from 2 through 9 and `X` is any digit from 0 through 9.
 
-Your task is to clean up differently formated telephone numbers by removing punctuation and the country code (1) if present.
+Your task is to clean up differently formatted telephone numbers by removing punctuation and the country code (1) if present.
 
 For example, the inputs
 - `+1 (613)-995-0253`

data/tracks/haskell/exercises/phone-number/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/pig-latin/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/pov/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/prime-factors/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/pythagorean-triplet/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/queen-attack/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/raindrops/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/rna-transcription/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/robot-name/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/robot-simulator/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/roman-numerals/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/rotational-cipher/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/run-length-encoding/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/saddle-points/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/say/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/scrabble-score/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/secret-handshake/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/series/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/sgf-parsing/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/sieve/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/simple-cipher/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/simple-linked-list/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/space-age/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/spiral-matrix/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/strain/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/sublist/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/sum-of-multiples/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/triangle/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/trinary/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/word-count/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/wordy/examples/success-standard/src/WordProblem.hs

@@ -1,5 +1,6 @@
 {-# LANGUAGE OverloadedStrings #-}
 module WordProblem (answer) where
+import Data.Functor (($>))
 import Data.Text (pack)
 import Data.List (foldl')
 import Control.Applicative ((<|>))
@@ -10,7 +11,7 @@ answerParser :: Parser Int
 answerParser = do
   n <- "What is " *> signed decimal
   ops <- many' (space *> operation)
-  "?" *> pure (foldl' (flip ($)) n ops)
+  "?" $> foldl' (flip ($)) n ops
 
 answer :: String -> Maybe Int
 answer = maybeResult . parse answerParser . pack
@@ -19,7 +20,7 @@ operation :: Parser (Int -> Int)
 operation = (flip <$> operator) <* space <*> signed decimal
 
 operator :: Parser (Int -> Int -> Int)
-operator = "plus"          *> pure (+) <|>
-           "minus"         *> pure (-) <|>
-           "multiplied by" *> pure (*) <|>
-           "divided by"    *> pure div
+operator = "plus"          $> (+) <|>
+           "minus"         $> (-) <|>
+           "multiplied by" $> (*) <|>
+           "divided by"    $> div

data/tracks/haskell/exercises/wordy/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/zebra-puzzle/package.yaml

@@ -1,5 +1,5 @@
 name: zebra-puzzle
-version: 0.1.0.2
+version: 1.0.0.3
 
 dependencies:
   - base

data/tracks/haskell/exercises/zebra-puzzle/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/zipper/README.md

@@ -3,7 +3,7 @@
 Creating a zipper for a binary tree.
 
 [Zippers](https://en.wikipedia.org/wiki/Zipper_%28data_structure%29) are
-a way purely functional of navigating within a data structure and
+a purely functional way of navigating within a data structure and
 manipulating it.  They essentially contain a data structure and a
 pointer into that data structure (called the focus).
 

data/tracks/haskell/exercises/zipper/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/javascript/.eslintignore

@@ -0,0 +1,43 @@
+big-integer.js
+exercises/accumulate
+exercises/acronym
+exercises/alphametics
+exercises/anagram
+exercises/binary-search
+exercises/binary-search-tree
+exercises/bowling
+exercises/bracket-push
+exercises/circular-buffer
+exercises/clock
+exercises/custom-set
+exercises/diamond
+exercises/flatten-array
+exercises/food-chain
+exercises/grade-school
+exercises/grains
+exercises/kindergarten-garden
+exercises/leap
+exercises/linked-list
+exercises/list-ops
+exercises/luhn
+exercises/minesweeper
+exercises/nth-prime
+exercises/octal
+exercises/palindrome-products
+exercises/pangram
+exercises/perfect-numbers
+exercises/pythagorean-triplet
+exercises/queen-attack
+exercises/robot-name
+exercises/robot-simulator
+exercises/roman-numerals
+exercises/saddle-points
+exercises/say
+exercises/scrabble-score
+exercises/secret-handshake
+exercises/simple-cipher
+exercises/simple-linked-list
+exercises/sum-of-multiples
+exercises/triangle
+exercises/trinary
+exercises/wordy

data/tracks/javascript/.travis.yml

@@ -6,9 +6,10 @@ node_js:
   - "node"
 
 install:
-  - "npm install -g jasmine"
+  - "npm install"
 
 script:
   - "make test"
   - "./bin/fetch-configlet"
   - "./bin/configlet lint ."
+  - "npm run lint"

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

@@ -8,13 +8,13 @@ of a game of bowling.
 
 ## Scoring Bowling
 
-The game consists of 10 frames. A frame is composed of one or two ball throws with 10 pins standing at frame initialization. There are three cases for the tabulation of a frame.
+A game consists of 10 frames. A frame is composed of one or two balls thrown, with 10 pins standing at the start of the frame. There are three cases for the tabulation of a frame:
 
-* An open frame is where a score of less than 10 is recorded for the frame. In this case the score for the frame is the number of pins knocked down.
+* An open frame is where a score of less than 10 is recorded for the frame. In this case the score for the frame is the number of pins knocked down after the second throw.
 
-* A spare is where all ten pins are knocked down after the second throw. The total value of a spare is 10 plus the number of pins knocked down in their next throw.
+* A spare is where all ten pins are knocked down after the second throw. The total value of a spare is 10 plus the number of pins knocked down in the next throw.
 
-* A strike is where all ten pins are knocked down after the first throw. The total value of a strike is 10 plus the number of pins knocked down in their next two throws. If a strike is immediately followed by a second strike, then we can not total the value of first strike until they throw the ball one more time.
+* A strike is where all ten pins are knocked down after the first throw. The total value of a strike is 10 plus the number of pins knocked down in the next two throws. If a strike is immediately followed by another strike, then the first strike's value cannot be totalled until the next throw.
 
 Here is a three frame example:
 
@@ -30,7 +30,7 @@ Frame 3 is (9 + 0) = 9
 
 This means the current running total is 48.
 
-The tenth frame in the game is a special case. If someone throws a strike or a spare then they get a fill ball. Fill balls exist to calculate the total of the 10th frame. Scoring a strike or spare on the fill ball does not give the player more fill balls. The total value of the 10th frame is the total number of pins knocked down.
+The tenth frame in the game is a special case. If the player throws a strike or a spare, then they get one extra throw called a fill ball. Fill balls exist to calculate the total of the 10th frame. Scoring a strike or spare on the fill ball does not give the player more fill balls. The total value of the 10th frame is the total number of pins knocked down.
 
 For a tenth frame of X1/ (strike and a spare), the total value is 20.
 

data/tracks/javascript/exercises/crypto-square/example.js

@@ -22,7 +22,8 @@ module.exports = function (input) {
 
   this.ciphertext = function () {
     var textSegments = this.plaintextSegments();
-    var i, j;
+    var i;
+    var j;
     var columns = [];
     var currentSegment;
     var currentLetter;

data/tracks/javascript/exercises/diffie-hellman/diffie-hellman.spec.js

@@ -1,6 +1,6 @@
 var DiffieHellman = require('./diffie-hellman');
 
-describe('diffie-hellman', function(){
+describe('diffie-hellman', function () {
   var p = 23;
   var g = 5;
   var diffieHellman = new DiffieHellman(p, g);
@@ -11,57 +11,57 @@ describe('diffie-hellman', function(){
   var bobPrivateKey = 15;
   var bobPublicKey = 19;
 
-  it('throws an error if the constructor arguments are out of range', function() {
-    expect(function() {
-      new DiffieHellman(0, 9999);
+  it('throws an error if the constructor arguments are out of range', function () {
+    expect(function () {
+      return new DiffieHellman(0, 9999);
     }).toThrow();
   });
 
-  xit('throws an error if the constructor arguments are not prime', function() {
-    expect(function() {
-      new DiffieHellman(10, 13);
+  xit('throws an error if the constructor arguments are not prime', function () {
+    expect(function () {
+      return new DiffieHellman(10, 13);
     }).toThrow();
   });
 
-  xit('throws an error if private key is negative', function() {
-    expect(function() {
+  xit('throws an error if private key is negative', function () {
+    expect(function () {
       diffieHellman.getPublicKeyFromPrivateKey(-1);
     }).toThrow();
   });
 
-  xit('throws an error if private key is zero', function() {
-    expect(function() {
+  xit('throws an error if private key is zero', function () {
+    expect(function () {
       diffieHellman.getPublicKeyFromPrivateKey(0);
     }).toThrow();
   });
 
-  xit('throws an error if private key is one', function() {
-    expect(function() {
+  xit('throws an error if private key is one', function () {
+    expect(function () {
       diffieHellman.getPublicKeyFromPrivateKey(1);
     }).toThrow();
   });
 
-  xit('throws an error if private key equals the modulus parameter p', function() {
-    expect(function() {
+  xit('throws an error if private key equals the modulus parameter p', function () {
+    expect(function () {
       diffieHellman.getPublicKeyFromPrivateKey(p);
     }).toThrow();
   });
 
-  xit('throws an error if private key is greater than the modulus parameter p', function() {
-    expect(function() {
+  xit('throws an error if private key is greater than the modulus parameter p', function () {
+    expect(function () {
       diffieHellman.getPublicKeyFromPrivateKey(p + 1);
     }).toThrow();
   });
 
-  xit('when given a private key, returns the correct public one', function() {
+  xit('when given a private key, returns the correct public one', function () {
     expect(diffieHellman.getPublicKeyFromPrivateKey(alicePrivateKey)).toEqual(alicePublicKey);
   });
 
-  xit('when given a different private key, returns the correct public one', function() {
+  xit('when given a different private key, returns the correct public one', function () {
     expect(diffieHellman.getPublicKeyFromPrivateKey(bobPrivateKey)).toEqual(bobPublicKey);
   });
 
-  xit('can generate a shared secret from our private key and their public key', function() {
+  xit('can generate a shared secret from our private key and their public key', function () {
     var sharedSecret = 2;
 
     expect(diffieHellman.getSharedSecret(alicePrivateKey, bobPublicKey))