trackler 1.0.0 → 1.0.0.1

data/tracks/ruby/exercises/acronym/.version

@@ -0,0 +1 @@
+2

data/tracks/ruby/exercises/acronym/acronym_test.rb

@@ -3,34 +3,58 @@ gem 'minitest', '>= 5.0.0'
 require 'minitest/autorun'
 require_relative 'acronym'
 
+# Test data version:
+# 5b5e807
+# rubocop:disable Metrics/LineLength
 class AcronymTest < Minitest::Test
-  ACRONYM_PAIRS =
-    {
-      'Portable Network Graphics' => 'PNG',
-      'Ruby on Rails' => 'ROR',
-      'HyperText Markup Language' => 'HTML',
-      'First In, First Out' => 'FIFO',
-      'PHP: Hypertext Preprocessor' => 'PHP',
-      'Complementary metal-oxide semiconductor' => 'CMOS'
-    }.freeze
-
-  def test_acronyms
-    ACRONYM_PAIRS.each do |given, expected|
-      assert_equal expected, Acronym.abbreviate(given), <<-MSG
-        The acronym of '#{given}' should be '#{expected}'.
-      MSG
-    end
+  def test_basic
+    assert_equal 'PNG', Acronym.abbreviate('Portable Network Graphics')
   end
 
-  # Problems in exercism evolve over time,
-  # as we find better ways to ask questions.
+  def test_lowercase_words
+    skip
+    assert_equal 'ROR', Acronym.abbreviate('Ruby on Rails')
+  end
+
+  def test_camelcase
+    skip
+    assert_equal 'HTML', Acronym.abbreviate('HyperText Markup Language')
+  end
+
+  def test_punctuation
+    skip
+    assert_equal 'FIFO', Acronym.abbreviate('First In, First Out')
+  end
+
+  def test_all_caps_words
+    skip
+    assert_equal 'PHP', Acronym.abbreviate('PHP: Hypertext Preprocessor')
+  end
+
+  def test_hyphenated
+    skip
+    assert_equal 'CMOS', Acronym.abbreviate('Complementary metal-oxide semiconductor')
+  end
+
+  # Problems in exercism evolve over time, as we find better ways to ask
+  # questions.
   # The version number refers to the version of the problem you solved,
   # not your solution.
   #
-  # Define a constant named VERSION inside of BookKeeping.
+  # Define a constant named VERSION inside of the top level BookKeeping
+  # module, which may be placed near the end of your file.
+  #
+  # In your file, it will look like this:
+  #
+  # module BookKeeping
+  #   VERSION = 1 # Where the version number matches the one in the test.
+  # end
+  #
   # If you are curious, read more about constants on RubyDoc:
   # http://ruby-doc.org/docs/ruby-doc-bundle/UsersGuide/rg/constants.html
-  def test_version
-    assert_equal 1, BookKeeping::VERSION
+
+  def test_bookkeeping
+    skip
+    assert_equal 2, BookKeeping::VERSION
   end
 end

data/tracks/ruby/exercises/acronym/example.rb

@@ -1,5 +1,5 @@
 module BookKeeping
-  VERSION = 1
+  VERSION = 2
 end
 
 class Acronym

data/tracks/ruby/exercises/acronym/example.tt

@@ -0,0 +1,19 @@
+#!/usr/bin/env ruby
+gem 'minitest', '>= 5.0.0'
+require 'minitest/autorun'
+require_relative 'acronym'
+
+# Test data version:
+# <%= sha1 %>
+class AcronymTest < Minitest::Test<% test_cases.each do |test_case| %>
+  def <%= test_case.name %><% if test_case.skipped? %>
+    skip<% end %>
+    assert_equal '<%= test_case.expected %>', <%= test_case.assertion %>
+  end
+<% end %>
+<%= IO.read(XRUBY_LIB + '/bookkeeping.md') %>
+  def test_bookkeeping
+    skip
+    assert_equal <%= version.next %>, BookKeeping::VERSION
+  end
+end

data/tracks/ruby/exercises/anagram/anagram_test.rb

