trackler 2.2.1.14 → 2.2.1.15

data/tracks/python/exercises/change/change_test.py

@@ -19,13 +19,18 @@ class ChangeTest(unittest.TestCase):
                          [21, 21, 21])
 
     def test_large_target_values(self):
-        self.assertEqual(find_minimum_coins(21, [2, 5, 10, 20, 50]),
-                         [2, 2, 2, 5, 10])
+        self.assertEqual(find_minimum_coins(999, [1, 2, 5, 10, 20, 50, 100]),
+                         [2, 2, 5, 20, 20, 50, 100, 100, 100,
+                          100, 100, 100, 100, 100, 100])
 
     def test_possible_change_without_unit_coins_available(self):
         self.assertEqual(find_minimum_coins(21, [2, 5, 10, 20, 50]),
                          [2, 2, 2, 5, 10])
 
+    def test_another_possible_change_without_unit_coins_available(self):
+        self.assertEqual(find_minimum_coins(27, [4, 5]),
+                         [4, 4, 4, 5, 5, 5])
+
     def test_no_coins_make_0_change(self):
         self.assertEqual(find_minimum_coins(0, [1, 5, 10, 21, 25]), [])
 

data/tracks/rust/config.json

@@ -1,5 +1,6 @@
 {
   "language": "Rust",
+  "blurb": "Rust is a compiled programming language designed for speed, concurrency, and memory safety. Rust programs can run almost anywhere, from low-power embedded devices to web servers.",
   "active": true,
   "exercises": [
     {

data/tracks/rust/docs/ABOUT.md

@@ -1,4 +1,4 @@
-Rust is a systems programming language focused on three goals: safety, speed, and concurrency. Rust does not use a garbage collector, but instead ensures safety and optimizes code at compile time. The concept of [ownership](https://doc.rust-lang.org/book/ownership.html) is how Rust achieves its largest goal, memory safety.
+Rust aims to bring modern language design and an advanced type system to systems programming. Rust does not use a garbage collector, but instead ensures safety and optimizes code at compile time. The concept of [ownership](https://doc.rust-lang.org/book/ownership.html) is how Rust achieves its largest goal, memory safety.
 
 Rust core and the standard library contain a minimal set of functionality. Rustaceans are encouraged to add features, in the form of libraries called _crates_, to the language and then share them on [crates.io](https://crates.io/).
 

data/tracks/scala/exercises/nth-prime/example.scala

@@ -1,10 +1,10 @@
-object Prime {
+object NthPrime {
   // The stream will cache calculated primes. This is nice for performance,
   // but not so nice for memory utilization.
   private lazy val primes: Stream[BigInt] =
     Stream.cons(BigInt(2), primes.map(b => new BigInt(b.bigInteger.nextProbablePrime)))
 
-  def nth(n: Int): Option[Int] =
+  def prime(n: Int): Option[Int] =
     if (n < 1) None
     else Some(primes.drop(n - 1).head.toInt)
 }

data/tracks/scala/exercises/nth-prime/src/test/scala/NthPrimeTest.scala

@@ -0,0 +1,29 @@
+import org.scalatest.{Matchers, FunSuite}
+
+/** @version 1.0.0 */
+class NthPrimeTest extends FunSuite with Matchers {
+
+  test("first prime") {
+    NthPrime.prime(1) should be (Some(2))
+  }
+
+  test("second prime") {
+    pending
+    NthPrime.prime(2) should be (Some(3))
+  }
+
+  test("sixth prime") {
+    pending
+    NthPrime.prime(6) should be (Some(13))
+  }
+
+  test("big prime") {
+    pending
+    NthPrime.prime(10001) should be (Some(104743))
+  }
+
+  test("there is no zeroth prime") {
+    pending
+    NthPrime.prime(0) should be (None)
+  }
+}

data/tracks/scala/testgen/src/main/scala/NthPrimeTestGenerator.scala

@@ -0,0 +1,34 @@
+import java.io.File
+
+import testgen.TestSuiteBuilder._
+import testgen._
+
+object NthPrimerTestGenerator {
+  def main(args: Array[String]): Unit = {
+    val file = new File("src/main/resources/nth-prime.json")
+
+    def toString(expected: CanonicalDataParser.Expected): String = {
+      expected match {
+        case Left(_) => "None"
+        case Right(false) => "None"
+        case Right(n) => s"Some($n)"
+      }
+    }
+
+    def fromLabeledTest(argNames: String*): ToTestCaseData =
+      withLabeledTest { sut =>
+        labeledTest =>
+          val args = sutArgs(labeledTest.result, argNames: _*)
+          val property = labeledTest.property
+          val sutCall =
+            s"""$sut.$property($args)"""
+          val expected = toString(labeledTest.expected)
+          TestCaseData(labeledTest.description, sutCall, expected)
+      }
+
+    val code = TestSuiteBuilder.build(file, fromLabeledTest("input"))
+    println(s"-------------")
+    println(code)
+    println(s"-------------")
+  }
+}

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.14
+  version: 2.2.1.15
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-08-21 00:00:00.000000000 Z
+date: 2017-08-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -2364,6 +2364,7 @@ files:
 - tracks/csharp/generators/Exercises/PerfectNumbers.cs
 - tracks/csharp/generators/Exercises/PhoneNumber.cs
 - tracks/csharp/generators/Exercises/PigLatin.cs
+- tracks/csharp/generators/Exercises/Poker.cs
 - tracks/csharp/generators/Exercises/PrimeFactors.cs
 - tracks/csharp/generators/Exercises/RailFenceCipher.cs
 - tracks/csharp/generators/Exercises/Raindrops.cs
@@ -2379,6 +2380,7 @@ files:
 - tracks/csharp/generators/Exercises/SumOfMultiples.cs
 - tracks/csharp/generators/Exercises/Transpose.cs
 - tracks/csharp/generators/Exercises/TwoFer.cs
+- tracks/csharp/generators/Exercises/WordCount.cs
 - tracks/csharp/generators/Exercises/Wordy.cs
 - tracks/csharp/generators/Generators.csproj
 - tracks/csharp/generators/Generators.csproj.user
@@ -2588,7 +2590,6 @@ files:
 - tracks/delphi/config/maintainers.json
 - tracks/delphi/docs/ABOUT.md
 - tracks/delphi/docs/EXERCISE_README_INSERT.md
-- tracks/delphi/docs/GETTING_STARTED_GUIDE.md
 - tracks/delphi/docs/INSTALLATION.md
 - tracks/delphi/docs/LEARNING.md
 - tracks/delphi/docs/RESOURCES.md
@@ -2662,6 +2663,7 @@ files:
 - tracks/delphi/exercises/hamming/README.md
 - tracks/delphi/exercises/hamming/uHammingExample.pas
 - tracks/delphi/exercises/hamming/uHammingTests.pas
+- tracks/delphi/exercises/hello-world/GETTING_STARTED_GUIDE.md
 - tracks/delphi/exercises/hello-world/HelloWorld.dpr
 - tracks/delphi/exercises/hello-world/README.md
 - tracks/delphi/exercises/hello-world/uHelloWorldExample.pas
@@ -4132,12 +4134,10 @@ files:
 - tracks/fsharp/.travis.yml
 - tracks/fsharp/LICENSE
 - tracks/fsharp/README.md
-- tracks/fsharp/appveyor.yml
 - tracks/fsharp/bin/fetch-configlet
 - tracks/fsharp/build.cmd
 - tracks/fsharp/build.fsx
 - tracks/fsharp/build.sh
-- tracks/fsharp/circle.yml
 - tracks/fsharp/config.json
 - tracks/fsharp/config/exercise_readme.go.tmpl
 - tracks/fsharp/config/maintainers.json
@@ -4671,7 +4671,6 @@ files:
 - tracks/go/exercises/hamming/hamming_test.go
 - tracks/go/exercises/hello-world/README.md
 - tracks/go/exercises/hello-world/example.go
-- tracks/go/exercises/hello-world/example_helloworld_test.go
 - tracks/go/exercises/hello-world/hello_test.go
 - tracks/go/exercises/hello-world/hello_world.go
 - tracks/go/exercises/hexadecimal/README.md
@@ -4871,6 +4870,11 @@ files:
 - tracks/go/exercises/twelve-days/README.md
 - tracks/go/exercises/twelve-days/example.go
 - tracks/go/exercises/twelve-days/twelve_days_test.go
+- tracks/go/exercises/two-fer/README.md
+- tracks/go/exercises/two-fer/example.go
+- tracks/go/exercises/two-fer/example_two_fer_test.go
+- tracks/go/exercises/two-fer/two_fer.go
+- tracks/go/exercises/two-fer/two_fer_test.go
 - tracks/go/exercises/variable-length-quantity/.meta/gen.go
 - tracks/go/exercises/variable-length-quantity/README.md
 - tracks/go/exercises/variable-length-quantity/cases_test.go
@@ -10909,7 +10913,7 @@ files:
 - tracks/scala/exercises/nth-prime/build.sbt
 - tracks/scala/exercises/nth-prime/example.scala
 - tracks/scala/exercises/nth-prime/src/main/scala/.keep
-- tracks/scala/exercises/nth-prime/src/test/scala/PrimeTest.scala
+- tracks/scala/exercises/nth-prime/src/test/scala/NthPrimeTest.scala
 - tracks/scala/exercises/nucleotide-count/HINTS.md
 - tracks/scala/exercises/nucleotide-count/README.md
 - tracks/scala/exercises/nucleotide-count/build.sbt
@@ -11161,6 +11165,7 @@ files:
 - tracks/scala/testgen/src/main/scala/LeapTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/LuhnTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/MinesweeperTestGenerator.scala
+- tracks/scala/testgen/src/main/scala/NthPrimeTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/NucleotideCountTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/PangramsTestGenerator.scala
 - tracks/scala/testgen/src/main/scala/PascalsTriangleTestGenerator.scala

data/tracks/fsharp/appveyor.yml

@@ -1,4 +0,0 @@
-build_script:
-- ps: .\build.cmd
-
-test: off

data/tracks/fsharp/circle.yml

@@ -1,16 +0,0 @@
-machine:
-  environment:
-    TERM: xterm-256color
-dependencies:
-  pre:
-    - sudo apt-key adv --keyserver hkp://keyserver.ubuntu.com:80 --recv-keys 3FA7E0328081BFF6A14DA29AA6A19B38D3D831EF
-    - echo "deb http://download.mono-project.com/repo/debian wheezy main" | sudo tee /etc/apt/sources.list.d/mono-xamarin.list
-    - sudo apt-get update
-    - sudo apt-get install mono-complete fsharp
-test:
-  override:
-    - ./build.sh
-  post:
-    - mkdir -p $CIRCLE_TEST_REPORTS/junit/
-    - sed -i '1 s/^\xef\xbb\xbf//' .*/junit-results.xml
-    - find . -type f -regex ".*/junit-results.xml" -exec cp {} $CIRCLE_TEST_REPORTS/junit/ \;

data/tracks/scala/exercises/nth-prime/src/test/scala/PrimeTest.scala

@@ -1,37 +0,0 @@
-import org.scalatest.{Matchers, FlatSpec}
-
-class PrimeTest extends FlatSpec with Matchers {
-  it should "calculate 1st prime" in {
-    Prime.nth(1) should be (Some(2))
-  }
-
-  it should "calculate 2nd prime" in {
-    pending
-    Prime.nth(2) should be (Some(3))
-  }
-
-  it should "calculate 6th prime" in {
-    pending
-    Prime.nth(6) should be (Some(13))
-  }
-
-  it should "calculate 1000th prime" in {
-    pending
-    Prime.nth(1000) should be (Some(7919))
-  }
-
-  it should "calculate 10000th prime" in {
-    pending
-    Prime.nth(10000) should be (Some(104729))
-  }
-
-  it should "calculate 10001th prime" in {
-    pending
-    Prime.nth(10001) should be (Some(104743))
-  }
-
-  it should "not find zeroth prime" in {
-    pending
-    Prime.nth(0) should be (None)
-  }
-}