trackler 2.2.1.45 → 2.2.1.46

data/tracks/haskell/exercises/robot-simulator/package.yaml

@@ -1,5 +1,5 @@
 name: robot-simulator
-version: 1.0.0.3
+version: 2.0.0.4
 
 dependencies:
   - base

data/tracks/haskell/exercises/secret-handshake/package.yaml

@@ -1,5 +1,5 @@
 name: secret-handshake
-version: 1.0.0.3
+version: 1.1.0.4
 
 dependencies:
   - base

data/tracks/haskell/exercises/secret-handshake/test/Tests.hs

@@ -41,6 +41,3 @@ specs = do
 
     it "do nothing for zero" $
       handshake (0 :: Int) `shouldBe` []
-
-    it "do nothing if lower 5 bits not set" $
-      handshake (32 :: Int) `shouldBe` []

data/tracks/haskell/exercises/sum-of-multiples/package.yaml

@@ -1,5 +1,5 @@
 name: sum-of-multiples
-version: 1.0.0.3
+version: 1.1.0.4
 
 dependencies:
   - base

data/tracks/haskell/exercises/sum-of-multiples/test/Tests.hs

@@ -34,6 +34,10 @@ cases = [ Case { factors  = [3, 5]
                , limit    = 4
                , expected = 3
                }
+        , Case { factors  = [3]
+               , limit    = 7
+               , expected = 9
+               }
         , Case { factors  = [3, 5]
                , limit    = 10
                , expected = 23

data/tracks/haskell/exercises/zipper/package.yaml

@@ -1,5 +1,5 @@
 name: zipper
-version: 0.1.0.2
+version: 1.0.0.3
 
 dependencies:
   - base

data/tracks/haskell/exercises/zipper/test/Tests.hs

@@ -27,6 +27,9 @@ specs = do
         t2         = BT 1 (node 5 Nothing  $ leaf 3) $ leaf 4
         t3         = BT 1 (node 2 (leaf 5) $ leaf 3) $ leaf 4
         t4         = BT 1 (leaf 2                  ) $ leaf 4
+        t5         = BT 6 (leaf 7                  ) $ leaf 8
+        t6         = BT 1 (node 2 Nothing  $ leaf 3) $ node 6 (leaf 7) (leaf 8)
+        t7         = BT 1 (node 2 Nothing  $ leaf 5) $ leaf 4
 
     it "data is retained" $
       toTree (fromTree t1)
@@ -40,6 +43,14 @@ specs = do
       (left . fromJust . left . fromTree) t1
       `shouldBe` Nothing
 
+    it "traversing up from top" $
+      (up . fromTree) t1
+      `shouldBe` Nothing
+
+    it "left, right, and up" $
+      (value . fromJust . right . fromJust . left . fromJust . up . fromJust . right . fromJust . up . fromJust . left . fromTree) t1
+      `shouldBe` 3
+
     it "tree from deep focus" $
       (toTree . fromJust . right . fromJust . left . fromTree) t1
       `shouldBe` t1
@@ -48,6 +59,10 @@ specs = do
       (toTree . setValue 5 . fromJust . left . fromTree) t1
       `shouldBe` t2
 
+    it "setValue after traversing up" $
+      (toTree . setValue 5 . fromJust . up . fromJust . right . fromJust . left . fromTree) t1
+      `shouldBe` t2
+
     it "setLeft with Just" $
       (toTree . setLeft (leaf 5) . fromJust . left . fromTree) t1
       `shouldBe` t3
@@ -56,6 +71,14 @@ specs = do
       (toTree . setRight Nothing . fromJust . left . fromTree) t1
       `shouldBe` t4
 
+    it "setRight with subtree" $
+      (toTree . setRight (Just t5) . fromTree) t1
+      `shouldBe` t6
+
+    it "setValue on deep focus" $
+      (toTree . setValue 5 . fromJust . right . fromJust . left . fromTree) t1
+      `shouldBe` t7
+
     it "different paths to same zipper" $
       (right . fromJust . up . fromJust . left . fromTree) t1
       `shouldBe` (right . fromTree) t1

data/tracks/java/config.json

@@ -418,7 +418,13 @@
       "core": true,
       "difficulty": 5,
       "slug": "word-count",
-      "topics": null,
+      "topics": [
+        "strings",
+        "maps",
+        "loops",
+        "conditionals",
+        "integers"
+      ],
       "unlocked_by": null,
       "uuid": "3603b770-87a5-4758-91f3-b4d1f9075bc1"
     },
@@ -434,7 +440,13 @@
       "core": true,
       "difficulty": 5,
       "slug": "robot-name",
-      "topics": null,
+      "topics": [
+        "regular_expressions",
+        "strings",
+        "randomness",
+        "text_formatting",
+        "pattern_matching"
+      ],
       "unlocked_by": null,
       "uuid": "d7c2eed9-64c7-4c4a-b45d-c787d460337f"
     },
