trackler 2.2.1.24 → 2.2.1.25

data/tracks/sml/config.json

@@ -5,9 +5,9 @@
   "test_pattern": "test[.]sml$",
   "exercises": [
     {
-      "uuid": "7e1d0e9a-435d-4dc6-8867-2fc4f9b7fe6f",
-      "slug": "all-your-base",
-      "core": false,
+      "uuid": "4450455d-0786-6f80-7672-48368a115df16e0aa7e",
+      "slug": "hello-world",
+      "core": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
@@ -15,8 +15,8 @@
       ]
     },
     {
-      "uuid": "4450455d-0786-6f80-7672-48368a115df16e0aa7e",
-      "slug": "hello-world",
+      "uuid": "a56bad29-684c-47e7-9724-8c7f165a51af",
+      "slug": "two-fer",
       "core": true,
       "unlocked_by": null,
       "difficulty": 1,
@@ -24,6 +24,26 @@
 
       ]
     },
+    {
+      "uuid": "622644a8-55c3-498e-ac72-ad6d7d31109d",
+      "slug": "leap",
+      "core": true,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
+    {
+      "uuid": "7e1d0e9a-435d-4dc6-8867-2fc4f9b7fe6f",
+      "slug": "all-your-base",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "9d8e76f1-0e85-a280-b779-16335f29d1a96ce3a72",
       "slug": "bob",
@@ -164,6 +184,36 @@
 
       ]
     },
+    {
+      "uuid": "db3e09ee-6c93-417f-b0a0-196cdccf4984",
+      "slug": "rna-transcription",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
+    {
+      "uuid": "6170f05b-358b-487a-b5ae-4424af422d8e",
+      "slug": "collatz-conjecture",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
+    {
+      "uuid": "b9377be8-06c1-5280-33b6-a2071298947c9ddf65e",
+      "slug": "sum-of-multiples",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "225cfd7d-81a3-4a58-b1aa-1de2e40e7a93",
       "slug": "binary",

data/tracks/sml/exercises/collatz-conjecture/README.md

@@ -0,0 +1,63 @@
+# Collatz Conjecture
+
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+## Examples
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+
+
+## 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
+
+An unsolved problem in mathematics named after mathematician Lothar Collatz [https://en.wikipedia.org/wiki/3x_%2B_1_problem](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
+
+## 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/collatz-conjecture/collatz-conjecture.sml

@@ -0,0 +1,4 @@
+exception NegativeInteger
+
+fun steps (number: int): int =
+  raise Fail "'steps' is not implemented"

data/tracks/sml/exercises/collatz-conjecture/example.sml

@@ -0,0 +1,17 @@
+exception NegativeInteger
+
+fun steps number =
+  let
+    fun odd n = n mod 2 = 1
+
+    fun steps' stepCount n =
+      if n = 1
+      then stepCount
+      else if odd n
+           then steps' (stepCount + 1) (3 * n + 1)
+           else steps' (stepCount + 1) (n div 2)
+  in
+    if number > 0
+    then steps' 0 number
+    else raise NegativeInteger
+  end

data/tracks/sml/exercises/collatz-conjecture/test.sml

@@ -0,0 +1,30 @@
+(* version 1.1.1 *)
+
+use "testlib.sml";
+use "collatz-conjecture.sml";
+
+infixr |>
+fun x |> f = f x
+
+val testsuite =
+  describe "collatz-conjecture" [
+    test "zero steps for one"
+      (fn _ => steps (1) |> Expect.equalTo 0),
+
+    test "divide if even"
+      (fn _ => steps (16) |> Expect.equalTo 4),
+
+    test "even and odd steps"
+      (fn _ => steps (12) |> Expect.equalTo 9),
+
+    test "Large number of even and odd steps"
+      (fn _ => steps (1000000) |> Expect.equalTo 152),
+
+    test "zero is an error"
+      (fn _ => (fn _ => steps (0)) |> Expect.error NegativeInteger),
+
+    test "negative value is an error"
+      (fn _ => (fn _ => steps (~15)) |> Expect.error NegativeInteger)
+  ]
+
+val _ = Test.run testsuite

data/tracks/sml/exercises/collatz-conjecture/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/leap/README.md

@@ -0,0 +1,63 @@
+# Leap
+
+Given a year, report if it is a leap year.
+
+The tricky thing here is that a leap year in the Gregorian calendar occurs:
+
+```plain
+on every year that is evenly divisible by 4
+  except every year that is evenly divisible by 100
+    unless the year is also evenly divisible by 400
+```
+
+For example, 1997 is not a leap year, but 1996 is.  1900 is not a leap
+year, but 2000 is.
+
+If your language provides a method in the standard library that does
+this look-up, pretend it doesn't exist and implement it yourself.
+
+## Notes
+
+Though our exercise adopts some very simple rules, there is more to
+learn!
+
+For a delightful, four minute explanation of the whole leap year
+phenomenon, go watch [this youtube video][video].
+
+[video]: http://www.youtube.com/watch?v=xX96xng7sAE
+
+## 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
+
+JavaRanch Cattle Drive, exercise 3 [http://www.javaranch.com/leap.jsp](http://www.javaranch.com/leap.jsp)
+
+## 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/leap/example.sml

@@ -0,0 +1,2 @@
+fun leapYear year =
+  year mod 400 = 0 orelse (year mod 4 = 0 andalso year mod 100 <> 0)

data/tracks/sml/exercises/leap/leap.sml

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

data/tracks/sml/exercises/leap/test.sml

@@ -0,0 +1,24 @@
+(* version 1.0.0 *)
+
+use "testlib.sml";
+use "leap.sml";
+
+infixr |>
+fun x |> f = f x
+
+val testsuite =
+  describe "leap" [
+    test "year not divisible by 4: common year"
+      (fn _ => leapYear (2015) |> Expect.falsy),
+
+    test "year divisible by 4, not divisible by 100: leap year"
+      (fn _ => leapYear (2016) |> Expect.truthy),
+
+    test "year divisible by 100, not divisible by 400: common year"
+      (fn _ => leapYear (2100) |> Expect.falsy),
+
+    test "year divisible by 400: leap year"
+      (fn _ => leapYear (2000) |> Expect.truthy)
+  ]
+
+val _ = Test.run testsuite