trackler 2.2.1.48 → 2.2.1.49

data/tracks/dart/exercises/word-count/pubspec.lock

@@ -12,7 +12,7 @@ packages:
       name: args
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "1.0.0"
+    version: "1.0.1"
   async:
     description:
       name: async
@@ -24,7 +24,7 @@ packages:
       name: barback
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "0.15.2+12"
+    version: "0.15.2+13"
   boolean_selector:
     description:
       name: boolean_selector
@@ -90,7 +90,7 @@ packages:
       name: http
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "0.11.3+15"
+    version: "0.11.3+16"
   http_multi_server:
     description:
       name: http_multi_server
@@ -204,7 +204,7 @@ packages:
       name: shelf_static
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "0.2.5"
+    version: "0.2.6"
   shelf_web_socket:
     description:
       name: shelf_web_socket

data/tracks/dart/pubspec.lock

@@ -24,7 +24,7 @@ packages:
       name: barback
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "0.15.2+12"
+    version: "0.15.2+13"
   boolean_selector:
     description:
       name: boolean_selector
@@ -96,7 +96,7 @@ packages:
       name: http
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "0.11.3+15"
+    version: "0.11.3+16"
   http_multi_server:
     description:
       name: http_multi_server
@@ -210,7 +210,7 @@ packages:
       name: shelf_static
       url: "https://pub.dartlang.org"
     source: hosted
-    version: "0.2.5"
+    version: "0.2.6"
   shelf_web_socket:
     description:
       name: shelf_web_socket

data/tracks/fsharp/exercises/largest-series-product/Example.fs

@@ -17,11 +17,25 @@ let slices size list =
 
     List.init sliceCount slice
 
-let largestProduct input seriesLength = 
-    if seriesLength > String.length input then failwith "Slice size is too big"
-    else 
+let allDigits input =
+    input
+    |> Seq.forall Char.IsDigit
+    
+let isInvalidCase input seriesLength =
+    let inputLenth = String.length input
+    
+    inputLenth < seriesLength 
+    || inputLenth = 0 && seriesLength > 0 
+    || seriesLength < 0 
+    || not (allDigits input)
+
+let largestProduct input seriesLength : int option = 
+    match isInvalidCase input seriesLength with 
+    | true -> None
+    | false ->   
         input 
         |> digits 
         |> slices seriesLength
         |> List.map (List.fold (*) 1)
-        |> List.max
+        |> List.max
+        |> Some

data/tracks/fsharp/exercises/largest-series-product/LargestSeriesProduct.fs

@@ -1,3 +1,3 @@
 module LargestSeriesProduct
 
-let largestProduct input seriesLength = failwith "You need to implement this function."
+let largestProduct input seriesLength : int option = failwith "You need to implement this function."

data/tracks/fsharp/exercises/largest-series-product/LargestSeriesProductTest.fs

@@ -1,40 +1,84 @@
+// This file was auto-generated based on version 1.0.0 of the canonical data.
+
 module LargestSeriesProductTest
 
-open Xunit
 open FsUnit.Xunit
-open System
+open Xunit
+
 open LargestSeriesProduct
