trackler 2.2.1.66 → 2.2.1.67

data/tracks/bash/exercises/rna-transcription/rna_transcription_test.sh

@@ -1,6 +1,7 @@
 #!/usr/bin/env bats
 
 @test 'Complement of cytosine is guanine' {
+  #skip
   run bash rna_transcription.sh C
 
   [ "$status" -eq 0 ]
@@ -8,6 +9,7 @@
 }
 
 @test 'Complement of guanine is cytosine' {
+  skip
   run bash rna_transcription.sh G
   
   [ "$status" -eq 0 ]
@@ -15,6 +17,7 @@
 }
 
 @test 'Complement of thymine is adenine' {
+  skip
   run bash rna_transcription.sh T
 
   [ "$status" -eq 0 ]
@@ -22,6 +25,7 @@
 }
 
 @test 'Complement of adenine is uracil' {
+  skip
   run bash rna_transcription.sh A
 
   [ "$status" -eq 0 ]
@@ -29,6 +33,7 @@
 }
 
 @test 'Complement of long string' {
+  skip
   run bash rna_transcription.sh ACGTGGTCTTAA
 
   [ "$status" -eq 0 ]
@@ -36,6 +41,7 @@
 }
 
 @test 'Handles invalid character' {
+  skip
   run bash rna_transcription.sh U
 
   [ "$status" -eq 1 ]
@@ -43,6 +49,7 @@
 }
 
 @test 'Handles completely invalid string' {
+  skip
   run bash rna_transcription.sh XXXX
 
   [ "$status" -eq 1 ]
@@ -50,6 +57,7 @@
 }
 
 @test 'Handles partially invalid string' {
+  skip
   run bash rna_transcription.sh ACGTXCTTAA
 
   [ "$status" -eq 1 ]

data/tracks/bash/exercises/two-fer/two_fer_test.sh

@@ -1,6 +1,7 @@
 #!/usr/bin/env bats
 
 @test "When given no name, it should have one for you!" {
+  #skip
   run bash two_fer.sh
 
   [ "$status" -eq 0 ]
@@ -8,6 +9,7 @@
 }
 
 @test 'When given "Alice" it should have one for Alice!' {
+  skip
   run bash two_fer.sh Alice
 
   [ "$status" -eq 0 ]
@@ -15,6 +17,7 @@
 }
 
 @test 'When given "Bob" it should have one for Bob!' {
+  skip
   run bash two_fer.sh Bob
 
   [ "$status" -eq 0 ]

data/tracks/bash/exercises/word-count/word_count_test.sh

@@ -1,6 +1,7 @@
 #!/usr/bin/env bats
 
 @test "count one word" {
+    #skip
     run ./word_count.sh "word"
 
     [ "$status" -eq 0 ]
@@ -9,6 +10,7 @@
 }
 
 @test "count one of each word" {
+    skip
     run ./word_count.sh "one of each"
 
     [ "$status" -eq 0 ]
@@ -19,6 +21,7 @@
 }
 
 @test "multiple occurrences of a word" {
+    skip
     run ./word_count.sh "one fish two fish red fish blue fish"
 
     [ "$status" -eq 0 ]
@@ -31,6 +34,7 @@
 }
 
 @test "handle cramped lists" {
+    skip
     run ./word_count.sh "one,two,three"
 
     [ "$status" -eq 0 ]
@@ -41,6 +45,7 @@
 }
 
 @test "ignore punctuation" {
+    skip
     run ./word_count.sh "car: carpet as java: javascript!!&@$%^&"
 
    [ "$status" -eq 0 ]
@@ -53,6 +58,7 @@
 }
 
 @test "include numbers" {
+    skip
     run ./word_count.sh "testing, 1, 2 testing"
 
     [ "$status" -eq 0 ]
@@ -63,6 +69,7 @@
 }
 
 @test "normalize case" {
+    skip
     run ./word_count.sh "go Go GO Stop stop"
 
     [ "$status" -eq 0 ]
@@ -72,6 +79,7 @@
 }
 
 @test "handle apostrophes" {
+    skip
     run ./word_count.sh "First: don't laugh. Then: don't cry."
 
     [ "$status" -eq 0 ]
@@ -81,4 +89,4 @@
     echo $output | grep "then: 1"
     echo $output | grep "cry: 1"
     echo $output | wc -w | grep "10"
-}
+}

data/tracks/c/exercises/hello-world/src/hello_world.c

@@ -1,5 +1,3 @@
-#include <stdio.h>
-#include <stddef.h>
 #include "hello_world.h"
 
 const char *hello(void)

data/tracks/c/exercises/sieve/test/test_sieve.c

@@ -3,6 +3,7 @@
 #include "../src/sieve.h"
 
 static primes_array_t result_array;
+#define ARRAY_LENGTH(x)   sizeof(x)/sizeof(x[0])
 
 void setUp(void)
 {
@@ -15,7 +16,6 @@ void tearDown(void)
 void test_no_primes_under_two(void)
 {
    const unsigned int limit = 1;
-   const primes_array_t expected_prime_array = { 0 };
    const unsigned int expected_prime_count = 0;
    unsigned int result_prime_count;
 
@@ -23,9 +23,6 @@ void test_no_primes_under_two(void)
 
    result_prime_count = sieve(limit, result_array);
    TEST_ASSERT_EQUAL(expected_prime_count, result_prime_count);
-   TEST_ASSERT_EQUAL(0,
-                     memcmp(expected_prime_array, result_array,
-                            sizeof(result_array)));
 }
 
 void test_find_first_prime(void)
@@ -40,9 +37,9 @@ void test_find_first_prime(void)
 
    result_prime_count = sieve(limit, result_array);
    TEST_ASSERT_EQUAL(expected_prime_count, result_prime_count);
-   TEST_ASSERT_EQUAL(0,
-                     memcmp(expected_prime_array, result_array,
-                            sizeof(expected_prime_array)));
+   TEST_ASSERT_EQUAL_UINT_ARRAY(expected_prime_array, result_array,
+                                ARRAY_LENGTH(expected_prime_array));
+
 }
 
 void test_find_primes_up_to_10(void)
@@ -57,9 +54,9 @@ void test_find_primes_up_to_10(void)
 
    result_prime_count = sieve(limit, result_array);
    TEST_ASSERT_EQUAL(expected_prime_count, result_prime_count);
-   TEST_ASSERT_EQUAL(0,
-                     memcmp(expected_prime_array, result_array,
-                            sizeof(expected_prime_array)));
+   TEST_ASSERT_EQUAL_UINT_ARRAY(expected_prime_array, result_array,
+                                ARRAY_LENGTH(expected_prime_array));
+
 }
 
 void test_limit_is_prime(void)
