trackler 2.2.1.98 → 2.2.1.99

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 61557d8c8f53297686afbfb79d34fd4bb855673b
-  data.tar.gz: 0e787d40634a430d4019195d58f4fdff356f82ae
+  metadata.gz: 8a4f6ff506d46fc8e5cd2158613f444181e5a9f4
+  data.tar.gz: 8248291e3689c6087c3e8d6c82de286eb754c6d3
 SHA512:
-  metadata.gz: bfd3d1d4c263d6dc3bc615d67eb273808855a2c2bfee91201963dcc168350f1b30c8fe8efe04a145d20900976a824d52a6e6540f686c42c1a81cdbf5c3108a54
-  data.tar.gz: a203c0f9128acfb983935569b854b134213a3da2aa254fc3a6e94565c2b3b22df296fc3027783cce311c64c22eb9415cb926c8c1e402db33f6cdcef96c52263f
+  metadata.gz: 19d9955f95e594ff280c3ceaf97cbb0a7583860bc892e01380953f95cd4861150bb8c00a9c0a222e18f3f31601f296f4e7bfa659c05e59a9a3943e5ac16a3033
+  data.tar.gz: 6804eab9031cad8febe3ab5fe3e49d03eb4eb95eaf50ad0401791d79b4c23bcf3dab914ef6023dac7ea5b364c22b0bfea717c6887404bc3d02c62a7b9eeaa1a2

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.98"
+  VERSION = "2.2.1.99"
 end

data/problem-specifications/exercises/complex-numbers/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "complex-numbers",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "comments": [
     " The canonical data assumes mathematically correct real   ",
     " numbers. The testsuites should consider rounding errors  ",
@@ -12,6 +12,52 @@
     " represented as \"e\".                                    "
   ],
   "cases": [
+    {
+      "description": "Real part",
+      "cases": [
+        {
+          "description": "Real part of a purely real number",
+          "property": "real",
+          "input": [1, 0],
+          "expected": 1
+        },
+        {
+          "description": "Real part of a purely imaginary number",
+          "property": "real",
+          "input": [0, 1],
+          "expected": 0
+        },
+        {
+          "description": "Real part of a number with real and imaginary part",
+          "property": "real",
+          "input": [1, 2],
+          "expected": 1
+        }
+      ]
+    },
+    {
+      "description": "Imaginary part",
+      "cases": [
+        {
+          "description": "Imaginary part of a purely real number",
+          "property": "imaginary",
+          "input": [1, 0],
+          "expected": 0
+        },
+        {
+          "description": "Imaginary part of a purely imaginary number",
+          "property": "imaginary",
+          "input": [0, 1],
+          "expected": 1
+        },
+        {
+          "description": "Imaginary part of a number with real and imaginary part",
+          "property": "imaginary",
+          "input": [1, 2],
+          "expected": 2
+        }
+      ]
+    },
     {
       "description": "Imaginary unit",
       "property": "mul",
@@ -186,52 +232,6 @@
         }
       ]
     },
