trackler 2.2.1.133 → 2.2.1.134

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 823d7cfe149655bf74ac3093c3948cd9e385e612
-  data.tar.gz: 42596817dd6559ca7642e6eb9ceb543dc9055751
+  metadata.gz: c199b6b186e79a6addc55c7b4c2ff2f43c3c39f6
+  data.tar.gz: c1c6657ba396dcb12f60736f1a09509e3c1eaf7c
 SHA512:
-  metadata.gz: d07624593c2464b858dbf6c2f6bf7c78d38451b1f0a579d8321e9a8a3a3e2632bd5f127d09f3c96e4125603e43193260d8e7c2612001b14b9f319f3e34835ece
-  data.tar.gz: 20c3e8d8037e8fb4130997771cc0886c83f214c94a7a0060870af86d9e5ba18d449e7d56430bfa29c96404f0d0c4e890ca208165cd573c9ed32e9169ffac104a
+  metadata.gz: d8be6e7f925daa5c522612b69e7023de0c4d1708655dc85dd31b8bc48e954f3fcdf7220db6a0b4ecdf1d413f44f719e629aa23f3e4f39179cb65a383504140d3
+  data.tar.gz: 49926783363b14e9328ebfa736c8f72cedf49e9aefccd98e81d5f71ffb80f728032884189caa0afa6675f267402c8642b4c98ba27d29af492efa75665c0654a3

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.133"
+  VERSION = "2.2.1.134"
 end

data/tracks/csharp/config.json

@@ -135,6 +135,16 @@
       "unlocked_by": "sum-of-multiples",
       "uuid": "8150604d-4cdc-414a-a523-dd65ac536f0e"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "rational-numbers",