@@ -74,9 +71,9 @@ void test_limit_is_prime(void)
 
    result_prime_count = sieve(limit, result_array);
    TEST_ASSERT_EQUAL(expected_prime_count, result_prime_count);
-   TEST_ASSERT_EQUAL(0,
-                     memcmp(expected_prime_array, result_array,
-                            sizeof(expected_prime_array)));
+   TEST_ASSERT_EQUAL_UINT_ARRAY(expected_prime_array, result_array,
+                                ARRAY_LENGTH(expected_prime_array));
+
 }
 
 void test_find_primes_up_to_1000(void)
@@ -105,9 +102,9 @@ void test_find_primes_up_to_1000(void)
 
    result_prime_count = sieve(limit, result_array);
    TEST_ASSERT_EQUAL(expected_prime_count, result_prime_count);
-   TEST_ASSERT_EQUAL(0,
-                     memcmp(expected_prime_array, result_array,
-                            sizeof(expected_prime_array)));
+   TEST_ASSERT_EQUAL_UINT_ARRAY(expected_prime_array, result_array,
+                                ARRAY_LENGTH(expected_prime_array));
+
 }
 
 int main(void)

data/tracks/erlang/config.json

@@ -103,7 +103,7 @@
       ]
     },
     {
-      "uuid": "97f3c252-09c1-b380-5f5f-45b6eebec416e2a0830",
+      "uuid": "94b997bb-8e8d-4519-ba97-199d0f35a80a",
       "slug": "isogram",
       "core": false,
       "unlocked_by": null,
@@ -113,7 +113,7 @@
       ]
     },
     {
-      "uuid": "ceb71cdc-098f-d580-179c-732dd8258f8a76cf2be",
+      "uuid": "9c092a14-475b-4b1b-ac4b-fb19467367ff",
       "slug": "pangram",
       "core": false,
       "unlocked_by": null,
@@ -213,7 +213,7 @@
       ]
     },
     {
-      "uuid": "1a8abaa2-04f5-0e80-7986-5fb33995971caeb1496",
+      "uuid": "ea369b85-b180-48ca-b602-c40811fc865f",
       "slug": "two-fer",
       "core": false,
       "unlocked_by": null,
@@ -313,7 +313,7 @@
       ]
     },
     {
-      "uuid": "28b7e4fa-0511-f480-5128-5531913fca21458a2d9",
+      "uuid": "9cfae4bf-cff8-49bc-aee9-a37d553cef81",
       "slug": "sieve",
       "core": false,
       "unlocked_by": null,

data/tracks/fsharp/config.json

@@ -696,6 +696,18 @@
       "unlocked_by": "beer-song",
       "uuid": "df6f311b-9deb-4d07-9a29-3d881556513e"
     },
