trackler 2.0.6.10 → 2.0.6.11

data/tracks/ceylon/exercises/anagram/source/anagram/module.ceylon

@@ -0,0 +1,3 @@
+module anagram "1.0" {
+  import "ceylon.test" "1.3.1";
+}

data/tracks/ceylon/exercises/bracket-push/example/Brackets.ceylon

@@ -0,0 +1,18 @@
+import ceylon.collection { ArrayList }
+
+Map<Character, Character> openFor = map {'}' -> '{', ')' -> '(', ']' -> '['};
+Set<Character> opens = set(openFor.items);
+
+Boolean balanced(String brackets) {
+  value expectedOpens = ArrayList<Character>();
+  for (c in brackets) {
+    if (opens.contains(c)) {
+      expectedOpens.push(c);
+    } else if (exists open = openFor[c]) {
+      if ((expectedOpens.pop() else '!') != open) {
+        return false;
+      }
+    }
+  }
+  return expectedOpens.empty;
+}

data/tracks/ceylon/exercises/bracket-push/example/module.ceylon

@@ -0,0 +1,4 @@
+module bracketpush "1.0" {
+  import "ceylon.collection" "1.3.1";
+  import "ceylon.test" "1.3.1";
+}

data/tracks/ceylon/exercises/bracket-push/source/bracketpush/Brackets.ceylon

@@ -0,0 +1,3 @@
+Boolean balanced(String brackets) {
+  return nothing;
+}

data/tracks/ceylon/exercises/bracket-push/source/bracketpush/BracketsTest.ceylon

@@ -0,0 +1,37 @@
+import ceylon.test { ... }
+
+{[String, Boolean]*} cases =>
+  {
+    // paired square brackets
+    ["[]", true],
+    // empty string
+    ["", true],
+    // unpaired brackets
+    ["[[", false],
+    // wrong ordered brackets
+    ["}{", false],
+    // paired with whitespace
+    ["{ }", true],
+    // simple nested brackets
+    ["{[]}", true],
+    // several paired brackets
+    ["{}[]", true],
+    // paired and nested brackets
+    ["([{}({}[])])", true],
+    // unopened closing brackets
+    ["{[)][]}", false],
+    // unpaired and nested brackets
+    ["([{])", false],
+    // paired and wrong nested brackets
+    ["[({]})", false],
+    // math expression
+    ["(((185 + 223.85) * 15) - 543)/2", true],
+    // complex latex expression
+    ["\\left(\\begin{array}{cc} \\frac{1}{3} & x\\\\ \\mathrm{e}^{x} &... x^2 \\end{array}\\right)", true]
+  };
+
+test
+parameters(`value cases`)
+void testBalanced(String brackets, Boolean expected) {
+  assertEquals(balanced(brackets), expected);
+}

data/tracks/ceylon/exercises/bracket-push/source/bracketpush/module.ceylon

@@ -0,0 +1,3 @@
+module bracketpush "1.0" {
+  import "ceylon.test" "1.3.1";
+}

data/tracks/ceylon/exercises/leap/example/Leap.ceylon

@@ -0,0 +1,3 @@
+Boolean leapYear(Integer year) {
+  return year % 4 == 0 && year % 100 != 0 || year % 400 == 0;
+}

data/tracks/ceylon/exercises/leap/source/leap/Leap.ceylon

@@ -0,0 +1,3 @@
+Boolean leapYear(Integer year) {
+  return nothing;
+}

data/tracks/ceylon/exercises/leap/source/leap/LeapTest.ceylon

@@ -0,0 +1,10 @@
+import ceylon.test { ... }
+
+{[Integer, Boolean]*} cases =>
+  {[2015, false], [2016, true], [2100, false], [2000, true]};
+
+test
+parameters(`value cases`)
+void testLeapYear(Integer year, Boolean isLeap) {
+  assertEquals(leapYear(year), isLeap);
+}

data/tracks/ceylon/exercises/leap/source/leap/module.ceylon

@@ -0,0 +1,3 @@
+module leap "1.0" {
+  import "ceylon.test" "1.3.1";
+}

data/tracks/ceylon/exercises/sieve/example/Sieve.ceylon

@@ -0,0 +1,24 @@
+import ceylon.numeric.float { sqrt }
+
+{Integer*} primesUpTo(Integer max) {
+  // if max < 4, sqrt(max) < 2, so 2..sqrt(max) gives decreasing values.
+  // Prevent this by just returning the small primes here:
+  if (max < 4) {
+    return {2, 3}.takeWhile((c) => c <= max);
+  }
+
+  value prime = Array.ofSize(max + 1, true);
+  prime[0] = false;
+  prime[1] = false;
+
+  for (i in 2..(sqrt(max.float).integer)) {
+    if (!(prime[i] else false)) {
+      continue;
+    }
+
+    for (multiple in ((i * i)..max).by(i)) {
+      prime[multiple] = false;
+    }
+  }
+  return { for (i -> p in prime.indexed) if (p) i };
+}