@@ -59,7 +59,7 @@ class AnagramTest < Minitest::Test
     skip
     detector = Anagram.new('allergy')
     anagrams =
-      detector.match %w( gallery ballerina regally clergy largely leading)
+      detector.match %w(gallery ballerina regally clergy largely leading)
     assert_equal %w(gallery largely regally), anagrams.sort
   end
 

data/tracks/ruby/exercises/nth-prime/.version

@@ -0,0 +1 @@
+1

data/tracks/ruby/exercises/nth-prime/example.rb

@@ -1,3 +1,7 @@
+module BookKeeping
+  VERSION = 1
+end
+
 class Prime
   def self.nth(n)
     if n < 1

data/tracks/ruby/exercises/nth-prime/example.tt

@@ -0,0 +1,23 @@
+#!/usr/bin/env ruby
+gem 'minitest', '>= 5.0.0'
+require 'minitest/autorun'
+require_relative 'nth_prime'
+
+# Test data version:
+# <%= sha1 %>
+# Rubocop directives
+# rubocop:disable Style/NumericLiterals
+#
+class NthPrimeTest < Minitest::Test<% test_cases.each do |test_case| %>
+  def <%= test_case.name %><% if test_case.skipped? %>
+    skip<% end %><% if test_case.raises_error? %>
+    assert_raises(ArgumentError) { <%= test_case.actual %> }<% else %>
+    assert_equal <%= test_case.expected %>, <%= test_case.actual %><% end %>
+  end
+<% end %>
+<%= IO.read(XRUBY_LIB + '/bookkeeping.md') %>
+  def test_bookkeeping
+    skip
+    assert_equal <%= version.next %>, BookKeeping::VERSION
+  end
+end

data/tracks/ruby/exercises/nth-prime/nth_prime_test.rb

@@ -1,16 +1,19 @@
 #!/usr/bin/env ruby
-
 gem 'minitest', '>= 5.0.0'
 require 'minitest/autorun'
-
 require_relative 'nth_prime'
 
-class TestPrimes < Minitest::Test
-  def test_first
+# Test data version:
+# bb79e10
+# Rubocop directives
+# rubocop:disable Style/NumericLiterals
+#
+class NthPrimeTest < Minitest::Test
+  def test_first_prime
     assert_equal 2, Prime.nth(1)
   end
 
-  def test_second
+  def test_second_prime
     skip
     assert_equal 3, Prime.nth(2)
   end
@@ -22,13 +25,33 @@ class TestPrimes < Minitest::Test
 
   def test_big_prime
     skip
-    assert_equal 104_743, Prime.nth(10_001)
+    assert_equal 104743, Prime.nth(10001)
+  end
+
+  def test_there_is_no_zeroth_prime
+    skip
+    assert_raises(ArgumentError) { Prime.nth(0) }
   end
 
-  def test_weird_case
+  # Problems in exercism evolve over time, as we find better ways to ask
+  # questions.
+  # The version number refers to the version of the problem you solved,
+  # not your solution.
+  #
+  # Define a constant named VERSION inside of the top level BookKeeping
+  # module, which may be placed near the end of your file.
+  #
+  # In your file, it will look like this:
+  #
+  # module BookKeeping
+  #   VERSION = 1 # Where the version number matches the one in the test.
+  # end
+  #
+  # If you are curious, read more about constants on RubyDoc:
+  # http://ruby-doc.org/docs/ruby-doc-bundle/UsersGuide/rg/constants.html
+
+  def test_bookkeeping
     skip
-    assert_raises ArgumentError do
-      Prime.nth(0)
-    end
+    assert_equal 1, BookKeeping::VERSION
   end
 end

data/tracks/ruby/exercises/raindrops/.version

@@ -1 +1 @@
-2
+3

data/tracks/ruby/exercises/raindrops/example.rb

@@ -1,5 +1,5 @@
 module BookKeeping
-  VERSION = 2
+  VERSION = 3
 end
 
 class Raindrops

data/tracks/ruby/exercises/raindrops/raindrops_test.rb

@@ -4,8 +4,7 @@ require 'minitest/autorun'
 require_relative 'raindrops'
 
 # Test data version:
