trackler 2.2.1.59 → 2.2.1.60

data/tracks/haskell/exercises/diamond/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/difference-of-squares/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

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

data/tracks/haskell/exercises/dominoes/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/etl/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/food-chain/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/forth/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/gigasecond/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/go-counting/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/grade-school/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/grains/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

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

@@ -1,5 +1,5 @@
 name: hamming
-version: 2.0.0.4
+version: 2.0.1.5
 
 dependencies:
   - base

data/tracks/haskell/exercises/hamming/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

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

@@ -67,13 +67,13 @@ cases = [ Case { description = "empty strands"
                , expected    = Just 2
                }
         , Case { description = "non-unique character in first strand"
-               , strand1     = "AGA"
-               , strand2     = "AGG"
+               , strand1     = "AAG"
+               , strand2     = "AAA"
                , expected    = Just 1
                }
         , Case { description = "non-unique character in second strand"
-               , strand1     = "AGG"
-               , strand2     = "AGA"
+               , strand1     = "AAA"
+               , strand2     = "AAG"
                , expected    = Just 1
                }
         , Case { description = "same nucleotides in different positions"

data/tracks/haskell/exercises/hello-world/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/hexadecimal/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/house/README.md

@@ -1,6 +1,6 @@
 # House
 
-Output the nursery rhyme 'This is the House that Jack Built'.
+Recite 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

data/tracks/haskell/exercises/house/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/isbn-verifier/README.md

@@ -0,0 +1,96 @@
+# Isbn Verifier
+
+Check if a given ISBN-10 is valid.
+
+## Functionality
+
+Given an unknown string the program should check if the provided string is a valid ISBN-10.
+Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
+
+The program should allow for ISBN-10 without the separating dashes to be verified as well.
+
+## ISBN
+
+Let's take a random ISBN-10 number, say `3-598-21508-8` for this.
+The first digit block indicates the group where the ISBN belongs. Groups can consist of shared languages, geographic regions or countries. The leading '3' signals this ISBN is from a german speaking country.
+The following number block is to identify the publisher. Since this is a three digit publisher number there is a 5 digit title number for this book.
+The last digit in the ISBN is the check digit which is used to detect read errors.
+
+The first 9 digits in the ISBN have to be between 0 and 9.
+The check digit can additionally be an 'X' to allow 10 to be a valid check digit as well.
+
+A valid ISBN-10 is calculated with this formula `(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0`
+So for our example ISBN this means:
+(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 = 0
+
+Which proves that the ISBN is valid.
+
+## Caveats
+
+Converting from string to number can be tricky in certain languages.
+It's getting even trickier since the check-digit of an ISBN-10 can be 'X'.
+
+## Bonus tasks
+
+* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier)
+
+* Generate valid ISBN, maybe even from a given starting ISBN
+
+## Getting Started
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/haskell).
+
+## Running the tests
+
+To run the test suite, execute the following command:
+
+```bash
+stack test
+```
+
+#### If you get an error message like this...
+
+```
+No .cabal file found in directory
+```
+
+You are probably running an old stack version and need
+to upgrade it.
+
+#### Otherwise, if you get an error message like this...
+
+```
+No compiler found, expected minor version match with...
+Try running "stack setup" to install the correct GHC...
+```
+
+Just do as it says and it will download and install
+the correct compiler version:
+
+```bash
+stack setup
+```
+
+## Running *GHCi*
+
+If you want to play with your solution in GHCi, just run the command:
+
+```bash
+stack ghci
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/haskell](https://github.com/exercism/haskell) repository on
+GitHub is the home for all of the Haskell exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue.  We'll do our best to help you!
+
+## Source
+
+Converting a string into a number and some basic processing utilizing a relatable real world example. [https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation](https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/haskell/exercises/isbn-verifier/examples/success-standard/package.yaml

@@ -0,0 +1,16 @@
+name: isbn-verifier
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: IsbnVerifier
+  source-dirs: src
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - isbn-verifier
+      - hspec

data/tracks/haskell/exercises/isbn-verifier/examples/success-standard/src/IsbnVerifier.hs

@@ -0,0 +1,10 @@
+module IsbnVerifier (isbn) where
+
+isbn :: String -> Bool
+isbn xs = length nums == 10 && g nums `mod` 11 == 0 && l <= 1
+  where
+    nums = let nxs = f xs in if last xs == 'X' then nxs++[(1,10)] else nxs
+    f :: String -> [(Int, Int)]
+    f = zip [10,9..1] . map (\x -> read [x]) . filter (`elem` ['0'..'9'])
+    g = sum . map (uncurry (*))
+    l = length $ filter (=='X') xs

data/tracks/haskell/exercises/isbn-verifier/package.yaml

@@ -0,0 +1,20 @@
+name: isbn-verifier
+version: 1.1.0.1
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: IsbnVerifier
+  source-dirs: src
+  dependencies:
+  # - foo       # List here the packages you
+  # - bar       # want to use in your solution.
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - isbn-verifier
+      - hspec

data/tracks/haskell/exercises/isbn-verifier/src/IsbnVerifier.hs

@@ -0,0 +1,4 @@
+module IsbnVerifier (isbn) where
+
+isbn :: String -> Bool
+isbn = error "You need to implement this function."

data/tracks/haskell/exercises/isbn-verifier/stack.yaml

@@ -0,0 +1 @@
+resolver: lts-9.11

data/tracks/haskell/exercises/isbn-verifier/test/Tests.hs

@@ -0,0 +1,74 @@
+{-# LANGUAGE RecordWildCards #-}
+
+import Data.Foldable     (for_)
+import Test.Hspec        (Spec, describe, it, shouldBe)
+import Test.Hspec.Runner (configFastFail, defaultConfig, hspecWith)
+
+import IsbnVerifier (isbn)
+
+main :: IO ()
+main = hspecWith defaultConfig {configFastFail = True} specs
+
+specs :: Spec
+specs = describe "isbn" $ for_ cases test
+  where
+
+    test Case{..} = it description assertion
+      where
+        assertion = isbn input `shouldBe` expected
+
+data Case = Case { description :: String
+                 , input       :: String
+                 , expected    :: Bool
+                 }
+
+cases :: [Case]
+cases = [ Case { description = "valid isbn number"
+               , input       = "3-598-21508-8"
+               , expected    = True
+               }
+        , Case { description = "invalid isbn check digit"
+               , input       = "3-598-21508-9"
+               , expected    = False
+               }
+        , Case { description = "valid isbn number with a check digit of 10"
+               , input       = "3-598-21507-X"
+               , expected    = True
+               }
+        , Case { description = "check digit is a character other than X"
+               , input       = "3-598-21507-A"
+               , expected    = False
+               }
+        , Case { description = "invalid character in isbn"
+               , input       = "3-598-2K507-0"
+               , expected    = False
+               }
+        , Case { description = "X is only valid as a check digit"
+               , input       = "3-598-2X507-9"
+               , expected    = False
+               }
+        , Case { description = "valid isbn without separating dashes"
+               , input       = "3598215088"
+               , expected    = True
+               }
+        , Case { description = "isbn without separating dashes and X as check digit"
+               , input       = "359821507"
+               , expected    = False
+               }
+        , Case { description = "too long isbn and no dashes"
+               , input       = "3598215078X"
+               , expected    = False
+               }
+        , Case { description = "isbn without check digit"
+               , input       = "3-598-21507"
+               , expected    = False
+               }
+        , Case { description = "too long isbn"
+               , input       = "3-598-21507-XX"
+               , expected    = False
+               }
+        , Case { description = "check digit of X should not be used for 0"
+               , input       = "3-598-21515-X"
+               , expected    = False
+               }
+        ]

data/tracks/haskell/exercises/isogram/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/kindergarten-garden/README.md

@@ -9,8 +9,8 @@ actual dirt, and grow actual plants.
 
 They've chosen to grow grass, clover, radishes, and violets.
 
-To this end, the children have put little cups along the window sills, and 
-planted one type of plant in each cup, choosing randomly from the available 
+To this end, the children have put little cups along the window sills, and
+planted one type of plant in each cup, choosing randomly from the available
 types of seeds.
 
 ```text
@@ -25,7 +25,7 @@ There are 12 children in the class:
 - Eve, Fred, Ginny, Harriet,
 - Ileana, Joseph, Kincaid, and Larry.
 
-Each child gets 4 cups, two on each row. Their teacher assigns cups to 
+Each child gets 4 cups, two on each row. Their teacher assigns cups to
 the children alphabetically by their names.
 
 The following diagram represents Alice's plants:

data/tracks/haskell/exercises/kindergarten-garden/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/largest-series-product/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

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

@@ -1,5 +1,5 @@
 name: leap
-version: 1.1.0.4
+version: 1.2.0.5
 
 dependencies:
   - base

data/tracks/haskell/exercises/leap/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

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

@@ -30,7 +30,7 @@ cases = [ Case { description = "year not divisible by 4: common year"
                , expected    = False
                }
         , Case { description = "year divisible by 4, not divisible by 100: leap year"
-               , input       = 2020
+               , input       = 1996
                , expected    = True
                }
         , Case { description = "year divisible by 100, not divisible by 400: common year"

data/tracks/haskell/exercises/lens-person/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/linked-list/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/list-ops/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/luhn/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/matrix/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/meetup/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/minesweeper/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/nth-prime/package.yaml

@@ -1,5 +1,5 @@
 name: nth-prime
-version: 1.0.0.3
+version: 2.0.0.4
 
 dependencies:
   - base

data/tracks/haskell/exercises/nth-prime/stack.yaml

@@ -1 +1 @@
-resolver: lts-8.21
+resolver: lts-9.11

data/tracks/haskell/exercises/nucleotide-count/README.md

@@ -2,8 +2,8 @@
 
 Given a single stranded DNA string, compute how many times each nucleotide occurs in the string.
 
-The genetic language of every living thing on the planet is DNA. 
-DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides. 
+The genetic language of every living thing on the planet is DNA.
+DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides.
 4 types exist in DNA and these differ only slightly and can be represented as the following symbols: 'A' for adenine, 'C' for cytosine, 'G' for guanine, and 'T' thymine.
 
 Here is an analogy:

data/tracks/haskell/exercises/nucleotide-count/package.yaml

@@ -1,5 +1,5 @@
 name: nucleotide-count
-version: 1.0.0.3
+version: 1.2.0.4
 
 dependencies:
   - base