trackler 2.0.8.1 → 2.0.8.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 31fb33c6f6d2b730536826f3f4636068f82e8fa6
-  data.tar.gz: a508d69520c86df66d8d401c138c8416309dee96
+  metadata.gz: 628be9992a422198cd22ca843fb2037ba6c03d72
+  data.tar.gz: 2ee76fac59c86929d2224dcaa3b4ca3843dc7f4b
 SHA512:
-  metadata.gz: c054cb72f146dad2bbc5d2f1db8b7dd1c5e2d335fc1354036ed49b7f3d59e5ea1a5675e7ed2f543ccd0543acd14edffaf7048ca9a333a55bdf528a8e2d2abb07
-  data.tar.gz: 91f5aac573c1b8180254ecf5000ad9d3e297f9731b478149dbd1df2c157ab3119f78b424f5590706a00cc81ee275369c62b2c4489fd847ff5eba5a1efbc48a79
+  metadata.gz: 950598d86876b07601a68378108358eeeceb09dac2a380d8d5cc607eaa8b6282d0ef2dcd660900dcede06a36b1e5d3fed69ae5ed8c522715b3320c68df20b75b
+  data.tar.gz: 1c2ba152ea54815a1be22d9224f210cfc0b6d0dd402020481666c914569f02b69a36417f7307dddd5ca342fd6ad6df6ea45bce30e9e4b87fb2ba4a4604caee2f

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.8.1"
+  VERSION = "2.0.8.2"
 end

data/tracks/fsharp/exercises/list-ops/Example.fs

@@ -5,7 +5,7 @@ let rec foldl folder state list =
     | [] -> state
     | x::xs -> foldl folder (folder state x) xs
 
-let rec foldr folder state list =
+let rec foldr folder list state =
     list
     |> List.rev
     |> foldl (fun acc item -> folder item acc) state
@@ -14,10 +14,10 @@ let length list = foldl (fun acc _ -> acc + 1) 0 list
 
 let reverse list = foldl (fun acc item -> item :: acc) [] list
 
-let map f list = foldr (fun item acc -> f item :: acc) [] list
+let map f list = foldr (fun item acc -> f item :: acc) list []
 
-let filter f list = foldr (fun item acc -> if f item then item :: acc else acc) [] list
+let filter f list = foldr (fun item acc -> if f item then item :: acc else acc) list []
 
-let append xs ys = foldr (fun item acc -> item :: acc) ys xs
+let append xs ys = foldr (fun item acc -> item :: acc) xs ys
 
-let concat xs = foldr append [] xs
+let concat xs = foldr append xs []

data/tracks/fsharp/exercises/list-ops/ListOpsTest.fs

@@ -80,12 +80,12 @@ let ``foldl is not just foldr . flip`` () =
 [<Test>]
 [<Ignore("Remove to run test")>]
 let ``foldr as id`` () =
-    Assert.That(foldr (fun item acc -> item :: acc) [] [1 .. big] = bigList, Is.True)
+    Assert.That(foldr (fun item acc -> item :: acc) [1 .. big] [] = bigList, Is.True)
 
 [<Test>]
 [<Ignore("Remove to run test")>]
 let ``foldr as append`` () =
-    Assert.That(foldr (fun item acc -> item :: acc) [100 .. big] [1 .. 99] = bigList, Is.True)
+    Assert.That(foldr (fun item acc -> item :: acc) [1 .. 99] [100 .. big] = bigList, Is.True)
 
 [<Test>]
 [<Ignore("Remove to run test")>]

data/tracks/go/exercises/TRACK_HINTS.md

@@ -1,3 +1,5 @@
+## Running the tests
+
 To run the tests run the command `go test` from within the exercise directory.
 
 If the test suite contains benchmarks, you can run these with the `-bench`
@@ -5,5 +7,7 @@ flag:
 
     go test -bench .
 