@@ -623,7 +635,11 @@
       "core": false,
       "difficulty": 6,
       "slug": "etl",
-      "topics": null,
+      "topics": [
+        "transforming",
+        "maps",
+        "lists"
+      ],
       "unlocked_by": "word-count",
       "uuid": "76d28d97-75d3-47eb-bb77-3d347b76f1b6"
     },
@@ -631,7 +647,11 @@
       "core": true,
       "difficulty": 6,
       "slug": "linked-list",
-      "topics": null,
+      "topics": [
+        "algorithms",
+        "lists",
+        "generics"
+      ],
       "unlocked_by": null,
       "uuid": "7ba5084d-3b75-4406-a0d7-87c26387f9c0"
     },
@@ -639,7 +659,13 @@
       "core": false,
       "difficulty": 6,
       "slug": "grade-school",
-      "topics": null,
+      "topics": [
+        "conditionals",
+        "strings",
+        "lists",
+        "maps",
+        "sorting"
+      ],
       "unlocked_by": "word-count",
       "uuid": "b4af5da1-601f-4b0f-bfb8-4a381851090c"
     },
@@ -700,7 +726,14 @@
       "core": false,
       "difficulty": 6,
       "slug": "all-your-base",
-      "topics": null,
+      "topics": [
+        "loops",
+        "mathematics",
+        "integers",
+        "arrays",
+        "conditionals",
+        "exception_handling"
+      ],
       "unlocked_by": "saddle-points",
       "uuid": "f7c2e4b5-1995-4dfe-b827-c9aff8ac5332"
     },
@@ -753,7 +786,13 @@
       "core": false,
       "difficulty": 7,
       "slug": "sublist",
-      "topics": null,
+      "topics": [
+        "lists",
+        "searching",
+        "loops",
+        "generics",
+        "enumeration"
+      ],
       "unlocked_by": "linked-list",
       "uuid": "d2aedbd7-092a-43d0-8a5e-ae3ebd5b9c7f"
     },
@@ -776,7 +815,12 @@
       "core": false,
       "difficulty": 7,
       "slug": "simple-linked-list",
-      "topics": null,
+      "topics": [
+        "algorithms",
+        "generics",
+        "lists",
+        "exception_handling"
+      ],
       "unlocked_by": "linked-list",
       "uuid": "e3e5ffe5-cfc1-467e-a28a-da0302130144"
     },
@@ -784,7 +828,13 @@
       "core": false,
       "difficulty": 7,
       "slug": "binary-search-tree",
-      "topics": null,
+      "topics": [
+        "trees",
+        "sorting",
+        "searching",
+        "generics",
+        "graphs"
+      ],
       "unlocked_by": "binary-search",
       "uuid": "0a2d18aa-7b5e-4401-a952-b93d2060694f"
     },
@@ -875,7 +925,13 @@
       "core": false,
       "difficulty": 8,
       "slug": "book-store",
-      "topics": null,
+      "topics": [
+        "integers",
+        "lists",
+        "algorithms",
+        "mathematics",
+        "floating_point_numbers"
+      ],
       "unlocked_by": "flatten-array",
       "uuid": "e5f05d00-fe5b-4d78-b2fa-934c1c9afb32"
     },
@@ -918,7 +974,12 @@
       "core": false,
       "difficulty": 8,
       "slug": "change",
-      "topics": null,
+      "topics": [
+        "algorithms",
+        "integers",
+        "exception_handling",
+        "lists"
+      ],
       "unlocked_by": "flatten-array",
       "uuid": "bac1f4bc-eea9-43c1-8e95-097347f5925e"
     },