-    
-[<Theory(Skip = "Remove to run test")>]
-[<InlineData("01234567890", 2, 72)>]
-[<InlineData("1027839564", 3, 270)>]
-let ``Gets the largest product``(digits: string) (seriesLength: int) (expected: int) =
-    largestProduct digits seriesLength |> should equal expected
-
-    
-[<Fact(Skip = "Remove to run test")>]
-let ``Largest product works for small numbers`` () =
-    largestProduct "19" 2 |> should equal 9
-    
-[<Fact(Skip = "Remove to run test")>]
-let ``Largest product works for large numbers`` () =
-    let LARGE_NUMBER = "73167176531330624919225119674426574742355349194934"
-    largestProduct LARGE_NUMBER 6 |> should equal 23520
-    
-[<Theory(Skip = "Remove to run test")>]
-[<InlineData("0000", 2, 0)>]
-[<InlineData("99099", 3, 0)>]
-let ``Largest product works if all spans contain zero``(digits: string) (seriesLength: int) (expected: int) =
-    largestProduct digits seriesLength |> should equal expected
-
-    
-[<Theory(Skip = "Remove to run test")>]
-[<InlineData("", 1)>]
-[<InlineData("123", 1)>]
-let ``Largest product for empty span is 1``(digits: string) (expected: int) =
-    largestProduct digits 0 |> should equal expected
-
-    
-[<Fact(Skip = "Remove to run test")>]
-let ``Cannot slice empty string with nonzero span`` () =
-    (fun () -> largestProduct "" 1 |> ignore) |> should throw typeof<Exception>
+
+[<Fact>]
+let ``Finds the largest product if span equals length`` () =
+    let digits = "29"
+    largestProduct digits 2 |> should equal (Some 18)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can find the largest product of 2 with numbers in order`` () =
+    let digits = "0123456789"
+    largestProduct digits 2 |> should equal (Some 72)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can find the largest product of 2`` () =
+    let digits = "576802143"
+    largestProduct digits 2 |> should equal (Some 48)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can find the largest product of 3 with numbers in order`` () =
+    let digits = "0123456789"
+    largestProduct digits 3 |> should equal (Some 504)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can find the largest product of 3`` () =
+    let digits = "1027839564"
+    largestProduct digits 3 |> should equal (Some 270)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can find the largest product of 5 with numbers in order`` () =
+    let digits = "0123456789"
+    largestProduct digits 5 |> should equal (Some 15120)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Can get the largest product of a big number`` () =
+    let digits = "73167176531330624919225119674426574742355349194934"
+    largestProduct digits 6 |> should equal (Some 23520)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Reports zero if the only digits are zero`` () =
+    let digits = "0000"
+    largestProduct digits 2 |> should equal (Some 0)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Reports zero if all spans include zero`` () =
+    let digits = "99099"
+    largestProduct digits 3 |> should equal (Some 0)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rejects span longer than string length`` () =
+    let digits = "123"
+    largestProduct digits 4 |> should equal None
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Reports 1 for empty string and empty product (0 span)`` () =
+    let digits = ""
+    largestProduct digits 0 |> should equal (Some 1)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Reports 1 for nonempty string and empty product (0 span)`` () =
+    let digits = "123"
+    largestProduct digits 0 |> should equal (Some 1)
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rejects empty string and nonzero span`` () =
+    let digits = ""
+    largestProduct digits 1 |> should equal None
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rejects invalid character in digits`` () =
+    let digits = "1234a5"
+    largestProduct digits 2 |> should equal None
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Rejects negative span`` () =
+    let digits = "12345"
+    largestProduct digits -1 |> should equal None
+

data/tracks/fsharp/generators/Exercise.fs

@@ -218,7 +218,7 @@ type Exercise() =
         canonicalDataCase.Properties
         |> Map.toList
         |> List.map fst
-        |> List.except ["property"; "expected"; "description"]
+        |> List.except ["property"; "expected"; "description"; "comments"]
     
     // Utility methods to customize rendered output
 

data/tracks/fsharp/generators/Generators.fs

@@ -154,6 +154,16 @@ type KindergartenGarden() =
 
     override this.UseFullMethodName canonicalDataCase = true
 
+type LargestSeriesProduct() =
+    inherit Exercise()
+
+     override this.PropertiesWithIdentifier canonicalDataCase = ["digits"]
+
+    override this.RenderExpected (canonicalDataCase, key, value) = 
+        match value :?> int64 with 
+        | -1L -> "None"
+        | _ -> value :?> int64 |> sprintf "(Some %d)"
+
 type Leap() =
     inherit Exercise()
 

data/tracks/gnu-apl/config.json

@@ -38,6 +38,20 @@
       "core": true,
       "difficulty": 1,
       "topics": ["strings", "residue", "conditions"]