+    {
+      "core": false,
+      "difficulty": 5,
+      "slug": "rotational-cipher",
+      "topics": [
+        "algorithms",
+        "strings",
+        "transforming"
+      ],
+      "unlocked_by": "beer-song",
+      "uuid": "26b00c8d-6282-48a8-b017-2ed3e6d48267"
+    },
     {
       "core": false,
       "difficulty": 5,

data/tracks/fsharp/exercises/Exercises.sln

@@ -216,6 +216,8 @@ Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "CollatzConjecture", "collat
 EndProject
 Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "ReverseString", "reverse-string\ReverseString.fsproj", "{A996AAE3-E54D-41F2-9B6A-99EACD6DAAB7}"
 EndProject
+Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "RotationalCipher", "rotational-cipher\RotationalCipher.fsproj", "{91D0A5E0-E39C-472B-87FB-6DD17336AA22}"
+EndProject
 Global
 	GlobalSection(SolutionConfigurationPlatforms) = preSolution
 		Debug|Any CPU = Debug|Any CPU
@@ -650,6 +652,10 @@ Global
 		{A996AAE3-E54D-41F2-9B6A-99EACD6DAAB7}.Debug|Any CPU.Build.0 = Debug|Any CPU
 		{A996AAE3-E54D-41F2-9B6A-99EACD6DAAB7}.Release|Any CPU.ActiveCfg = Release|Any CPU
 		{A996AAE3-E54D-41F2-9B6A-99EACD6DAAB7}.Release|Any CPU.Build.0 = Release|Any CPU
+		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Release|Any CPU.Build.0 = Release|Any CPU
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
 		HideSolutionNode = FALSE

data/tracks/fsharp/exercises/rotational-cipher/Example.fs

@@ -0,0 +1,29 @@
+module RotationalCipher
+
+open System
+
+let private alphabet = ['a' .. 'z']
+
+let private createKey shiftKey = 
+    alphabet @ alphabet 
+    |> List.skip shiftKey 
+    |> List.take (List.length alphabet)
+
+let private rotateLetter key c =
+    let index = List.findIndex (fun x -> x = Char.ToLower(c)) alphabet
+    let rotatedLetter = List.item index key
+
+    match Char.IsUpper(c) with
+    | false -> rotatedLetter
+    | true  -> Char.ToUpper(rotatedLetter)
+
+let private rotateChar shiftKey =
+    let key = createKey shiftKey
+    let rotate = rotateLetter key
+
+    fun (c: char) -> 
+        match Char.IsLetter(c) with
+        | false -> c
+        | true  -> rotate c
+
+let rotate shiftKey input = String.map (rotateChar shiftKey) input

data/tracks/fsharp/exercises/rotational-cipher/Program.fs

@@ -0,0 +1 @@
+module Program = let [<EntryPoint>] main _ = 0

data/tracks/fsharp/exercises/rotational-cipher/README.md

@@ -0,0 +1,29 @@
+Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
+
+The Caesar cipher is a simple shift cipher that relies on
+transposing all the letters in the alphabet using an integer key
+between `0` and `26`. Using a key of `0` or `26` will always yield
+the same output due to modular arithmetic. The letter is shifted
+for as many values as the value of the key.
+
+The general notation for rotational ciphers is `ROT + <key>`.
+The most commonly used rotational cipher is `ROT13`.
+
+A `ROT13` on the Latin alphabet would be as follows:
+
+```text
+Plain:  abcdefghijklmnopqrstuvwxyz
+Cipher: nopqrstuvwxyzabcdefghijklm
+```
+
+It is stronger than the Atbash cipher because it has 27 possible keys, and 25 usable keys.
+
+Ciphertext is written out in the same formatting as the input including spaces and punctuation.
+
+## Examples
+
+- ROT5  `omg` gives `trl`
+- ROT0  `c` gives `c`
+- ROT26 `Cool` gives `Cool`
+- ROT13 `The quick brown fox jumps over the lazy dog.` gives `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.`
+- ROT13 `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.` gives `The quick brown fox jumps over the lazy dog.`

data/tracks/fsharp/exercises/rotational-cipher/RotationalCipher.fs

@@ -0,0 +1,3 @@
+module RotationalCipher
+
+let rotate shiftKey text = failwith "You need to implement this function."

data/tracks/fsharp/exercises/rotational-cipher/RotationalCipher.fsproj

@@ -0,0 +1,23 @@
+<Project Sdk="Microsoft.NET.Sdk">
+
+  <PropertyGroup>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
+
+    <IsPackable>false</IsPackable>
+  </PropertyGroup>
+
+  <ItemGroup>
+    <Compile Include="RotationalCipher.fs" />
+    <Compile Include="RotationalCipherTest.fs" />
+    <Compile Include="Program.fs" />
+  </ItemGroup>
+
+  <ItemGroup>
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.5.0" />
+    <PackageReference Include="xunit" Version="2.3.1" />
+    <PackageReference Include="xunit.runner.visualstudio" Version="2.3.1" />
+    <PackageReference Include="FsUnit.xUnit" Version="3.0.0" />
+    <DotNetCliToolReference Include="dotnet-xunit" Version="2.3.1" />
+  </ItemGroup>
+
+</Project>

data/tracks/fsharp/exercises/rotational-cipher/RotationalCipherTest.fs

@@ -0,0 +1,49 @@
+// This file was auto-generated based on version 1.1.0 of the canonical data.
+
+module RotationalCipherTest
+
+open FsUnit.Xunit
+open Xunit
+
+open RotationalCipher
+
+[<Fact>]
+let ``Rotate a by 0, same output as input`` () =
+    rotate 0 "a" |> should equal "a"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate a by 1`` () =
+    rotate 1 "a" |> should equal "b"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate a by 26, same output as input`` () =
+    rotate 26 "a" |> should equal "a"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate m by 13`` () =
+    rotate 13 "m" |> should equal "z"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate n by 13 with wrap around alphabet`` () =
+    rotate 13 "n" |> should equal "a"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate capital letters`` () =
+    rotate 5 "OMG" |> should equal "TRL"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate spaces`` () =
+    rotate 5 "O M G" |> should equal "T R L"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate numbers`` () =
+    rotate 4 "Testing 1 2 3 testing" |> should equal "Xiwxmrk 1 2 3 xiwxmrk"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate punctuation`` () =
+    rotate 21 "Let's eat, Grandma!" |> should equal "Gzo'n zvo, Bmviyhv!"
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rotate all letters`` () =
+    rotate 13 "The quick brown fox jumps over the lazy dog." |> should equal "Gur dhvpx oebja sbk whzcf bire gur ynml qbt."
+