trackler 2.2.1.80 → 2.2.1.81

data/tracks/csharp/exercises/octal/README.md

@@ -0,0 +1,55 @@
+# Octal
+
+Convert an octal number, represented as a string (e.g. '1735263'), to its
+decimal equivalent using first principles (i.e. no, you may not use built-in or
+external libraries to accomplish the conversion).
+
+Implement octal to decimal conversion.  Given an octal input
+string, your program should produce a decimal output.
+
+## Note
+- Implement the conversion yourself.
+  Do not use something else to perform the conversion for you.
+- Treat invalid input as octal 0.
+
+## About Octal (Base-8)
+Decimal is a base-10 system.
+
+A number 233 in base 10 notation can be understood
+as a linear combination of powers of 10:
+
+- The rightmost digit gets multiplied by 10^0 = 1
+- The next number gets multiplied by 10^1 = 10
+- ...
+- The *n*th number gets multiplied by 10^*(n-1)*.
+- All these values are summed.
+
+So:
+```
+   233 # decimal
+ = 2*10^2 + 3*10^1 + 3*10^0
+ = 2*100  + 3*10   + 3*1
+```
+
+Octal is similar, but uses powers of 8 rather than powers of 10.
+
+So:
+```
+   233 # octal
+ = 2*8^2 + 3*8^1 + 3*8^0
+ = 2*64  + 3*8   + 3*1
+ = 128   + 24    + 3
+ = 155
+```
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the exercise file that you're submitting is in the `exercism/csharp/<exerciseName>` directory.
+
+For example, if you're submitting `bob.cs` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/csharp/bob/bob.cs`.
+## Source
+
+All of Computer Science [http://www.wolframalpha.com/input/?i=base+8](http://www.wolframalpha.com/input/?i=base+8)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/csharp/exercises/trinary/Example.cs

@@ -0,0 +1,24 @@
+using System;
+using System.Linq;
+
+public class Trinary
+{
+    public static int ToDecimal(string trinary)
+    {
+        if (IsNotValidTrinary(trinary)) return 0;
+
+        return trinary
+            .Select((c, i) => int.Parse(c.ToString()) * ThreeToThePowerOf(trinary.Length - i - 1))
+            .Sum();
+    }
+
+    private static bool IsNotValidTrinary(string trinary)
+    {
+        return !trinary.All(x => char.IsDigit(x) && int.Parse(x.ToString()) < 3);
+    }
+
+    private static int ThreeToThePowerOf(int power)
+    {
+        return (int)Math.Pow(3, power);
+    }
+}

data/tracks/csharp/exercises/trinary/README.md

@@ -0,0 +1,34 @@
+# Trinary
+
+Convert a trinary number, represented as a string (e.g. '102012'), to its
+decimal equivalent using first principles.
+
+The program should consider strings specifying an invalid trinary as the
+value 0.
+
+Trinary numbers contain three symbols: 0, 1, and 2.
+
+The last place in a trinary number is the 1's place. The second to last
+is the 3's place, the third to last is the 9's place, etc.
+
+```bash
+# "102012"
+    1       0       2       0       1       2    # the number
+1*3^5 + 0*3^4 + 2*3^3 + 0*3^2 + 1*3^1 + 2*3^0    # the value
+  243 +     0 +    54 +     0 +     3 +     2 =  302
+```
+
+If your language provides a method in the standard library to perform the
+conversion, pretend it doesn't exist and implement it yourself.
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the exercise file that you're submitting is in the `exercism/csharp/<exerciseName>` directory.
+
+For example, if you're submitting `bob.cs` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/csharp/bob/bob.cs`.
+## Source
+
+All of Computer Science [http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-](http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/csharp/exercises/trinary/Trinary.cs

@@ -0,0 +1,9 @@
+using System;
+
+public class Trinary
+{
+    public static int ToDecimal(string trinary)
+    {
+        throw new NotImplementedException("You need to implement this function.");
+    }
+}

data/tracks/csharp/exercises/trinary/Trinary.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/trinary/TrinaryTest.cs

@@ -0,0 +1,70 @@
+using Xunit;
+
+public class TrinaryTest
+{
+    [Fact]
+    public void Trinary_1_is_decimal_1()
+    {
+        Assert.Equal(1, Trinary.ToDecimal("1"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_2_is_decimal_2()
+    {
+        Assert.Equal(2, Trinary.ToDecimal("2"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_10_is_decimal_3()
+    {
+        Assert.Equal(3, Trinary.ToDecimal("10"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_11_is_decimal_4()
+    {
+        Assert.Equal(4, Trinary.ToDecimal("11"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_100_is_decimal_9()
+    {
+        Assert.Equal(9, Trinary.ToDecimal("100"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_112_is_decimal_14()
+    {
+        Assert.Equal(14, Trinary.ToDecimal("112"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_222_is_decimal_26()
+    {
+        Assert.Equal(26, Trinary.ToDecimal("222"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Trinary_1122000120_is_decimal_32091()
+    {
+        Assert.Equal(32091, Trinary.ToDecimal("1122000120"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Invalid_trinary_digits_returns_0()
+    {
+        Assert.Equal(0, Trinary.ToDecimal("1234"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Invalid_word_as_input_returns_0()
+    {
+        Assert.Equal(0, Trinary.ToDecimal("carrot"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Invalid_numbers_with_letters_as_input_returns_0()
+    {
+        Assert.Equal(0, Trinary.ToDecimal("0a1b2c"));
+    }
+}

data/tracks/delphi/exercises/isbn-verifier/uTestISBNVerifier.pas

@@ -4,6 +4,9 @@ interface
 uses
   DUnitX.TestFramework;
 
+const
+  CanonicalVersion = '2.2.0';
+
 type
   [TestFixture]
   ISBNVerifierTest = class(TObject)
@@ -59,6 +62,10 @@ type
     [Test]
     [Ignore]
     procedure check_digit_of_X_should_not_be_used_for_0;
+
+    [Test]
+    [Ignore]
+    procedure empty_ISBN;
   end;
 
 implementation
@@ -76,6 +83,11 @@ begin
   Assert.IsFalse(TIsbn.isValid('3-598-21515-X'));
 end;
 
+procedure ISBNVerifierTest.empty_ISBN;
+begin
+  Assert.IsFalse(TIsbn.isValid(''))
+end;
+
 procedure ISBNVerifierTest.invalid_character_in_isbn;
 begin
   Assert.IsFalse(TIsbn.isValid('3-598-2K507-0'))

data/tracks/fsharp/config.json

@@ -1234,6 +1234,26 @@
       ],
       "unlocked_by": "two-fer",
       "uuid": "a6082751-98ca-45dc-aeed-cdd19a8da0ca"
+    },
+    {
+      "uuid": "df8f4106-c1ce-4c33-86b2-ad61ba5ccc4a",
+      "slug": "binary",
+      "deprecated": true
+    },
+    {
+      "uuid": "81904afe-a893-45be-99f8-2e074a6f1ad5",
+      "slug": "trinary",
+      "deprecated": true
+    },
+    {
+      "uuid": "f29f9e56-c79b-4ae4-a0d0-29db78c677e4",
+      "slug": "octal",
+      "deprecated": true
+    },
+    {
+      "uuid": "f4f80d57-a248-49d3-9329-587eb2643d4f",
+      "slug": "hexadecimal",
+      "deprecated": true
     }
   ],
   "foregone": [
@@ -1244,4 +1264,4 @@
     "counter"
   ],
   "language": "F#"
-}
+}

data/tracks/fsharp/exercises/binary/Binary.fs

@@ -0,0 +1,3 @@
+module Binary
+
+let toDecimal (input: string): int = failwith "You need to implement this function."

data/tracks/fsharp/exercises/binary/Binary.fsproj

@@ -0,0 +1,23 @@
+<Project Sdk="Microsoft.NET.Sdk">
+
+  <PropertyGroup>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
+
+    <IsPackable>false</IsPackable>
+  </PropertyGroup>
+
+  <ItemGroup>
+    <Compile Include="Binary.fs" />
+    <Compile Include="BinaryTest.fs" />
+    <Compile Include="Program.fs" />
+  </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" />
+    <PackageReference Include="FsUnit.xUnit" Version="3.0.0" />
+    <DotNetCliToolReference Include="dotnet-xunit" Version="2.3.1" />
+  </ItemGroup>
+
+</Project>

data/tracks/fsharp/exercises/binary/BinaryTest.fs

@@ -0,0 +1,67 @@
+module BinaryTest
+
+open FsUnit.Xunit
+open Xunit
+
+open Binary
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_0_is_decimal_0`` () =
+    toDecimal "0" |> should equal 0
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_1_is_decimal_1`` () =
+    toDecimal "1" |> should equal 1
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_10_is_decimal_2`` () =
+    toDecimal "10" |> should equal 2
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_11_is_decimal_3`` () =
+    toDecimal "11" |> should equal 3
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_100_is_decimal_4`` () =
+    toDecimal "100" |> should equal 4
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_1001_is_decimal_9`` () =
+    toDecimal "1001" |> should equal 9
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_11010_is_decimal_26`` () =
+    toDecimal "11010" |> should equal 26
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_10001101000_is_decimal_1128`` () =
+    toDecimal "10001101000" |> should equal 1128
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Binary_ignores_leading_zeros`` () =
+    toDecimal "000011111" |> should equal 31
+
+[<Fact(Skip = "Remove to run test")>]
+let ``2_is_not_a_valid_binary_digit`` () =
+    toDecimal "2" |> should equal 0
+
+[<Fact(Skip = "Remove to run test")>]
+let ``A_number_containing_a_non_binary_digit_is_invalid`` () =
+    toDecimal "01201" |> should equal 0
+
+[<Fact(Skip = "Remove to run test")>]
+let ``A_number_with_trailing_non_binary_characters_is_invalid`` () =
+    toDecimal "10nope" |> should equal 0
+
+[<Fact(Skip = "Remove to run test")>]
+let ``A_number_with_leading_non_binary_characters_is_invalid`` () =
+    toDecimal "nope10" |> should equal 0
+
+[<Fact(Skip = "Remove to run test")>]
+let ``A_number_with_internal_non_binary_characters_is_invalid`` () =
+    toDecimal "10nope10" |> should equal 0
+
+[<Fact(Skip = "Remove to run test")>]
+let ``A_number_and_a_word_whitespace_separated_is_invalid`` () =
+    toDecimal "001 nope" |> should equal 0
+

data/tracks/fsharp/exercises/binary/Example.fs

@@ -0,0 +1,13 @@
+module Binary
+
+let isValid char = 
+    match char with
+    | '0' | '1' -> true
+    | _  -> false
+
+let charToDecimal char = (int)char - (int)'0'
+
+let toDecimal(input: string) = 
+    let chars = input.ToCharArray()
+    if Array.forall isValid chars then Array.fold (fun acc c -> acc * 2 + charToDecimal c) 0 chars
+    else 0

data/tracks/fsharp/exercises/binary/Program.fs

@@ -0,0 +1 @@
+module Program = let [<EntryPoint>] main _ = 0

data/tracks/fsharp/exercises/binary/README.md

@@ -0,0 +1,35 @@
+# Binary
+
+Convert a binary number, represented as a string (e.g. '101010'), to its decimal equivalent using first principles.
+
+Implement binary to decimal conversion. Given a binary input
+string, your program should produce a decimal output. The
+program should handle invalid inputs.
+
+## Note
+- Implement the conversion yourself.
+  Do not use something else to perform the conversion for you.
+
+## About Binary (Base-2)
+Decimal is a base-10 system.
+
+A number 23 in base 10 notation can be understood
+as a linear combination of powers of 10:
+
+- The rightmost digit gets multiplied by 10^0 = 1
+- The next number gets multiplied by 10^1 = 10
+- ...
+- The *n*th number gets multiplied by 10^*(n-1)*.
+- All these values are summed.
+
+So: `23 => 2*10^1 + 3*10^0 => 2*10 + 3*1 = 23 base 10`
+
+Binary is similar, but uses powers of 2 rather than powers of 10.
+
+So: `101 => 1*2^2 + 0*2^1 + 1*2^0 => 1*4 + 0*2 + 1*1 => 4 + 1 => 5 base 10`.
+## Source
+
+All of Computer Science [http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-](http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/fsharp/exercises/hexadecimal/Example.fs

@@ -0,0 +1,14 @@
+module Hexadecimal
+
+open System
+
+let private isValid char = "0123456789ABCDEF".Contains(string char)
+
+let private charToDecimal (char: char) =
+    if Char.IsDigit(char) then (int)char - (int)'0'
+    else (int)(char) - (int)'A' + 10
+
+let toDecimal(input: string) = 
+    let chars = input.ToUpperInvariant().ToCharArray()
+    if Array.forall isValid chars then Array.fold (fun acc c -> acc * 16 + charToDecimal c) 0 chars
+    else 0