trackler 2.2.1.16 → 2.2.1.17

data/tracks/sml/exercises/atbash-cipher/example.sml

@@ -0,0 +1,32 @@
+fun chunkify chunkSz s =
+  let
+    val sz = size s
+
+    fun chunker 0 _   = chunker chunkSz (substring (s, 0, chunkSz))
+      | chunker i acc =
+          if sz = i
+          then acc
+          else if sz - i < chunkSz
+               then acc ^ " " ^ substring (s, i, size s - i)
+               else chunker (i + chunkSz) (acc ^ " " ^ substring (s, i, chunkSz))
+  in
+    if chunkSz > sz
+    then s
+    else chunker 0 ""
+  end
+
+fun cipher c =
+  let
+    open Char
+    val n = ord #"z" + ord #"a"
+    val c = toLower c
+  in
+    if isAlpha c
+    then (toString o chr) (n - ord c)
+    else if isDigit c
+         then toString c
+         else ""
+  end
+
+val decode = String.translate cipher
+val encode = (chunkify 5) o decode

data/tracks/sml/exercises/atbash-cipher/test.sml

@@ -0,0 +1,52 @@
+(* version 1.0.0 *)
+
+use "atbash-cipher.sml";
+use "testlib.sml";
+
+infixr |>
+fun x |> f = f x
+
+val testsuite =
+  describe "atbash-cipher" [
+    describe "encode" [
+      test "encode yes"
+        (fn _ => encode ("yes") |> Expect.equalTo "bvh"),
+
+      test "encode no"
+        (fn _ => encode ("no") |> Expect.equalTo "ml"),
+
+      test "encode OMG"
+        (fn _ => encode ("OMG") |> Expect.equalTo "lnt"),
+
+      test "encode spaces"
+        (fn _ => encode ("O M G") |> Expect.equalTo "lnt"),
+
+      test "encode mindblowingly"
+        (fn _ => encode ("mindblowingly") |> Expect.equalTo "nrmwy oldrm tob"),
+
+      test "encode numbers"
+        (fn _ => encode ("Testing,1 2 3, testing.") |> Expect.equalTo "gvhgr mt123 gvhgr mt"),
+
+      test "encode deep thought"
+        (fn _ => encode ("Truth is fiction.") |> Expect.equalTo "gifgs rhurx grlm"),
+
+      test "encode all the letters"
+        (fn _ => encode ("The quick brown fox jumps over the lazy dog.") |> Expect.equalTo "gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt")
+    ],
+
+    describe "decode" [
+      test "decode exercism"
+        (fn _ => decode ("vcvix rhn") |> Expect.equalTo "exercism"),
+
+      test "decode a sentence"
+        (fn _ => decode ("zmlyh gzxov rhlug vmzhg vkkrm thglm v") |> Expect.equalTo "anobstacleisoftenasteppingstone"),
+
+      test "decode numbers"
+        (fn _ => decode ("gvhgr mt123 gvhgr mt") |> Expect.equalTo "testing123testing"),
+
+      test "decode all the letters"
+        (fn _ => decode ("gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt") |> Expect.equalTo "thequickbrownfoxjumpsoverthelazydog")
+    ]
+  ]
+
+val _ = Test.run testsuite

data/tracks/sml/exercises/atbash-cipher/testlib.sml

