trackler 2.2.1.98 → 2.2.1.99

data/tracks/fsharp/exercises/sgf-parsing/SgfParsingTest.fs

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

data/tracks/fsharp/exercises/sieve/SieveTest.fs

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

data/tracks/fsharp/exercises/simple-cipher/SimpleCipherTest.fs

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

data/tracks/fsharp/exercises/simple-linked-list/SimpleLinkedListTest.fs

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

data/tracks/fsharp/exercises/space-age/SpaceAgeTest.fs

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

data/tracks/fsharp/exercises/strain/StrainTest.fs

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

data/tracks/fsharp/exercises/sublist/SublistTest.fs

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

data/tracks/fsharp/exercises/sum-of-multiples/SumOfMultiplesTest.fs

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

data/tracks/fsharp/exercises/tournament/TournamentTest.fs

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

data/tracks/fsharp/exercises/transpose/TransposeTest.fs

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

data/tracks/fsharp/exercises/transpose/TrinaryTest.fs

@@ -1,4 +1,6 @@
-module TrinaryTest
+// This file was created manually and its version is 1.0.0.
+
+module TrinaryTest
 
 open NUnit.Framework
 open Trinary

data/tracks/fsharp/exercises/tree-building/TreeBuildingTest.fs

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

data/tracks/fsharp/exercises/triangle/TriangleTest.fs

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

data/tracks/fsharp/exercises/trinary/TrinaryTest.fs

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

data/tracks/fsharp/exercises/two-bucket/TwoBucketTest.fs

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

data/tracks/fsharp/exercises/variable-length-quantity/VariableLengthQuantityTest.fs

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

data/tracks/fsharp/exercises/word-count/WordCountTest.fs

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

data/tracks/fsharp/exercises/word-search/WordSearchTest.fs

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

data/tracks/fsharp/exercises/wordy/WordyTest.fs

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

data/tracks/fsharp/exercises/zebra-puzzle/ZebraPuzzleTest.fs

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

data/tracks/fsharp/exercises/zipper/ZipperTest.fs

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

data/tracks/fsharp/generators/CanonicalData.fs

