trackler 2.2.1.45 → 2.2.1.46

data/tracks/delphi/docs/RESOURCES.md

@@ -7,14 +7,13 @@ I also recommend reading [delphi.about.com](http://delphi.about.com/)'s "[A Begi
 Here is a list of topics that you should find helpful from the beginner's guide mentioned above:
 
 1. [String Handling Routines](http://delphi.about.com/od/beginners/fl/String-Handling-Routines-Delphi-Programming.htm)
-2. [Ordinal Data Types](http://delphi.about.com/od/faqstipstricks/fl/Ordinal-Data-Types-in-Delphi.htm)
-3. [Returning multiple values from a function](http://delphi.about.com/od/beginners/a/return-multiple-values-from-a-delphi-function.htm)
-4. [Overloading and Default Parameters](http://delphi.about.com/od/objectpascalide/a/overloading.htm)
-5. [Class and Record Helpers](http://delphi.about.com/od/oopindelphi/a/understanding-delphi-class-and-record-helpers.htm)
-6. [Record Helpers for sets and other simple types](http://delphi.about.com/od/objectpascalide/a/delphi-record-helpers-for-sets-and-other-simple-types.htm)
-7. [Using TDictionary hash tables](http://delphi.about.com/od/beginners/a/using-t-dictionary-hash-tables-in-delphi.htm)
-8. [Understanding generic types](http://delphi.about.com/od/objectpascalide/a/understanding-generic-types-in-delphi.htm)
-9. [Interfaces](http://delphi.about.com/od/oopindelphi/a/interfaces-in-delphi-programming-101.htm)
-10. [More on Interfaces](http://delphi.about.com/od/oopindelphi/a/interfaces-delphi-programming-102.htm)
-11. [Handling exceptions](http://delphi.about.com/od/objectpascalide/a/on-handling-exceptions-in-delphi-exception-handling.htm)
-12. [Threading libraries](http://delphi.about.com/od/kbthread/tp/threading-libraries-for-Delphi.htm)
+1. [Ordinal Data Types](http://delphi.about.com/od/faqstipstricks/fl/Ordinal-Data-Types-in-Delphi.htm)
+1. [Returning multiple values from a function](http://delphi.about.com/od/beginners/a/return-multiple-values-from-a-delphi-function.htm)
+1. [Overloading and Default Parameters](http://delphi.about.com/od/objectpascalide/a/overloading.htm)
+1. [Class and Record Helpers](http://delphi.about.com/od/oopindelphi/a/understanding-delphi-class-and-record-helpers.htm)
+1. [Record Helpers for sets and other simple types](http://delphi.about.com/od/objectpascalide/a/delphi-record-helpers-for-sets-and-other-simple-types.htm)
+1. [Using TDictionary hash tables](http://delphi.about.com/od/beginners/a/using-t-dictionary-hash-tables-in-delphi.htm)
+1. [Understanding generic types](http://delphi.about.com/od/objectpascalide/a/understanding-generic-types-in-delphi.htm)
+1. [Interfaces](http://delphi.about.com/od/oopindelphi/a/interfaces-in-delphi-programming-101.htm)
+1. [Handling exceptions](http://delphi.about.com/od/objectpascalide/a/on-handling-exceptions-in-delphi-exception-handling.htm)
+1. [Parallel Programming Library Tutorials](http://docwiki.embarcadero.com/RADStudio/Tokyo/en/Parallel_Programming_Library_Tutorials)

data/tracks/elixir/exercises/hello-world/hello_world.exs

@@ -1,6 +1,6 @@
 defmodule HelloWorld do
   @doc """
-  Simply returns "Hello, world!"
+  Simply returns "Hello, World!"
   """
   @spec hello :: String.t
   def hello do

data/tracks/elixir/exercises/secret-handshake/README.md

@@ -55,11 +55,9 @@ Flags &&& Check: 0b10010 (Third bit not set)
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir secret_handshake_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.
@@ -71,8 +69,8 @@ For example:
 
 ```elixir
 # @tag :pending
-test "shouting" do
-  assert Bob.hey("WATCH OUT!") == "Whoa, chill out!"
+test "wink for 1" do
+  assert SecretHandshake.commands(1) == ["wink"]
 end
 ```
 

data/tracks/elm/exercises/isogram/Isogram.example.elm

@@ -5,16 +5,16 @@ import List
 import Char
 
 
-isLetter : Char -> Bool
-isLetter c =
-    Char.isHexDigit c && (not <| Char.isDigit c)
+isAlpha : Char -> Bool
+isAlpha char =
+    Char.isUpper char || Char.isLower char
 
 
 isIsogram : String -> Bool
 isIsogram sentence =
     let
         sanitized =
-            String.filter isLetter sentence
+            String.filter isAlpha sentence
                 |> String.toLower
                 |> String.toList
                 |> List.sort

data/tracks/erlang/config.json

@@ -292,6 +292,16 @@
 
       ]
     },
+    {
+      "uuid": "28b7e4fa-0511-f480-5128-5531913fca21458a2d9",
+      "slug": "sieve",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "b312ff0e-90e3-4dd8-99dc-df4a9deb1907",
       "slug": "largest-series-product",

data/tracks/erlang/exercises/sieve/README.md

@@ -0,0 +1,88 @@
+# Sieve
+
+Use the Sieve of Eratosthenes to find all the primes from 2 up to a given
+number.
+
+The Sieve of Eratosthenes is a simple, ancient algorithm for finding all
+prime numbers up to any given limit. It does so by iteratively marking as
+composite (i.e. not prime) the multiples of each prime,
+starting with the multiples of 2.
+
+Create your range, starting at two and continuing up to and including the given limit. (i.e. [2, limit])
+
+The algorithm consists of repeating the following over and over:
+
+- take the next available unmarked number in your list (it is prime)
+- mark all the multiples of that number (they are not prime)
+
+Repeat until you have processed each number in your range.
+
+When the algorithm terminates, all the numbers in the list that have not
+been marked are prime.
+
+The wikipedia article has a useful graphic that explains the algorithm:
+https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
+
+Notice that this is a very specific algorithm, and the tests don't check
+that you've implemented the algorithm, only that you've come up with the
+correct list of primes.
+
+
+## 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
+
+Sieve of Eratosthenes at Wikipedia [http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/erlang/exercises/sieve/include/exercism.hrl

@@ -0,0 +1,11 @@
+-include_lib("eunit/include/eunit.hrl").
+
+sut(Module) ->
+  {ok, Files} = file:list_dir("./src"),
+  case lists:member("example.erl", Files) of
+    true  -> example;
+    false -> Module
+  end.
+
+version_test() ->
+  ?assertMatch(?TEST_VERSION, ?TESTED_MODULE:test_version()).

data/tracks/erlang/exercises/sieve/rebar.config

@@ -0,0 +1,30 @@
+%% Erlang compiler options
+{erl_opts, [debug_info]}.
+
+{deps, []}.
+
+{dialyzer, [
+  {warnings, [underspecs, no_return]},
+  {get_warnings, true},
+  {plt_apps, top_level_deps}, % top_level_deps | all_deps
+  {plt_extra_apps, []},
+  {plt_location, local}, % local | "/my/file/name"
+  {plt_prefix, "rebar3"},
+  {base_plt_apps, [stdlib, kernel, crypto]},
+  {base_plt_location, global}, % global | "/my/file/name"
+  {base_plt_prefix, "rebar3"}
+]}.
+
+%% eunit:test(Tests)
+{eunit_tests, []}.
+%% Options for eunit:test(Tests, Opts)
+{eunit_opts, [verbose]}.
+
+%% == xref ==
+
+{xref_warnings, true}.
+
+%% xref checks to run
+{xref_checks, [undefined_function_calls, undefined_functions,
+  locals_not_used, exports_not_used,
+  deprecated_function_calls, deprecated_functions]}.

data/tracks/erlang/exercises/sieve/src/example.erl

@@ -0,0 +1,16 @@
+-module(example).
+
+-export([sieve/1, test_version/0]).
+
+sieve(N) when N < 2 ->
+    [];
+sieve(N) ->
+    sieve(lists:seq(2,N), []).
+
+sieve([], P) ->
+    lists:reverse(P);
+sieve([N|S], P) ->
+    R = lists:filter(fun(X) -> X rem N /= 0 end, S),
+    sieve(R, [N|P]).
+
+test_version() -> 1.

data/tracks/erlang/exercises/sieve/src/sieve.app.src

@@ -0,0 +1,9 @@
+{application, sieve,
+  [{description, "exercism.io - sieve"},
+    {vsn, "0.0.1"},
+    {modules, []},
+    {registered, []},
+    {applications, [kernel,
+      stdlib]},
+    {env, []}
+  ]}.

data/tracks/erlang/exercises/sieve/src/sieve.erl

@@ -0,0 +1,8 @@
+-module(sieve).
+
+-export([sieve/1, test_version/0]).
+
+sieve(N) ->
+  undefined.
+
+test_version() -> 1.

data/tracks/erlang/exercises/sieve/test/sieve_tests.erl

@@ -0,0 +1,38 @@
+-module(sieve_tests).
+
+-define(TESTED_MODULE, (sut(sieve))).
+-define(TEST_VERSION, 1).
+-include("exercism.hrl").
+
+no_primes_under_two_test() ->
+    ?assertEqual([], ?TESTED_MODULE:sieve(1)).
+
+first_prime_test() ->
+    ?assertEqual([2], ?TESTED_MODULE:sieve(2)).
+
+primes_up_to_10_test() ->
+    ?assertEqual([2, 3, 5, 7], ?TESTED_MODULE:sieve(10)).
+
+limit_is_prime_test() ->
+    ?assertEqual([2, 3, 5, 7, 11, 13], ?TESTED_MODULE:sieve(13)).
+
+primes_up_to_1000_test() ->
+    ?assertEqual(
+      [   2,   3,   5,   7,  11,  13,  17,  19,  23,  29,
+         31,  37,  41,  43,  47,  53,  59,  61,  67,  71,
+         73,  79,  83,  89,  97, 101, 103, 107, 109, 113,
+        127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
+        179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
+        233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
+        283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
+        353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
+        419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
+        467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
+        547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
+        607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
+        661, 673, 677, 683, 691, 701, 709, 719, 727, 733,
+        739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
+        811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
+        877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
+        947, 953, 967, 971, 977, 983, 991, 997 ],
+      ?TESTED_MODULE:sieve(1000)).

data/tracks/fsharp/.gitignore

@@ -9,4 +9,5 @@ tools/
 paket-files
 .idea/
 .vs/
-.vscode/
+.vscode/
+.dotnet

data/tracks/fsharp/exercises/crypto-square/CryptoSquareTest.fs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 3.0.0 of the canonical data.
+// This file was auto-generated based on version 3.1.0 of the canonical data.
 
 module CryptoSquareTest
 
@@ -8,6 +8,10 @@ open Xunit
 open CryptoSquare
 
 [<Fact>]
+let ``Empty plaintext results in an empty ciphertext`` () =
+    ciphertext "" |> should equal ""
+
+[<Fact(Skip = "Remove to run test")>]
 let ``Lowercase`` () =
     ciphertext "A" |> should equal "a"
 
@@ -19,15 +23,15 @@ let ``Remove spaces`` () =
 let ``Remove punctuation`` () =
     ciphertext "@1,%!" |> should equal "1"
 
-[<Fact(Skip = "Remove to run test")>]
-let ``Empty plaintext results in an empty ciphertext`` () =
-    ciphertext "" |> should equal ""
-
 [<Fact(Skip = "Remove to run test")>]
 let ``9 character plaintext results in 3 chunks of 3 characters`` () =
     ciphertext "This is fun!" |> should equal "tsf hiu isn"
 
 [<Fact(Skip = "Remove to run test")>]
-let ``54 character plaintext results in 7 chunks, the last two padded with spaces`` () =
+let ``8 character plaintext results in 3 chunks, the last one with a trailing space`` () =
+    ciphertext "Chill out." |> should equal "clu hlt io "
+
+[<Fact(Skip = "Remove to run test")>]
+let ``54 character plaintext results in 7 chunks, the last two with trailing spaces`` () =
     ciphertext "If man was meant to stay on the ground, god would have given us roots." |> should equal "imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau "
 

data/tracks/fsharp/exercises/leap/LeapTest.fs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 1.0.0 of the canonical data.
+// This file was auto-generated based on version 1.1.0 of the canonical data.
 
 module LeapTest
 
@@ -13,7 +13,7 @@ let ``Year not divisible by 4: common year`` () =
 
 [<Fact(Skip = "Remove to run test")>]
 let ``Year divisible by 4, not divisible by 100: leap year`` () =
-    leapYear 2016 |> should equal true
+    leapYear 2020 |> should equal true
 
 [<Fact(Skip = "Remove to run test")>]
 let ``Year divisible by 100, not divisible by 400: common year`` () =

data/tracks/fsharp/exercises/pangram/PangramTest.fs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 1.1.0 of the canonical data.
+// This file was auto-generated based on version 1.2.0 of the canonical data.
 
 module PangramTest
 
@@ -11,6 +11,10 @@ open Pangram
 let ``Sentence empty`` () =
     isPangram "" |> should equal false
 
+[<Fact(Skip = "Remove to run test")>]
+let ``Recognizes a perfect lower case pangram`` () =
+    isPangram "abcdefghijklmnopqrstuvwxyz" |> should equal true
+
 [<Fact(Skip = "Remove to run test")>]
 let ``Pangram with only lower case`` () =
     isPangram "the quick brown fox jumps over the lazy dog" |> should equal true

data/tracks/fsharp/exercises/queen-attack/QueenAttackTest.fs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 1.0.0 of the canonical data.
+// This file was auto-generated based on version 2.0.0 of the canonical data.
 
 module QueenAttackTest
 
@@ -12,19 +12,19 @@ let ``Queen with a valid position`` () =
     create (2, 2) |> should equal true
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Queen must have positive rank`` () =
+let ``Queen must have positive row`` () =
     create (-2, 2) |> should equal false
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Queen must have rank on board`` () =
+let ``Queen must have row on board`` () =
     create (8, 4) |> should equal false
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Queen must have positive file`` () =
+let ``Queen must have positive column`` () =
     create (2, -2) |> should equal false
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Queen must have file on board`` () =
+let ``Queen must have column on board`` () =
     create (4, 8) |> should equal false
 
 [<Fact(Skip = "Remove to run test")>]
@@ -34,13 +34,13 @@ let ``Can not attack`` () =
     canAttack blackQueen whiteQueen |> should equal false
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Can attack on same rank`` () =
+let ``Can attack on same row`` () =
     let whiteQueen = (2, 4)
     let blackQueen = (2, 6)
     canAttack blackQueen whiteQueen |> should equal true
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Can attack on same file`` () =
+let ``Can attack on same column`` () =
     let whiteQueen = (4, 5)
     let blackQueen = (2, 5)
     canAttack blackQueen whiteQueen |> should equal true

data/tracks/fsharp/exercises/run-length-encoding/Example.fs

@@ -23,12 +23,12 @@ let encode (input: string) =
     |> List.ofArray
     |> partitionConsecutive
     |> List.map encodePartition
-    |> List.reduce (+)
+    |> List.fold (+) ""
 
 let decode (input: string) = 
     let folder ((decoded: string), (count: int option)) item =
         let updatedCount = Option.fold (fun acc x -> acc + x * 10) (digitToInt item) count |> Some
-        let updateDecoded = Option.fold (fun acc x -> acc + new String(item, x - 1)) (decoded + string item) count
+        let updateDecoded = Option.fold (fun acc x -> acc + String(item, x - 1)) (decoded + string item) count
 
         if Char.IsDigit item then (decoded, updatedCount) else (updateDecoded, None)