trackler 2.2.1.1 → 2.2.1.2

data/tracks/pony/exercises/hello-world/README.md

@@ -0,0 +1,21 @@
+# Hello World
+
+The classical introductory exercise. Just say "Hello, World!".
+
+["Hello, World!"](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) is
+the traditional first program for beginning programming in a new language
+or environment.
+
+The objectives are simple:
+
+- Write a function that returns the string "Hello, World!".
+- Run the test suite and make sure that it succeeds.
+- Submit your solution and check it at the website.
+
+If everything goes well, you will be ready to fetch your first real exercise.
+## Source
+
+This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/pony/exercises/leap/README.md

@@ -0,0 +1,33 @@
+# Leap
+
+Given a year, report if it is a leap year.
+
+The tricky thing here is that a leap year in the Gregorian calendar occurs:
+
+```plain
+on every year that is evenly divisible by 4
+  except every year that is evenly divisible by 100
+    unless the year is also evenly divisible by 400
+```
+
+For example, 1997 is not a leap year, but 1996 is.  1900 is not a leap
+year, but 2000 is.
+
+If your language provides a method in the standard library that does
+this look-up, pretend it doesn't exist and implement it yourself.
+
+## Notes
+
+Though our exercise adopts some very simple rules, there is more to
+learn!
+
+For a delightful, four minute explanation of the whole leap year
+phenomenon, go watch [this youtube video][video].
+
+[video]: http://www.youtube.com/watch?v=xX96xng7sAE
+## Source
+
+JavaRanch Cattle Drive, exercise 3 [http://www.javaranch.com/leap.jsp](http://www.javaranch.com/leap.jsp)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/pony/exercises/pascals-triangle/README.md

@@ -0,0 +1,21 @@
+# Pascals Triangle
+
+Compute Pascal's triangle up to a given number of rows.
+
+In Pascal's Triangle each number is computed by adding the numbers to
+the right and left of the current position in the previous row.
+
+```plain
+    1
+   1 1
+  1 2 1
+ 1 3 3 1
+1 4 6 4 1
+# ... etc
+```
+## Source
+
+Pascal's Triangle at Wolfram Math World [http://mathworld.wolfram.com/PascalsTriangle.html](http://mathworld.wolfram.com/PascalsTriangle.html)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/pony/exercises/rna-transcription/README.md

@@ -0,0 +1,25 @@
+# Rna Transcription
+
+Given a DNA strand, return its RNA complement (per RNA transcription).
+
+Both DNA and RNA strands are a sequence of nucleotides.
+
+The four nucleotides found in DNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and thymine (**T**).
+
+The four nucleotides found in RNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and uracil (**U**).
+
+Given a DNA strand, its transcribed RNA strand is formed by replacing
+each nucleotide with its complement:
+
+* `G` -> `C`
+* `C` -> `G`
+* `T` -> `A`
+* `A` -> `U`
+## Source
+
+Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/pony/exercises/roman-numerals/README.md

@@ -0,0 +1,49 @@
+# Roman Numerals
+
+Write a function to convert from normal numbers to Roman Numerals.
+
+The Romans were a clever bunch. They conquered most of Europe and ruled
+it for hundreds of years. They invented concrete and straight roads and
+even bikinis. One thing they never discovered though was the number
+zero. This made writing and dating extensive histories of their exploits
+slightly more challenging, but the system of numbers they came up with
+is still in use today. For example the BBC uses Roman numerals to date
+their programmes.
+
+The Romans wrote numbers using letters - I, V, X, L, C, D, M. (notice
+these letters have lots of straight lines and are hence easy to hack
+into stone tablets).
+
+```
+ 1  => I
+10  => X
+ 7  => VII
+```
+
+There is no need to be able to convert numbers larger than about 3000.
+(The Romans themselves didn't tend to go any higher)
+
+Wikipedia says: Modern Roman numerals ... are written by expressing each
+digit separately starting with the left most digit and skipping any
+digit with a value of zero.
+
+To see this in practice, consider the example of 1990.
+
+In Roman numerals 1990 is MCMXC:
+
+1000=M
+900=CM
+90=XC
+
+2008 is written as MMVIII:
+
+2000=MM
+8=VIII
+
+See also: http://www.novaroma.org/via_romana/numbers.html
+## Source
+
+The Roman Numeral Kata [http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals](http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/ruby/config.json

@@ -859,6 +859,19 @@
         "Mathematics"
       ]
     },
+    {
+      "uuid": "af5ccf14-eff2-4dc6-b1db-e209cddca62a",
+      "slug": "rotational-cipher",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "Control-flow (conditionals)",
+        "Control-flow (loops)",
+        "Logic",
+        "Strings"
+      ]
+    },
     {
       "uuid": "cae4e000-3aac-41f7-b727-f9cce12d058d",
       "slug": "octal",

data/tracks/ruby/config/maintainers.json

@@ -0,0 +1,64 @@
+{
+  "maintainers": [
+    {
+      "github_username": "kotp",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "bernardoamc",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "tommyschaefer",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "hilary",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "bmulvihill",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "Insti",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ]
+}

data/tracks/ruby/exercises/rotational-cipher/.meta/.version

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

data/tracks/ruby/exercises/rotational-cipher/.meta/generator/rotational_cipher_case.rb

@@ -0,0 +1,9 @@
+require 'generator/exercise_case'
+
+class RotationalCipherCase < Generator::ExerciseCase
+
+  def workload
+    assert_equal { %Q[RotationalCipher.rotate("#{text}", #{shiftKey})] }
+  end
+
+end

data/tracks/ruby/exercises/rotational-cipher/.meta/solutions/rotational_cipher.rb

@@ -0,0 +1,53 @@
+module BookKeeping
+  VERSION = 1
+end
+
+class RotationalCipher
+  SMALL_LETTERS_RANGE = (97..122)
+  BIG_LETTERS_RANGE   = (65..90)
+  ROTATION_MODIFIER   = 1
+
+  attr_reader :text
+
+  def initialize(text, key)
+    @text      = text
+    @shift_key = key
+  end
+
+  def self.rotate(text, key)
+    new(text, key).rotate
+  end
+
+  def rotate
+    text.split('').map { |char| shift_char(char) }.join
+  end
+
+  private
+
+  def shift_char(char)
+    shift_ascii(char.ord).chr
+  end
+
+  def shift_key
+    @shift_key % 26
+  end
+
+  def shift_ascii(char_ascii)
+    case char_ascii
+    when SMALL_LETTERS_RANGE
+      shift_within(char_ascii, SMALL_LETTERS_RANGE.min, SMALL_LETTERS_RANGE.max)
+    when BIG_LETTERS_RANGE
+      shift_within(char_ascii, BIG_LETTERS_RANGE.min, BIG_LETTERS_RANGE.max)
+    else
+      char_ascii
+    end
+  end
+
+  def shift_within(char_ascii, lower_limit, upper_limit)
+    shifted_ascii = char_ascii + shift_key
+
+    return shifted_ascii if shifted_ascii <= upper_limit
+
+    lower_limit + (shifted_ascii - upper_limit - ROTATION_MODIFIER)
+  end
+end

data/tracks/ruby/exercises/rotational-cipher/rotational_cipher_test.rb

@@ -0,0 +1,77 @@
+require 'minitest/autorun'
+require_relative 'rotational_cipher'
+
+# Common test data version: 1.1.0 9c658d1
+class RotationalCipherTest < Minitest::Test
+  def test_rotate_a_by_0_same_output_as_input
+    # skip
+    assert_equal "a", RotationalCipher.rotate("a", 0)
+  end
+
+  def test_rotate_a_by_1
+    skip
+    assert_equal "b", RotationalCipher.rotate("a", 1)
+  end
+
+  def test_rotate_a_by_26_same_output_as_input
+    skip
+    assert_equal "a", RotationalCipher.rotate("a", 26)
+  end
+
+  def test_rotate_m_by_13
+    skip
+    assert_equal "z", RotationalCipher.rotate("m", 13)
+  end
+
+  def test_rotate_n_by_13_with_wrap_around_alphabet
+    skip
+    assert_equal "a", RotationalCipher.rotate("n", 13)
+  end
+
+  def test_rotate_capital_letters
+    skip
+    assert_equal "TRL", RotationalCipher.rotate("OMG", 5)
+  end
+
+  def test_rotate_spaces
+    skip
+    assert_equal "T R L", RotationalCipher.rotate("O M G", 5)
+  end
+
+  def test_rotate_numbers
+    skip
+    assert_equal "Xiwxmrk 1 2 3 xiwxmrk", RotationalCipher.rotate("Testing 1 2 3 testing", 4)
+  end
+
+  def test_rotate_punctuation
+    skip
+    assert_equal "Gzo'n zvo, Bmviyhv!", RotationalCipher.rotate("Let's eat, Grandma!", 21)
+  end
+
+  def test_rotate_all_letters
+    skip
+    assert_equal "Gur dhvpx oebja sbk whzcf bire gur ynml qbt.", RotationalCipher.rotate("The quick brown fox jumps over the lazy dog.", 13)
+  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, 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_equal 1, BookKeeping::VERSION
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.1
+  version: 2.2.1.2
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-07-24 00:00:00.000000000 Z
+date: 2017-07-25 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -3597,6 +3597,7 @@ files:
 - tracks/erlang/bin/journey-test.sh
 - tracks/erlang/config.json
 - tracks/erlang/config/exercise_readme.go.tmpl
+- tracks/erlang/config/maintainers.json
 - tracks/erlang/docs/ABOUT.md
 - tracks/erlang/docs/EXERCISE_README_INSERT.md
 - tracks/erlang/docs/INSTALLATION.md
@@ -4697,6 +4698,7 @@ files:
 - tracks/haskell/bin/test-stub
 - tracks/haskell/config.json
 - tracks/haskell/config/exercise_readme.go.tmpl
+- tracks/haskell/config/maintainers.json
 - tracks/haskell/docs/ABOUT.md
 - tracks/haskell/docs/EXERCISE_README_INSERT.md
 - tracks/haskell/docs/INSTALLATION.md
@@ -6127,6 +6129,9 @@ files:
 - tracks/javascript/exercises/strain/README.md
 - tracks/javascript/exercises/strain/example.js
 - tracks/javascript/exercises/strain/strain.spec.js
+- tracks/javascript/exercises/sublist/README.md
+- tracks/javascript/exercises/sublist/example.js
+- tracks/javascript/exercises/sublist/sublist.spec.js
 - tracks/javascript/exercises/sum-of-multiples/README.md
 - tracks/javascript/exercises/sum-of-multiples/example.js
 - tracks/javascript/exercises/sum-of-multiples/sum-of-multiples.spec.js
@@ -8430,32 +8435,44 @@ files:
 - tracks/pony/bin/install-deps
 - tracks/pony/bin/test-exercises
 - tracks/pony/config.json
+- tracks/pony/config/exercise_readme.go.tmpl
 - tracks/pony/docs/ABOUT.md
 - tracks/pony/docs/EXERCISE_README_INSERT.md
 - tracks/pony/docs/INSTALLATION.md
 - tracks/pony/docs/LEARNING.md
 - tracks/pony/docs/RESOURCES.md
 - tracks/pony/docs/TESTS.md
+- tracks/pony/exercises/anagram/README.md
 - tracks/pony/exercises/anagram/example.pony
 - tracks/pony/exercises/anagram/test.pony
+- tracks/pony/exercises/atbash-cipher/README.md
 - tracks/pony/exercises/atbash-cipher/example.pony
 - tracks/pony/exercises/atbash-cipher/test.pony
+- tracks/pony/exercises/beer-song/README.md
 - tracks/pony/exercises/beer-song/example.pony
 - tracks/pony/exercises/beer-song/test.pony
+- tracks/pony/exercises/bob/README.md
 - tracks/pony/exercises/bob/example.pony
 - tracks/pony/exercises/bob/test.pony
+- tracks/pony/exercises/difference-of-squares/README.md
 - tracks/pony/exercises/difference-of-squares/example.pony
 - tracks/pony/exercises/difference-of-squares/test.pony
+- tracks/pony/exercises/hamming/README.md
 - tracks/pony/exercises/hamming/example.pony
 - tracks/pony/exercises/hamming/test.pony
+- tracks/pony/exercises/hello-world/README.md
 - tracks/pony/exercises/hello-world/example.pony
 - tracks/pony/exercises/hello-world/test.pony
+- tracks/pony/exercises/leap/README.md
 - tracks/pony/exercises/leap/example.pony
 - tracks/pony/exercises/leap/test.pony
+- tracks/pony/exercises/pascals-triangle/README.md
 - tracks/pony/exercises/pascals-triangle/example.pony
 - tracks/pony/exercises/pascals-triangle/test.pony
+- tracks/pony/exercises/rna-transcription/README.md
 - tracks/pony/exercises/rna-transcription/example.pony
 - tracks/pony/exercises/rna-transcription/test.pony
+- tracks/pony/exercises/roman-numerals/README.md
 - tracks/pony/exercises/roman-numerals/example.pony
 - tracks/pony/exercises/roman-numerals/test.pony
 - tracks/pony/img/icon.png
@@ -9251,6 +9268,7 @@ files:
 - tracks/ruby/bin/setup-git-hoooks
 - tracks/ruby/config.json
 - tracks/ruby/config/exercise_readme.go.tmpl
+- tracks/ruby/config/maintainers.json
 - tracks/ruby/docs/24pullrequests.md
 - tracks/ruby/docs/ABOUT.md
 - tracks/ruby/docs/EXERCISE_README_INSERT.md
@@ -9533,6 +9551,10 @@ files:
 - tracks/ruby/exercises/roman-numerals/.meta/solutions/roman_numerals.rb
 - tracks/ruby/exercises/roman-numerals/README.md
 - tracks/ruby/exercises/roman-numerals/roman_numerals_test.rb
+- tracks/ruby/exercises/rotational-cipher/.meta/.version
+- tracks/ruby/exercises/rotational-cipher/.meta/generator/rotational_cipher_case.rb
+- tracks/ruby/exercises/rotational-cipher/.meta/solutions/rotational_cipher.rb
+- tracks/ruby/exercises/rotational-cipher/rotational_cipher_test.rb
 - tracks/ruby/exercises/run-length-encoding/.meta/.version
 - tracks/ruby/exercises/run-length-encoding/.meta/generator/run_length_encoding_case.rb
 - tracks/ruby/exercises/run-length-encoding/.meta/solutions/run_length_encoding.rb