trackler 2.2.1.91 → 2.2.1.92

data/tracks/elixir/exercises/bracket-push/README.md

@@ -8,11 +8,9 @@ verify that all the pairs are matched and nested correctly.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir bracket_push_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/change/README.md

@@ -21,11 +21,9 @@ that the sum of the coins' value would equal the correct amount of change.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir change_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -54,7 +52,7 @@ see the [help page](http://exercism.io/languages/elixir).
 
 ## Source
 
-Software Craftsmanship - Kata-logue [http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata](http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata)
+Software Craftsmanship - Coin Change Kata [https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata](https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elixir/exercises/clock/README.md

@@ -11,11 +11,9 @@ Two clocks that represent the same time should be equal to each other.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir clock_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/collatz-conjecture/README.md

@@ -10,6 +10,7 @@ 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
@@ -25,17 +26,14 @@ Starting with n = 12, the steps would be as follows:
 
 Resulting in 9 steps. So for input n = 12, the return value would be 9.
 
-
 ## Running tests
 
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir collatz_conjecture_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/connect/README.md

@@ -18,7 +18,7 @@ computes the winner (or lack thereof). Note that all games need not be "fair".
 The boards look like this (with spaces added for readability, which won't be in
 the representation passed to your code):
 
-```        
+```text
 . O . X .
  . X X O .
   O O O X .
@@ -35,11 +35,9 @@ won since `O` didn't connect top and bottom.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir connect_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -66,6 +64,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elixir/exercises/crypto-square/README.md

@@ -26,7 +26,7 @@ and `r` is the number of rows.
 Our normalized text is 54 characters long, dictating a rectangle with
 `c = 8` and `r = 7`:
 
-```plain
+```text
 ifmanwas
 meanttos
 tayonthe
@@ -41,22 +41,24 @@ right.
 
 The message above is coded as:
 
-```plain
+```text
 imtgdvsfearwermayoogoanouuiontnnlvtwttddesaohghnsseoau
 ```
 
-Output the encoded text in chunks.  Phrases that fill perfect squares
-`(r X r)` should be output in `r`-length chunks separated by spaces.
-Imperfect squares will have `n` empty spaces.  Those spaces should be distributed evenly across the last `n` rows.
+Output the encoded text in chunks.  Phrases that fill perfect rectangles
+`(r X c)` should be output `c` chunks of `r` length, separated by spaces.
+Phrases that do not fill perfect rectangles will have `n` empty spaces.
+Those spaces should be distributed evenly, added to the end of the last
+`n` chunks.
 
-```plain
-imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau
+```text
+imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau 
 ```
 
 Notice that were we to stack these, we could visually decode the
 cyphertext back in to the original message:
 
-```plain
+```text
 imtgdvs
 fearwer
 mayoogo
@@ -72,11 +74,9 @@ sseoau
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir crypto_square_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/custom-set/README.md

@@ -12,11 +12,9 @@ unique elements.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir custom_set_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -43,6 +41,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elixir/exercises/diamond/README.md

@@ -1,7 +1,7 @@
 # Diamond
 
-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 
+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.
 
 ## Requirements
@@ -15,7 +15,7 @@ supplied letter at the widest point.
 * The diamond has a square shape (width equals height).
 * The letters form a diamond shape.
 * The top half has the letters in ascending order.
-* The bottom half has the letters in descending order. 
+* The bottom half has the letters in descending order.
 * The four corners (containing the spaces) are triangles.
 
 ## Examples
@@ -24,13 +24,13 @@ In the following examples, spaces are indicated by `·` characters.
 
 Diamond for letter 'A':
 
-```plain
+```text
 A
 ```
 
 Diamond for letter 'C':
 
-```plain
+```text
 ··A··
 ·B·B·
 C···C
@@ -40,7 +40,7 @@ C···C
 
 Diamond for letter 'E':
 
-```plain
+```text
 ····A····
 ···B·B···
 ··C···C··
@@ -57,11 +57,9 @@ E·······E
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir diamond_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -17,11 +17,9 @@ natural numbers is 3025 - 385 = 2640.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir difference_of_squares_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/diffie-hellman/README.md

@@ -54,11 +54,9 @@ particularly for enormous integers, but you might need :binary to decode it.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir diffie_hellman_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/dominoes/README.md

@@ -7,10 +7,10 @@ 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
 which don't have a neighbour (the first and last stone) match each other.
 
-For example given the stones `21`, `23` and `13` you should compute something
-like `12 23 31` or `32 21 13` or `13 32 21` etc, where the first and last numbers are the same.
+For example given the stones `[2|1]`, `[2|3]` and `[1|3]` you should compute something
+like `[1|2] [2|3] [3|1]` or `[3|2] [2|1] [1|3]` or `[1|3] [3|2] [2|1]` etc, where the first and last numbers are the same.
 
-For stones 12, 41 and 23 the resulting chain is not valid: 41 12 23's first and last numbers are not the same. 4 != 3
+For stones `[1|2]`, `[4|1]` and `[2|3]` the resulting chain is not valid: `[4|1] [1|2] [2|3]`'s first and last numbers are not the same. 4 != 3
 
 Some test cases may use duplicate stones in a chain solution, assume that multiple Domino sets are being used.
 
@@ -19,11 +19,9 @@ Some test cases may use duplicate stones in a chain solution, assume that multip
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir dominoes_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -50,6 +48,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elixir/exercises/dot-dsl/README.md

@@ -1,4 +1,4 @@
-# Dot Dsl
+# DOT DSL
 
 Write a Domain Specific Language similar to the Graphviz dot language.
 
@@ -29,11 +29,9 @@ Create a DSL similar to the dot language.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir dot_dsl_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -60,6 +58,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elixir/exercises/etl/README.md

@@ -1,8 +1,9 @@
-# Etl
+# ETL
 
 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."
 
@@ -11,6 +12,7 @@ once." That's then typically followed by much forehead slapping and
 moaning about how stupid we could possibly be.)
 
 ### The goal
+
 We're going to extract some scrabble scores from a legacy system.
 
 The old system stored a list of letters per score:
@@ -49,11 +51,9 @@ game while being scored at 4 in the Hawaiian-language version.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir etl_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/flatten-array/README.md

@@ -3,24 +3,21 @@
 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.
- 
+
 For Example
 
 input: [1,[2,3,null,4],[null],5]
 
 output: [1,2,3,4,5]
 
-
 ## Running tests
 
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir flatten_array_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/forth/README.md

@@ -30,11 +30,9 @@ Words are case-insensitive.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir forth_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -61,6 +59,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -9,11 +9,9 @@ A gigasecond is 10^9 (1,000,000,000) seconds.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir gigasecond_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/grade-school/README.md

@@ -21,7 +21,6 @@ In the end, you should be able to:
 Note that all our students only have one name.  (It's a small town, what
 do you want?)
 
-
 ## For bonus points
 
 Did you get the tests passing and the code clean? If you want to, these
@@ -40,11 +39,9 @@ experiment make the code better? Worse? Did you learn anything from it?
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir grade_school_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/grains/README.md

@@ -15,7 +15,6 @@ Write code that shows:
 - how many grains were on each square, and
 - the total number of grains
 
-
 ## For bonus points
 
 Did you get the tests passing and the code clean? If you want to, these
@@ -32,11 +31,9 @@ experiment make the code better? Worse? Did you learn anything from it?
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir grains_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.