@@ -99,7 +99,7 @@ type CanonicalDataConverter() =
         let properties = jTokenToMap jToken
 
         { Input = createInputFromJToken properties
-          Expected = properties.["expected"]
+          Expected = if properties.ContainsKey "expected" then properties.["expected"] else ("" :> obj)
           Property = string properties.["property"]
           Properties = properties
           Description = string properties.["description"]

data/tracks/fsharp/generators/Generators.fs

@@ -176,6 +176,56 @@ type Change() =
             | _  -> None
         | _ -> None
 
+type CircularBuffer() = 
+    inherit GeneratorExercise()
+
+    override __.AdditionalNamespaces = [ "System" ]
+
+    override __.RenderAssert _ = ""
+
+    member __.ExceptionCheck command = 
+        sprintf "(fun () -> %s |> ignore) |> should throw typeof<Exception>" command 
+
+    override this.RenderArrange canonicalDataCase = 
+        seq {
+            yield sprintf "let buffer1 = mkCircularBuffer %i" (canonicalDataCase.Properties.["capacity"] :?> int64)
+            let operations = (canonicalDataCase.Properties.["operations"] :?> JArray)
+            let mutable ind = 2
+            let lastInd = operations.Count + 1 
+            for op in operations do
+                let dict = (op :?> JObject).ToObject<Collections.Generic.Dictionary<string, JToken>>();
+                let funcName = dict.["operation"].ToObject<string>()
+                match funcName with
+                | "write" as operation -> 
+                    let item = dict.["item"].ToObject<int>()
+                    let command = sprintf "%s %i buffer%i" operation item (ind - 1)
+                    match dict.ContainsKey "should_succeed", (dict.["should_succeed"].ToObject<bool>()) with
+                    | true, false ->
+                        yield this.ExceptionCheck command
+                    | _, _ ->
+                        yield sprintf "let buffer%i = %s" ind command
+                | "read" as operation -> 
+                    let command = sprintf "%s buffer%i" operation (ind - 1)
+                    match dict.ContainsKey "should_succeed", dict.["should_succeed"].ToObject<bool>() with
+                    | true, false ->
+                        yield this.ExceptionCheck command
+                    | _, _ -> 
+                        let expected = dict.["expected"].ToObject<int64>()
+                        if ind = lastInd then
+                            yield sprintf "let (val%i, _) = %s" ind command
+                        else
+                            yield sprintf "let (val%i, buffer%i) = %s" ind ind command
+                        yield sprintf "val%i |> should equal %i" ind expected
+                | "overwrite" ->
+                    yield sprintf "let buffer%i = forceWrite %i buffer%i" ind (dict.["item"].ToObject<int>()) (ind-1)
+                | "clear" -> 
+                    yield sprintf "let buffer%i = clear buffer%i" ind (ind - 1) 
+                | _ -> ()
+                ind <- ind + 1
+
+        }
+        |> Seq.toList
+
 type Clock() =
     inherit GeneratorExercise()
 
@@ -216,6 +266,45 @@ type Clock() =
         | _ -> 
             base.RenderSut canonicalDataCase
 
+type ComplexNumbers() =
+    inherit GeneratorExercise()
+
+    let renderNumber (input: JToken) =
+        match string input with
+        | "e"  -> "Math.E"
+        | "pi" -> "Math.PI"
+        | int when int.IndexOf('.') = -1  -> sprintf "%s.0" int
+        | float -> float
+    
+    let renderComplexNumber (input: JArray) =
+        sprintf "(create %s %s)" (renderNumber input.[0]) (renderNumber input.[1])
+
+    override __.RenderValue (canonicalDataCase, key, value) = 
+        match value with
+        | :? JArray as jArray -> renderComplexNumber jArray
+        | :? int64 as i -> sprintf "%d.0" i
+        | _ -> base.RenderValue (canonicalDataCase, key, value)
+
+    override __.RenderAssert canonicalDataCase = 
+        match canonicalDataCase.Expected with
+        | :? JArray as jArray ->
+            let renderAssertion testedFunction expected =
+                { Sut = sprintf "%s sut" testedFunction; Expected = expected }
+                |> renderInlineTemplate "{{ Sut }} |> should (equalWithin 0.000000001) {{ Expected }}"
+
+            [ renderAssertion "real" (renderNumber jArray.[0]) 
+              renderAssertion "imaginary" (renderNumber jArray.[1]) |> indent 1 ]
+            |> String.concat "\n"
+        | _ ->
+            base.RenderAssert(canonicalDataCase)
+
+    override __.PropertiesWithIdentifier canonicalDataCase = 
+        match canonicalDataCase.Expected with
+        | :? JArray -> ["sut"]
+        | _ -> base.PropertiesWithIdentifier canonicalDataCase
+
+    override __.AdditionalNamespaces = [typeof<Math>.Namespace]
+
 type Connect() =
     inherit GeneratorExercise()
 

data/tracks/go/config.json

@@ -587,6 +587,22 @@
       "unlocked_by": "grains",
       "uuid": "cbfd4cfb-abe7-45f9-80e4-3de3b2639fc8"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "rail-fence-cipher",
+      "topics": [
+        "algorithms",
+        "cryptography",
+        "loops",
+        "sorting",
+        "strings",
+        "text_formatting",
+        "transforming"
+      ],
+      "unlocked_by": "ledger",
+      "uuid": "bafd87ad-1dc5-4bbe-b853-ed330c3f155a"
+    },
     {
       "core": false,
       "difficulty": 2,

data/tracks/go/exercises/rail-fence-cipher/.meta/gen.go

@@ -0,0 +1,82 @@
+package main
+
+import (
+	"encoding/json"
+	"log"
+	"text/template"
+
+	"../../../gen"
+)
+
+func main() {
+	t, err := template.New("").Parse(tmpl)
+	if err != nil {
+		log.Fatal(err)
+	}
+	var j js
+	if err := gen.Gen("rail-fence-cipher", &j, t); err != nil {
+		log.Fatal(err)
+	}
+}
+
+// The JSON structure we expect to be able to unmarshal into
+type js struct {
+	Groups []testGroup `json:"cases"`
+}
+
+type testGroup struct {
+	Description string
+	Cases       []json.RawMessage `property:"RAW"`
+	EncodeCases []oneCase         `property:"encode"`
+	DecodeCases []oneCase         `property:"decode"`
+}
+
+// Test cases
+type oneCase struct {
+	Description string
+	Property    string
+	Message     string `json:"msg"`
+	Rails       int
+	Expected    string
+}
+
+// Template to generate test cases.
+var tmpl = `package railfence
+
+{{.Header}}
+
+type testCase struct {
+	description string
+	message     string
+	rails       int
+	expected    string
+}
+
+{{range .J.Groups}}
+	// {{ .Description }}
+	{{- if .EncodeCases }}
+		var encodeTests = []testCase{
+			{{- range .EncodeCases }}
+
+				{ {{.Description | printf "%q"}},
+				{{.Message | printf "%q"}},
+				{{.Rails}},
+				{{.Expected | printf "%q"}}},
+			{{- end }}
+		}
+	{{- end }}
+
+	{{- if .DecodeCases }}
+		var decodeTests = []testCase{
+			{{- range .DecodeCases }}
+
+				{ {{.Description | printf "%q"}},
+				{{.Message | printf "%q"}},
+				{{.Rails}},
+				{{.Expected | printf "%q"}}},
+			{{- end }}
+		}
+	{{- end }}
+
+{{end}}
+`

data/tracks/go/exercises/rail-fence-cipher/README.md

@@ -0,0 +1,83 @@
+# Rail Fence Cipher
+
+Implement encoding and decoding for the rail fence cipher.
+
+The Rail Fence cipher is a form of transposition cipher that gets its name from
+the way in which it's encoded. It was already used by the ancient Greeks.
+
+In the Rail Fence cipher, the message is written downwards on successive "rails"
+of an imaginary fence, then moving up when we get to the bottom (like a zig-zag).
+Finally the message is then read off in rows.
+
+For example, using three "rails" and the message "WE ARE DISCOVERED FLEE AT ONCE",
+the cipherer writes out:
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. E . R . D . S . O . E . E . F . E . A . O . C .
+. . A . . . I . . . V . . . D . . . E . . . N . .
+```
+
+Then reads off:
+
+```text
+WECRLTEERDSOEEFEAOCAIVDEN
+```
+
+To decrypt a message you take the zig-zag shape and fill the ciphertext along the rows.
+
+```text
+? . . . ? . . . ? . . . ? . . . ? . . . ? . . . ?
+. ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? .
+. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
+```
+
+The first row has seven spots that can be filled with "WECRLTE".
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? . ? .
+. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
+```
+
+Now the 2nd row takes "ERDSOEEFEAOC".
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. E . R . D . S . O . E . E . F . E . A . O . C .
+. . ? . . . ? . . . ? . . . ? . . . ? . . . ? . .
+```
+
+Leaving "AIVDEN" for the last row.
+
+```text
+W . . . E . . . C . . . R . . . L . . . T . . . E
+. E . R . D . S . O . E . E . F . E . A . O . C .
+. . A . . . I . . . V . . . D . . . E . . . N . .
+```
+
+If you now read along the zig-zag shape you can read the original message.
+
+## Running the tests
+
+To run the tests run the command `go test` from within the exercise directory.
+
+If the test suite contains benchmarks, you can run these with the `-bench`
+flag:
+
+    go test -bench .
+
+Keep in mind that each reviewer will run benchmarks on a different machine, with
+different specs, so the results from these benchmark tests may vary.
+
+## Further information
+
+For more detailed information about the Go track, including how to get help if
+you're having trouble, please visit the exercism.io [Go language page](http://exercism.io/languages/go/about).
+
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Transposition_cipher#Rail_Fence_cipher](https://en.wikipedia.org/wiki/Transposition_cipher#Rail_Fence_cipher)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.