trackler 2.2.0.5 → 2.2.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 447bff79931171eac084cccc735ad522e765f6af
-  data.tar.gz: af1bd54ac24bd83154ca283f4de0e7670294f1a7
+  metadata.gz: c01a1f87bf36c0dda5c6dda215561d9aab7f404f
+  data.tar.gz: 0a4cc995dcc8b75e502196695e9c3cde56e838fb
 SHA512:
-  metadata.gz: 843de8da103e7771059c6c2cfb0343db4dcadfa329d0ca454d41b5395968c7f7a4fa04fa0c7d834eb1fa1a11744316c47abbe1c394f3097d38a2f294fb10ae0d
-  data.tar.gz: 9132d00fecdbdf9ee66a3b5a88821cbfbe65b9d58d7183cf475d96e79bc0908ba6e337bcf6efd5264020dd85ae42bf902c09020cddb23b932702b37a61a6c2b1
+  metadata.gz: 15312570345615c7f7ad2b1f0132ec8c86a76985c29c315a6ca0686800a11f44e4def5039e2e4cc41f349b2c2dae502f302c0f79ce3271bc5cf856227953a5d5
+  data.tar.gz: 0bba7ef3ede35c23798163a1f1e7ba8f43bfe8c07cf2548aa90d9cabefed2f6905f30434f9b661bc9577c06797bc36258e1ed4efbd3aaed803a34ae3b163d0a4

data/lib/trackler/track.rb

@@ -32,7 +32,7 @@ module Trackler
     end
 
     def active?
-      !!config["active"]
+      !!config.active
     end
 
     def upcoming?
@@ -53,11 +53,11 @@ module Trackler
     end
 
     def checklist_issue
-      config.fetch("checklist_issue", 1)
+      config.checklist_issue || 1
     end
 
     def gitter
-      config["gitter"]
+      config.gitter
     end
 
     def icon_path
@@ -69,23 +69,23 @@ module Trackler
     end
 
     def language
-      config['language'].to_s.strip
+      config.language.to_s.strip
     end
 
     def repository
-      @repository ||= (config['repository'] || "https://github.com/exercism/%s" % id).to_s.strip
+      @repository ||= (config.repository || "https://github.com/exercism/%s" % id).to_s.strip
     end
 
     def test_pattern
-      if config.key?('test_pattern')
-        Regexp.new(config['test_pattern'])
+      if !!config.test_pattern
+        Regexp.new(config.test_pattern)
       else
         /test/i
       end
     end
 
     def ignore_pattern
-      config.fetch('ignore_pattern', 'example')
+      config.ignore_pattern || 'example'
     end
 
     def docs(image_path: DocFile::DEFAULT_IMAGE_PATH)
@@ -124,15 +124,15 @@ module Trackler
     private
 
     def active_slugs
-      (config["exercises"] || []).reject { |ex| ex["deprecated"] }.map { |ex| ex["slug"] }
+      exercises.reject(&:deprecated).map(&:slug)
     end
 
     def foregone_slugs
-      config["foregone"] || []
+      config.foregone || []
     end
 
     def deprecated_slugs
-      (config["exercises"] || []).select {|ex| ex["deprecated"]}.map { |ex| ex["slug"]}
+      exercises.select(&:deprecated).map(&:slug)
     end
 
     def most_popular_format(path)
@@ -142,8 +142,12 @@ module Trackler
       formats.max_by { |format| formats.count(format) }
     end
 
+    def exercises
+      config.exercises || []
+    end
+
     def config
-      @config ||= JSON.parse(File.read(config_filename))
+      @config ||= JSON.parse(File.read(config_filename), object_class: OpenStruct)
     end
 
     def config_filename

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.0.5"
+  VERSION = "2.2.0.6"
 end

data/tracks/bash/config.json