data/tracks/ceylon/exercises/sieve/example/module.ceylon

@@ -0,0 +1,4 @@
+module sieve "1.0" {
+  import "ceylon.numeric" "1.3.1";
+  import "ceylon.test" "1.3.1";
+}

data/tracks/ceylon/exercises/sieve/source/sieve/Sieve.ceylon

@@ -0,0 +1,3 @@
+{Integer*} primesUpTo(Integer max) {
+  return nothing;
+}

data/tracks/ceylon/exercises/sieve/source/sieve/SieveTest.ceylon

@@ -0,0 +1,23 @@
+import ceylon.test { ... }
+
+{Integer*} cases => {1, 2, 10, 13, 1000};
+
+[Integer+] primes1000 = [
+  2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
+  73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
+  157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233,
+  239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317,
+  331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419,
+  421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,
+  509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607,
+  613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,
+  709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811,
+  821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911,
+  919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997
+];
+
+test
+parameters(`value cases`)
+void testPrimesUpto(Integer max) {
+  assertEquals([*primesUpTo(max)], [*primes1000.takeWhile((x) => x <= max)]);
+}

data/tracks/ceylon/exercises/sieve/source/sieve/module.ceylon

@@ -0,0 +1,3 @@
+module sieve "1.0" {
+  import "ceylon.test" "1.3.1";
+}

data/tracks/csharp/.travis.yml

@@ -1,5 +1,9 @@
 language: csharp
 
+os:
+  - linux
+  - osx
+
 script:
   - ./bin/fetch-configlet
   - ./bin/configlet .

data/tracks/elm/SETUP.md

@@ -1,11 +1,12 @@
 ## Elm Installation
 