+      "topics": [
+        "mathematics"
+      ],
+      "unlocked_by": "leap",
+      "uuid": "9ae7f7ed-75d8-4d03-967c-53846634ae07"
+    },
     {
       "core": true,
       "difficulty": 3,

data/tracks/csharp/exercises/Exercises.sln

@@ -228,6 +228,8 @@ Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "ArmstrongNumbers", "armstro
 EndProject
 Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "Yacht", "yacht\Yacht.csproj", "{C029D4C6-3A10-459E-96D7-3E77170A5A10}"
 EndProject
+Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "RationalNumbers", "rational-numbers\RationalNumbers.csproj", "{0CBB430D-BF64-436F-93BE-8E8088DBCBFE}"
+EndProject
 Global
 	GlobalSection(SolutionConfigurationPlatforms) = preSolution
 		Debug|Any CPU = Debug|Any CPU
@@ -686,6 +688,10 @@ Global
 		{C029D4C6-3A10-459E-96D7-3E77170A5A10}.Debug|Any CPU.Build.0 = Debug|Any CPU
 		{C029D4C6-3A10-459E-96D7-3E77170A5A10}.Release|Any CPU.ActiveCfg = Release|Any CPU
 		{C029D4C6-3A10-459E-96D7-3E77170A5A10}.Release|Any CPU.Build.0 = Release|Any CPU
+		{0CBB430D-BF64-436F-93BE-8E8088DBCBFE}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{0CBB430D-BF64-436F-93BE-8E8088DBCBFE}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{0CBB430D-BF64-436F-93BE-8E8088DBCBFE}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{0CBB430D-BF64-436F-93BE-8E8088DBCBFE}.Release|Any CPU.Build.0 = Release|Any CPU
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
 		HideSolutionNode = FALSE

data/tracks/csharp/exercises/rational-numbers/Example.cs

@@ -0,0 +1,167 @@
+using System;
+using System.Diagnostics;
+
+public static class RealNumberExtension
+{
+    // exponentiate real number to the rational number power
+    public static double Expreal(this int realNumber, RationalNumber r)
+    {
+        return r.Expreal(realNumber);
+    }
+}
+
+[DebuggerDisplay("{Numerator} / {Denominator}")]
+public struct RationalNumber
+{
+    public RationalNumber(int numerator, int denominator)
+    {
+        this.Numerator = numerator;
+        this.Denominator = denominator;
+    }
+
+    public int Numerator { get; }
+    public int Denominator { get; }
+
+    public RationalNumber Add(RationalNumber r)
+    {
+        return ReducedRationalNumber(this.Numerator * r.Denominator + this.Denominator * r.Numerator, this.Denominator * r.Denominator);
+    }
+
+    public static RationalNumber operator+ (RationalNumber r1, RationalNumber r2)
+    {
+        return r1.Add(r2);
+    }
+
+    public RationalNumber Sub(RationalNumber r)
+    {
+        return ReducedRationalNumber(this.Numerator * r.Denominator - this.Denominator * r.Numerator, this.Denominator * r.Denominator);
+    }
+
+    public static RationalNumber operator -(RationalNumber r1, RationalNumber r2)
+    {
+        return r1.Sub(r2);
+    }
+
+    public RationalNumber Mul(RationalNumber r)
+    {
+        if (this.Numerator == 0) return new RationalNumber(0, 1);
+        return ReducedRationalNumber(this.Numerator * r.Numerator, this.Denominator * r.Denominator);
+    }
+
+    public static RationalNumber operator *(RationalNumber r1, RationalNumber r2)
+    {
+        return r1.Mul(r2);
+    }
+
+    public RationalNumber Div(RationalNumber r)
+    {
+        return ReducedRationalNumber(this.Numerator * r.Denominator, this.Denominator * r.Numerator);
+    }
+
+    public static RationalNumber operator /(RationalNumber r1, RationalNumber r2)
+    {
+        return r1.Div(r2);
+    }
+
+    public RationalNumber Abs()
+    {
+        return new RationalNumber(Abs(this.Numerator), Abs(this.Denominator));
+    }
+
+    public RationalNumber Reduce()
+    {
+        if (this.Denominator == 0) return new RationalNumber(this.Numerator, this.Denominator);
+        else if (this.Numerator == 0) return new RationalNumber(0, 1);
+
+        var a = Abs(this.Numerator);
+        var b = Abs(this.Denominator);
+
+        var sign = Sign(this.Numerator) * Sign(this.Denominator);
+
+        return new RationalNumber(sign * a / GreatestCommonDenominator(a, b), b / GreatestCommonDenominator(a, b));
+    }
+
+    public RationalNumber Exprational(int power)
+    {
+        if (power == 0) return new RationalNumber(1, 1);
+
+        return ReducedRationalNumber
+            (
+                (Sign(this.Numerator) / Sign(this.Denominator)) *
+                Abs((int)Pow(this.Numerator, power)),
+                Abs((int)Pow(this.Denominator, power))
+            );
+    }
+
+    public double Expreal(int baseNumber)
+    {
+        if (this.Numerator == 0)
+            return 1;
+        else
+            return Pow(baseNumber);
+    }
+
+    private static RationalNumber ReducedRationalNumber(int numerator, int denominator)
+    {
+        return new RationalNumber(numerator, denominator).Reduce();
+    }
+
+    private double Pow(int baseNumber)
+    {
+        return NthRoot((Sign(this.Numerator) == Sign(this.Denominator) ?
+                        Pow(baseNumber, Abs(this.Numerator)) :
+                        1d / Pow(baseNumber, Abs(this.Numerator))),
+                        Abs(this.Denominator));
+    }
+
+    private int Abs(int value)
+    {
+        return (value > 0) ? value : -value;
+    }
+
+    private double Abs(double value)
+    {
+        return (value > 0) ? value : -value;
+    }
+
+    private int Sign(int value)
+    {
+        return (value > 0) ? 1 : -1;
+    }
+
+    private int GreatestCommonDenominator(int a, int b)
+    {
+        var x = Abs(a);
+        var y = Abs(b);
+
+        while (x != 0 && y != 0)
+            if (x > y) x %= y; else y %= x;
+        return x == 0 ? y : x;
+    }
+
+    private double Pow(double baseValue, int exp)
+    {
+        double result = 1.0;
+        while (exp != 0)
+        {
+            if ((exp & 1) != 0) result *= baseValue;
+            baseValue *= baseValue;
+            exp >>= 1;
+        }
+        return result;
+    }
+
+    private double NthRoot(double baseValue, int n)
+    {
+        if (n == 1) return baseValue;
+        double deltaX;
+        double x = 0.1;
+        do
+        {
+            deltaX = ((double)baseValue / Pow(x, (n - 1)) - x) / n;
+            x = x + deltaX;
+        }
+        while (Abs(deltaX) > 0);
+        return x;
+    }
+}

data/tracks/csharp/exercises/rational-numbers/README.md

@@ -0,0 +1,27 @@
+A rational number is defined as the quotient of two integers `a` and `b`, called the numerator and denominator, respectively, where `b != 0`.
+
+The absolute value `|r|` of the rational number `r = a/b` is equal to `|a|/|b|`.
+
+The sum of two rational numbers `r1 = a1/b1` and `r2 = a2/b2` is `r1 + r2 = a1/b1 + a2/b2 = (a1 * b2 + a2 * b1) / (b1 * b2)`.
+
+The difference of two rational numbers `r1 = a1/b1` and `r2 = a2/b2` is `r1 - r2 = a1/b1 - a2/b2 = (a1 * b2 - a2 * b1) / (b1 * b2)`.
+
+The product (multiplication) of two rational numbers `r1 = a1/b1` and `r2 = a2/b2` is `r1 * r2 = (a1 * a2) / (b1 * b2)`.
+
+Dividing a rational number `r1 = a1/b1` by another `r2 = a2/b2` is `r1 / r2 = (a1 * b2) / (a2 * b1)` if `a2 * b1` is not zero.
+
+Exponentiation of a rational number `r = a/b` to a non-negative integer power `n` is `r^n = (a^n)/(b^n)`.
+
+Exponentiation of a rational number `r = a/b` to a negative integer power `n` is `r^n = (b^m)/(a^m)`, where `m = |n|`.
+
+Exponentiation of a rational number `r = a/b` to a real (floating-point) number `x` is the quotient `(a^x)/(b^x)`, which is a real number.
+
+Exponentiation of a real number `x` to a rational number `r = a/b` is `x^(a/b) = root(x^a, b)`, where `root(p, q)` is the `q`th root of `p`.
+
+Implement the following operations:
+ - addition, subtraction, multiplication and division of two rational numbers,
+ - absolute value, exponentiation of a given rational number to an integer power, exponentiation of a given rational number to a real (floating-point) power, exponentiation of a real number to a rational number.
+
+Your implementation of rational numbers should always be reduced to lowest terms. For example, `4/4` should reduce to `1/1`, `30/60` should reduce to `1/2`, `12/8` should reduce to `3/2`, etc. To reduce a rational number `r = a/b`, divide `a` and `b` by the greatest common divisor (gcd) of `a` and `b`. So, for example, `gcd(12, 8) = 4`, so `r = 12/8` can be reduced to `(12/4)/(8/4) = 3/2`.
+
+Assume that the programming language you are using does not have an implementation of rational numbers.

data/tracks/csharp/exercises/rational-numbers/RationalNumbers.cs

@@ -0,0 +1,77 @@
+using System;
+using System.Diagnostics;
+
+public static class RealNumberExtension
+{
+    public static double Expreal(this int realNumber, RationalNumber r)
+    {
+        throw new NotImplementedException("You need to implement this extension method.");
+    }
+}
+
+public struct RationalNumber
+{
+    public RationalNumber(int numerator, int denominator)
+    {
+    }
+
+    public RationalNumber Add(RationalNumber r)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public static RationalNumber operator +(RationalNumber r1, RationalNumber r2)
+    {
+        throw new NotImplementedException("You need to implement this operator.");
+    }
+
+    public RationalNumber Sub(RationalNumber r)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public static RationalNumber operator -(RationalNumber r1, RationalNumber r2)
+    {
+        throw new NotImplementedException("You need to implement this operator.");
+    }
+
+    public RationalNumber Mul(RationalNumber r)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public static RationalNumber operator *(RationalNumber r1, RationalNumber r2)
+    {
+        throw new NotImplementedException("You need to implement this operator.");
+    }
+
+    public RationalNumber Div(RationalNumber r)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public static RationalNumber operator /(RationalNumber r1, RationalNumber r2)
+    {
+        throw new NotImplementedException("You need to implement this operator.");
+    }
+
+    public RationalNumber Abs()
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public RationalNumber Reduce()
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public RationalNumber Exprational(int power)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+
+    public double Expreal(int baseNumber)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+}

data/tracks/csharp/exercises/rational-numbers/RationalNumbers.csproj

@@ -0,0 +1,17 @@
+<Project Sdk="Microsoft.NET.Sdk">
+
+  <PropertyGroup>    
+    <TargetFramework>netcoreapp2.0</TargetFramework>
+  </PropertyGroup>
+
+  <ItemGroup>
+    <Compile Remove="Example.cs" />
+  </ItemGroup>
+
+  <ItemGroup>
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.5.0" />
+    <PackageReference Include="xunit" Version="2.3.1" />
+    <PackageReference Include="xunit.runner.visualstudio" Version="2.3.1" />
+  </ItemGroup>
+
+</Project>

data/tracks/csharp/exercises/rational-numbers/RationalNumbersTest.cs

@@ -0,0 +1,222 @@
+// This file was auto-generated based on version 1.0.0 of the canonical data.
+
+using Xunit;
+
+public class RationalNumbersTest
+{
+    [Fact]
+    public void Add_two_positive_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (7, 6), new RationalNumber(1, 2) + (new RationalNumber(2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Add_a_positive_rational_number_and_a_negative_rational_number()
+    {
+        Assert.Equal(new RationalNumber (-1, 6), new RationalNumber(1, 2) + (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Add_two_negative_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (-7, 6), new RationalNumber(-1, 2) + (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Add_a_rational_number_to_its_additive_inverse()
+    {
+        Assert.Equal(new RationalNumber (0, 1), new RationalNumber(1, 2) + (new RationalNumber(-1, 2)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Subtract_two_positive_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (-1, 6), new RationalNumber(1, 2) - (new RationalNumber(2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Subtract_a_positive_rational_number_and_a_negative_rational_number()
+    {
+        Assert.Equal(new RationalNumber (7, 6), new RationalNumber(1, 2) - (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Subtract_two_negative_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (1, 6), new RationalNumber(-1, 2) - (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Subtract_a_rational_number_from_itself()
+    {
+        Assert.Equal(new RationalNumber (0, 1), new RationalNumber(1, 2) - (new RationalNumber(1, 2)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Multiply_two_positive_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (1, 3), new RationalNumber(1, 2) * (new RationalNumber(2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Multiply_a_negative_rational_number_by_a_positive_rational_number()
+    {
+        Assert.Equal(new RationalNumber (-1, 3), new RationalNumber(-1, 2) * (new RationalNumber(2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Multiply_two_negative_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (1, 3), new RationalNumber(-1, 2) * (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Multiply_a_rational_number_by_its_reciprocal()
+    {
+        Assert.Equal(new RationalNumber (1, 1), new RationalNumber(1, 2) * (new RationalNumber(2, 1)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Multiply_a_rational_number_by_1()
+    {
+        Assert.Equal(new RationalNumber (1, 2), new RationalNumber(1, 2) * (new RationalNumber(1, 1)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Multiply_a_rational_number_by_0()
+    {
+        Assert.Equal(new RationalNumber (0, 1), new RationalNumber(1, 2) * (new RationalNumber(0, 1)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Divide_two_positive_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (3, 4), new RationalNumber(1, 2) / (new RationalNumber(2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Divide_a_positive_rational_number_by_a_negative_rational_number()
+    {
+        Assert.Equal(new RationalNumber (-3, 4), new RationalNumber(1, 2) / (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Divide_two_negative_rational_numbers()
+    {
+        Assert.Equal(new RationalNumber (3, 4), new RationalNumber(-1, 2) / (new RationalNumber(-2, 3)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Divide_a_rational_number_by_1()
+    {
+        Assert.Equal(new RationalNumber (1, 2), new RationalNumber(1, 2) / (new RationalNumber(1, 1)));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Absolute_value_of_a_positive_rational_number()
+    {
+        Assert.Equal(new RationalNumber (1, 2), new RationalNumber(1, 2).Abs());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Absolute_value_of_a_negative_rational_number()
+    {
+        Assert.Equal(new RationalNumber (1, 2), new RationalNumber(-1, 2).Abs());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Absolute_value_of_zero()
+    {
+        Assert.Equal(new RationalNumber (0, 1), new RationalNumber(0, 1).Abs());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_positive_rational_number_to_a_positive_integer_power()
+    {
+        Assert.Equal(new RationalNumber (1, 8), new RationalNumber(1, 2).Exprational(3));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_negative_rational_number_to_a_positive_integer_power()
+    {
+        Assert.Equal(new RationalNumber (-1, 8), new RationalNumber(-1, 2).Exprational(3));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_zero_to_an_integer_power()
+    {
+        Assert.Equal(new RationalNumber (0, 1), new RationalNumber(0, 1).Exprational(5));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_one_to_an_integer_power()
+    {
+        Assert.Equal(new RationalNumber (1, 1), new RationalNumber(1, 1).Exprational(4));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_positive_rational_number_to_the_power_of_zero()
+    {
+        Assert.Equal(new RationalNumber (1, 1), new RationalNumber(1, 2).Exprational(0));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_negative_rational_number_to_the_power_of_zero()
+    {
+        Assert.Equal(new RationalNumber (1, 1), new RationalNumber(-1, 2).Exprational(0));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_real_number_to_a_positive_rational_number()
+    {
+        Assert.Equal(16, 8.Expreal(new RationalNumber(4, 3)),0);
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_real_number_to_a_negative_rational_number()
+    {
+        Assert.Equal(0.333333333333333, 9.Expreal(new RationalNumber(-1, 2)),15);
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Raise_a_real_number_to_a_zero_rational_number()
+    {
+        Assert.Equal(1, 2.Expreal(new RationalNumber(0, 1)),0);
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Reduce_a_positive_rational_number_to_lowest_terms()
+    {
+        Assert.Equal(new RationalNumber (1, 2), new RationalNumber(2, 4).Reduce());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Reduce_a_negative_rational_number_to_lowest_terms()
+    {
+        Assert.Equal(new RationalNumber (-2, 3), new RationalNumber(-4, 6).Reduce());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Reduce_a_rational_number_with_a_negative_denominator_to_lowest_terms()
+    {
+        Assert.Equal(new RationalNumber (-1, 3), new RationalNumber(3, -9).Reduce());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Reduce_zero_to_lowest_terms()
+    {
+        Assert.Equal(new RationalNumber (0, 1), new RationalNumber(0, 6).Reduce());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Reduce_an_integer_to_lowest_terms()
+    {
+        Assert.Equal(new RationalNumber (-2, 1), new RationalNumber(-14, 7).Reduce());
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Reduce_one_to_lowest_terms()
+    {
+        Assert.Equal(new RationalNumber (1, 1), new RationalNumber(13, 13).Reduce());
+    }
+}

data/tracks/csharp/exercises/rational-numbers/hints.md

@@ -0,0 +1,5 @@
+## Hints		
+This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx).
+
+This exercise also requires you to write operator overloading methods for +, -, * and / operators. For more information, see [this page](https://msdn.microsoft.com/en-us/library/5tk49fh2.aspx).
+

data/tracks/csharp/generators/Exercises/RationalNumbers.cs

@@ -0,0 +1,73 @@
+using Generators.Output;
+
+namespace Generators.Exercises
+{
+    public struct RationalNumber
+    {
+        public RationalNumber(int[] n)
+        {
+            this.Numerator = n[0];
+            this.Denominator = n[1];
+        }
+
+        public int Numerator { get; }
+        public int Denominator { get; }
+    }
+	
+    public class RationalNumbers : GeneratorExercise
+    {
+        protected override string RenderTestMethodBodyAssert(TestMethodBody testMethodBody)
+        {
+            var input = testMethodBody.CanonicalDataCase.Properties["input"] as System.Collections.Generic.Dictionary<string, object>;
+            var operation = testMethodBody.CanonicalDataCase.Properties["property"].ToString();
+            var expected = testMethodBody.CanonicalDataCase.Properties["expected"];
+			var operationName = char.ToUpper(operation[0]) + operation.Substring(1);			
+            string assertCodeLine = "";
+            string operationsWithOverloading = "add|+|sub|-|mul|*|div|/";
+            string operationCode = operationsWithOverloading.Substring(operationsWithOverloading.IndexOf(operation.ToLower()) + 4, 1);
+
+            switch (operation.ToLower())
+            {
+                case "add":
+                case "sub":
+                case "mul":
+                case "div":
+                    {                       
+                        var r1 = new RationalNumber((int[])input["r1"]);
+                        var r2 = new RationalNumber((int[])input["r2"]);
+                        var e = new RationalNumber((int[])expected);
+                        assertCodeLine = "Assert.Equal(" + $"new RationalNumber ({e.Numerator}, {e.Denominator}), new RationalNumber({r1.Numerator}, {r1.Denominator}) {operationCode} (new RationalNumber({r2.Numerator}, {r2.Denominator})));";
+                    }
+                    break;
+                case "abs":
+                case "reduce":
+                    {
+                        var r = new RationalNumber((int[])input["r"]);
+                        var e = new RationalNumber((int[])expected);
+                        assertCodeLine = "Assert.Equal(" + $"new RationalNumber ({e.Numerator}, {e.Denominator}), new RationalNumber({r.Numerator}, {r.Denominator}).{operationName}());";
+                    }
+                    break;
+                case "exprational":
+                    {
+                        var r = new RationalNumber((int[])input["r"]);
+                        var n = input["n"];
+                        var e = new RationalNumber((int[])expected);
+                        assertCodeLine = "Assert.Equal(" + $"new RationalNumber ({e.Numerator}, {e.Denominator}), new RationalNumber({r.Numerator}, {r.Denominator}).{operationName}({n}));";
+                    }
+                    break;
+                case "expreal":
+                    {
+                        var x = input["x"].ToString();
+                        var r = new RationalNumber((int[])input["r"]);
+                        var e = expected;
+                        var p = precision(e);
+                        assertCodeLine = "Assert.Equal(" + $"{e}, {x}.{operationName}(new RationalNumber({r.Numerator}, {r.Denominator})),{p});";						
+                    }
+                    break;
+            }
+            return TemplateRenderer.RenderInline(assertCodeLine, testMethodBody.AssertTemplateParameters);			
+        }
+
+        private static int precision(object rawValue) => rawValue.ToString().Split(new char[] { '.' }).Length <= 1 ? 0 : rawValue.ToString().Split(new char[] { '.' })[1].Length;
+    }
+}

data/tracks/java/exercises/all-your-base/.meta/version

@@ -1 +1 @@
-2.1.0
+2.3.0

data/tracks/java/exercises/all-your-base/src/test/java/BaseConverterTest.java

@@ -221,7 +221,7 @@ public class BaseConverterTest {
         expectedException.expect(IllegalArgumentException.class);
         expectedException.expectMessage("Bases must be at least 2.");
 
-        new BaseConverter(1, new int[]{});
+        new BaseConverter(1, new int[]{1});
     }
 
     @Ignore("Remove to run test")

data/tracks/java/exercises/roman-numerals/.meta/version

@@ -1 +1 @@
-1.0.0
+1.2.0

data/tracks/java/exercises/roman-numerals/src/test/java/RomanNumeralsTest.java

@@ -68,6 +68,13 @@ public class RomanNumeralsTest {
         romanNumeral = new RomanNumeral(48);
         assertEquals("XLVIII", romanNumeral.getRomanNumeral());
     }
+    
+    @Ignore("Remove to run test")
+    @Test
+    public void test49ToRomanNumberXLIX() {
+        romanNumeral = new RomanNumeral(49);
+        assertEquals("XLIX", romanNumeral.getRomanNumeral());
+    }
 
     @Ignore("Remove to run test")
     @Test

data/tracks/python/exercises/crypto-square/README.md

@@ -45,11 +45,10 @@ The message above is coded as:
 imtgdvsfearwermayoogoanouuiontnnlvtwttddesaohghnsseoau
 ```
 
-Output the encoded text in chunks.  Phrases that fill perfect rectangles
-`(r X c)` should be output `c` chunks of `r` length, separated by spaces.
-Phrases that do not fill perfect rectangles will have `n` empty spaces.
-Those spaces should be distributed evenly, added to the end of the last
-`n` chunks.
+Output the encoded text in chunks that fill perfect rectangles `(r X c)`,
+with `c` chunks of `r` length, separated by spaces. For phrases that are
+`n` characters short of the perfect rectangle, pad each of the last `n`
+chunks with a single trailing space.
 
 ```text
 imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau 

data/tracks/python/exercises/scale-generator/README.md

@@ -4,13 +4,13 @@ Given a tonic, or starting note, and a set of intervals, generate
 the musical scale starting with the tonic and following the
 specified interval pattern.
 
-Scales in Western music are based on the chromatic (12-note) scale.This
+Scales in Western music are based on the chromatic (12-note) scale. This
 scale can be expressed as the following group of pitches:
 
 A, A#, B, C, C#, D, D#, E, F, F#, G, G#
 
-A given sharp note (indicated by a #), can also be expressed as the flat
-of the note above it (indicated by a b), so the chromatic scale can also be
+A given sharp note (indicated by a #) can also be expressed as the flat
+of the note above it (indicated by a b) so the chromatic scale can also be
 written like this:
 
 A, Bb, B, C, Db, D, Eb, E, F, Gb, G, Ab
@@ -20,9 +20,9 @@ collection. They have seven pitches, and are called diatonic scales.
 The collection of notes in these scales is written with either sharps or
 flats, depending on the tonic. Here is a list of which are which:
 
-No Accidentals:
+No Sharps or Flats:
 C major
-A minor
+a minor
 
 Use Sharps:
 G, D, A, E, B, F# major
@@ -43,17 +43,10 @@ a "whole step" or "major second" (written as an upper-case "M"). The
 diatonic scales are built using only these two intervals between
 adjacent notes.
 
-Non-diatonic scales can contain the same letter twice, and can contain other intervals.
-Sometimes they may be smaller than usual (diminished, written "D"), or larger
-(augmented, written "A").  Intervals larger than an augmented second have other names.
-
-Here is a table of pitches with the names of their interval distance from the tonic (A).
-
-|   A    |    A#   |    B    |    C    |    C#   |    D    |    D#   |    E    |    F    |    F#   |    G    |    G#   |    A   |
-|:------:|:-------:|:-------:|:-------:|:-------:|:-------:|:-------:|:-------:|:-------:|:-------:|:-------:|:-------:|:------:|
-| Unison | Min 2nd | Maj 2nd | Min 3rd | Maj 3rd | Per 4th | Tritone | Per 5th | Min 6th | Maj 6th | Min 7th | Maj 7th | Octave |
-|        |         | Dim 3rd | Aug 2nd | Dim 4th |         | Aug 4th | Dim 5th | Aug 5th | Dim 7th | Aug 6th | Dim 8ve |        |
-|        |         |         |         |         |         | Dim 5th |         |         |         |         |         |        |
+Non-diatonic scales can contain other intervals.  An "augmented first"
+interval, written "A", has two interceding notes (e.g., from A to C or
+Db to E). There are also smaller and larger intervals, but they will not
+figure into this exercise.
 
 ## Exception messages
 

data/tracks/swift/config.json

@@ -861,7 +861,7 @@
         "mathematics",
         "tuples"
       ],
-      "unlocked_by": "leap",
+      "unlocked_by": null,
       "uuid": "5a918ed8-e840-46b8-b824-291d872d2224"
     },
     {

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.133
+  version: 2.2.1.134
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-04-15 00:00:00.000000000 Z
+date: 2018-04-16 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -2938,6 +2938,12 @@ files:
 - tracks/csharp/exercises/raindrops/Raindrops.cs
 - tracks/csharp/exercises/raindrops/Raindrops.csproj
 - tracks/csharp/exercises/raindrops/RaindropsTest.cs
+- tracks/csharp/exercises/rational-numbers/Example.cs
+- tracks/csharp/exercises/rational-numbers/README.md
+- tracks/csharp/exercises/rational-numbers/RationalNumbers.cs
+- tracks/csharp/exercises/rational-numbers/RationalNumbers.csproj
+- tracks/csharp/exercises/rational-numbers/RationalNumbersTest.cs
+- tracks/csharp/exercises/rational-numbers/hints.md
 - tracks/csharp/exercises/react/.meta/hints.md
 - tracks/csharp/exercises/react/Example.cs
 - tracks/csharp/exercises/react/README.md
@@ -3200,6 +3206,7 @@ files:
 - tracks/csharp/generators/Exercises/QueenAttack.cs
 - tracks/csharp/generators/Exercises/RailFenceCipher.cs
 - tracks/csharp/generators/Exercises/Raindrops.cs
+- tracks/csharp/generators/Exercises/RationalNumbers.cs
 - tracks/csharp/generators/Exercises/ReverseString.cs
 - tracks/csharp/generators/Exercises/RnaTranscription.cs
 - tracks/csharp/generators/Exercises/RobotSimulator.cs