@@ -6,11 +6,10 @@
     {
       "uuid": "4e2533dd-3af5-400b-869d-78140764d533",
       "slug": "hello-world",
-      "core": false,
-      "unlocked_by": null,
+      "core": true,
       "difficulty": 1,
       "topics": [
-
+        "stdout"
       ]
     },
     {
@@ -20,97 +19,127 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "dates"
       ]
     },
     {
-      "uuid": "e24451fd-761d-4d20-81d9-e470486ec44a",
-      "slug": "leap",
+      "uuid": "9ac0b041-a7aa-4b0c-952a-d38d35e2cd65",
+      "slug": "bob",
       "core": false,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "control_flow_conditionals"
       ]
     },
     {
-      "uuid": "68103f44-b442-48e6-b2b5-09001f73e926",
-      "slug": "hamming",
-      "core": false,
-      "unlocked_by": null,
+      "uuid": "e24451fd-761d-4d20-81d9-e470486ec44a",
+      "slug": "leap",
+      "core": true,
       "difficulty": 1,
       "topics": [
-
+        "control_flow_conditionals",
+        "input_validation",
+        "boolean_logic"
       ]
     },
     {
-      "uuid": "8a62e53e-59c2-42d5-96e5-a0f8f9b5d177",
-      "slug": "rna-transcription",
+      "uuid": "1a9c8d65-43ee-435e-8c55-9a45c14a71fb",
+      "slug": "raindrops",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "leap",
       "difficulty": 1,
       "topics": [
-
+        "input_validation",
+        "control_flow_conditionals"
       ]
     },
     {
-      "uuid": "1a9c8d65-43ee-435e-8c55-9a45c14a71fb",
-      "slug": "raindrops",
+      "uuid": "ca5139b4-8b2f-44ea-8d83-0b8ca7674436",
+      "slug": "difference-of-squares",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "leap",
       "difficulty": 1,
       "topics": [
-
+        "control_flow_conditionals",
+        "control_flow_loops",
+        "string_transformation",
+        "string_comparison"
       ]
     },
     {
-      "uuid": "51bd6542-408b-4a73-8343-1c4d50db5315",
-      "slug": "word-count",
+      "uuid": "a7e2018a-c454-4fe0-ad35-229304306648",
+      "slug": "pangram",
+      "core": true,
+      "difficulty": 2,
+      "topics": [
+        "string_transformation"
+      ]
+    },
+    {
+      "uuid": "33d9eb48-5958-4e98-afc0-8cff89577c86",
+      "slug": "anagram",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "pangram",
+      "difficulty": 2,
       "topics": [
-
+        "control_flow_loops",
+        "string_transformation"
       ]
     },
     {
-      "uuid": "9ac0b041-a7aa-4b0c-952a-d38d35e2cd65",
-      "slug": "bob",
+      "uuid": "68103f44-b442-48e6-b2b5-09001f73e926",
+      "slug": "hamming",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "pangram",
+      "difficulty": 2,
       "topics": [
-
+        "control_flow_loops",
+        "string_comparison"
       ]
     },
     {
-      "uuid": "ca5139b4-8b2f-44ea-8d83-0b8ca7674436",
-      "slug": "difference-of-squares",
+      "uuid": "8a62e53e-59c2-42d5-96e5-a0f8f9b5d177",
+      "slug": "rna-transcription",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "pangram",
+      "difficulty": 2,
       "topics": [
-
+        "control_flow_loops",
+        "associative_arrays"
       ]
     },
     {
-      "uuid": "33d9eb48-5958-4e98-afc0-8cff89577c86",
-      "slug": "anagram",
+      "uuid": "51bd6542-408b-4a73-8343-1c4d50db5315",
+      "slug": "word-count",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "pangram",
+      "difficulty": 2,
       "topics": [
-
+        "control_flow_loops",
+        "string_comparison"
       ]
     },
     {
-      "uuid": "a7e2018a-c454-4fe0-ad35-229304306648",
-      "slug": "pangram",
+      "uuid": "0cfac255-6871-4588-a16b-98f7692bfdbe",
+      "slug": "two-fer",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "pangram",
+      "difficulty": 2,
       "topics": [
-
+        "text_formatting",
+        "control_flow_conditionals"
+      ]
+    },
+    {
+      "uuid": "9f9a1a49-472f-4a39-aa28-6aa17eeebdc7",
+      "slug": "phone-number",
+      "core": false,
+      "unlocked_by": "pangram",
+      "difficulty": 2,
+      "topics": [
+        "string_comparison",
+        "control_flow_conditionals"
       ]
     }
   ],

