trackler 2.1.0.18 → 2.1.0.19

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 699aa71d406aeae5f2929cca3f9cff8960929312
-  data.tar.gz: f7b3ecaa31574dea13f65d401f0c01dcc5c3ae2c
+  metadata.gz: 2d6ac1a44061082046f6a5d3b58fd73dfebf3fbd
+  data.tar.gz: 96a6b24af274b1524bfc6264aabf63f6fb3d9bb8
 SHA512:
-  metadata.gz: 376c215f4dde84b255030179130d4c205adebdf3601cc99dd58cff52d7a236afc12413257f968be0976b04dae7b8c619282f1df0853d230532bb34a9bd99f310
-  data.tar.gz: bcdb38e3b1233aa1a3dc2e859409928c3c11a7fe1d9a07968941d04d2a724a35bab8abfc2da65c967fab30575f3abc088c0e67f74c32125c1a9c743418dce909
+  metadata.gz: 0e5f615e31da2f867efd6f40d40e526ca1497c909670527e226bf3c21568ac232845a36bd293c7bc3acb537adff990c83c9316bae4890361b3619629ba81046c
+  data.tar.gz: 1ccb4b4aa381b721b6acf5337ded3154970e7c00f80011db5c9212ed73c6e37c67e5461a1101a004fd5c82da8d447ea1a3d942148d5b6074058b73616da5a6f1

data/common/bin/transfer_blurb_to_description.rb

@@ -0,0 +1,56 @@
+#!/usr/bin/env ruby
+
+# This is a temporary file which exists to support the x-common issue #767
+# [Make description.md self contained.](# https://github.com/exercism/x-common/issues/767)
+#
+# The exercise description given in description.md should be complete and self
+# contained, and not require the addition of the blurb to make sense.
+#
+# This script copies the current blurb into description.md for all exercises.
+#
+# It will NOT update the description if it already begins with the blurb.
+# Thus this script will not add multiple blurbs if it is run multiple times.
+
+require 'yaml'
+
+class Exercise
+  attr_reader :path
+  def initialize(path)
+    @path = path
+  end
+
+  def update_description
+    unless description.start_with?(blurb)
+      complete_description = format("%s\n\n%s", blurb, description)
+      File.write(description_filename, complete_description)
+    end
+  end
+
+  private
+
+  def blurb
+    metadata['blurb']
+  end
+
+  def metadata
+    metadata_filename = File.join(path, 'metadata.yml')
+    YAML.load_file(metadata_filename)
+  end
+
+  def description
+    File.read(description_filename)
+  end
+
+  def description_filename
+    File.join(path, 'description.md')
+  end
+end
+
+
+exercises = Dir.glob('exercises/*').map {|path| Exercise.new(path)}
+
+updated = exercises.count do |exercise|
+  exercise.update_description
+end
+
+puts "#{updated}/#{exercises.count} exercises updated"

data/common/exercises/accumulate/description.md

@@ -1,3 +1,5 @@
+Implement the `accumulate` operation, which, given a collection and an operation to perform on each element of the collection, returns a new collection containing the result of applying that operation to each element of the input collection.
+
 Given the collection of numbers:
 
 - 1, 2, 3, 4, 5