@@ -0,0 +1,159 @@
+structure Expect =
+struct
+  datatype expectation = Pass | Fail of string * string
+
+  local
+    fun failEq b a =
+      Fail ("Expected: " ^ b, "Got: " ^ a)
+    
+    fun failExn b a =
+      Fail ("Expected: " ^ b, "Raised: " ^ a)
+
+    fun exnName (e: exn): string = General.exnName e
+  in
+    fun truthy a =
+      if a
+      then Pass
+      else failEq "true" "false"
+
+    fun falsy a =
+      if a
+      then failEq "false" "true"
+      else Pass
+
+    fun equalTo b a = 
+      if a = b
+      then Pass
+      else failEq (PolyML.makestring b) (PolyML.makestring a)
+
+    fun nearTo b a =
+      if Real.== (a, b)
+      then Pass
+      else failEq (Real.toString b) (Real.toString a)
+
+    fun anyError f =
+      (
+        f ();
+        failExn "an exception" "Nothing"
+      ) handle _ => Pass
+
+    fun error e f =
+      (
+        f ();
+        failExn (exnName e) "Nothing"
+      ) handle e' => if exnMessage e' = exnMessage e
+                     then Pass
+                     else failExn (exnMessage e) (exnMessage e')
+  end
+end
+
+structure TermColor =
+struct
+  datatype color = Red | Green | Yellow | Normal
+
+  fun f Red    = "\027[31m"
+    | f Green  = "\027[32m"
+    | f Yellow = "\027[33m"
+    | f Normal = "\027[0m"
+
+  fun colorize color s = (f color) ^ s ^ (f Normal)
+
+  val redit = colorize Red
+
+  val greenit = colorize Green
+
+  val yellowit = colorize Yellow
+end
+
+structure Test =
+struct
+  datatype testnode = TestGroup of string * testnode list
+                    | Test of string * (unit -> Expect.expectation)
+
+  local
+    datatype evaluation = Success of string
+                        | Failure of string * string * string
+                        | Error of string * string
+
+    fun indent n s = (implode (List.tabulate (n, fn _ => #" "))) ^ s
+
+    fun fmt indentlvl ev =
+      let
+        val check = TermColor.greenit "\226\156\148 " (* ✔ *)
+        val cross = TermColor.redit "\226\156\150 "   (* ✖ *)
+        val indentlvl = indentlvl * 2
+      in
+      case ev of
+        Success descr => indent indentlvl (check ^ descr)
+      | Failure (descr, exp, got) =>
+          String.concatWith "\n" [indent indentlvl (cross ^ descr),
+                                  indent (indentlvl + 2) exp,
+                                  indent (indentlvl + 2) got]
+      | Error (descr, reason) =>
+          String.concatWith "\n" [indent indentlvl (cross ^ descr),
+                                  indent (indentlvl + 2) (TermColor.redit reason)]
+      end
+
+    fun eval (TestGroup _) = raise Fail "Only a 'Test' can be evaluated"
+      | eval (Test (descr, thunk)) =
+          (
+            case thunk () of
+              Expect.Pass   => ((1, 0, 0), Success descr)
+            | Expect.Fail (s, s') => ((0, 1, 0), Failure (descr, s, s'))
+          )
+          handle e => ((0, 0, 1), Error (descr, "Unexpected error: " ^ exnMessage e))
+
+    fun flatten depth testnode =
+      let
+        fun sum (x, y, z) (a, b, c) = (x + a, y + b, z + c)
+
+        fun aux (t, (counter, acc)) =
+          let
+            val (counter', texts) = flatten (depth + 1) t
+          in
+            (sum counter' counter, texts :: acc)
+          end
+      in
+        case testnode of
+          TestGroup (descr, ts) =>
+            let
+              val (counter, texts) = foldr aux ((0, 0, 0), []) ts
+            in
+              (counter, (indent (depth * 2) descr) :: List.concat texts)
+            end
+        | Test _ =>
+            let
+              val (counter, evaluation) = eval testnode
+            in
+              (counter, [fmt depth evaluation])
+            end
+      end
+    
+    fun println s = print (s ^ "\n")
+  in
+    fun run suite =
+      let
+        val ((succeeded, failed, errored), texts) = flatten 0 suite
+
+        val summary = String.concatWith ", " [
+          TermColor.greenit ((Int.toString succeeded) ^ " passed"),
+          TermColor.redit ((Int.toString failed) ^ " failed"),
+          TermColor.redit ((Int.toString errored) ^ " errored"),
+          (Int.toString (succeeded + failed + errored)) ^ " total"
+        ]
+        
+        val status = if failed = 0 andalso errored = 0
+                     then OS.Process.success
+                     else OS.Process.failure
+
+      in
+        List.app println texts;
+        println "";
+        println ("Tests: " ^ summary);
+        OS.Process.exit status
+      end
+  end
+end
+
+fun describe description tests = Test.TestGroup (description, tests)
+fun test description thunk = Test.Test (description, thunk)

data/tracks/sml/exercises/pangram/README.md

@@ -0,0 +1,45 @@
+# 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.
+
+## Loading your exercise implementation in PolyML
+
+```
+$ poly --use {exercise}.sml
+```
+
+Or:
+
+```
+$ poly
+> use "{exercise}.sml";
+```
+
+**Note:** You have to replace {exercise}.
+
+## Running the tests
+
+```
+$ poly -q --use test.sml
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/sml](https://github.com/exercism/sml) repository on
+GitHub is the home for all of the Standard ML exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue. We'll do our best to help you!
+
+## 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/sml/exercises/pangram/example.sml

@@ -0,0 +1,18 @@
+fun isPangram (input: string): bool =
+  let
+    val counter = Array.tabulate (26, fn _ => 0)
+    val chars = map Char.toLower (String.explode input)
+    val aCode = ord #"a"
+
+    fun updateCounter c =
+      let
+        val index = ord c - aCode
+      in
+        if index < 0
+        then ()
+        else Array.update (counter, index, (Array.sub (counter, index)) + 1)
+      end
+  in
+    List.app updateCounter chars;
+    Array.all (fn x => x > 0) counter
+  end

data/tracks/sml/exercises/pangram/pangram.sml

@@ -0,0 +1,2 @@
+fun isPangram (input: string): bool =
+  raise Fail "'isPangram' is not implemented"

data/tracks/sml/exercises/pangram/test.sml

@@ -0,0 +1,41 @@
+(* version 1.1.0 *)
+
+use "pangram.sml";
+use "testlib.sml";
+
+infixr |>
+fun x |> f = f x
+
+val testsuite =
+  describe "pangram" [
+    describe "Check if the given string is an pangram" [
+      test "sentence empty"
+        (fn _ => isPangram ("") |> Expect.falsy),
+
+      test "pangram with only lower case"
+        (fn _ => isPangram ("the quick brown fox jumps over the lazy dog") |> Expect.truthy),
+
+      test "missing character 'x'"
+        (fn _ => isPangram ("a quick movement of the enemy will jeopardize five gunboats") |> Expect.falsy),
+
+      test "another missing character 'x'"
+        (fn _ => isPangram ("the quick brown fish jumps over the lazy dog") |> Expect.falsy),
+
+      test "pangram with underscores"
+        (fn _ => isPangram ("the_quick_brown_fox_jumps_over_the_lazy_dog") |> Expect.truthy),
+
+      test "pangram with numbers"
+        (fn _ => isPangram ("the 1 quick brown fox jumps over the 2 lazy dogs") |> Expect.truthy),
+
+      test "missing letters replaced by numbers"
+        (fn _ => isPangram ("7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog") |> Expect.falsy),
+
+      test "pangram with mixed case and punctuation"
+        (fn _ => isPangram ("\"Five quacking Zephyrs jolt my wax bed.\"") |> Expect.truthy),
+
+      test "upper and lower case versions of the same character should not be counted separately"
+        (fn _ => isPangram ("the quick brown fox jumps over with lazy FX") |> Expect.falsy)
+    ]
+  ]
+
+val _ = Test.run testsuite

data/tracks/sml/exercises/pangram/testlib.sml

@@ -0,0 +1,159 @@
+structure Expect =
+struct
+  datatype expectation = Pass | Fail of string * string
+
+  local
+    fun failEq b a =
+      Fail ("Expected: " ^ b, "Got: " ^ a)
+    
+    fun failExn b a =
+      Fail ("Expected: " ^ b, "Raised: " ^ a)
+
+    fun exnName (e: exn): string = General.exnName e
+  in
+    fun truthy a =
+      if a
+      then Pass
+      else failEq "true" "false"
+
+    fun falsy a =
+      if a
+      then failEq "false" "true"
+      else Pass
+
+    fun equalTo b a = 
+      if a = b
+      then Pass
+      else failEq (PolyML.makestring b) (PolyML.makestring a)
+
+    fun nearTo b a =
+      if Real.== (a, b)
+      then Pass
+      else failEq (Real.toString b) (Real.toString a)
+
+    fun anyError f =
+      (
+        f ();
+        failExn "an exception" "Nothing"
+      ) handle _ => Pass
+
+    fun error e f =
+      (
+        f ();
+        failExn (exnName e) "Nothing"
+      ) handle e' => if exnMessage e' = exnMessage e
+                     then Pass
+                     else failExn (exnMessage e) (exnMessage e')
+  end
+end
+
+structure TermColor =
+struct
+  datatype color = Red | Green | Yellow | Normal
+
+  fun f Red    = "\027[31m"
+    | f Green  = "\027[32m"
+    | f Yellow = "\027[33m"
+    | f Normal = "\027[0m"
+
+  fun colorize color s = (f color) ^ s ^ (f Normal)
+
+  val redit = colorize Red
+
+  val greenit = colorize Green
+
+  val yellowit = colorize Yellow
+end
+
+structure Test =
+struct
+  datatype testnode = TestGroup of string * testnode list
+                    | Test of string * (unit -> Expect.expectation)
+
+  local
+    datatype evaluation = Success of string
+                        | Failure of string * string * string
+                        | Error of string * string
+
+    fun indent n s = (implode (List.tabulate (n, fn _ => #" "))) ^ s
+
+    fun fmt indentlvl ev =
+      let
+        val check = TermColor.greenit "\226\156\148 " (* ✔ *)
+        val cross = TermColor.redit "\226\156\150 "   (* ✖ *)
+        val indentlvl = indentlvl * 2
+      in
+      case ev of
+        Success descr => indent indentlvl (check ^ descr)
+      | Failure (descr, exp, got) =>
+          String.concatWith "\n" [indent indentlvl (cross ^ descr),
+                                  indent (indentlvl + 2) exp,
+                                  indent (indentlvl + 2) got]
+      | Error (descr, reason) =>
+          String.concatWith "\n" [indent indentlvl (cross ^ descr),
+                                  indent (indentlvl + 2) (TermColor.redit reason)]
+      end
+
+    fun eval (TestGroup _) = raise Fail "Only a 'Test' can be evaluated"
+      | eval (Test (descr, thunk)) =
+          (
+            case thunk () of
+              Expect.Pass   => ((1, 0, 0), Success descr)
+            | Expect.Fail (s, s') => ((0, 1, 0), Failure (descr, s, s'))
+          )
+          handle e => ((0, 0, 1), Error (descr, "Unexpected error: " ^ exnMessage e))
+
+    fun flatten depth testnode =
+      let
+        fun sum (x, y, z) (a, b, c) = (x + a, y + b, z + c)
+
+        fun aux (t, (counter, acc)) =
+          let
+            val (counter', texts) = flatten (depth + 1) t
+          in
+            (sum counter' counter, texts :: acc)
+          end
+      in
+        case testnode of
+          TestGroup (descr, ts) =>
+            let
+              val (counter, texts) = foldr aux ((0, 0, 0), []) ts
+            in
+              (counter, (indent (depth * 2) descr) :: List.concat texts)
+            end
+        | Test _ =>
+            let
+              val (counter, evaluation) = eval testnode
+            in
+              (counter, [fmt depth evaluation])
+            end
+      end
+    
+    fun println s = print (s ^ "\n")
+  in
+    fun run suite =
+      let
+        val ((succeeded, failed, errored), texts) = flatten 0 suite
+
+        val summary = String.concatWith ", " [
+          TermColor.greenit ((Int.toString succeeded) ^ " passed"),
+          TermColor.redit ((Int.toString failed) ^ " failed"),
+          TermColor.redit ((Int.toString errored) ^ " errored"),
+          (Int.toString (succeeded + failed + errored)) ^ " total"
+        ]
+        
+        val status = if failed = 0 andalso errored = 0
+                     then OS.Process.success
+                     else OS.Process.failure
+
+      in
+        List.app println texts;
+        println "";
+        println ("Tests: " ^ summary);
+        OS.Process.exit status
+      end
+  end
+end
+
+fun describe description tests = Test.TestGroup (description, tests)
+fun test description thunk = Test.Test (description, thunk)

data/tracks/sml/exercises/perfect-numbers/README.md

@@ -0,0 +1,54 @@
+# Perfect Numbers
+
+Determine if a number is perfect, abundant, or deficient based on
+Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
+
+The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
+
+- **Perfect**: aliquot sum = number 
+  - 6 is a perfect number because (1 + 2 + 3) = 6
+  - 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
+- **Abundant**: aliquot sum > number
+  - 12 is an abundant number because (1 + 2 + 3 + 4 + 6) = 16
+  - 24 is an abundant number because (1 + 2 + 3 + 4 + 6 + 8 + 12) = 36
+- **Deficient**: aliquot sum < number
+  - 8 is a deficient number because (1 + 2 + 4) = 7
+  - Prime numbers are deficient
+
+Implement the `classify` function, it should return one of `Abundant`, `Deficient` or `Perfect`. If the input param is not a positive integer, raise the exception `NotAPositiveInteger`.
+
+## Loading your exercise implementation in PolyML
+
+```
+$ poly --use {exercise}.sml
+```
+
+Or:
+
+```
+$ poly
+> use "{exercise}.sml";
+```
+
+**Note:** You have to replace {exercise}.
+
+## Running the tests
+
+```
+$ poly -q --use test.sml
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/sml](https://github.com/exercism/sml) repository on
+GitHub is the home for all of the Standard ML exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue. We'll do our best to help you!
+
+## Source
+
+Taken from Chapter 2 of Functional Thinking by Neal Ford. [http://shop.oreilly.com/product/0636920029687.do](http://shop.oreilly.com/product/0636920029687.do)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/sml/exercises/perfect-numbers/example.sml

@@ -0,0 +1,26 @@
+exception NotAPositiveInteger
+
+datatype classification = Abundant | Deficient | Perfect
+
+fun sigma n =
+  let
+    fun loop i =
+      if i * i > n
+      then 0
+      else if n mod i <> 0
+           then loop (i + 1)
+           else if n div i = i
+                then i + loop (i + 1)
+                else i + (n div i) + loop (i + 1)
+  in
+    loop 1
+  end
+
+fun classify n =
+  if n < 1
+  then raise NotAPositiveInteger
+  else
+    case Int.compare (sigma n, 2 * n) of
+      GREATER => Abundant
+    | LESS    => Deficient
+    | _       => Perfect

data/tracks/sml/exercises/perfect-numbers/perfect-numbers.sml

@@ -0,0 +1,6 @@
+exception NotAPositiveInteger
+
+datatype classification = Abundant | Deficient | Perfect
+
+fun classify (input: int): classification =
+  raise Fail "'classify' is not implemented"

data/tracks/sml/exercises/perfect-numbers/test.sml

@@ -0,0 +1,59 @@
+(* version 1.0.1 *)
+
+use "perfect-numbers.sml";
+use "testlib.sml";
+
+infixr |>
+fun x |> f = f x
+
+val testsuite =
+  describe "perfect-numbers" [
+    describe "Perfect numbers" [
+      test "Smallest perfect number is classified correctly"
+        (fn _ => classify (6) |> Expect.equalTo Perfect),
+
+      test "Medium perfect number is classified correctly"
+        (fn _ => classify (28) |> Expect.equalTo Perfect),
+
+      test "Large perfect number is classified correctly"
+        (fn _ => classify (33550336) |> Expect.equalTo Perfect)
+    ],
+
+    describe "Abundant numbers" [
+      test "Smallest abundant number is classified correctly"
+        (fn _ => classify (12) |> Expect.equalTo Abundant),
+
+      test "Medium abundant number is classified correctly"
+        (fn _ => classify (30) |> Expect.equalTo Abundant),
+
+      test "Large abundant number is classified correctly"
+        (fn _ => classify (33550335) |> Expect.equalTo Abundant)
+    ],
+
+    describe "Deficient numbers" [
+      test "Smallest prime deficient number is classified correctly"
+        (fn _ => classify (2) |> Expect.equalTo Deficient),
+
+      test "Smallest non-prime deficient number is classified correctly"
+        (fn _ => classify (4) |> Expect.equalTo Deficient),
+
+      test "Medium deficient number is classified correctly"
+        (fn _ => classify (32) |> Expect.equalTo Deficient),
+
+      test "Large deficient number is classified correctly"
+        (fn _ => classify (33550337) |> Expect.equalTo Deficient),
+
+      test "Edge case (no factors other than itself) is classified correctly"
+        (fn _ => classify (1) |> Expect.equalTo Deficient)
+    ],
+
+    describe "Invalid inputs" [
+      test "Zero is rejected (not a natural number)"
+        (fn _ => (fn _ => classify (~1)) |> Expect.error NotAPositiveInteger),
+
+      test "Negative integer is rejected (not a natural number)"
+        (fn _ => (fn _ => classify (~1)) |> Expect.error NotAPositiveInteger)
+    ]
+  ]
+
+val _ = Test.run testsuite