trackler 2.2.1.59 → 2.2.1.60

data/tracks/ocaml/config.json

@@ -299,6 +299,16 @@
       "unlocked_by": null,
       "uuid": "202e8a9a-7a5e-486f-883b-56be298ed665"
     },
+    {
+      "core": false,
+      "difficulty": 6,
+      "slug": "rectangles",
+      "topics": [
+        "search" 
+      ],
+      "unlocked_by": null,
+      "uuid": "1b491d7e-40db-4782-a8bb-7cb3746588f5"
+    },
     {
       "core": false,
       "difficulty": 6,

data/tracks/ocaml/exercises/hamming/test.ml

@@ -1,4 +1,4 @@
-(* Test/exercise version: "1.1.0" *)
+(* Test/exercise version: "2.0.1" *)
 
 open Core
 open OUnit2
@@ -39,9 +39,9 @@ let tests = [
    "small distance in long strands" >::
       ae (Some 2) (hamdist "ACCAGGG" "ACTATGG");
    "non-unique character in first strand" >::
-      ae (Some 1) (hamdist "AGA" "AGG");
+      ae (Some 1) (hamdist "AAG" "AAA");
    "non-unique character in second strand" >::
-      ae (Some 1) (hamdist "AGG" "AGA");
+      ae (Some 1) (hamdist "AAA" "AAG");
    "same nucleotides in different positions" >::
       ae (Some 2) (hamdist "TAG" "GAT");
    "large distance" >::

data/tracks/ocaml/exercises/leap/test.ml

@@ -1,4 +1,4 @@
-(* Test/exercise version: "1.0.0" *)
+(* Test/exercise version: "1.2.0" *)
 
 open Core
 open OUnit2
@@ -10,7 +10,7 @@ let tests = [
   "year not divisible by 4: common year" >::
     ae false (leap_year 2015);
   "year divisible by 4, not divisible by 100: leap year" >::
-    ae true (leap_year 2016);
+    ae true (leap_year 1996);
   "year divisible by 100, not divisible by 400: common year" >::
     ae false (leap_year 2100);
   "year divisible by 400: leap year" >::

data/tracks/ocaml/exercises/pangram/test.ml

@@ -1,4 +1,4 @@
-(* Test/exercise version: "1.2.0" *)
+(* Test/exercise version: "1.3.0" *)
 
 open Core
 open OUnit2
@@ -15,8 +15,8 @@ let tests = [
       ae true (is_pangram "the quick brown fox jumps over the lazy dog");
    "missing character 'x'" >::
       ae false (is_pangram "a quick movement of the enemy will jeopardize five gunboats");
-   "another missing character 'x'" >::
-      ae false (is_pangram "the quick brown fish jumps over the lazy dog");
+   "another missing character, e.g. 'h'" >::
+      ae false (is_pangram "five boxing wizards jump quickly at it");
    "pangram with underscores" >::
       ae true (is_pangram "the_quick_brown_fox_jumps_over_the_lazy_dog");
    "pangram with numbers" >::

data/tracks/ocaml/exercises/rectangles/.merlin

@@ -0,0 +1,5 @@
+PKG findlib
+PKG core
+PKG ounit
+S *
+B *

data/tracks/ocaml/exercises/rectangles/Makefile

@@ -0,0 +1,11 @@
+test: test.native
+	@./test.native
+
+test.native: *.ml *.mli
+	@corebuild -r -quiet -pkg oUnit test.native
+
+clean:
+	rm -rf _build
+	rm -f test.native
+
+.PHONY: clean

data/tracks/ocaml/exercises/rectangles/example.ml

@@ -0,0 +1,30 @@
+type position = Start | UpperSide | RightSide | LowerSide | LeftSide
+
+let count_rectangles pic =
+  let maxY = Array.length pic in
+  let maxX = if maxY > 0 then String.length pic.(0) else 0 in
+  let rec go count x y xStart yStart pos = 
+    let on_side_fn dx dy next_pos () = 
+      go count (x+dx) (y+dy) xStart yStart next_pos in
+    let on_corner_fn dx1 dy1 dx2 dy2 next_pos () = 
+      go count (x+dx1) (y+dy1) xStart yStart next_pos + go count (x+dx2) (y+dy2) xStart yStart pos in
+    let progress side_ch on_side on_corner = 
+      try
+        match pic.(y).[x] with
+        | c when c = side_ch -> on_side ()
+        | '+' -> on_corner ()
+        | _ -> count
+      with Invalid_argument _ -> count in
+    match pos with
+    | Start -> 
+        if y = maxY then count
+        else if x = maxX then go count 0 (y+1) 0 (y+1) Start
+        else (match pic.(y).[x] with
+        | '+' -> go count (x+1) y x y UpperSide + go count (x+1) y x y Start
+        | _ -> go count (x+1) y (x+1) y Start 
+        )
+    | UpperSide -> progress '-' (on_side_fn 1 0 UpperSide)    (on_corner_fn 0 1 1 0 RightSide)
+    | RightSide -> progress '|' (on_side_fn 0 1 RightSide)    (on_corner_fn (-1) 0 0 1 LowerSide)
+    | LowerSide -> progress '-' (on_side_fn (-1) 0 LowerSide) (on_corner_fn 0 (-1) (-1) 0 LeftSide)
+    | LeftSide ->  progress '|' (on_side_fn 0 (-1) LeftSide)  (fun () -> if x = xStart && y = yStart then count+1 else go count x (y-1) xStart yStart LeftSide)
+  in go 0 0 0 0 0 Start

data/tracks/ocaml/exercises/rectangles/rectangles.mli

@@ -0,0 +1 @@
+val count_rectangles : string array -> int

data/tracks/ocaml/exercises/rectangles/test.ml

@@ -0,0 +1,72 @@
+(* Test/exercise version: "1.0.0" *)
+
+open Core
+open OUnit2
+open Rectangles
+
+let ae exp got _test_ctxt = assert_equal exp got ~printer:Int.to_string
+
+let tests = [
+   "no rows" >::
+      ae 0 (count_rectangles [||]);
+   "no columns" >::
+      ae 0 (count_rectangles [|""|]);
+   "no rectangles" >::
+      ae 0 (count_rectangles [|" "|]);
+   "one rectangle" >::
+      ae 1 (count_rectangles [|"+-+"; 
+                               "| |"; 
+                               "+-+"|]);
+   "two rectangles without shared parts" >::
+      ae 2 (count_rectangles [|"  +-+"; 
+                               "  | |"; 
+                               "+-+-+"; 
+                               "| |  "; 
+                               "+-+  "|]);
+   "five rectangles with shared parts" >::
+      ae 5 (count_rectangles [|"  +-+"; 
+                               "  | |"; 
+                               "+-+-+"; 
+                               "| | |"; 
+                               "+-+-+"|]);
+   "rectangle of height 1 is counted" >::
+      ae 1 (count_rectangles [|"+--+"; 
+                               "+--+"|]);
+   "rectangle of width 1 is counted" >::
+      ae 1 (count_rectangles [|"++"; 
+                               "||"; 
+                               "++"|]);
+   "1x1 square is counted" >::
+      ae 1 (count_rectangles [|"++";
+                               "++"|]);
+   "only complete rectangles are counted" >::
+      ae 1 (count_rectangles [|"  +-+"; 
+                               "    |"; 
+                               "+-+-+"; 
+                               "| | -"; 
+                               "+-+-+"|]);
+   "rectangles can be of different sizes" >::
+      ae 3 (count_rectangles [|"+------+----+"; 
+                               "|      |    |"; 
+                               "+---+--+    |"; 
+                               "|   |       |"; 
+                               "+---+-------+"|]);
+   "corner is required for a rectangle to be complete" >::
+      ae 2 (count_rectangles [|"+------+----+"; 
+                               "|      |    |"; 
+                               "+------+    |"; 
+                               "|   |       |"; 
+                               "+---+-------+"|]);
+   "large input with many rectangles" >::
+      ae 60 (count_rectangles [|"+---+--+----+"; 
+                                "|   +--+----+"; 
+                                "+---+--+    |"; 
+                                "|   +--+----+"; 
+                                "+---+--+--+-+"; 
+                                "+---+--+--+-+"; 
+                                "+------+  | |"; 
+                                "          +-+"|]);
+]
+
+let () =
+  run_test_tt_main ("rectangles tests" >::: tests)

data/tracks/ocaml/tools/test-generator/templates/ocaml/leap/test.ml

@@ -2,7 +2,7 @@ open Core
 open OUnit2
 open Leap
 
-let ae exp got _test_ctxt = assert_equal exp got
+let ae exp got _test_ctxt = assert_equal exp got ~printer:Int.to_string
 
 let tests = [
 (* TEST

data/tracks/ocaml/tools/test-generator/templates/ocaml/rectangles/test.ml

@@ -0,0 +1,15 @@
+open Core
+open OUnit2
+open Rectangles
+
+let ae exp got _test_ctxt = assert_equal exp got ~printer:Int.to_string
+
+let tests = [
+(* TEST
+   "$description" >::
+      ae $expected (count_rectangles $input);
+   END TEST *)
+]
+
+let () =
+  run_test_tt_main ("rectangles tests" >::: tests)

data/tracks/pony/README.md

@@ -2,7 +2,7 @@
 
 [![Build Status](https://travis-ci.org/exercism/pony.svg?branch=master)](https://travis-ci.org/exercism/pony)
 
-Exercism exercises in Pony.
+Exercism exercises in [Pony](https://www.ponylang.org/).
 
 ## Contributing Guide
 

data/tracks/pony/exercises/atbash-cipher/example.pony

@@ -23,16 +23,12 @@ primitive Atbash
     groups
 
   fun encode(input: String): String iso^ =>
-    try
-      String.join(
-        Iter[U8](input.lower().values())
-          .filter(this~_transposable())
-          .map[U8]({(c: U8): U8 => Atbash._transpose(c) })
-          .fold[Array[String ref]](this~_group(), [String(6)])?
-          .values())
-    else
-      recover String end
-    end
+    String.join(
+      Iter[U8](input.lower().values())
+        .filter(this~_transposable())
+        .map[U8]({(c: U8): U8 => Atbash._transpose(c) })
+        .fold[Array[String ref]]([String(6)], this~_group())
+        .values())
 
   fun decode(input: String): String iso^ =>
     recover

data/tracks/pony/exercises/difference-of-squares/example.pony

@@ -7,13 +7,9 @@ primitive Squares
     sum * sum
 
   fun sum_of_squares(n: USize): USize =>
-    try
-      Iter[USize](Range(0, n + 1))
-        .map[USize]({(x: USize): USize => x * x })
-        .fold[USize]({(acc: USize, x: USize): USize => acc + x }, 0)?
-    else
-      0
-    end
+    Iter[USize](Range(0, n + 1))
+      .map[USize]({(x: USize): USize => x * x })
+      .fold[USize](0, {(acc: USize, x: USize): USize => acc + x })
 
   fun difference(n: USize): USize =>
     square_of_sums(n) - sum_of_squares(n)

data/tracks/rust/_test/count-ignores.sh

@@ -1,9 +1,9 @@
 #!/bin/sh
 
-dir=$(dirname $(dirname $0))
+repo=$(cd "$(dirname "$0")/.." && pwd)
 exitcode=0
 
-for t in $dir/exercises/*/tests/*.rs; do
+for t in $repo/exercises/*/tests/*.rs; do
   tests=$(grep "^\s*\#\[test\]" $t | wc -l | tr -d '[:space:]')
   ignores=$(grep "^\s*\#\[ignore\]" $t | wc -l | tr -d '[:space:]')
   want_ignores=$(expr $tests - 1)

data/tracks/rust/config.json

@@ -189,6 +189,18 @@
         "loop"
       ]
     },
+    {
+      "uuid": "c986c240-46de-419c-8ed6-700eb68f8db6",
+      "slug": "isbn-verifier",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "conversion between string and int",
+        "loop",
+        "mathematics"
+      ]
+    },
     {
       "uuid": "20e7d347-b80a-4656-ac34-0825126939ff",
       "slug": "perfect-numbers",
@@ -658,6 +670,18 @@
         "external crates (optional)"
       ]
     },
+    {
+      "uuid": "1850fb3f-9dad-449a-90b6-9d90038cf34d",
+      "slug": "two-bucket",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "algorithm",
+        "loops",
+        "mathematics"
+      ]
+    },
     {
       "uuid": "c21c379b-fb23-449b-809a-3c6ef1c31221",
       "slug": "pig-latin",

data/tracks/rust/config/maintainers.json

@@ -44,6 +44,16 @@
       "link_text": null,
       "link_url": null,
       "avatar_url": null
+    },
+    {
+      "github_username": "coriolinus",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
     }
   ]
 }

data/tracks/rust/exercises/acronym/README.md

@@ -7,7 +7,6 @@ Techies love their TLA (Three Letter Acronyms)!
 Help generate some jargon by writing a program that converts a long name
 like Portable Network Graphics to its acronym (PNG).
 
-
 ## Rust Installation
 
 Refer to the [exercism help page][help-page] for Rust installation and learning

data/tracks/rust/exercises/all-your-base/README.md

@@ -6,6 +6,7 @@ Implement general base conversion. Given a number in base **a**,
 represented as a sequence of digits, convert it to base **b**.
 
 ## Note
+
 - Try to implement the conversion yourself.
   Do not use something else to perform the conversion for you.
 
@@ -28,7 +29,6 @@ The number 1120, *in base 3*, means:
 
 I think you got the idea!
 
-
 *Yes. Those three numbers above are exactly the same. Congratulations!*
 
 ## Rust Installation

data/tracks/rust/exercises/allergies/README.md

@@ -29,7 +29,6 @@ allergens that score 256, 512, 1024, etc.).  Your program should
 ignore those components of the score.  For example, if the allergy
 score is 257, your program should only report the eggs (1) allergy.
 
-
 ## Rust Installation
 
 Refer to the [exercism help page][help-page] for Rust installation and learning

data/tracks/rust/exercises/alphametics/README.md

@@ -7,7 +7,7 @@ letters in words are replaced with numbers.
 
 For example `SEND + MORE = MONEY`:
 
-```
+```text
   S E N D
   M O R E +
 -----------
@@ -16,7 +16,7 @@ M O N E Y
 
 Replacing these with valid numbers gives:
 
-```
+```text
   9 5 6 7
   1 0 8 5 +
 -----------

data/tracks/rust/exercises/atbash-cipher/README.md

@@ -9,7 +9,7 @@ letter, the second with the second-last, and so on.
 
 An Atbash cipher for the Latin alphabet would be as follows:
 
-```plain
+```text
 Plain:  abcdefghijklmnopqrstuvwxyz
 Cipher: zyxwvutsrqponmlkjihgfedcba
 ```
@@ -23,6 +23,7 @@ being 5 letters, and punctuation is excluded. This is to make it harder to guess
 things based on word boundaries.
 
 ## Examples
+
 - Encoding `test` gives `gvhg`
 - Decoding `gvhg` gives `test`
 - Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`

data/tracks/rust/exercises/beer-song/README.md

@@ -4,7 +4,7 @@ Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles
 
 Note that not all verses are identical.
 
-```plain
+```text
 99 bottles of beer on the wall, 99 bottles of beer.
 Take one down and pass it around, 98 bottles of beer on the wall.
 

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

@@ -2,19 +2,29 @@
 
 Score a bowling game.
 
-Bowling is game where players roll a heavy ball to knock down pins
+Bowling is a 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.
 
 ## 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.
+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.
 
-* 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.
 
-* 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 by the second
+  throw. The total value of a spare is 10 plus the number of pins
+  knocked down in their 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 by 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 a second strike, then the value of the first strike
+  cannot be determined until the ball is thrown one more time.
 
 Here is a three frame example:
 
@@ -30,7 +40,11 @@ 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 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.
 
 For a tenth frame of X1/ (strike and a spare), the total value is 20.