+    },
+    {
+      "uuid": "b9d47ae7-0df7-2a80-cbe1-a40548a641756b77e3f",
+      "slug": "difference-of-squares",
+      "core": true,
+      "difficulty": 1,
+      "topics": ["reduce", "arrays"]
+    },
+    {
+      "uuid": "a6da3d26-0b3f-cb80-478f-0da928bdbf2975c8605",
+      "slug": "pangram",
+      "core": true,
+      "difficulty": 1,
+      "topics": ["strings", "characters"]
     }
   ],
   "deprecated": [

data/tracks/gnu-apl/exercises/difference-of-squares/README.md

@@ -0,0 +1,19 @@
+# Difference Of Squares
+
+Find the difference between the square of the sum and the sum of the squares of the first N natural numbers.
+
+The square of the sum of the first ten natural numbers is
+(1 + 2 + ... + 10)² = 55² = 3025.
+
+The sum of the squares of the first ten natural numbers is
+1² + 2² + ... + 10² = 385.
+
+Hence the difference between the square of the sum of the first
+ten natural numbers and the sum of the squares of the first ten
+natural numbers is 3025 - 385 = 2640.
+## Source
+
+Problem 6 at Project Euler [http://projecteuler.net/problem=6](http://projecteuler.net/problem=6)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/gnu-apl/exercises/difference-of-squares/difference-of-squares-example.apl

@@ -0,0 +1,13 @@
+#!/usr/bin/env apl --script
+
+∇z←square_of_sum integer
+  z←(+/⍳integer)*2
+∇
+
+∇z←sum_of_squares integer
+  z←+/(⍳integer)*2
+∇
+
+∇z←difference_of_squares integer
+  z←(square_of_sum integer)-sum_of_squares integer
+∇

data/tracks/gnu-apl/exercises/difference-of-squares/difference-of-squares.tc

@@ -0,0 +1,38 @@
+log←'./difference-of-squares.tc.log'
+⍎ ')COPY ',(⎕FIO 30),'/../../test.apl'
+
+test∆copy_relative 'difference-of-squares.apl'
+test∆clear_log log
+
+⍝ ∇square_of_sum
+
+⍝ it returns the square of the sum from 1 to the given number
+  1⎕CR square_of_sum 1
+1
+  1⎕CR square_of_sum 5 ⍝ (1+2+3+4+5)*2
+225
+  1⎕CR square_of_sum 100
+25502500
+
+⍝ ∇sum_of_squares
+
+⍝ it returns the sum of the squares of the numbers from 1 to the given number
+  1⎕CR sum_of_squares 1
+1
+  1⎕CR sum_of_squares 5 ⍝ (1*2)+(2*2)+(3*2)+(4*2)+(5*2)
+55
+  1⎕CR sum_of_squares 100
+338350
+
+⍝ ∇difference_of_squares
+
+⍝ it returns square_of_sum minus sum_of_squares
+  1⎕CR difference_of_squares 1
+0
+  1⎕CR difference_of_squares 5
+170
+  1⎕CR difference_of_squares 100
+25164150
+
+test∆show_log log
+

data/tracks/gnu-apl/exercises/pangram/README.md

@@ -0,0 +1,15 @@
+# Pangram
+
+Determine if a sentence is a pangram. A pangram (Greek: παν γράμμα, pan gramma,
+"every letter") is a sentence using every letter of the alphabet at least once.
+The best known English pangram is: 
+> The quick brown fox jumps over the lazy dog.
+
+The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case
+insensitive. Input will not contain non-ASCII symbols.
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Pangram](https://en.wikipedia.org/wiki/Pangram)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/gnu-apl/exercises/pangram/pangram-example.apl

@@ -0,0 +1,14 @@
+#!/usr/bin/env apl --script
+
+lowercase←⎕AF (⎕AF 'a')+(⍳26)-1
+
+∇z←is_pangram string
+  z←∧/lowercase∊to_lower string
+∇
+
+∇z←to_lower string;uppercase;to_change
+  uppercase←⎕AF ((⎕AF lowercase)-⎕AF 'a')+(⎕AF 'A')
+  to_change←(string⍳uppercase)~1+⍴string
+  z←string
+  z[to_change]←lowercase[uppercase⍳string[to_change]]
+∇

data/tracks/gnu-apl/exercises/pangram/pangram.tc

@@ -0,0 +1,40 @@
+log←'./pangram.tc.log'
+⍎ ')COPY ',(⎕FIO 30),'/../../test.apl'
+
+test∆copy_relative 'pangram.apl'
+test∆clear_log log
+
+⍝ ∇is_pangram
+
+⍝ it returns false for a null vector
+  1⎕CR is_pangram ''
+0
+⍝ it recognizes a perfect lower case pangram
+  1⎕CR is_pangram 'abcdefghijklmnopqrstuvwxyz'
+1
+⍝ pangram with only lower case: true
+  1⎕CR is_pangram 'the quick brown fox jumps over the lazy dog'
+1
+⍝ missing character 'x': false
+  is_pangram 'a quick movement of the enemy will jeopardize five gunboats'
+0
+⍝ missing 'h': false
+  is_pangram 'five boxing wizards jump quickly at it'
+0
+
+⍝ pangram with non-alphabetic characters: true
+  is_pangram 'the_quick_brown_fox_jumps_over_the_lazy_dog'
+1
+  is_pangram 'the 1 quick brown fox jumps over the 2 lazy dogs'
+1
+⍝ letters missing, replaced by numbers: false
+  is_pangram '7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog'
+0
+⍝ pangram with mixed case and punctuation: true
+  is_pangram '"Five quacking Zephyrs jolt my wax bed."'
+1
+⍝ non-pangram with upper- and lowercase versions of same letter: false
+  is_pangram "the quick brown fox jumps over with lazy FX"
+0
+
+test∆show_log log

data/tracks/gnu-apl/exercises/raindrops/raindrops.tc

@@ -45,7 +45,7 @@ PlangPlong
   1⎕CR convert 105 ⍝ 3×5×7
 'PlingPlangPlong'
 
-⍝ the sound for squares of a raindrop factor is only the single sound
+⍝ the sound for powers of a raindrop factor is only the single sound
   convert 9 ⍝ 3×3
 Pling
   convert 25 ⍝ 5×5

data/tracks/java/exercises/bracket-push/.meta/version

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

data/tracks/java/exercises/complex-numbers/.meta/version

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

data/tracks/java/exercises/ocr-numbers/.meta/version

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

data/tracks/java/exercises/queen-attack/.meta/version

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

data/tracks/java/exercises/rectangles/.meta/version

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