-# deb225e Implement canonical dataset for scrabble-score problem (#255)
-
+# 5b5e807
 class RaindropsTest < Minitest::Test
   def test_1
     assert_equal '1', Raindrops.convert(1)
@@ -31,6 +30,11 @@ class RaindropsTest < Minitest::Test
     assert_equal 'Pling', Raindrops.convert(6)
   end
 
+  def test_8
+    skip
+    assert_equal '8', Raindrops.convert(8)
+  end
+
   def test_9
     skip
     assert_equal 'Pling', Raindrops.convert(9)
@@ -61,6 +65,11 @@ class RaindropsTest < Minitest::Test
     assert_equal 'Plang', Raindrops.convert(25)
   end
 
+  def test_27
+    skip
+    assert_equal 'Pling', Raindrops.convert(27)
+  end
+
   def test_35
     skip
     assert_equal 'PlangPlong', Raindrops.convert(35)
@@ -81,14 +90,20 @@ class RaindropsTest < Minitest::Test
     assert_equal 'PlingPlangPlong', Raindrops.convert(105)
   end
 
+  def test_3125
+    skip
+    assert_equal 'Plang', Raindrops.convert(3125)
+  end
+
   # Problems in exercism evolve over time, as we find better ways to ask
   # questions.
   # The version number refers to the version of the problem you solved,
   # not your solution.
   #
   # Define a constant named VERSION inside of the top level BookKeeping
-  # module.
-  #  In your file, it will look like this:
+  # module, which may be placed near the end of your file.
+  #
+  # In your file, it will look like this:
   #
   # module BookKeeping
   #   VERSION = 1 # Where the version number matches the one in the test.
@@ -99,6 +114,6 @@ class RaindropsTest < Minitest::Test
 
   def test_bookkeeping
     skip
-    assert_equal 2, BookKeeping::VERSION
+    assert_equal 3, BookKeeping::VERSION
   end
 end

data/tracks/ruby/lib/acronym_cases.rb

@@ -0,0 +1,19 @@
+class AcronymCase < OpenStruct
+  def name
+    'test_%s' % description.tr(' ', '_')
+  end
+
+  def assertion
+    "Acronym.abbreviate('#{phrase}')"
+  end
+
+  def skipped?
+    index > 0
+  end
+end
+
+AcronymCases = proc do |data|
+  JSON.parse(data)['abbreviate']['cases'].map.with_index do |row, i|
+    AcronymCase.new(row.merge('index' => i))
+  end
+end

data/tracks/ruby/lib/generator.rb

@@ -14,11 +14,12 @@ class Generator
   end
 
   def metadata_dir
-    File.expand_path(File.join('..', '..', '..', METADATA_REPOSITORY), __FILE__)
+    # rubocop:disable Metrics/LineLength
+    File.expand_path(File.join('..', '..', '..', METADATA_REPOSITORY, 'exercises', name), __FILE__)
   end
 
   def data
-    File.read(File.join(metadata_dir, "#{name}.json"))
+    File.read(File.join(metadata_dir, 'canonical-data.json'))
   end
 
   def path_to(file)

data/tracks/ruby/lib/nth_prime_cases.rb

@@ -0,0 +1,23 @@
+class NthPrimeCase < OpenStruct
+  def name
+    'test_%s' % description.downcase.gsub(/[ -]/, '_')
+  end
+
+  def actual
+    "Prime.nth(#{input})"
+  end
+
+  def raises_error?
+    expected == false
+  end
+
+  def skipped?
+    index > 0
+  end
+end
+
+NthPrimeCases = proc do |data|
+  JSON.parse(data)['cases'].map.with_index do |row, i|
+    NthPrimeCase.new(row.merge('index' => i))
+  end
+end

data/tracks/ruby/lib/raindrop_cases.rb

@@ -1,6 +1,6 @@
 class RaindropsCase < OpenStruct
   def name
-    'test_%s' % description.downcase.gsub(/[ -]/, '_')
+    'test_%s' % number
   end
 
   def do

data/tracks/rust/README.md

@@ -15,5 +15,5 @@ The MIT License (MIT)
 Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
 
 ## Rust icon
