trackler 2.1.0.24 → 2.1.0.25

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f709e319865d19a3edd18d5e20ff5f0fabcd438b
-  data.tar.gz: 9a9e667cc9ef535f6cb3fd28270f4a09f8a4acf9
+  metadata.gz: 8e992178474e75584ead434f6949b980b992ed45
+  data.tar.gz: d6b4cbd00de3ee42f96e025937e18154edfab66e
 SHA512:
-  metadata.gz: ae5e1c6d35bcbe9879f021fe2130ecfa6cf7a365e40d56271c7b04d66fc367fa80c768ebfb8d466a8ef6208a1e26bbd5cc2a9e0a61d6d8763cd945392afd7ed7
-  data.tar.gz: 946c99dd215e5e1f0d74089a72280e33e7ce035743381878fd8f363c960e63685a1e52ed2307a94098fbb1f047229e127030bd97783e6e09d6235f64d0319218
+  metadata.gz: 67568e6b9ef2079e4f16e767c01c147d664b12a3629196b517c12f74a9124a5d82e2c214623153ab0b59d9b26b60d96218d46eea64dcaaef693f49c8c62c043b
+  data.tar.gz: 2ac45474dfdfda50caa53c35dfccb94b9ec5947cd77570fb82ac9d159c95a9efc1bfe381178c6c2055a5869a91b85e1f05b7e0830d2a2eeafc241fccefa6b812

data/.gitmodules

@@ -178,3 +178,6 @@
 [submodule "tracks/coq"]
 	path = tracks/coq
 	url = https://github.com/exercism/xcoq
+[submodule "tracks/fortran"]
+	path = tracks/fortran
+	url = https://github.com/exercism/xfortran

data/CONTRIBUTING.md

@@ -10,17 +10,12 @@ A git submodule is essentially a project in another project.
 
 ## Terminology
 
-* _Language_ - the name of a programming language, e.g. _C++_.
-* _Track_ - a collection of exercises in a programming language.
-* _Track ID_ - a url-friendly version of the language name, e.g. `cpp`.
-* _Problem_ - a high-level, language-independent description of a problem to solve.
-* _Implementation_ - a language-specific implementation of a problem. This contains at
-  minimum a README and a test suite.
+Check out the [glossary][] for an overview of the important terms for Exercism, many
+of which are used as class names in this codebase.
 
 ## Adding a New Language Track
 
