trackler 2.2.1.66 → 2.2.1.67

data/tracks/r/exercises/hello-world/test_hello-world.R

@@ -5,12 +5,4 @@ test_that("no name", {
   expect_equal(hello_world(), "Hello, World!")
 })
 
-test_that("sample name", {
-  expect_equal(hello_world("Alice"), "Hello, Alice!")
-})
-
-test_that("other sample name", {
-  expect_equal(hello_world("Bob"), "Hello, Bob!")
-})
-
 message("All tests passed for exercise: hello-world")

data/tracks/racket/config.json

@@ -104,7 +104,7 @@
         "strings"
       ],
       "unlocked_by": null,
-      "uuid": "d330a93f-063f-0d80-f35b-02cc2f9da754e0be296"
+      "uuid": "72ac5f36-ec1b-465e-b359-1cc49efc262d"
     },
     {
       "core": false,

data/tracks/swift/config.json

@@ -346,7 +346,17 @@
         "mathematics"
       ],
       "unlocked_by": null,
-      "uuid": "899bd49a-0970-9a80-5e6b-2adf5bfd0bf79f480ba"
+      "uuid": "1b068d66-c8de-42a8-a566-03848c9c7941"
+    },
+    {
+      "core": false,
+      "difficulty": 3,
+      "slug": "diamond",
+      "topics": [
+        "strings"
+      ],
+      "unlocked_by": null,
+      "uuid": "6d70fd81-76a4-4e44-a64a-9a070e07e83d"
     },
     {
       "core": false,
@@ -831,4 +841,4 @@
   ],
   "foregone": [],
   "language": "Swift"
-}
+}

data/tracks/swift/exercises/diamond/Package.swift

@@ -0,0 +1,5 @@
+import PackageDescription
+
+let package = Package(
+    name: "Diamond"
+)

data/tracks/swift/exercises/diamond/README.md