-The Rust Logo is created by the Mozilla Corporation, and has been released under the Creative Commons Attribution 4.0 International license.
+The Rust Logo is created by the Mozilla Corporation, and has been released under the [Creative Commons Attribution 4.0 International license](https://creativecommons.org/licenses/by/4.0/).
 We tweaked the color from black to charcoal (#212121).

data/tracks/scala/exercises/leap/src/test/scala/leap_test.scala

@@ -10,6 +10,11 @@ class LeapTest extends FunSuite {
     assert(!Year(1997).isLeap)
   }
 
+  test("an even year") {
+    pending
+    assert(!Year(1986).isLeap)
+  }
+
   test ("century") {
     pending
     assert(!Year(1900).isLeap)
@@ -19,4 +24,9 @@ class LeapTest extends FunSuite {
     pending
     assert(Year(2000).isLeap)
   }
+
+  test("exceptional century that is no millenium") {
+    pending
+    assert(Year(1600).isLeap)
+  }
 }

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

@@ -1,8 +1,8 @@
 import scala.annotation.tailrec
 
 // Algorithm from - http://fldit-www.cs.uni-dortmund.de/~peter/PS07/HR.pdf
-class PrimeFactors {
-  def primeFactors(n: Long): List[Long] = {
+object PrimeFactors {
+  def forNumber(n: Long): List[Long] = {
     assert(n >= 1, "Argument must be positive")
 
     @tailrec
@@ -26,7 +26,4 @@ class PrimeFactors {
     else ldf(k + 1, n)
 }
 
-object PrimeFactors {
-  def apply() = new PrimeFactors
-}
 

data/tracks/scala/exercises/prime-factors/src/test/scala/primefactors_test.scala

@@ -1,50 +1,48 @@
 import org.scalatest.{FlatSpec, Matchers}
 
 class PrimeFactorsTest extends FlatSpec with Matchers {
-  private val calc = PrimeFactors()
-
   it should "calc empty list" in {
-    calc.primeFactors(1) should be (List())
+    PrimeFactors.forNumber(1) should be (List())
   }
 
   it should "calc prime factors of 2" in {
-    calc.primeFactors(2) should be (List(2))
+    PrimeFactors.forNumber(2) should be (List(2))
   }
 
   it should "calc prime factors of 3" in {
-    calc.primeFactors(3) should be (List(3))
+    PrimeFactors.forNumber(3) should be (List(3))
   }
 
   it should "calc prime factors of 4" in {
-    calc.primeFactors(4) should be (List(2, 2))
+    PrimeFactors.forNumber(4) should be (List(2, 2))
   }
 
   it should "calc prime factors of 6" in {
-    calc.primeFactors(6) should be (List(2, 3))
+    PrimeFactors.forNumber(6) should be (List(2, 3))
   }
 
   it should "calc prime factors of 8" in {
-    calc.primeFactors(8) should be (List(2, 2, 2))
+    PrimeFactors.forNumber(8) should be (List(2, 2, 2))
   }
 
   it should "calc prime factors of 9" in {
-    calc.primeFactors(9) should be (List(3, 3))
+    PrimeFactors.forNumber(9) should be (List(3, 3))
   }
 
   it should "calc prime factors of 27" in {
-    calc.primeFactors(27) should be (List(3, 3, 3))
+    PrimeFactors.forNumber(27) should be (List(3, 3, 3))
   }
 
   it should "calc prime factors of 625" in {
-    calc.primeFactors(625) should be (List(5, 5, 5, 5))
+    PrimeFactors.forNumber(625) should be (List(5, 5, 5, 5))
   }
 
   it should "calc prime factors of 901255" in {
-    calc.primeFactors(901255) should be (List(5, 17, 23, 461))
+    PrimeFactors.forNumber(901255) should be (List(5, 17, 23, 461))
   }
 
   it should "calc prime factors of 93819012551" in {
-    calc.primeFactors(Long.MaxValue) should be (List(7, 7, 73, 127, 337, 92737, 649657))
+    PrimeFactors.forNumber(Long.MaxValue) should be (List(7, 7, 73, 127, 337, 92737, 649657))
   }
 }