-To start a new language track, ask [Katrina](https://github.com/kytrinyx) to bootstrap a
-repository for you.
+To start a new language track, open an issue in the [request-new-language-track][] repository.
 
 Once the repository exists, it can be added as a submodule here (using C++ as an example):
 
@@ -31,3 +26,5 @@ $ TRACK_ID=cpp; git submodule add https://github.com/exercism/x$TRACK_ID.git tra
 [submodule]: https://git-scm.com/book/en/v2/Git-Tools-Submodules
 [xtracks]: https://github.com/exercism/trackler/tree/master/tracks
 [xcommon]: https://github.com/exercism/x-common
+[glossary]: https://github.com/exercism/docs/blob/master/glossary.md
+[request-new-language-track]: https://github.com/exercism/request-new-language-track

data/README.md

@@ -36,26 +36,26 @@ track.implementations.each do |implementation|
 end
 ```
 
-To get a problem, use the problem slug:
+To get the specification of a problem, use the exercise slug:
 
 ```
-problem = Trackler.problems["leap"]
+specification = Trackler.specifications["leap"]
 ```
 
-Problems contain the generic, language-independent metadata:
+Specifications contain the generic, language-independent metadata:
 
 ```
-problem.blurb
+specification.blurb
 # => "Write a program that will take a year and report if it is a leap year."
-problem.name
+specification.name
 # => "Leap"
 ```
 
-You can get all of the different language implementations for a problem:
+You can get all of the different language implementations for a specification:
 
 ```
 
-Trackler.implementations[problem.slug].each do |implementation|
+Trackler.implementations[specification.slug].each do |implementation|
   # ...
 end
 ```

data/common/CONTRIBUTING.md

@@ -32,7 +32,6 @@ themselves. There are other guides about contributing to other parts of the Exer
     * [Providing Feedback on the Site for an Exercise You Implemented](#providing-feedback-on-the-site-for-an-exercise-you-implemented)
 * [Implementing a Completely New Exercise](#implementing-a-completely-new-exercise)
 * [Improving Consistency By Extracting Shared Test Data](#improving-consistency-by-extracting-shared-test-data)
-* [Writing a New Test Suite Generator](#writing-a-new-test-suite-generator)
 * [Track Anatomy](#track-anatomy)
 * [Starting a New Track](#starting-a-new-track)
     * [Beta-Testing a Language Track](#beta-testing-a-language-track)
@@ -404,10 +403,6 @@ From what you learned in step 3 decide for a sensible set of test cases. The fol
 
   If you are unsure about all these considerations just make a pull request with an initial proposal and ask the community for help.
 
-## Writing a New Test Suite Generator
-
-TODO: elaborate.
-
 ## Track Anatomy
 
 Each track should have the following structure:

data/common/exercises/accumulate/description.md

@@ -1,4 +1,7 @@
-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.
+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:
 

data/common/exercises/acronym/description.md

@@ -1,4 +1,4 @@
-Convert a long phrase to its acronym.
+Convert a phrase to its acronym.
 
 Techies love their TLA (Three Letter Acronyms)!
 

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

@@ -1,4 +1,5 @@
-Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!
+Simulate a bank account supporting opening/closing, withdrawals, 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

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

@@ -1,8 +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. 
+To try and encourage more sales of different books from a popular 5 book
+series, a bookshop has decided to offer discounts on multiple book purchases.
 
 One copy of any of the five books costs $8. 
 

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

@@ -1,4 +1,2 @@
-Make sure the brackets and braces all match.
-
-Ensure that all the brackets and braces are matched correctly,
-and nested correctly.
+Given a string containing brackets `[]`, braces `{}` and parentheses `()`,
+verify that all the pairs are matched and nested correctly.

data/common/exercises/change/description.md

@@ -1,8 +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.
+Correctly determine the fewest number of coins to be given to a customer such
+that the sum of the coins' value would equal the correct amount of change.
 
 ## For example
 

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

@@ -1,5 +1,3 @@
-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,7 +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.
 
 Two clocks that represent the same time should be equal to each other.

data/common/exercises/collatz-conjecture/canonical-data.json

@@ -0,0 +1,36 @@
+{
+  "exercise": "collatz-conjecture",
+  "version": "1.0.0",
+  "cases": [
+    {
+      "description": "zero steps for one",
+      "property": "steps",
+      "number": 1,
+      "expected": 0
+    },
+    {
+      "description": "divide if even",
+      "property": "steps",
+      "number": 16,
+      "expected": 4
+    },
+    {
+      "description": "even and odd steps",
+      "property": "steps",
+      "number": 12,
+      "expected": 9
+    },
+    {
+      "description": "zero is an error",
+      "property": "steps",
+      "number": 0,
+      "expected": { "error": "Only positive numbers are allowed" }
+    },
+    {
+      "description": "negative value is an error ",
+      "property": "steps",
+      "number": -15,
+      "expected": { "error": "Only positive numbers are allowed" }
+    }
+  ]
+}

data/common/exercises/collatz-conjecture/description.md

@@ -0,0 +1,25 @@
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+## Examples
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+

data/common/exercises/collatz-conjecture/metadata.yml

@@ -0,0 +1,4 @@
+---
+blurb: "Calculate the number of steps to reach 1 using the Collatz conjecture"
+source: "An unsolved problem in mathematics named after mathematician Lothar Collatz"
+source_url: "https://en.wikipedia.org/wiki/3x_%2B_1_problem"

data/common/exercises/counter/description.md

@@ -1,11 +1,10 @@
-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
 for more context.
 
 --------
+Design a test suite for a line/letter/character counter tool.
 
 This is a special exercise. Instead of creating code that works with
 an existing test suite you get to define the test suite. To help you

data/common/exercises/diamond/description.md

@@ -1,7 +1,3 @@
-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 
 shape. Given a letter, it prints a diamond starting with 'A', with the 
 supplied letter at the widest point.

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

@@ -1,4 +1,4 @@
-Take a nested list and return a single list with all values except nil/null.
+Take a nested list and return a single flattened 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.
  

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

@@ -1,4 +1,5 @@
-Given students' names along with the grade that they are in, create a roster for the school.
+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:
 

data/common/exercises/grains/description.md

@@ -1,4 +1,5 @@
-Calculate the number of grains of wheat on a chessboard given that the number on each square doubles.
+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

data/common/exercises/grep/description.md

@@ -1,4 +1,5 @@
-Search a file for lines matching a regular expression pattern. Return the line number and contents of each matching line.
+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*).
@@ -59,4 +60,4 @@ hello again
 The `grep` command should support multiple flags at once.
 
 For example, running `grep -l -v "hello" file1.txt file2.txt` should
-print the names of files that do not contain the string "hello".
+print the names of files that do not contain the string "hello".

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

@@ -1,4 +1,5 @@
-Given a diagram, determine which plants each child in the kindergarten class is responsible for.
+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

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

@@ -1,4 +1,5 @@
-Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.
+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

data/common/exercises/matrix/description.md

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

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

@@ -1,4 +1,5 @@
-Write a function that returns the name of an amino acid a particular codon, possibly using shorthand, encodes for.
+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

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

@@ -1,4 +1,5 @@
-Given a 3 x 4 grid of pipes, underscores, and spaces, determine which number is represented, or whether it is garbled.
+Given a 3 x 4 grid of pipes, underscores, and spaces, determine which number is
+represented, or whether it is garbled.
 
 # Step One
 

data/common/exercises/octal/description.md

@@ -1,4 +1,6 @@
-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).
+Convert an 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/pangram/description.md

@@ -1,6 +1,7 @@
 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 best known English pangram is: 
+> The quick brown fox jumps over the lazy dog.
 
 The alphabet used is ASCII, and case insensitive, from 'a' to 'z'
 inclusively.

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

@@ -1,4 +1,5 @@
-Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
+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
 

data/common/exercises/poker/description.md

@@ -1,6 +1,4 @@
 Pick the best hand(s) from a list of poker hands.
 
-Write an algorithm to pick the best poker hand(s) from a list.
-
 See [wikipedia](https://en.wikipedia.org/wiki/List_of_poker_hands) for an
 overview of poker hands.

data/common/exercises/protein-translation/description.md

@@ -1,7 +1,5 @@
 Translate RNA sequences into proteins.
 
-Let's translate RNA sequences into proteins. [general ref](http://en.wikipedia.org/wiki/Translation_(biology))
-
 RNA can be broken into three nucleotide sequences called codons, and then translated to a polypeptide like so:
 
 RNA: `"AUGUUUUCU"` => translates to
@@ -38,3 +36,6 @@ UAU, UAC              | Tyrosine
 UGU, UGC              | Cysteine
 UGG                   | Tryptophan
 UAA, UAG, UGA         | STOP
+
+
+Learn more about [protein translation on Wikipedia](http://en.wikipedia.org/wiki/Translation_(biology))

data/common/exercises/proverb/description.md

@@ -1,4 +1,5 @@
-For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.
+For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output
+the full text of this proverbial rhyme.
 
 For want of a nail the shoe was lost.
 For want of a shoe the horse was lost.

data/common/exercises/pythagorean-triplet/description.md

@@ -1,5 +1,3 @@
-There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product a * b * c.
-
 A Pythagorean triplet is a set of three natural numbers, {a, b, c}, for
 which,
 
@@ -12,3 +10,7 @@ For example,
 ```
 3**2 + 4**2 = 9 + 16 = 25 = 5**2.
 ```
+
+There exists exactly one Pythagorean triplet for which a + b + c = 1000.
+
+Find the product a * b * c.

data/common/exercises/queen-attack/description.md

@@ -1,4 +1,5 @@
-Given the position of two queens on a chess board, indicate whether or not they are positioned so that they can attack each other.
+Given the position of two queens on a chess board, indicate whether or not they
+are positioned so that they can attack each other.
 
 In the game of chess, a queen can attack pieces which are on the same
 row, column, or diagonal.

data/common/exercises/rectangles/description.md

@@ -1,6 +1,4 @@
-Count the rectangles in an ASCII diagram.
-
-Create a program to count the rectangles in an ASCII diagram like the one below.
+Count the rectangles in an ASCII diagram like the one below.
 
 ```
    +--+

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

@@ -1,9 +1,5 @@
 Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
 
-# Rotational Cipher
-
-Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
-
 The Caesar cipher is a simple shift cipher that relies on
 transposing all the letters in the alphabet using an integer key
 between `0` and `26`. Using a key of `0` or `26` will always yield