-Refer to the [exercism help page][http://exercism.io/languages/elm] for Elm installation and learning
-resources.
+Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm
+installation and learning resources.
 
 ## Writing the Code
 
-The first time you start an exercise, you'll need to ensure you have the appropriate dependancies installed.
+The first time you start an exercise, you'll need to ensure you have the
+appropriate dependencies installed.
 
 ```bash
 $ npm install
@@ -15,4 +16,4 @@ Execute the tests with:
 
 ```bash
 $ npm test
-```
+```

data/tracks/fsharp/.travis.yml

@@ -1,5 +1,9 @@
 language: csharp
 
+os:
+  - linux
+  - osx
+
 script:
   - ./bin/fetch-configlet
   - ./bin/configlet .

data/tracks/go/config.json

@@ -46,9 +46,13 @@
       ]
     },
     {
-      "difficulty": 1,
+      "difficulty": 3,
       "slug": "clock",
-      "topics": []
+      "topics": [
+        "Time",
+        "Mathematics",
+        "Text formatting"
+      ]
     },
     {
       "difficulty": 1,

data/tracks/go/exercises/luhn/example.go

@@ -1,6 +1,11 @@
 package luhn
 
+const testVersion = 1
+
 func Valid(n string) bool {
+	if len(n) == 1 {
+		return false
+	}
 	d := extract(n)
 	if len(d) == 0 {
 		return false
@@ -33,7 +38,3 @@ func check(d []int) int {
 	}
 	return s
 }
-
-func AddCheck(raw string) string {
-	return raw + string('0'+(10-check(extract(raw))%10)%10)
-}

data/tracks/go/exercises/luhn/luhn_test.go

@@ -2,41 +2,25 @@ package luhn
 
 import "testing"
 
-var validTests = []struct {
-	n  string
-	ok bool
-}{
-	{"738", false},
-	{"8739567", true},
-	{"1111", false},
-	{"8763", true},
-	{"    ", false},
-	{"", false},
-	{"2323 2005 7766 3554", true},
-}
+const targetTestVersion = 1
 
-var addTests = []struct{ raw, luhn string }{
-	{"123", "1230"},
-	{"873956", "8739567"},
-	{"837263756", "8372637564"},
-	{"2323 2005 7766 355", "2323 2005 7766 3554"},
-	// bonus Unicode cases
-	// {"2323·2005·7766·355", "2323·2005·7766·3554"},
-	// {"１２３", "１２３０"},
+var testCases = []struct {
+	input       string
+	description string
+	ok          bool
+}{
+	{"1", "single digit strings can not be valid", false},
+	{"0", "a single zero is invalid", false},
+	{"046 454 286", "valid Canadian SIN", true},
+	{"046 454 287", "invalid Canadian SIN", false},
+	{"8273 1232 7352 0569", "invalid credit card", false},
+	{"827a 1232 7352 0569", "strings that contain non-digits are not valid", false},
 }
 
 func TestValid(t *testing.T) {
-	for _, test := range validTests {
-		if ok := Valid(test.n); ok != test.ok {
-			t.Fatalf("Valid(%s) = %t, want %t.", test.n, ok, test.ok)
-		}
-	}
-}
-
-func TestAddCheck(t *testing.T) {
-	for _, test := range addTests {
-		if luhn := AddCheck(test.raw); luhn != test.luhn {
-			t.Fatalf("AddCheck(%s) = %s, want %s.", test.raw, luhn, test.luhn)
+	for _, test := range testCases {
+		if ok := Valid(test.input); ok != test.ok {
+			t.Fatalf("Valid(%s): %s\n\t Expected: %t\n\t Got: %t", test.input, test.description, ok, test.ok)
 		}
 	}
 }
@@ -47,8 +31,8 @@ func BenchmarkValid(b *testing.B) {
 	}
 }
 
-func BenchmarkAddCheck(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		AddCheck("2323 2005 7766 355")
+func TestTestVersion(t *testing.T) {
+	if testVersion != targetTestVersion {
+		t.Errorf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
 	}
 }

data/tracks/java/exercises/word-count/src/test/java/WordCountTest.java

@@ -1,3 +1,4 @@
+import org.junit.Before;
 import org.junit.Test;
 import org.junit.Ignore;
 
@@ -10,13 +11,19 @@ import static org.junit.Assert.*;
 
 public class WordCountTest {
 
-    private final WordCount wordCount = new WordCount();
+    private WordCount wordCount;
+    private Map<String, Integer> actualWordCount;
+    private Map<String, Integer> expectedWordCount;
+
+    @Before
+    public void setup() {
+        wordCount = new WordCount();
+        expectedWordCount = new HashMap<String, Integer>();
+    }
 
 
     @Test
     public void countOneWord() {
-        Map<String, Integer> actualWordCount = new HashMap<String, Integer>();
-        final Map<String, Integer> expectedWordCount = new HashMap<String, Integer>();
         expectedWordCount.put("word", 1);
 
         actualWordCount = wordCount.phrase("word");
@@ -28,8 +35,6 @@ public class WordCountTest {
     @Ignore
     @Test
     public void countOneOfEach() {
-        Map<String, Integer> actualWordCount = new HashMap<String, Integer>();
-        final Map<String, Integer> expectedWordCount = new HashMap<String, Integer>();
         expectedWordCount.put("one", 1);
         expectedWordCount.put("of", 1);
         expectedWordCount.put("each", 1);
@@ -43,8 +48,6 @@ public class WordCountTest {
     @Ignore
     @Test
     public void countMultipleOccurences() {
-        Map<String, Integer> actualWordCount = new HashMap<String, Integer>();
-        final Map<String, Integer> expectedWordCount = new HashMap<String, Integer>();
         expectedWordCount.put("one", 1);
         expectedWordCount.put("fish", 4);
         expectedWordCount.put("two", 1);
@@ -60,8 +63,6 @@ public class WordCountTest {
     @Ignore
     @Test
     public void ignorePunctuation() {
-        Map<String, Integer> actualWordCount = new HashMap<String, Integer>();
-        final Map<String, Integer> expectedWordCount = new HashMap<String, Integer>();
         expectedWordCount.put("car", 1);
         expectedWordCount.put("carpet", 1);
         expectedWordCount.put("as", 1);
@@ -78,8 +79,6 @@ public class WordCountTest {
     @Ignore
     @Test
     public void includeNumbers() {
-        Map<String, Integer> actualWordCount = new HashMap<String, Integer>();
-        final Map<String, Integer> expectedWordCount = new HashMap<String, Integer>();
         expectedWordCount.put("testing", 2);
         expectedWordCount.put("1", 1);
         expectedWordCount.put("2", 1);
@@ -93,8 +92,6 @@ public class WordCountTest {
     @Ignore
     @Test
     public void normalizeCase() {
-        Map<String, Integer> actualWordCount = new HashMap<String, Integer>();
-        final Map<String, Integer> expectedWordCount = new HashMap<String, Integer>();
         expectedWordCount.put("go", 3);
 
         actualWordCount = wordCount.phrase("go Go GO");

data/tracks/lua/docs/ABOUT.md

@@ -4,6 +4,6 @@ Lua supports procedural, object-oriented, functional, data-driven programming an
 
 Lua has been used in [many industrial applications](https://sites.google.com/site/marbux/home/where-lua-is-used#8S4UcLlroV5fq8i3WSheIA) with an emphasis on embedded systems and games.
 
-The home page for Lua is [Lua.org](https://www.lua.org/). You can [learn the language in 15 minutes](tylerneylon.com/a/learn-lua/). Enjoy!
+The home page for Lua is [Lua.org](https://www.lua.org/). Enjoy!
 
 (Taken from https://www.lua.org/about.html)

data/tracks/lua/docs/LEARNING.md

@@ -0,0 +1 @@
+Lua is a very small language and you can [learn the basics of the language in 15 minutes](tylerneylon.com/a/learn-lua/). For an exhaustive look at the language, written by the authors of Lua, you can read [Programming in Lua](https://www.lua.org/pil/) (the first edition which covers Lua 5.1 [is available online for free](https://www.lua.org/pil/contents.html)).

data/tracks/lua/docs/RESOURCES.md

@@ -1,13 +1,18 @@
 There are many great free online resources for Lua including:
 
   1. [lua.org][8]
-  2. A highly recommended detailed and authoritative introduction to all aspects of Lua programming by Lua's chief architect: [Programming in Lua (2nd edition), by Roberto Ierusalimschy][6]
+  2. A highly recommended detailed and authoritative introduction to all aspects of Lua programming by Lua's chief architect: [Programming in Lua, by Roberto Ierusalimschy][6]
   3. For an official definition of the Lua language, consult the [Lua 5.1 Reference Manual][7], by R. Ierusalimschy, L. H. de Figueiredo, W. Celes.
   4. [Lua Style Guide][4]
   5. [Learn Lua in 15 minutes][5]
+  6. [Some][9] [options][10] [for][11] [linting][12]
 
 [4]: https://github.com/Olivine-Labs/lua-style-guide
 [5]: http://tylerneylon.com/a/learn-lua/
 [6]: http://www.lua.org/pil/
 [7]: http://www.lua.org/manual/5.1/
 [8]: http://www.lua.org
+[9]: https://code.google.com/p/lua-checker/
+[10]: http://lua-users.org/wiki/LuaLint
+[11]: http://lua-users.org/wiki/LuaInspect
+[12]: http://lua-users.org/wiki/DetectingUndefinedVariables

data/tracks/lua/exercises/flatten-array/flatten-array_spec.lua

@@ -1,3 +1,14 @@
+--[[-
+Note that because ipairs and the length operator work correctly only for sequences
+in Lua, no arrays with nils are included in these tests. This means that the provided
+example is not included here:
+
+  input: [1,[2,3,null,4],[null],5]
+  output: [1,2,3,4,5]
+
+See https://www.lua.org/manual/5.3/manual.html#3.4.7 for more information.
+]]
+
 local flatten = require 'flatten-array'
 
 describe('flatten-array', function()

data/tracks/lua/exercises/luhn/example.lua

@@ -1,14 +1,7 @@
-local Luhn = {}
-Luhn.__index = Luhn
-
-function Luhn:check_digit()
-  return tonumber(self.s:sub(-1))
-end
-
-function Luhn:addends()
+local function addends(s)
   local result = {}
-  for i = #self.s, 1, -1 do
-    local digit = tonumber(self.s:sub(i, i))
+  for i = #s, 1, -1 do
+    local digit = tonumber(s:sub(i, i))
     if #result % 2 > 0 then digit = digit * 2 end
     if digit > 9 then digit = digit - 9 end
     table.insert(result, 1, digit)
@@ -16,28 +9,19 @@ function Luhn:addends()
   return result
 end
 
-function Luhn:checksum()
+local function checksum(s)
   local checksum = 0
-  for _, addend in ipairs(self:addends()) do
+  for _, addend in ipairs(addends(s)) do
     checksum = checksum + addend
   end
   return checksum
 end
 
-function Luhn:valid()
-  return self:checksum() % 10 == 0
-end
-
-local function new(s)
-  return setmetatable({ s = s }, Luhn)
-end
-
-local function create(s)
-  local checksum = new(s .. '0'):checksum()
-  return s .. tostring((10 - (checksum % 10)) % 10)
-end
-
 return {
-  new = new,
-  create = create
+  valid = function(s)
+    s = s:gsub(' ', '')
+    if #s < 2 then return false end
+    if s:find('%D') then return false end
+    return checksum(s) % 10 == 0
+  end
 }