@@ -0,0 +1,64 @@
+The diamond kata takes as its input a letter, and outputs it in a diamond
+shape. Given a letter, it prints a diamond starting with 'A', with the
+supplied letter at the widest point.
+
+## Requirements
+
+* The first row contains one 'A'.
+* The last row contains one 'A'.
+* All rows, except the first and last, have exactly two identical letters.
+* All rows have as many trailing spaces as leading spaces. (This might be 0).
+* The diamond is horizontally symmetric.
+* The diamond is vertically symmetric.
+* The diamond has a square shape (width equals height).
+* The letters form a diamond shape.
+* The top half has the letters in ascending order.
+* The bottom half has the letters in descending order.
+* The four corners (containing the spaces) are triangles.
+
+## Examples
+
+In the following examples, spaces are indicated by `·` characters.
+
+Diamond for letter 'A':
+
+```text
+A
+```
+
+Diamond for letter 'C':
+
+```text
+··A··
+·B·B·
+C···C
+·B·B·
+··A··
+```
+
+Diamond for letter 'E':
+
+```text
+····A····
+···B·B···
+··C···C··
+·D·····D·
+E·······E
+·D·····D·
+··C···C··
+···B·B···
+····A····
+```
+
+## Setup
+
+Go through the project setup instructions for Xcode using Swift:
+
+http://exercism.io/languages/swift
+
+## Source
+
+Seb Rose [http://claysnow.co.uk/recycling-tests-in-tdd/](http://claysnow.co.uk/recycling-tests-in-tdd/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/swift/exercises/diamond/Sources/Diamond.swift

@@ -0,0 +1 @@
+//Solution goes in Sources

data/tracks/swift/exercises/diamond/Sources/DiamondExample.swift

@@ -0,0 +1,30 @@
+struct Diamond {
+    static let alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".characters.map { $0 }
+
+    static func makeDiamond(letter: Character) -> [String] {
+        guard let index = alphabet.index(of: letter) else {
+            return []
+        }
+
+        let numberOfLines = index * 2 + 1
+        let middle = numberOfLines / 2
+        var result = [String]()
+
+        for lineNumber in 0..<numberOfLines {
+            var line = ""
+
+            for column in 0..<numberOfLines {
+                let distanceFromMiddle = middle - abs(middle - lineNumber)
+
+                if abs(middle - column) == distanceFromMiddle {
+                    line.append(alphabet[distanceFromMiddle])
+                } else {
+                    line.append(" ")
+                }
+            }
+            result.append(line)
+        }
+
+        return result
+    }
+}

data/tracks/swift/exercises/diamond/Tests/DiamondTests/DiamondTests.swift

@@ -0,0 +1,98 @@
+import XCTest
+@testable import Diamond
+
+class DiamondTests: XCTestCase {
+
+    func testLetterA() {
+        XCTAssertEqual(Diamond.makeDiamond(letter: "A"), ["A"])
+    }
+
+    func testLetterC() {
+        let expected = [
+            "  A  ",
+            " B B ",
+            "C   C",
+            " B B ",
+            "  A  "]
+        XCTAssertEqual(Diamond.makeDiamond(letter: "C"), expected)
+    }
+
+    func testLetterE() {
+        let expected = [
+            "    A    ",
+            "   B B   ",
+            "  C   C  ",
+            " D     D ",
+            "E       E",
+            " D     D ",
+            "  C   C  ",
+            "   B B   ",
+            "    A    "]
+        XCTAssertEqual(Diamond.makeDiamond(letter: "E"), expected)
+    }
+
+    func testLargestPossibleDiamond() {
+        let expected = [
+            "                         A                         ",
+            "                        B B                        ",
+            "                       C   C                       ",
+            "                      D     D                      ",
+            "                     E       E                     ",
+            "                    F         F                    ",
+            "                   G           G                   ",
+            "                  H             H                  ",
+            "                 I               I                 ",
+            "                J                 J                ",
+            "               K                   K               ",
+            "              L                     L              ",
+            "             M                       M             ",
+            "            N                         N            ",
+            "           O                           O           ",
+            "          P                             P          ",
+            "         Q                               Q         ",
+            "        R                                 R        ",
+            "       S                                   S       ",
+            "      T                                     T      ",
+            "     U                                       U     ",
+            "    V                                         V    ",
+            "   W                                           W   ",
+            "  X                                             X  ",
+            " Y                                               Y ",
+            "Z                                                 Z",
+            " Y                                               Y ",
+            "  X                                             X  ",
+            "   W                                           W   ",
+            "    V                                         V    ",
+            "     U                                       U     ",
+            "      T                                     T      ",
+            "       S                                   S       ",
+            "        R                                 R        ",
+            "         Q                               Q         ",
+            "          P                             P          ",
+            "           O                           O           ",
+            "            N                         N            ",
+            "             M                       M             ",
+            "              L                     L              ",
+            "               K                   K               ",
+            "                J                 J                ",
+            "                 I               I                 ",
+            "                  H             H                  ",
+            "                   G           G                   ",
+            "                    F         F                    ",
+            "                     E       E                     ",
+            "                      D     D                      ",
+            "                       C   C                       ",
+            "                        B B                        ",
+            "                         A                         "]
+        XCTAssertEqual(Diamond.makeDiamond(letter: "Z"), expected)
+    }
+
+    static var allTests: [(String, (DiamondTests) -> () throws -> Void)] {
+        return [
+            ("testLetterA", testLetterA),
+            ("testLetterC", testLetterC),
+            ("testLetterE", testLetterE),
+            ("testLargestPossibleDiamond", testLargestPossibleDiamond),
+        ]
+    }
+}

data/tracks/swift/exercises/diamond/Tests/LinuxMain.swift

@@ -0,0 +1,6 @@
+import XCTest
+@testable import DiamondTests
+
+XCTMain([
+    testCase(DiamondTests.allTests),
+])

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.66
+  version: 2.2.1.67
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-11-15 00:00:00.000000000 Z
+date: 2017-11-17 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -5388,6 +5388,12 @@ files:
 - tracks/fsharp/exercises/roman-numerals/RomanNumerals.fs
 - tracks/fsharp/exercises/roman-numerals/RomanNumerals.fsproj
 - tracks/fsharp/exercises/roman-numerals/RomanNumeralsTest.fs
+- tracks/fsharp/exercises/rotational-cipher/Example.fs
+- tracks/fsharp/exercises/rotational-cipher/Program.fs
+- tracks/fsharp/exercises/rotational-cipher/README.md
+- tracks/fsharp/exercises/rotational-cipher/RotationalCipher.fs
+- tracks/fsharp/exercises/rotational-cipher/RotationalCipher.fsproj
+- tracks/fsharp/exercises/rotational-cipher/RotationalCipherTest.fs
 - tracks/fsharp/exercises/run-length-encoding/Example.fs
 - tracks/fsharp/exercises/run-length-encoding/Program.fs
 - tracks/fsharp/exercises/run-length-encoding/README.md
@@ -5785,7 +5791,9 @@ files:
 - tracks/go/exercises/grade-school/README.md
 - tracks/go/exercises/grade-school/example.go
 - tracks/go/exercises/grade-school/grade_school_test.go
+- tracks/go/exercises/grains/.meta/gen.go
 - tracks/go/exercises/grains/README.md
+- tracks/go/exercises/grains/cases_test.go
 - tracks/go/exercises/grains/example.go
 - tracks/go/exercises/grains/grains_test.go
 - tracks/go/exercises/hamming/.meta/gen.go
@@ -7100,7 +7108,7 @@ files:
 - tracks/java/exercises/diamond/.meta/version
 - tracks/java/exercises/diamond/README.md
 - tracks/java/exercises/diamond/build.gradle
-- tracks/java/exercises/diamond/src/main/java/.keep
+- tracks/java/exercises/diamond/src/main/java/DiamondPrinter.java
 - tracks/java/exercises/diamond/src/test/java/DiamondPrinterTest.java
 - tracks/java/exercises/difference-of-squares/.meta/src/reference/java/DifferenceOfSquaresCalculator.java
 - tracks/java/exercises/difference-of-squares/.meta/version
@@ -7166,11 +7174,17 @@ files:
 - tracks/java/exercises/house/build.gradle
 - tracks/java/exercises/house/src/main/java/.keep
 - tracks/java/exercises/house/src/test/java/HouseTest.java
+- tracks/java/exercises/isbn-verifier/.meta/src/reference/java/IsbnVerifier.java
+- tracks/java/exercises/isbn-verifier/.meta/version
+- tracks/java/exercises/isbn-verifier/README.md
+- tracks/java/exercises/isbn-verifier/build.gradle
+- tracks/java/exercises/isbn-verifier/src/main/java/IsbnVerifier.java
+- tracks/java/exercises/isbn-verifier/src/test/java/IsbnVerifierTest.java
 - tracks/java/exercises/isogram/.meta/hints.md
 - tracks/java/exercises/isogram/.meta/src/reference/java/IsogramChecker.java
 - tracks/java/exercises/isogram/README.md
 - tracks/java/exercises/isogram/build.gradle
-- tracks/java/exercises/isogram/src/main/java/.keep
+- tracks/java/exercises/isogram/src/main/java/IsogramChecker.java
 - tracks/java/exercises/isogram/src/test/java/IsogramCheckerTest.java
 - tracks/java/exercises/kindergarten-garden/.meta/src/reference/java/KindergartenGarden.java
 - tracks/java/exercises/kindergarten-garden/.meta/src/reference/java/Plant.java
@@ -7356,6 +7370,7 @@ files:
 - tracks/java/exercises/saddle-points/.meta/version
 - tracks/java/exercises/saddle-points/README.md
 - tracks/java/exercises/saddle-points/build.gradle
+- tracks/java/exercises/saddle-points/src/main/java/Matrix.java
 - tracks/java/exercises/saddle-points/src/main/java/MatrixCoordinate.java
 - tracks/java/exercises/saddle-points/src/test/java/MatrixTest.java
 - tracks/java/exercises/scrabble-score/.meta/src/reference/java/Scrabble.java
@@ -10133,6 +10148,10 @@ files:
 - tracks/php/exercises/roman-numerals/README.md
 - tracks/php/exercises/roman-numerals/example.php
 - tracks/php/exercises/roman-numerals/roman-numerals_test.php
+- tracks/php/exercises/run-length-encoding/README.md
+- tracks/php/exercises/run-length-encoding/example.php
+- tracks/php/exercises/run-length-encoding/run-length-encoding.php
+- tracks/php/exercises/run-length-encoding/run-length-encoding_test.php
 - tracks/php/exercises/scrabble-score/README.md
 - tracks/php/exercises/scrabble-score/example.php
 - tracks/php/exercises/scrabble-score/scrabble-score_test.php
@@ -10766,10 +10785,6 @@ files:
 - tracks/python/exercises/pangram/example.py
 - tracks/python/exercises/pangram/pangram.py
 - tracks/python/exercises/pangram/pangram_test.py
-- tracks/python/exercises/parallel-letter-frequency/README.md
-- tracks/python/exercises/parallel-letter-frequency/example.py
-- tracks/python/exercises/parallel-letter-frequency/parallel_letter_frequency.py
-- tracks/python/exercises/parallel-letter-frequency/parallel_letter_frequency_test.py
 - tracks/python/exercises/pascals-triangle/README.md
 - tracks/python/exercises/pascals-triangle/example.py
 - tracks/python/exercises/pascals-triangle/pascals_triangle.py
@@ -13190,6 +13205,12 @@ files:
 - tracks/swift/exercises/custom-set/Sources/CustomSetExample.swift
 - tracks/swift/exercises/custom-set/Tests/CustomSetTests/CustomSetTests.swift
 - tracks/swift/exercises/custom-set/Tests/LinuxMain.swift
+- tracks/swift/exercises/diamond/Package.swift
+- tracks/swift/exercises/diamond/README.md
+- tracks/swift/exercises/diamond/Sources/Diamond.swift
+- tracks/swift/exercises/diamond/Sources/DiamondExample.swift
+- tracks/swift/exercises/diamond/Tests/DiamondTests/DiamondTests.swift
+- tracks/swift/exercises/diamond/Tests/LinuxMain.swift
 - tracks/swift/exercises/difference-of-squares/.gitignore
 - tracks/swift/exercises/difference-of-squares/Package.swift
 - tracks/swift/exercises/difference-of-squares/README.md

data/tracks/python/exercises/parallel-letter-frequency/README.md

@@ -1,24 +0,0 @@
-# Parallel Letter Frequency
-
-Count the frequency of letters in texts using parallel computation.
-
-Parallelism is about doing things in parallel that can also be done
-sequentially. A common example is counting the frequency of letters.
-Create a function that returns the total frequency of each letter in a
-list of texts and that employs parallelism.
-
-The letters used consists of ASCII letters `a` to `z`, inclusive, and is case
-insensitive.
-
-## Submitting Exercises
-
-Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory.
-
-For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`.
-
-
-For more detailed information about running tests, code style and linting,
-please see the [help page](http://exercism.io/languages/python).
-
-## Submitting Incomplete Solutions
-It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/python/exercises/parallel-letter-frequency/example.py

@@ -1,56 +0,0 @@
-# -*- coding: utf-8 -*-
-from collections import Counter
-from threading import Lock, Thread
-from time import sleep
-import sys
-if sys.version[0] == '2':
-    from Queue import Queue
-else:
-    from queue import Queue
-
-total_workers = 3  # Maximum number of threads chosen arbitrarily
-
-
-class LetterCounter(object):
-
-    def __init__(self):
-        self.lock = Lock()
-        self.value = Counter()
-
-    def add_counter(self, counter_to_add):
-        self.lock.acquire()
-        try:
-            self.value = self.value + counter_to_add
-        finally:
-            self.lock.release()
-
-
-def count_letters(queue_of_texts, letter_to_frequency, worker_id):
-    while not queue_of_texts.empty():
-        sleep(worker_id + 1)
-        line_input = queue_of_texts.get()
-        if line_input is not None:
-            letters_in_line = Counter([x for x in line_input.lower() if
-                                       x.isalpha()])
-            letter_to_frequency.add_counter(letters_in_line)
-        queue_of_texts.task_done()
-        if line_input is None:
-            break
-
-
-def calculate(list_of_texts):
-    queue_of_texts = Queue()
-    [queue_of_texts.put(line) for line in list_of_texts]
-    letter_to_frequency = LetterCounter()
-    threads = []
-    for i in range(total_workers):
-        worker = Thread(target=count_letters, args=(queue_of_texts,
-                                                    letter_to_frequency, i))
-        worker.start()
-        threads.append(worker)
-    queue_of_texts.join()
-    for i in range(total_workers):
-        queue_of_texts.put(None)
-    for t in threads:
-        t.join()
-    return letter_to_frequency.value