data/common/exercises/acronym/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "acronym",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "cases": [
     {
       "description": "Abbreviate a phrase",
@@ -17,12 +17,6 @@
           "phrase": "Ruby on Rails",
           "expected": "ROR"
         },
-        {
-          "description": "camelcase",
-          "property": "abbreviate",
-          "phrase": "HyperText Markup Language",
-          "expected": "HTML"
-        },
         {
           "description": "punctuation",
           "property": "abbreviate",

data/common/exercises/acronym/description.md

@@ -1,3 +1,5 @@
+Convert a long phrase to its acronym.
+
 Techies love their TLA (Three Letter Acronyms)!
 
 Help generate some jargon by writing a program that converts a long name

data/common/exercises/all-your-base/description.md

@@ -1,3 +1,5 @@
+Convert a number, represented as a sequence of digits in one base, to any other base.
+
 Implement general base conversion. Given a number in base **a**,
 represented as a sequence of digits, convert it to base **b**.
 

data/common/exercises/allergies/description.md

@@ -1,3 +1,5 @@
+Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies.
+
 An allergy test produces a single numeric score which contains the
 information about all the allergies the person has (that they were
 tested for).

data/common/exercises/alphametics/description.md

@@ -1,3 +1,5 @@
+Write a function to solve alphametics puzzles.
+
 [Alphametics](https://en.wikipedia.org/wiki/Alphametics) is a puzzle where
 letters in words are replaced with numbers.
 

data/common/exercises/anagram/description.md

@@ -1,3 +1,5 @@
+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"`.

data/common/exercises/atbash-cipher/description.md

@@ -1,3 +1,5 @@
+Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.
+
 The Atbash cipher is a simple substitution cipher that relies on
 transposing all the letters in the alphabet such that the resulting
 alphabet is backwards. The first letter is replaced with the last

data/common/exercises/bank-account/description.md

@@ -1,3 +1,5 @@
+Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!
+
 A bank account can be accessed in multiple ways. Clients can make
 deposits and withdrawals using the internet, mobile phones, etc. Shops
 can charge against the account.

data/common/exercises/beer-song/description.md

@@ -1,3 +1,5 @@
+Produce 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

data/common/exercises/binary/description.md

@@ -1,3 +1,5 @@
+Convert a binary number, represented as a string (e.g. '101010'), to its decimal equivalent using first principles.
+
 Implement binary to decimal conversion. Given a binary input
 string, your program should produce a decimal output. The
 program should handle invalid inputs.

data/common/exercises/binary-search/description.md

@@ -1,3 +1,5 @@
+Implement a binary search algorithm.
+
 Searching a sorted collection is a common task. A dictionary is a sorted
 list of word definitions. Given a word, one can find its definition. A
 telephone book is a sorted list of people's names, addresses, and

data/common/exercises/binary-search-tree/description.md

@@ -1,3 +1,5 @@
+Insert and search for numbers in a binary tree.
+
 When we need to represent sorted data, an array does not make a good
 data structure.
 

data/common/exercises/bob/description.md

@@ -1,3 +1,5 @@
+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.

data/common/exercises/book-store/description.md

@@ -1,3 +1,5 @@
+To try and encourage more sales of different books from a popular 5 book series, a bookshop has decided to offer discounts of multiple-book purchases.
+
 To try and encourage more sales of the 5 different books
 they sell of a popular series, a bookshop has decided to
 offer discounts of multi-book purchases. 

data/common/exercises/bowling/description.md

@@ -1,3 +1,5 @@
+Score a bowling game.
+
 Bowling is game where players roll a heavy ball to knock down pins
 arranged in a triangle. Write code to keep track of the score
 of a game of bowling.

data/common/exercises/bracket-push/description.md

@@ -1,2 +1,4 @@
+Make sure the brackets and braces all match.
+
 Ensure that all the brackets and braces are matched correctly,
 and nested correctly.

data/common/exercises/change/description.md

@@ -1,3 +1,5 @@
+Correctly determine change to be given using the least number of coins.
+
 Correctly determine the fewest number of coins to be given to the user
 such that the sum of the coins' value would equal the correct amount
 of change.

data/common/exercises/circular-buffer/description.md

@@ -1,3 +1,5 @@
+A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
+
 A circular buffer, cyclic buffer or ring buffer is a data structure that
 uses a single, fixed-size buffer as if it were connected end-to-end.
 

data/common/exercises/clock/description.md

@@ -1,3 +1,5 @@
+Implement a clock that handles times without dates.
+
 Create a clock that is independent of date.
 
 You should be able to add and subtract minutes to it.

data/common/exercises/connect/description.md

@@ -1,3 +1,5 @@
+Compute the result for a game of Hex / Polygon.
+
 The abstract boardgame known as
 [Hex](https://en.wikipedia.org/wiki/Hex_%28board_game%29) / Polygon /
 CON-TAC-TIX is quite simple in rules, though complex in practice. Two players

data/common/exercises/counter/description.md

@@ -1,3 +1,5 @@
+Design a test suite for a line/letter/character counter tool.
+
 **NOTE: This exercise has been deprecated.**
 
 Please see the discussion in https://github.com/exercism/x-common/issues/80

data/common/exercises/crypto-square/description.md

@@ -1,3 +1,5 @@
+Implement the classic method for composing secret messages called a square code.
+
 Given an English text, output the encoded version of that text.
 
 First, the input is normalized: the spaces and punctuation are removed

data/common/exercises/custom-set/description.md

@@ -1,3 +1,5 @@
+Create a custom set type.
+
 Sometimes it is necessary to define a custom data structure of some
 type, like a set. In this exercise you will define your own set. How it
 works internally doesn't matter, as long as it behaves like a set of

data/common/exercises/diamond/description.md

@@ -1,3 +1,5 @@
+Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.
+
 ## Diamond kata
 
 The diamond kata takes as its input a letter, and outputs it in a diamond 

data/common/exercises/difference-of-squares/description.md

@@ -1,3 +1,5 @@
+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.
 

data/common/exercises/diffie-hellman/description.md

@@ -1,3 +1,5 @@
+Diffie-Hellman key exchange.
+
 Alice and Bob use Diffie-Hellman key exchange to share secrets.  They
 start with prime numbers, pick private keys, generate and share public
 keys, and then generate a shared secret key.

data/common/exercises/dominoes/description.md

@@ -1,3 +1,5 @@
+Make a chain of dominoes.
+
 Compute a way to order a given set of dominoes in such a way that they form a
 correct domino chain (the dots on one half of a stone match the dots on the
 neighbouring half of an adjacent stone) and that dots on the halfs of the stones

data/common/exercises/dot-dsl/description.md

@@ -1,3 +1,5 @@
+Write a Domain Specific Language similar to the Graphviz dot language.
+
 A [Domain Specific Language
 (DSL)](https://en.wikipedia.org/wiki/Domain-specific_language) is a
 small language optimized for a specific domain.

data/common/exercises/error-handling/description.md

@@ -1,3 +1,5 @@
+Implement various kinds of error handling and resource management.
+
 An important point of programming is how to handle errors and close
 resources even if errors occur.
 

data/common/exercises/etl/description.md

@@ -1,3 +1,5 @@
+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."

data/common/exercises/flatten-array/description.md

@@ -1,3 +1,5 @@
+Take a nested list and return a single list with all values except nil/null.
+
 The challenge is to write a function that accepts an arbitrarily-deep nested list-like structure and returns a flattened structure without any nil/null values.
  
 For Example

data/common/exercises/food-chain/description.md

@@ -1,3 +1,5 @@
+Generate the lyrics of the song 'I Know an Old Lady Who Swallowed a Fly'.
+
 While you could copy/paste the lyrics,
 or read them from a file, this problem is much more
 interesting if you approach it algorithmically.

data/common/exercises/forth/description.md

@@ -1,3 +1,5 @@
+Implement an evaluator for a very simple subset of Forth.
+
 [Forth](https://en.wikipedia.org/wiki/Forth_%28programming_language%29)
 is a stack-based programming language. Implement a very basic evaluator
 for a small subset of Forth.

data/common/exercises/gigasecond/description.md

@@ -1 +1,3 @@
+Calculate the moment when someone has lived for 10^9 seconds.
+
 A gigasecond is 10^9 (1,000,000,000) seconds.

data/common/exercises/go-counting/description.md

@@ -1,3 +1,5 @@
+Count the scored points on a Go board.
+
 In the game of go (also known as baduk, igo, cờ vây and wéiqí) points
 are gained by completely encircling empty intersections with your
 stones. The encircled intersections of a player are known as its

data/common/exercises/grade-school/description.md

@@ -1,3 +1,5 @@
+Given students' names along with the grade that they are in, create a roster for the school.
+
 In the end, you should be able to:
 
 - Add a student's name to the roster for a grade

data/common/exercises/grains/description.md

@@ -1,3 +1,5 @@
+Calculate the number of grains of wheat on a chessboard given that the number on each square doubles.
+
 There once was a wise servant who saved the life of a prince. The king
 promised to pay whatever the servant could dream up. Knowing that the
 king loved chess, the servant told the king he would like to have grains

data/common/exercises/grep/description.md

@@ -1,3 +1,5 @@
+Search a file for lines matching a regular expression pattern. Return the line number and contents of each matching line.
+
 The Unix [`grep`](http://pubs.opengroup.org/onlinepubs/9699919799/utilities/grep.html) command can be used to search for lines in one or more files 
 that match a user-provided search query (known as the *pattern*).
 

data/common/exercises/hamming/description.md

@@ -1,3 +1,5 @@
+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

data/common/exercises/hangman/description.md

@@ -1,3 +1,5 @@
+Implement the logic of the hangman game using functional reactive programming.
+
 [Hangman][] is a simple word guessing game.
 
 [Functional Reactive Programming][frp] is a way to write interactive

data/common/exercises/hello-world/description.md

@@ -1,3 +1,5 @@
+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.

data/common/exercises/hexadecimal/description.md

@@ -1,3 +1,5 @@
+Convert a hexadecimal number, represented as a string (e.g. "10af8c"), to its decimal equivalent using first principles (i.e. no, you may not use built-in or external libraries to accomplish the conversion).
+
 On the web we use hexadecimal to represent colors, e.g. green: 008000,
 teal: 008080, navy: 000080).
 

data/common/exercises/house/description.md

@@ -1,3 +1,5 @@
+Output the nursery rhyme 'This is the House that Jack Built'.
+
 > [The] process of placing a phrase of clause within another phrase of
 > clause is called embedding. It is through the processes of recursion
 > and embedding that we are able to take a finite number of forms (words

data/common/exercises/isogram/description.md

@@ -1,3 +1,5 @@
+Determine if a word or phrase is an isogram.
+
 An isogram (also known as a "nonpattern word") is a word or phrase without a repeating letter.
 
 Examples of isograms:

data/common/exercises/kindergarten-garden/description.md

@@ -1,3 +1,5 @@
+Given a diagram, determine which plants each child in the kindergarten class is responsible for.
+
 The kindergarten class is learning about growing plants. The teachers
 thought it would be a good idea to give them actual seeds, plant them in
 actual dirt, and grow actual plants.

data/common/exercises/largest-series-product/description.md

@@ -1,3 +1,5 @@
+Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.
+
 For example, for the input `'1027839564'`, the largest product for a
 series of 3 digits is 270 (9 * 5 * 6), and the largest product for a
 series of 5 digits is 7560 (7 * 8 * 3 * 9 * 5).

data/common/exercises/leap/description.md

@@ -1,3 +1,5 @@
+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

data/common/exercises/ledger/description.md

@@ -1,3 +1,5 @@
+Refactor a ledger printer.
+
 The ledger exercise is a refactoring exercise. There is code that prints a
 nicely formatted ledger, given a locale (American or Dutch) and a currency (US
 dollar or euro). The code however is rather badly written, though (somewhat

data/common/exercises/lens-person/description.md

@@ -1,3 +1,5 @@
+Use lenses to update nested records (specific to languages with immutable data).
+
 Updating fields of nested records is kind of annoying in Haskell. One solution
 is to use [lenses](https://wiki.haskell.org/Lens).  Implement several record
 accessing functions using lenses, you may use any library you want. The test

data/common/exercises/linked-list/description.md

@@ -1,3 +1,5 @@
+Implement a doubly linked list.
+
 Like an array, a linked list is a simple linear data structure. Several 
 common data types can be implemented using linked lists, like queues, 
 stacks, and associative arrays.

data/common/exercises/list-ops/description.md

@@ -1,3 +1,5 @@
+Implement basic list operations.
+
 In functional languages list operations like `length`, `map`, and
 `reduce` are very common. Implement a series of basic list operations,
 without using existing functions.

data/common/exercises/luhn/description.md

@@ -1,3 +1,5 @@
+Given a number determine whether or not it is valid per the Luhn formula.
+
 The [Luhn algorithm](https://en.wikipedia.org/wiki/Luhn_algorithm) is
 a simple checksum formula used to validate a variety of identification
 numbers, such as credit card numbers and Canadian Social Insurance

data/common/exercises/markdown/description.md

@@ -1,3 +1,5 @@
+Refactor a Markdown parser.
+
 The markdown exercise is a refactoring exercise. There is code that parses a
 given string with [Markdown
 syntax](https://guides.github.com/features/mastering-markdown/) and returns the

data/common/exercises/matrix/description.md

@@ -1,3 +1,5 @@
+Given a string representing a matrix of numbers, return the rows and columns of that matrix.
+
 So given a string with embedded newlines like:
 
 > 9 8 7  

data/common/exercises/meetup/description.md

@@ -1,3 +1,5 @@
+Calculate the date of meetups.
+
 Typically meetups happen on the same day of the week.  In this exercise, you will take
 a description of a meetup date, and return the actual meetup date.
 

data/common/exercises/minesweeper/description.md

@@ -1,3 +1,5 @@
+Add the numbers to a minesweeper board.
+
 Minesweeper is a popular game where the user has to find the mines using
 numeric hints that indicate how many mines are directly adjacent
 (horizontally, vertically, diagonally) to a square.

data/common/exercises/nth-prime/description.md

@@ -1,3 +1,5 @@
+Given a number n, determine what the nth prime is.
+
 By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that
 the 6th prime is 13.
 

data/common/exercises/nucleotide-codons/description.md

@@ -1,3 +1,5 @@
+Write a function that returns the name of an amino acid a particular codon, possibly using shorthand, encodes for.
+
 In DNA sequences of 3 nucleotides, called codons, encode for amino acids. Often
 several codons encode for the same amino acid. The International Union of Pure
 and Applied Chemistry developed a shorthand system for designating groups of

data/common/exercises/nucleotide-count/description.md

@@ -1,3 +1,5 @@
+Given a DNA string, compute how many times each nucleotide occurs in the string.
+
 DNA is represented by an alphabet of the following symbols: 'A', 'C',
 'G', and 'T'.
 

data/common/exercises/ocr-numbers/description.md

@@ -1,3 +1,5 @@
+Given a 3 x 4 grid of pipes, underscores, and spaces, determine which number is represented, or whether it is garbled.
+
 # Step One
 
 To begin with, convert a simple binary font to a string containing 0 or 1.

data/common/exercises/octal/description.md

@@ -1,3 +1,5 @@
+Convert a octal number, represented as a string (e.g. '1735263'), to its decimal equivalent using first principles (i.e. no, you may not use built-in or external libraries to accomplish the conversion).
+
 Implement octal to decimal conversion.  Given an octal input
 string, your program should produce a decimal output.
 

data/common/exercises/paasio/description.md

@@ -1,3 +1,5 @@
+Report network IO statistics.
+
 You are writing a [PaaS][], and you need a way to bill customers based
 on network and filesystem usage.
 

data/common/exercises/palindrome-products/description.md

@@ -1,3 +1,5 @@
+Detect palindrome products in a given range.
+
 A palindromic number is a number that remains the same when its digits are
 reversed. For example, `121` is a palindromic number but `112` is not.
 

data/common/exercises/parallel-letter-frequency/description.md

@@ -1,3 +1,5 @@
+Count the frequency of letters in texts using parallel computation.
+
 Parallelism is about doing things in parallel that can also be done
 sequentially. A common example is counting the frequency of letters.
 Create a function that returns the total frequency of each letter in a

data/common/exercises/pascals-triangle/description.md

@@ -1,3 +1,5 @@
+Compute Pascal's triangle up to a given number of rows.
+
 In Pascal's Triangle each number is computed by adding the numbers to
 the right and left of the current position in the previous row.
 

data/common/exercises/perfect-numbers/description.md

@@ -1,3 +1,5 @@
+Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
+
 The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
 
 - **Perfect**: aliquot sum = number 

data/common/exercises/phone-number/description.md

@@ -1,3 +1,5 @@
+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*.

data/common/exercises/pig-latin/description.md

@@ -1,3 +1,5 @@
+Implement a program that translates from English to Pig Latin.
+
 Pig Latin is a made-up children's language that's intended to be
 confusing. It obeys a few simple rules (below), but when it's spoken
 quickly it's really difficult for non-children (and non-native speakers)

data/common/exercises/point-mutations/description.md

@@ -1,3 +1,5 @@
+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