-For more detailed info about the Go track see the [help
-page](http://exercism.io/languages/go).
+## Further information
+
+For more detailed information about the Go track, including how to get help if
+you're having trouble, please visit the exercism.io [Go language page](http://exercism.io/languages/go/about).

data/tracks/go/exercises/series/asktoomuch_test.go

@@ -8,21 +8,21 @@ func TestAskTooMuch(t *testing.T) {
 	test := allTests[0]
 	defer func() {
 		if recover() != nil {
-			t.Fatalf("Yikes, UnsafeFirst(%d, %s) panicked!", test.n, test.s)
+			t.Fatalf("Yikes, UnsafeFirst(%d, %q) panicked!", test.n, test.s)
 		}
 	}()
 	for _, test = range allTests {
 		switch res := UnsafeFirst(test.n, test.s); {
 		case len(test.out) > 0: // well, this should work
 			if res != test.out[0] {
-				t.Fatalf("Yikes, UnsafeFirst(%d, %s) = %q, want %q.",
+				t.Fatalf("Yikes, UnsafeFirst(%d, %q) = %q, want %q.",
 					test.n, test.s, res, test.out[0])
 			}
 		case len(res) != test.n:
-			t.Fatalf("Yikes, UnsafeFirst(%d, %s) = %q, but %q doesn't have %d characters.",
+			t.Fatalf("Yikes, UnsafeFirst(%d, %q) = %q, but %q doesn't have %d characters.",
 				test.n, test.s, res, res, test.n)
 		default:
-			t.Fatalf("Yikes, UnsafeFirst(%d, %s) = %q, but %q isn't in %q",
+			t.Fatalf("Yikes, UnsafeFirst(%d, %q) = %q, but %q isn't in %q",
 				test.n, test.s, res, res, test.s)
 		}
 	}

data/tracks/go/exercises/series/example.go

@@ -1,5 +1,7 @@
 package slice
 
+const testVersion = 1
+
 func All(n int, s string) (r []string) {
 	for i := 0; n <= len(s); i++ {
 		r = append(r, s[i:n])

data/tracks/go/exercises/series/first_test.go

@@ -9,14 +9,14 @@ func TestFirst(t *testing.T) {
 		switch res, ok := First(test.n, test.s); {
 		case !ok:
 			if len(test.out) > 0 {
-				t.Fatalf("First(%d, %s) returned !ok, want ok.",
+				t.Fatalf("First(%d, %q) returned !ok, want ok.",
 					test.n, test.s)
 			}
 		case len(test.out) == 0:
-			t.Fatalf("First(%d, %s) = %s, %t.  Expected ok == false",
+			t.Fatalf("First(%d, %q) = %q, %t.  Expected ok == false",
 				test.n, test.s, res, ok)
 		case res != test.out[0]:
-			t.Fatalf("First(%d, %s) = %s.  Want %s.",
+			t.Fatalf("First(%d, %q) = %q.  Want %q.",
 				test.n, test.s, res, test.out[0])
 		}
 	}

data/tracks/go/exercises/series/series_test.go

@@ -34,6 +34,8 @@ import (
 	"testing"
 )
 
+const targetTestVersion = 1
+
 var allTests = []struct {
 	n   int
 	s   string
@@ -69,13 +71,19 @@ var allTests = []struct {
 
 var cx = "01032987583"
 
+func TestTestVersion(t *testing.T) {
+	if testVersion != targetTestVersion {
+		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
+	}
+}
+
 func TestAll(t *testing.T) {
 	for _, test := range allTests {
 		switch res := All(test.n, test.s); {
 		case len(res) == 0 && len(test.out) == 0:
 		case reflect.DeepEqual(res, test.out):
 		default:
-			t.Fatalf("All(%d, %s) = %v, want %v.",
+			t.Fatalf("All(%d, %q) = %q, want %q.",
 				test.n, test.s, res, test.out)
 		}
 	}
@@ -87,7 +95,7 @@ func TestUnsafeFirst(t *testing.T) {
 			continue
 		}
 		if res := UnsafeFirst(test.n, test.s); res != test.out[0] {
-			t.Fatalf("UnsafeFirst(%d, %s) = %s, want %s.",
+			t.Fatalf("UnsafeFirst(%d, %q) = %q, want %q.",
 				test.n, test.s, res, test.out[0])
 		}
 	}

data/tracks/java/exercises/pangram/src/test/java/PangramsTest.java

@@ -66,4 +66,10 @@ public class PangramsTest {
     public void panagramInAlphabetOtherThanAscii() {
         assertFalse(Pangrams.isPangram("Широкая электрификация южных губерний даст мощный толчок подъёму сельского хозяйства."));
     }
+
+    @Ignore
+    @Test
+    public void upperAndLowerCaseVersionsOfTheSameCharacterShouldNotBeCountedSeparately() {
+        assertFalse(Pangrams.isPangram("the quick brown fox jumped over the lazy FOX"));
+    }
 }

data/tracks/javascript/exercises/robot-simulator/example.js

@@ -10,6 +10,13 @@ Robot.prototype.at = function (xcoord, ycoord) {
 };
 
 Robot.prototype.orient = function (direction) {
+  if (direction != 'north' &&
+      direction != 'south' &&
+      direction != 'east' &&
+      direction != 'west') {
+    throw 'Invalid Robot Bearing'
+  }
+
   this.bearing = direction;
   return 'The robot is pointed ' + direction;
 };
@@ -78,4 +85,4 @@ Robot.prototype.evaluate = function (s) {
   }, this);
 };
 
-module.exports = Robot;
+module.exports = Robot;

data/tracks/javascript/exercises/robot-simulator/robot-simulator.spec.js

@@ -14,11 +14,11 @@ describe('Robot', function() {
   });
 
   xit('invalid robot bearing', function() {
-    try {
+    var incorrectlyOrientRobot = function () {
       robot.orient('crood');
-    } catch(exception) {
-      expect(exception).toEqual('Invalid Robot Bearing');
-    }
+    };
+
+    expect(incorrectlyOrientRobot).toThrow(new Error('Invalid Robot Bearing'));
   });
 
   xit('turn right from north', function() {

data/tracks/julia/docs/ABOUT.md

@@ -0,0 +1,12 @@
+Julia is an open-source high-level, high-performance dynamic programming language designed for technical and scientific computing while also being effective for general-purpose tasks. It is convenient to use for daily work but also runs fast enough to be deployed for high-performance applications.
+
+Interesting features include:
+- Large parts of [Julia's base library](https://github.com/julialang/julia) are written in Julia itself. Understanding and contributing to the Julia core does not require knowledge of another language.
+- Easy to use interfaces to call libraries written in other languages, such as [C, Fortran](http://docs.julialang.org/en/stable/manual/calling-c-and-fortran-code/) and [Python](https://github.com/JuliaPy/PyCall.jl), directly.
+- [Multiple dispatch](http://docs.julialang.org/en/stable/manual/methods/#man-methods)
+- A dynamic, nominative and parametric [type system](http://docs.julialang.org/en/stable/manual/types/).
+- Homoiconicity: Julia code can be represented in Julia itself, making it a good language to learn about [metaprogramming](http://docs.julialang.org/en/stable/manual/metaprogramming/).
+
+The first public release was in 2012. You can find out more about the motivation behind it in the blog post ["Why We Created Julia"](http://julialang.org/blog/2012/02/why-we-created-julia) by the core developers.
+
+Despite its young age, Julia is already being used in the real world in a variety of fields, such as but not limited to Finance, Data Science and Scientific Computing. You can find many showcase applications on [juliabloggers.com](http://www.juliabloggers.com/) and a list of publications about the language and its technical computing applications [here](http://julialang.org/publications/).

data/tracks/julia/docs/INSTALLATION.md

@@ -1,5 +1,7 @@
 To install Julia on your system follow the instructions on the [Julia Language Downloads page](http://julialang.org/downloads/).
 
+[JuliaPro](http://juliacomputing.com/products/juliapro.html) includes the latest stable version of Julia, the Juno IDE, a debugger, a Jupyter notebook environment and many of the most popular Julia packages. It is a convenient way to install everything you will need to get started.
+
 For a local installation, it is recommended to use [Juno](http://junolab.org/). It's an IDE based on Atom and offers a powerful text editor as well as additional features for developing in Julia. Just follow the instructions on their website.
 
 A simple way to get started with Julia without the need of a local installation is [JuliaBox](http://junolab.org/), which is an online IDE based on Jupyter notebooks. You just access it from your browser, login and you can start solving exercises.

data/tracks/julia/docs/RESOURCES.md

@@ -0,0 +1,6 @@
+- [Julia Style Guide](docs.julialang.org/en/stable/manual/style-guide/): Guide on how to write idiomatic Julia code.
+- [Performance Tips](http://docs.julialang.org/en/stable/manual/performance-tips/): Techniques to speed up your programs.
+- [Julia Manual](http://docs.julialang.org/en/stable/manual/introduction/): Additional explanations and examples.
+- [juliabloggers.com](http://www.juliabloggers.com/): Aggregator of Julia blog posts.
+- [Julia Discourse](https://discourse.julialang.org/): Discussions about the language.
+- [Julia YouTube channel](https://www.youtube.com/user/JuliaLanguage): Archive of JuliaCon talks.

data/tracks/ocaml/exercises/hello-world/example.ml

@@ -1,4 +1 @@
-let greet subject =
-  match subject with
-  | None    -> "Hello, World!"
-  | Some(s) -> "Hello, " ^ s ^ "!"
+let hello = "Hello, World!"

data/tracks/ocaml/exercises/hello-world/hello_world.ml

@@ -1,2 +1 @@
-let greet subject =
-  "your code here"
+let hello = "Change me"

data/tracks/ocaml/exercises/hello-world/hello_world.mli

@@ -1,12 +1,4 @@
 (*
-   Return a greeting to an optional subject
-
-   ## Examples
-
-   ### greet None
-   "Hello, World!"
-
-   ### greet Some("Alice")
-   "Hello, Alice!"
+   Returns "Hello, World!"
 *)
-val greet: string option -> string
+val hello: string

data/tracks/ocaml/exercises/hello-world/test.ml

@@ -5,9 +5,7 @@ open Hello_world
 let ae exp got _test_ctxt = assert_equal ~printer:String.to_string exp got
 
 let tests = [
-     "no name" >:: ae "Hello, World!" (greet None);
-     "sample name" >:: ae "Hello, Alice!" (greet (Some "Alice"));
-     "other sample name" >:: ae "Hello, Bob!" (greet (Some "Bob"));
+     "Say Hi!" >:: ae "Hello, World!" hello;
 ]
 
 let () =

data/tracks/ocaml/exercises/luhn/test.ml

@@ -10,27 +10,27 @@ let tests = [
     assert_valid false "1";
   "A single zero is invalid" >::
     assert_valid false "0";
-  "simple valid sin" >::
-    assert_valid true " 5 9 ";
-  "valid Canadian SIN" >::
-    assert_valid true "046 454 286";
+  "a simple valid SIN that remains valid if reversed" >::
+    assert_valid true "059";
+  "a simple valid SIN that becomes invalid if reversed" >::
+    assert_valid true "59";
+  "a valid Canadian SIN" >::
+    assert_valid true "055 444 285";
   "invalid Canadian SIN" >::
-    assert_valid false "046 454 287";
+    assert_valid false "055 444 286";
   "invalid credit card" >::
     assert_valid false "8273 1232 7352 0569";
-  "valid strings with a non-digit added become invalid" >::
-    assert_valid false "046a 454 286";
-  "punctuation is not allowed" >::
+  "valid strings with a non-digit included become invalid" >::
+    assert_valid false "055a 444 285";
+  "valid strings with punctuation included become invalid" >::
     assert_valid false "055-444-285";
-  "symbols are not allowed" >::
+  "valid strings with symbols included become invalid" >::
     assert_valid false "055\194\163 444$ 285";
   "single zero with space is invalid" >::
     assert_valid false " 0";
-  "lots of zeros are valid" >::
-    assert_valid true " 00000";
-  "another valid sin" >::
-    assert_valid true "055 444 285";
-  "nine doubled is nine" >::
+  "more than a single zero is valid" >::
+    assert_valid true "0000 0";
+  "input digit 9 is correctly converted to output digit 9" >::
     assert_valid true "091";
 ]
 

data/tracks/ocaml/tools/test-generator/src/parser.ml

@@ -35,7 +35,8 @@ let parse_single (text: string) (expected_key: string) (cases_key: string): (tes
   Result.return (Single ts)
 
 let is_suite (json: json) (cases_key: string) =
-  let keys = List.filter (keys json) ~f:(fun k -> k <> "methods") in
+  let ignorable_keys = ["exercise"; "version"; "methods"] in
+  let keys = List.filter (keys json) ~f:(Fn.non (List.mem ignorable_keys)) in
   let keys = List.sort keys ~cmp:String.compare in
   not (List.is_empty keys || keys = [cases_key] || keys = ["#"; cases_key])
 

data/tracks/ocaml/tools/test-generator/templates/hello-world/template.ml

@@ -6,7 +6,7 @@ let ae exp got _test_ctxt = assert_equal ~printer:String.to_string exp got
 
 let tests = [
   (* TEST
-     "$description" >:: ae $expected (greet $name);
+     "$description" >:: ae $expected hello;
      END TEST *)
 ]
 

data/tracks/python/.travis.yml

@@ -7,6 +7,7 @@ python:
   - 3.3
   - 3.4
   - 3.5
+  - 3.6
   - nightly
 
 matrix:

data/tracks/python/config.json

@@ -417,6 +417,31 @@
       "difficulty": 1,
       "topics": [
       ]
+    },
+    {
+      "slug": "all-your-base",
+      "difficulty": 4,
+      "topics": [
+        "integers",
+        "transforming"
+      ]
+    },
+    {
+      "slug": "grep",
+      "difficulty": 4,
+      "topics": [
+        "files",
+        "text formatting",
+        "searching"
+      ]
+    },
+    {
+      "slug": "word-search",
+      "difficulty": 6,
+      "topics": [
+        "strings",
+        "searching"
+      ]
     }
   ],
   "deprecated": [

data/tracks/python/exercises/all-your-base/all_your_base_test.py

@@ -0,0 +1,82 @@
+import unittest
+
+from all_your_base import rebase
+
+
+class AllYourBaseTests(unittest.TestCase):
+
+    def test_single_bit_to_one_decimal(self):
+        self.assertEqual(rebase(2, [1], 10), [1])
+
+    def test_binary_to_single_decimal(self):
+        self.assertEqual(rebase(2, [1, 0, 1], 10), [5])
+
+    def test_single_decimal_to_binary(self):
+        self.assertEqual(rebase(10, [5], 2), [1, 0, 1])
+
+    def test_binary_to_multiple_decimal(self):
+        self.assertEqual(rebase(2, [1, 0, 1, 0, 1, 0], 10), [4, 2])
+
+    def test_decimal_to_binary(self):
+        self.assertEqual(rebase(10, [4, 2], 2), [1, 0, 1, 0, 1, 0])
+
+    def test_trinary_to_hexadecimal(self):
+        self.assertEqual(rebase(3, [1, 1, 2, 0], 16), [2, 10])
+
+    def test_hexadecimal_to_trinary(self):
+        self.assertEqual(rebase(16, [2, 10], 3), [1, 1, 2, 0])
+
+    def test_15_bit_integer(self):
+        self.assertEqual(rebase(97, [3, 46, 60], 73), [6, 10, 45])
+
+    def test_empty_list(self):
+        self.assertEqual(rebase(2, [], 10), [])
+
+    def test_single_zero(self):
+        self.assertEqual(rebase(10, [0], 2), [])
+
+    def test_multiple_zeroes(self):
+        self.assertEqual(rebase(10, [0, 0, 0], 2), [])
+
+    def test_leading_zeros(self):
+        self.assertEqual(rebase(7, [0, 6, 0], 10), [4, 2])
+
+    def test_negative_digit(self):
+        with self.assertRaises(ValueError):
+            rebase(2, [1, -1, 1, 0, 1, 0], 10)
+
+    def test_invalid_positive_digit(self):
+        with self.assertRaises(ValueError):
+            rebase(2, [1, 2, 1, 0, 1, 0], 10)
+
+    def test_first_base_is_one(self):
+        with self.assertRaises(ValueError):
+            rebase(1, [], 10)
+
+    def test_second_base_is_one(self):
+        with self.assertRaises(ValueError):
+            rebase(2, [1, 0, 1, 0, 1, 0], 1)
+
+    def test_first_base_is_zero(self):
+        with self.assertRaises(ValueError):
+            rebase(0, [], 10)
+
+    def test_second_base_is_zero(self):
+        with self.assertRaises(ValueError):
+            rebase(10, [7], 0)
+
+    def test_first_base_is_negative(self):
+        with self.assertRaises(ValueError):
+            rebase(-2, [1], 10)
+
+    def test_second_base_is_negative(self):
+        with self.assertRaises(ValueError):
+            rebase(2, [1], -7)
+
+    def test_both_bases_are_negative(self):
+        with self.assertRaises(ValueError):
+            rebase(-2, [1], -7)
+
+
+if __name__ == '__main__':
+    unittest.main()