-    {
-      "description": "Real part",
-      "cases": [
-        {
-          "description": "Real part of a purely real number",
-          "property": "real",
-          "input": [1, 0],
-          "expected": 1
-        },
-        {
-          "description": "Real part of a purely imaginary number",
-          "property": "real",
-          "input": [0, 1],
-          "expected": 0
-        },
-        {
-          "description": "Real part of a number with real and imaginary part",
-          "property": "real",
-          "input": [1, 2],
-          "expected": 1
-        }
-      ]
-    },
-    {
-      "description": "Imaginary part",
-      "cases": [
-        {
-          "description": "Imaginary part of a purely real number",
-          "property": "imaginary",
-          "input": [1, 0],
-          "expected": 0
-        },
-        {
-          "description": "Imaginary part of a purely imaginary number",
-          "property": "imaginary",
-          "input": [0, 1],
-          "expected": 1
-        },
-        {
-          "description": "Imaginary part of a number with real and imaginary part",
-          "property": "imaginary",
-          "input": [1, 2],
-          "expected": 2
-        }
-      ]
-    },
     {
       "description": "Complex exponential function",
       "comments": [

data/problem-specifications/exercises/custom-set/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "custom-set",
-  "version": "1.2.0",
+  "version": "1.3.0",
   "comments": [
     "These tests cover the core components of a set data structure: checking",
     "presence, adding, comparing and basic set operations. Other features",
@@ -239,22 +239,28 @@
         {
           "description": "add to empty set",
           "property": "add",
-          "set": [],
-          "element": 3,
+          "input": {
+            "set": [],
+            "element": 3
+          },
           "expected": [3]
         },
         {
           "description": "add to non-empty set",
           "property": "add",
-          "set": [1, 2, 4],
-          "element": 3,
+          "input": {
+            "set": [1, 2, 4],
+            "element": 3
+          },
           "expected": [1, 2, 3, 4]
         },
         {
           "description": "adding an existing element does not change the set",
           "property": "add",
-          "set": [1, 2, 3],
-          "element": 3,
+          "input": {
+            "set": [1, 2, 3],
+            "element": 3
+          },
           "expected": [1, 2, 3]
         }
       ]

data/tracks/delphi/exercises/phone-number/uPhoneNumberTests.pas

@@ -206,7 +206,7 @@ procedure PhoneNumberTests.Formats_a_number;
 var phone: IPhoneNumber;
 begin
   phone := NewPhoneNumber('2234567890');
-  assert.AreEqual('(223) 456-7890', phone.ToString);
+  assert.AreEqual('(223) 456-7890', phone.Formatted);
 end;
 
 initialization

data/tracks/elixir/exercises/protein-translation/protein_translation_test.exs

@@ -80,6 +80,11 @@ defmodule ProteinTranslationTest do
     assert ProteinTranslation.of_rna("CARROT") == { :error, "invalid RNA" }
   end
 
+  @tag :pending
+  test "invalid codon at end of RNA" do
+    assert ProteinTranslation.of_rna("UUUROT") == { :error, "invalid RNA" }
+  end
+
   @tag :pending
   test "invalid codon" do
     assert ProteinTranslation.of_codon("INVALID") == { :error, "invalid codon" }

data/tracks/fsharp/config.json

@@ -954,6 +954,16 @@
       "unlocked_by": "queen-attack",
       "uuid": "471c89f9-8b27-4898-8e98-58e4b2921616"
     },
+    {
+      "core": false,
+      "difficulty": 6,
+      "slug": "complex-numbers",
+      "topics": [
+        "mathematics"
+      ],
+      "unlocked_by": "leap",
+      "uuid": "d993508d-b4d2-4f3f-a46d-35b753bf90a9"
+    },
     {
       "core": false,
       "difficulty": 6,

data/tracks/fsharp/exercises/Exercises.sln

@@ -224,6 +224,8 @@ Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "SpiralMatrix", "spiral-matr
 EndProject
 Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "ArmstrongNumbers", "armstrong-numbers\ArmstrongNumbers.fsproj", "{48345F81-5B0F-4C2C-9403-84CBF918714C}"
 EndProject
+Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "ComplexNumbers", "complex-numbers\ComplexNumbers.fsproj", "{79DD3BB0-7693-4DE3-98AD-E28A7DD91758}"
+EndProject
 Global
 	GlobalSection(SolutionConfigurationPlatforms) = preSolution
 		Debug|Any CPU = Debug|Any CPU
@@ -674,6 +676,10 @@ Global
 		{48345F81-5B0F-4C2C-9403-84CBF918714C}.Debug|Any CPU.Build.0 = Debug|Any CPU
 		{48345F81-5B0F-4C2C-9403-84CBF918714C}.Release|Any CPU.ActiveCfg = Release|Any CPU
 		{48345F81-5B0F-4C2C-9403-84CBF918714C}.Release|Any CPU.Build.0 = Release|Any CPU
+		{79DD3BB0-7693-4DE3-98AD-E28A7DD91758}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{79DD3BB0-7693-4DE3-98AD-E28A7DD91758}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{79DD3BB0-7693-4DE3-98AD-E28A7DD91758}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{79DD3BB0-7693-4DE3-98AD-E28A7DD91758}.Release|Any CPU.Build.0 = Release|Any CPU
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
 		HideSolutionNode = FALSE

data/tracks/fsharp/exercises/accumulate/AccumulateTest.fs

@@ -1,3 +1,5 @@
+// This file was created manually and its version is 1.0.0
+
 module AccumulateTest
 
 open System

data/tracks/fsharp/exercises/bank-account/BankAccountTest.fs

@@ -1,3 +1,5 @@
+// This file was created manually and its version is 1.0.0.
+
 module BankAccountTest
 
 open Xunit

data/tracks/fsharp/exercises/binary-search-tree/BinarySearchTreeTest.fs

@@ -1,3 +1,5 @@
+// This file was created manually and its version is 1.0.0.
+
 module BinarySearchTreeTest
 
 open Xunit

data/tracks/fsharp/exercises/binary/BinaryTest.fs

@@ -1,3 +1,5 @@
+// This file was created manually and its version is 1.0.0.
+
 module BinaryTest
 
 open FsUnit.Xunit

data/tracks/fsharp/exercises/circular-buffer/CircularBufferTest.fs

@@ -1,140 +1,144 @@
+// This file was auto-generated based on version 1.0.1 of the canonical data.
+
 module CircularBufferTest
 
-open Xunit
 open FsUnit.Xunit
+open Xunit
 open System
 
 open CircularBuffer
 
 [<Fact>]
-let ``Write and read back one item`` () =
-    let buffer1 = mkCircularBuffer 1 |> write '1'    
-    let (val2, buffer2) = read buffer1
-
-    val2 |> should equal '1'    
-    (fun () -> read buffer2 |> ignore) |> should throw typeof<Exception>
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Write and read back multiple items`` () =    
-    let buffer1 = 
-        mkCircularBuffer 2
-        |> write '1'
-        |> write '2'
-
-    let (val2, buffer2) = read buffer1
-    let (val3, buffer3) = read buffer2
+let ``Reading empty buffer should fail`` () =
+    let buffer1 = mkCircularBuffer 1
+    (fun () -> read buffer1 |> ignore) |> should throw typeof<Exception>
+    
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can read an item just written`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = write 1 buffer1
+    let (val3, _) = read buffer2
+    val3 |> should equal 1
+    
 
-    val2 |> should equal '1'
-    val3 |> should equal '2'
+[<Fact(Skip = "Remove to run test")>]
+let ``Each item may only be read once`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = write 1 buffer1
+    let (val3, buffer3) = read buffer2
+    val3 |> should equal 1
     (fun () -> read buffer3 |> ignore) |> should throw typeof<Exception>
     
-[<Fact(Skip = "Remove to run test")>] 
-let ``Clearing buffer`` () =    
-    let buffer1 = mkCircularBuffer 3
-    let buffer2 = List.fold (fun buffer value -> write value buffer) buffer1 ['1'..'3']
-    let buffer3 = clear buffer2
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Items are read in the order they are written`` () =
+    let buffer1 = mkCircularBuffer 2
+    let buffer2 = write 1 buffer1
+    let buffer3 = write 2 buffer2
+    let (val4, buffer4) = read buffer3
+    val4 |> should equal 1
+    let (val5, _) = read buffer4
+    val5 |> should equal 2
     
-    let buffer4 = 
-        buffer3 
-        |> write '1' 
-        |> write '2'
 
-    let (val5, buffer5) = read buffer4
-    let buffer6 = buffer5 |> write '3'
-    let (val7, _) = read buffer6
+[<Fact(Skip = "Remove to run test")>]
+let ``Full buffer can't be written to`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = write 1 buffer1
+    (fun () -> write 2 buffer2 |> ignore) |> should throw typeof<Exception>
+    
 
-    (fun () -> read buffer3 |> ignore) |> should throw typeof<Exception>
-    val5 |> should equal '1'
-    val7 |> should equal '2'
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Alternate write and read`` () =    
-    let buffer1 = mkCircularBuffer 2
-    let buffer2 = buffer1 |> write '1'
+[<Fact(Skip = "Remove to run test")>]
+let ``A read frees up capacity for another write`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = write 1 buffer1
     let (val3, buffer3) = read buffer2
-    let buffer4 = buffer3 |> write '2'
+    val3 |> should equal 1
+    let buffer4 = write 2 buffer3
     let (val5, _) = read buffer4
+    val5 |> should equal 2
     
-    val3 |> should equal '1'
-    val5 |> should equal '2'
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Reads back oldest item`` () =    
-    let buffer1 = 
-        mkCircularBuffer 3
-        |> write '1'
-        |> write '2'
-
-    let (_, buffer2) = read buffer1
-    let buffer3 = buffer2 |> write '3'
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Read position is maintained even across multiple writes`` () =
+    let buffer1 = mkCircularBuffer 3
+    let buffer2 = write 1 buffer1
+    let buffer3 = write 2 buffer2
     let (val4, buffer4) = read buffer3
-    let (val5, _) = read buffer4
-    val4 |> should equal '2'
-    val5 |> should equal '3'
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Writing to a full buffer throws an exception`` () =    
-    let buffer = 
-        mkCircularBuffer 2
-        |> write '1'
-        |> write '2'
-
-    (fun () -> buffer |> write 'A' |> ignore) |> should throw typeof<Exception>
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Overwriting oldest item in a full buffer`` () =    
-    let buffer1 = 
-        mkCircularBuffer 2
-        |> write '1'
-        |> write '2'
-        |> forceWrite 'A'
-
-    let (val2, buffer2) = read buffer1
-    let (val3, buffer3) = read buffer2
+    val4 |> should equal 1
+    let buffer5 = write 3 buffer4
+    let (val6, buffer6) = read buffer5
+    val6 |> should equal 2
+    let (val7, _) = read buffer6
+    val7 |> should equal 3
+    
 
-    val2 |> should equal '2'
-    val3 |> should equal 'A'
+[<Fact(Skip = "Remove to run test")>]
+let ``Items cleared out of buffer can't be read`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = write 1 buffer1
+    let buffer3 = clear buffer2
     (fun () -> read buffer3 |> ignore) |> should throw typeof<Exception>
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Forced writes to non full buffer should behave like writes`` () =    
-    let buffer1 = 
-        mkCircularBuffer 2
-        |> write '1'
-        |> forceWrite '2'
-
-    let (val2, buffer2) = read buffer1
-    let (val3, buffer3) = read buffer2
+    
 
-    val2 |> should equal '1'
-    val3 |> should equal '2'
-    (fun () -> read buffer3 |> ignore) |> should throw typeof<Exception>
-  
-[<Fact(Skip = "Remove to run test")>] 
-let ``Alternate read and write into buffer overflow`` () =    
-    let buffer1 = mkCircularBuffer 5
-    let buffer2 = List.fold (fun buffer value -> write value buffer) buffer1 ['1'..'3']
-
-    let (_, buffer3) = read buffer2
-    let (_, buffer4) = read buffer3    
-    let buffer5 = buffer4 |> write '4'
-    let (_, buffer6) = read buffer5
-
-    let buffer7 = 
-        List.fold (fun buffer value -> write value buffer) buffer6 ['5'..'8']
-        |> forceWrite 'A'
-        |> forceWrite 'B'
-
-    let folder buffer value =
-        let (val', buffer') = read buffer    
-        val' |> should equal value |> ignore
-        buffer'
-
-    let buffer8 = List.fold folder buffer7 ['6'..'8']      
+[<Fact(Skip = "Remove to run test")>]
+let ``Clear frees up capacity for another write`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = write 1 buffer1
+    let buffer3 = clear buffer2
+    let buffer4 = write 2 buffer3
+    let (val5, _) = read buffer4
+    val5 |> should equal 2
     
-    let (val9, buffer9) = read buffer8  
-    let (val10, buffer10) = read buffer9
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Clear does nothing on empty buffer`` () =
+    let buffer1 = mkCircularBuffer 1
+    let buffer2 = clear buffer1
+    let buffer3 = write 1 buffer2
+    let (val4, _) = read buffer3
+    val4 |> should equal 1
     
-    val9 |> should equal 'A'
-    val10 |> should equal 'B'
-    (fun () -> read buffer10 |> ignore) |> should throw typeof<Exception>
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Overwrite acts like write on non-full buffer`` () =
+    let buffer1 = mkCircularBuffer 2
+    let buffer2 = write 1 buffer1
+    let buffer3 = forceWrite 2 buffer2
+    let (val4, buffer4) = read buffer3
+    val4 |> should equal 1
+    let (val5, _) = read buffer4
+    val5 |> should equal 2
+    
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Overwrite replaces the oldest item on full buffer`` () =
+    let buffer1 = mkCircularBuffer 2
+    let buffer2 = write 1 buffer1
+    let buffer3 = write 2 buffer2
+    let buffer4 = forceWrite 3 buffer3
+    let (val5, buffer5) = read buffer4
+    val5 |> should equal 2
+    let (val6, _) = read buffer5
+    val6 |> should equal 3
+    
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Overwrite replaces the oldest item remaining in buffer following a read`` () =
+    let buffer1 = mkCircularBuffer 3
+    let buffer2 = write 1 buffer1
+    let buffer3 = write 2 buffer2
+    let buffer4 = write 3 buffer3
+    let (val5, buffer5) = read buffer4
+    val5 |> should equal 1
+    let buffer6 = write 4 buffer5
+    let buffer7 = forceWrite 5 buffer6
+    let (val8, buffer8) = read buffer7
+    val8 |> should equal 3
+    let (val9, buffer9) = read buffer8
+    val9 |> should equal 4
+    let (val10, _) = read buffer9
+    val10 |> should equal 5
+    
+