@@ -949,7 +1010,14 @@
       "core": false,
       "difficulty": 9,
       "slug": "forth",
-      "topics": null,
+      "topics": [
+        "parsing",
+        "stacks",
+        "exception_handling",
+        "strings",
+        "lists",
+        "logic"
+      ],
       "unlocked_by": "secret-handshake",
       "uuid": "f0c0316d-3fb5-455e-952a-91161e7fb298"
     },
@@ -957,7 +1025,11 @@
       "core": false,
       "difficulty": 10,
       "slug": "custom-set",
-      "topics": null,
+      "topics": [
+        "sets",
+        "equality",
+        "generics"
+      ],
       "unlocked_by": "linked-list",
       "uuid": "377fe38b-08ad-4f3a-8118-a43c10f7b9b2"
     },

data/tracks/java/config/maintainers.json

@@ -55,4 +55,4 @@
       "show_on_website": true
     }
   ]
-}
+}

data/tracks/java/exercises/accumulate/README.md

@@ -25,9 +25,6 @@ Keep your hands off that collect/map/fmap/whatchamacallit functionality
 provided by your standard library!
 Solve this one yourself using other basic tools instead.
 
-Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
-as this is idiomatic Lisp, not a library function.
-
 
 To run the tests:
 

data/tracks/java/exercises/acronym/.meta/.version

@@ -0,0 +1 @@
+1.1.0

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

@@ -8,7 +8,6 @@ Help generate some jargon by writing a program that converts a long name
 like Portable Network Graphics to its acronym (PNG).
 
 
-
 To run the tests:
 
 ```sh

data/tracks/java/exercises/acronym/src/test/java/AcronymTest.java

@@ -3,9 +3,6 @@ import org.junit.Ignore;
 
 import static org.junit.Assert.assertEquals;
 
-/*
- * version: 1.1.0
- */
 public class AcronymTest {
 
     @Test

data/tracks/java/exercises/all-your-base/.meta/.version

@@ -0,0 +1 @@
+1.1.0

data/tracks/java/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!*
 
 

data/tracks/java/exercises/all-your-base/src/test/java/BaseConverterTest.java

@@ -7,9 +7,6 @@ import java.util.Arrays;
 
 import static org.junit.Assert.assertArrayEquals;
 
-/*
- * version: 1.1.0
- */
 public class BaseConverterTest {
 
     @Rule

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

@@ -30,7 +30,6 @@ ignore those components of the score.  For example, if the allergy
 score is 257, your program should only report the eggs (1) allergy.
 
 
-
 To run the tests:
 
 ```sh

data/tracks/java/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/java/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/java/exercises/binary/README.md

@@ -7,10 +7,12 @@ string, your program should produce a decimal output. The
 program should handle invalid inputs.
 
 ## Note
+
 - Implement the conversion yourself.
   Do not use something else to perform the conversion for you.
 
 ## About Binary (Base-2)
+
 Decimal is a base-10 system.
 
 A number 23 in base 10 notation can be understood

data/tracks/java/exercises/book-store/README.md

@@ -3,20 +3,20 @@
 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. 
+One copy of any of the five books costs $8.
 
 If, however, you buy two different books, you get a 5%
 discount on those two books.
 
-If you buy 3 different books, you get a 10% discount. 
+If you buy 3 different books, you get a 10% discount.
 
 If you buy 4 different books, you get a 20% discount.
 
-If you buy all 5, you get a 25% discount. 
+If you buy all 5, you get a 25% discount.
 
 Note: that if you buy four books, of which 3 are
 different titles, you get a 10% discount on the 3 that
-form part of a set, but the fourth book still costs $8. 
+form part of a set, but the fourth book still costs $8.
 
 Your mission is to write a piece of code to calculate the
 price of any conceivable shopping basket (containing only
@@ -30,7 +30,7 @@ For example, how much does this basket of books cost?
 - 2 copies of the third book
 - 1 copy of the fourth book
 - 1 copy of the fifth book
- 
+
 One way of grouping these 8 books is:
 
 - 1 group of 5 --> 25% discount (1st,2nd,3rd,4th,5th)

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