data/tracks/bash/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.

data/tracks/bash/config/maintainers.json

@@ -0,0 +1,24 @@
+{
+  "maintainers": [
+    {
+      "github_username": "adelcambre",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "kotp",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ]
+}

data/tracks/bash/exercises/anagram/README.md

@@ -0,0 +1,18 @@
+# Anagram
+
+Given a word and a list of possible anagrams, select the correct sublist.
+
+Given `"listen"` and a list of candidates like `"enlists" "google"
+"inlets" "banana"` the program should return a list containing
+`"inlets"`.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Inspired by the Extreme Startup game [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/bob/README.md

@@ -0,0 +1,23 @@
+# Bob
+
+Bob is a lackadaisical teenager. In conversation, his responses are very limited.
+
+Bob answers 'Sure.' if you ask him a question.
+
+He answers 'Whoa, chill out!' if you yell at him.
+
+He says 'Fine. Be that way!' if you address him without actually saying
+anything.
+
+He answers 'Whatever.' to anything else.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=06](http://pine.fm/LearnToProgram/?Chapter=06)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/difference-of-squares/README.md

@@ -0,0 +1,24 @@
+# Difference Of Squares
+
+Find the difference between the square of the sum and the sum of the squares of the first N natural numbers.
+
+The square of the sum of the first ten natural numbers is
+(1 + 2 + ... + 10)² = 55² = 3025.
+
+The sum of the squares of the first ten natural numbers is
+1² + 2² + ... + 10² = 385.
+
+Hence the difference between the square of the sum of the first
+ten natural numbers and the sum of the squares of the first ten
+natural numbers is 3025 - 385 = 2640.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Problem 6 at Project Euler [http://projecteuler.net/problem=6](http://projecteuler.net/problem=6)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/gigasecond/README.md

@@ -0,0 +1,16 @@
+# Gigasecond
+
+Calculate the moment when someone has lived for 10^9 seconds.
+
+A gigasecond is 10^9 (1,000,000,000) seconds.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Chapter 9 in Chris Pine's online Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=09](http://pine.fm/LearnToProgram/?Chapter=09)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/hamming/README.md

@@ -0,0 +1,47 @@
+# Hamming
+
+Calculate the Hamming difference between two DNA strands.
+
+A mutation is simply a mistake that occurs during the creation or
+copying of a nucleic acid, in particular DNA. Because nucleic acids are
+vital to cellular functions, mutations tend to cause a ripple effect
+throughout the cell. Although mutations are technically mistakes, a very
+rare mutation may equip the cell with a beneficial attribute. In fact,
+the macro effects of evolution are attributable by the accumulated
+result of beneficial microscopic mutations over many generations.
+
+The simplest and most common type of nucleic acid mutation is a point
+mutation, which replaces one base with another at a single nucleotide.
+
+By counting the number of differences between two homologous DNA strands
+taken from different genomes with a common ancestor, we get a measure of
+the minimum number of point mutations that could have occurred on the
+evolutionary path between the two strands.
+
+This is called the 'Hamming distance'.
+
+It is found by comparing two DNA strands and counting how many of the
+nucleotides are different from their equivalent in the other string.
+
+    GAGCCTACTAACGGGAT
+    CATCGTAATGACGGCCT
+    ^ ^ ^  ^ ^    ^^
+
+The Hamming distance between these two DNA strands is 7.
+
+# Implementation notes
+
+The Hamming distance is only defined for sequences of equal length. This means
+that based on the definition, each language could deal with getting sequences
+of equal length differently.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+The Calculating Point Mutations problem at Rosalind [http://rosalind.info/problems/hamm/](http://rosalind.info/problems/hamm/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/hello-world/README.md

@@ -0,0 +1,66 @@
+# Hello World
+
+The classical introductory exercise. Just say "Hello, World!".
+
+["Hello, World!"](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) is
+the traditional first program for beginning programming in a new language
+or environment.
+
+The objectives are simple:
+
+- Write a function that returns the string "Hello, World!".
+- Run the test suite and make sure that it succeeds.
+- Submit your solution and check it at the website.
+
+If everything goes well, you will be ready to fetch your first real exercise.
+
+# Welcome to Bash!
+
+Unlike many other languages here, bash is a bit of a special snowflake.
+If you are on a Mac or other unix-y platform, you almost definitely
+already have bash. In fact, anything you type into the terminal is
+likely going through bash.
+
+The downside to this is that there isn't much of a development
+ecosystem around bash like there is for other languages, and there are
+multiple verions of bash that can be frustratingly incompatible. Luckily
+we shouldn't hit those differences for these basic examples, and if you
+can get the tests to pass on your machine, we are doing great.
+
+## Installation
+
+As I said above, if you are on a unix-like OS (Mac OS X, Linux, Solaris,
+etc), you probably already have bash.
+
+## Testing
+
+As there isn't much of a bash ecosystem, there also isn't really a de
+facto leader in the bash testing area. For these examples we are using
+[bats](https://github.com/sstephenson/bats). You should be able to
+install it from your favorite package manager, on OS X with homebrew
+this would look something like this:
+
+```
+$ brew install bats
+==> Downloading
+https://github.com/sstephenson/bats/archive/v0.4.0.tar.gz
+==> Downloading from
+https://codeload.github.com/sstephenson/bats/tar.gz/v0.4.0
+########################################################################
+100.0%
+==> ./install.sh /opt/boxen/homebrew/Cellar/bats/0.4.0
+🍺  /opt/boxen/homebrew/Cellar/bats/0.4.0: 10 files, 60K, built in 2
+seconds
+```
+
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/hello-world/example.sh

@@ -1,9 +1,3 @@
 #!/bin/bash
 
-if [ "$#" -eq 0 ]; then
-  greeter="World"
-else
-  greeter="$@"
-fi
-
-echo "Hello, $greeter!"
+echo "Hello, World!"

data/tracks/bash/exercises/hello-world/hello_world_test.sh

@@ -1,22 +1,8 @@
 #!/usr/bin/env bats
 
-@test "When given no name, it should greet the world!" {
+@test "Say Hi!" {
   run bash hello_world.sh
 
   [ "$status" -eq 0 ]
   [ "$output" = "Hello, World!" ]
 }
-
-@test 'When given "Alice" it should greet Alice!' {
-  run bash hello_world.sh Alice
-
-  [ "$status" -eq 0 ]
-  [ "$output" = "Hello, Alice!" ]
-}
-
-@test 'When given "Bob" it should greet Bob!' {
-  run bash hello_world.sh Bob
-
-  [ "$status" -eq 0 ]
-  [ "$output" = "Hello, Bob!" ]
-}

data/tracks/bash/exercises/leap/README.md

@@ -0,0 +1,38 @@
+# Leap
+
+Given a year, report if it is a leap year.
+
+The tricky thing here is that a leap year in the Gregorian calendar occurs:
+
+```plain
+on every year that is evenly divisible by 4
+  except every year that is evenly divisible by 100
+    unless the year is also evenly divisible by 400
+```
+
+For example, 1997 is not a leap year, but 1996 is.  1900 is not a leap
+year, but 2000 is.
+
+If your language provides a method in the standard library that does
+this look-up, pretend it doesn't exist and implement it yourself.
+
+## Notes
+
+Though our exercise adopts some very simple rules, there is more to
+learn!
+
+For a delightful, four minute explanation of the whole leap year
+phenomenon, go watch [this youtube video][video].
+
+[video]: http://www.youtube.com/watch?v=xX96xng7sAE
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+JavaRanch Cattle Drive, exercise 3 [http://www.javaranch.com/leap.jsp](http://www.javaranch.com/leap.jsp)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/pangram/README.md

@@ -0,0 +1,20 @@
+# Pangram
+
+Determine if a sentence is a pangram. A pangram (Greek: παν γράμμα, pan gramma,
+"every letter") is a sentence using every letter of the alphabet at least once.
+The best known English pangram is: 
+> The quick brown fox jumps over the lazy dog.
+
+The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case
+insensitive. Input will not contain non-ASCII symbols.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Pangram](https://en.wikipedia.org/wiki/Pangram)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -0,0 +1,39 @@
+# Phone Number
+
+Clean up user-entered phone numbers so that they can be sent SMS messages.
+
+The **North American Numbering Plan (NANP)** is a telephone numbering system used by many countries in North America like the United States, Canada or Bermuda. All NANP-countries share the same international country code: `1`.
+
+NANP numbers are ten-digit numbers consisting of a three-digit Numbering Plan Area code, commonly known as *area code*, followed by a seven-digit local number. The first three digits of the local number represent the *exchange code*, followed by the unique four-digit number which is the *subscriber number*.
+
+
+The format is usually represented as
+```
+(NXX)-NXX-XXXX
+```
+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.
+
+For example, the inputs
+- `+1 (613)-995-0253`
+- `613-995-0253`
+- `1 613 995 0253`
+- `613.995.0253`
+
+should all produce the output
+
+`6139950253`
+
+**Note:** As this exercise only deals with telephone numbers used in NANP-countries, only 1 is considered a valid country code.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Event Manager by JumpstartLab [http://tutorials.jumpstartlab.com/projects/eventmanager.html](http://tutorials.jumpstartlab.com/projects/eventmanager.html)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/phone-number/example.sh

@@ -0,0 +1,27 @@
+#!/usr/bin/env bash
+
+correct_pattern="^1?[2-9][0-9]{2}[2-9][0-9]{6}$"
+
+function usage {
+  echo "Usage: $0 <phone-number>"
+  # echo "<phone-number>: [1]NXX-NXX-XXXX : N=[2-9], X=[0-9]"
+}
+
+if [ "$#" -ne 1 ]; then
+  usage
+  exit 1
+fi
+
+input="$1"
+
+# Remove everything but numbers
+result=${input//[^0-9]/""}
+
+# Error checking
+if [[ ! $result =~ $correct_pattern ]]; then
+  echo "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9"
+  exit 1
+fi
+
+# Strip off leading 1 country code if exists
+echo ${result: -10}

data/tracks/bash/exercises/phone-number/phone_number_tests.sh

@@ -0,0 +1,73 @@
+#!/usr/bin/env bats
+
+@test "Cleans the number" {
+  run bash phone_number.sh "(223) 456-7890"
+  [ "$status" -eq 0 ]
+  [ "$output" = "2234567890" ]
+}
+
+@test "Cleans numbers with dots" {
+  run bash phone_number.sh "223.456.7890"
+  [ "$status" -eq 0 ]
+  [ "$output" = "2234567890" ]
+}
+
+@test "Cleans numbers with multiple spaces" {
+  run bash phone_number.sh "223 456   7890   "
+  [ "$status" -eq 0 ]
+  [ "$output" = "2234567890" ]
+}
+
+@test "Invalid when 9 digits" {
+  run bash phone_number.sh "123456789"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}
+
+@test "Invalid when 11 digits does not start with 1" {
+  run bash phone_number.sh "22234567890"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}
+
+@test "Valid when 11 digits and starting with 1" {
+  run bash phone_number.sh "12234567890"
+  [ "$status" -eq 0 ]
+  [ "$output" = "2234567890" ]
+}
+
+@test "Valid when 11 digits and starting with 1 even with punctuation" {
+  run bash phone_number.sh "+1 (223) 456-7890"
+  [ "$status" -eq 0 ]
+  [ "$output" = "2234567890" ]
+}
+
+@test "Invalid with more than 11 digits" {
+  run bash phone_number.sh "321234567890"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}
+
+@test "Invalid with letters" {
+  run bash phone_number.sh "123-abc-7890"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}
+
+@test "Invalid with punctuations" {
+  run bash phone_number.sh "123-@:!-7890"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}
+
+@test "Invalid if area code does not start with 2-9" {
+  run bash phone_number.sh "(123) 456-7890"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}
+
+@test "Invalid if exchange code does not start with 2-9" {
+  run bash phone_number.sh "(223) 056-7890"
+  [ "$status" -eq 1 ]
+  [ "$output" = "Invalid number.  [1]NXX-NXX-XXXX N=2-9, X=0-9" ]
+}

data/tracks/bash/exercises/raindrops/README.md

@@ -0,0 +1,29 @@
+# Raindrops
+
+Convert a number to a string, the contents of which depend on the number's factors.
+
+- If the number has 3 as a factor, output 'Pling'.
+- If the number has 5 as a factor, output 'Plang'.
+- If the number has 7 as a factor, output 'Plong'.
+- If the number does not have 3, 5, or 7 as a factor,
+  just pass the number's digits straight through.
+
+## Examples
+
+- 28's factors are 1, 2, 4, **7**, 14, 28.
+  - In raindrop-speak, this would be a simple "Plong".
+- 30's factors are 1, 2, **3**, **5**, 6, 10, 15, 30.
+  - In raindrop-speak, this would be a "PlingPlang".
+- 34 has four factors: 1, 2, 17, and 34.
+  - In raindrop-speak, this would be "34".
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+A variation on a famous interview question intended to weed out potential candidates. [http://jumpstartlab.com](http://jumpstartlab.com)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/rna-transcription/README.md

@@ -0,0 +1,30 @@
+# Rna Transcription
+
+Given a DNA strand, return its RNA complement (per RNA transcription).
+
+Both DNA and RNA strands are a sequence of nucleotides.
+
+The four nucleotides found in DNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and thymine (**T**).
+
+The four nucleotides found in RNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and uracil (**U**).
+
+Given a DNA strand, its transcribed RNA strand is formed by replacing
+each nucleotide with its complement:
+
+* `G` -> `C`
+* `C` -> `G`
+* `T` -> `A`
+* `A` -> `U`
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/two-fer/README.md

@@ -0,0 +1,53 @@
+# Two Fer
+
+`Two-fer` or `2-fer` is short for two for one. One for you and one for me.
+
+```
+"One for X, one for me."
+```
+
+When X is a name or "you".
+
+If the given name is "Alice", the result should be "One for Alice, one for me."
+If no name is given, the result should be "One for you, one for me."
+
+
+## Test-Driven Development
+
+As programmers mature, they eventually want to test their code.
+
+Here at Exercism we simulate [Test-Driven
+Development](http://en.wikipedia.org/wiki/Test-driven_development) (TDD), where
+you write your tests before writing any functionality. The simulation comes in
+the form of a pre-written test suite, which will signal that you have solved
+the problem.
+
+It will also provide you with a safety net to explore other solutions without
+breaking the functionality.
+
+### A typical TDD workflow on Exercism:
+
+1. Run the test file and pick one test that's failing.
+2. Write some code to fix the test you picked.
+3. Re-run the tests to confirm the test is now passing.
+4. Repeat from step 1.
+5. Submit your solution (`exercism submit /path/to/file`)
+
+## Instructions
+
+Submissions are encouraged to be general, within reason. Having said that, it's
+also important not to over-engineer a solution.
+
+It's important to remember that the goal is to make code as expressive and
+readable as we can.
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+This is an exercise to introduce users to basic programming constructs, just after hello World. [https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/bash/exercises/two-fer/example.sh

@@ -0,0 +1,9 @@
+#!/bin/bash
+
+if [ "$#" -eq 0 ]; then
+  person="you"
+else
+  person="$@"
+fi
+
+echo "One for $person, one for me."

data/tracks/bash/exercises/two-fer/two_fer_test.sh

@@ -0,0 +1,23 @@
+#!/usr/bin/env bats
+
+@test "When given no name, it should have one for you!" {
+  run bash two_fer.sh
+
+  [ "$status" -eq 0 ]
+  [ "$output" = "One for you, one for me." ]
+}
+
+@test 'When given "Alice" it should have one for Alice!' {
+  run bash two_fer.sh Alice
+
+  [ "$status" -eq 0 ]
+  [ "$output" = "One for Alice, one for me." ]
+}
+
+@test 'When given "Bob" it should have one for Bob!' {
+  run bash two_fer.sh Bob
+
+  [ "$status" -eq 0 ]
+  [ "$output" = "One for Bob, one for me." ]
+}
+

data/tracks/bash/exercises/word-count/README.md

@@ -0,0 +1,24 @@
+# Word Count
+
+Given a phrase, count the occurrences of each word in that phrase.
+
+For example for the input `"olly olly in come free"`
+
+```plain
+olly: 2
+in: 1
+come: 1
+free: 1
+```
+
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Source
+
+This is a classic toy problem, but we were reminded of it by seeing it in the Go Tour.
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/vimscript/docs/ABOUT.md

@@ -1,5 +1,3 @@
-## ABOUT
-
 [Vim](http://www.vim.org) is a decades old text editor that is still wildly
 popular among programmers and people who like working in terminal emulators.
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.0.5
+  version: 2.2.0.6
 platform: ruby
 authors:
 - Katrina Owen
@@ -573,32 +573,51 @@ files:
 - tracks/bash/README.md
 - tracks/bash/bin/fetch-configlet
 - tracks/bash/config.json
+- tracks/bash/config/exercise_readme.go.tmpl
+- tracks/bash/config/maintainers.json
 - tracks/bash/docs/EXERCISE_README_INSERT.md
 - tracks/bash/docs/INSTALLATION.md
 - tracks/bash/docs/LEARNING.md
 - tracks/bash/docs/RESOURCES.md
 - tracks/bash/docs/TESTS.md
+- tracks/bash/exercises/anagram/README.md
 - tracks/bash/exercises/anagram/anagram_tests.sh
 - tracks/bash/exercises/anagram/example.sh
+- tracks/bash/exercises/bob/README.md
 - tracks/bash/exercises/bob/bob_test.sh
 - tracks/bash/exercises/bob/example.sh
+- tracks/bash/exercises/difference-of-squares/README.md
 - tracks/bash/exercises/difference-of-squares/difference_of_squares_test.sh
 - tracks/bash/exercises/difference-of-squares/example.sh
+- tracks/bash/exercises/gigasecond/README.md
 - tracks/bash/exercises/gigasecond/example.sh
 - tracks/bash/exercises/gigasecond/gigasecond_test.sh
+- tracks/bash/exercises/hamming/README.md
 - tracks/bash/exercises/hamming/example.sh
 - tracks/bash/exercises/hamming/hamming_test.sh
 - tracks/bash/exercises/hello-world/HINTS.md
+- tracks/bash/exercises/hello-world/README.md
 - tracks/bash/exercises/hello-world/example.sh
 - tracks/bash/exercises/hello-world/hello_world_test.sh
+- tracks/bash/exercises/leap/README.md
 - tracks/bash/exercises/leap/example.sh
 - tracks/bash/exercises/leap/leap_test.sh
+- tracks/bash/exercises/pangram/README.md
 - tracks/bash/exercises/pangram/example.sh
 - tracks/bash/exercises/pangram/pangram_tests.sh
+- tracks/bash/exercises/phone-number/README.md
+- tracks/bash/exercises/phone-number/example.sh
+- tracks/bash/exercises/phone-number/phone_number_tests.sh
+- tracks/bash/exercises/raindrops/README.md
 - tracks/bash/exercises/raindrops/example.sh
 - tracks/bash/exercises/raindrops/raindrops_test.sh
+- tracks/bash/exercises/rna-transcription/README.md
 - tracks/bash/exercises/rna-transcription/example.sh
 - tracks/bash/exercises/rna-transcription/rna_transcription_test.sh
+- tracks/bash/exercises/two-fer/README.md
+- tracks/bash/exercises/two-fer/example.sh
+- tracks/bash/exercises/two-fer/two_fer_test.sh
+- tracks/bash/exercises/word-count/README.md
 - tracks/bash/exercises/word-count/example.awk
 - tracks/bash/exercises/word-count/example.sh
 - tracks/bash/img/icon.png