trackler 2.2.1.43 → 2.2.1.44

data/tracks/sml/exercises/hamming/example.sml

@@ -1,10 +1,14 @@
-exception NonEqualLengthStringsFound;
-fun hamming (s1, s2) = let
-    val chars1 = explode s1
-    val chars2 = explode s2
-    fun hamming' ([],[]) acc = acc
-      | hamming' ((x::xs),(y::ys)) acc = hamming' (xs, ys) (acc + (if x = y then 0 else 1))
-in
-    if (length chars1) <> (length chars2) then raise NonEqualLengthStringsFound
-    else hamming' (chars1, chars2) 0
-end
+exception NonEqualLengthStringsFound
+
+fun distance (strand1: string, strand2: string): int =
+  let
+    val chars1 = explode strand1
+    val chars2 = explode strand2
+    fun distance' ([], []) acc = acc
+      | distance' ((x::xs), (y::ys)) acc =
+          distance' (xs, ys) (acc + (if x = y then 0 else 1))
+  in
+    if (length chars1) <> (length chars2) then
+      raise NonEqualLengthStringsFound
+    else distance' (chars1, chars2) 0
+  end

data/tracks/sml/exercises/hamming/hamming.sml

@@ -1,3 +1,4 @@
-exception NonEqualLengthStringsFound;
-fun hamming (s1: string, s2: string): int =
-  raise Fail "'hamming' has not been implemented"
+exception NonEqualLengthStringsFound
+
+fun distance (strand1: string, strand2: string): int =
+  raise Fail "'distance' is not implemented"

data/tracks/sml/exercises/hamming/test.sml

@@ -1,66 +1,57 @@
+(* version 2.0.0 *)
+
+use "testlib.sml";
 use "hamming.sml";
 
-val test_cases = [
-  {
-    description = "'GAGCCTACTAACGGGAT' is 7 away from 'CATCGTAATGACGGCCT'",
-    input = ("GAGCCTACTAACGGGAT","CATCGTAATGACGGCCT"),
-    expected = 7
-  },
-  {
-    description = "'CAT' is 3 away from 'DOG'",
-    input = ("CAT","DOG"),
-    expected = 3
-  },
-  {
-    description = "'DEPOSIT' is 4 away from 'DOPIEST'",
-    input = ("DEPOSIT","DOPIEST"),
-    expected = 4
-  }
-];
-
-val error_test_cases = [
-  {
-    description = "throws error on unequal length strings",
-    input = ("", "A"),
-    expected = NonEqualLengthStringsFound
-  },
-  {
-    description = "throws error on unequal length strings",
-    input = ("A", ""),
-    expected = NonEqualLengthStringsFound
-  },
-  {
-    description = "throws error on unequal length strings",
-    input = ("ABCD", "ABC"),
-    expected = NonEqualLengthStringsFound
-  }
-];
-
-fun run_tests _ [] = []
-  | run_tests f (x :: xs) =
-      let
-        fun aux { description, is_correct } =
-          let
-            val expl = description ^ ": " ^
-              (if is_correct then "PASSED" else "FAILED") ^ "\n"
-          in
-            (print (expl); is_correct)
-          end
-      in
-        (aux x) :: run_tests f xs
-      end
-
-fun evaluateGoodTestCase f { description, input, expected } =
-  { description = description, is_correct = (f input) = expected }
-
-fun evaluateErrorTestCase f { description, input, expected } =
-  { description = description, is_correct = (f input handle expected => 1) = 1 }
-
-val testResults = run_tests hamming (List.map (evaluateGoodTestCase hamming) test_cases)
-  @ run_tests hamming (List.map (evaluateErrorTestCase hamming) error_test_cases);
-val passedTests = List.filter (fn x => x) testResults;
-val failedTests = List.filter (fn x => not x) testResults;
-
-if (List.length testResults) = (List.length passedTests)
-then (print "ALL TESTS PASSED")
-else (print (Int.toString (List.length failedTests) ^ " TEST(S) FAILED"));
+infixr |>
+fun x |> f = f x
+
+val testsuite =
+  describe "hamming" [
+    test "empty strands"
+      (fn _ => distance ("", "") |> Expect.equalTo 0),
+
+    test "identical strands"
+      (fn _ => distance ("A", "A") |> Expect.equalTo 0),
+
+    test "long identical strands"
+      (fn _ => distance ("GGACTGA", "GGACTGA") |> Expect.equalTo 0),
+
+    test "complete distance in single nucleotide strands"
+      (fn _ => distance ("A", "G") |> Expect.equalTo 1),
+
+    test "complete distance in small strands"
+      (fn _ => distance ("AG", "CT") |> Expect.equalTo 2),
+
+    test "small distance in small strands"
+      (fn _ => distance ("AT", "CT") |> Expect.equalTo 1),
+
+    test "small distance"
+      (fn _ => distance ("GGACG", "GGTCG") |> Expect.equalTo 1),
+
+    test "small distance in long strands"
+      (fn _ => distance ("ACCAGGG", "ACTATGG") |> Expect.equalTo 2),
+
+    test "non-unique character in first strand"
+      (fn _ => distance ("AGA", "AGG") |> Expect.equalTo 1),
+
+    test "non-unique character in second strand"
+      (fn _ => distance ("AGG", "AGA") |> Expect.equalTo 1),
+
+    test "same nucleotides in different positions"
+      (fn _ => distance ("TAG", "GAT") |> Expect.equalTo 2),
+
+    test "large distance"
+      (fn _ => distance ("GATACA", "GCATAA") |> Expect.equalTo 4),
+
+    test "large distance in off-by-one strand"
+      (fn _ => distance ("GGACGGATTCTG", "AGGACGGATTCT") |> Expect.equalTo 9),
+
+    test "disallow first strand longer"
+      (fn _ => (fn _ => distance ("AATG", "AAA")) |> Expect.error NonEqualLengthStringsFound),
+
+    test "disallow second strand longer"
+      (fn _ => (fn _ => distance ("ATA", "AGTG")) |> Expect.error NonEqualLengthStringsFound)
+  ]
+
+val _ = Test.run testsuite

data/tracks/sml/exercises/hamming/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/typescript/config.json

@@ -90,6 +90,21 @@
         "Integers"
       ]
     },
+    {
+      "uuid": "4c1392d7-8779-496f-b0bb-81605e777e3b",
+      "slug": "nth-prime",
+      "core": false,
+      "unlocked_by": "prime-factors",
+      "difficulty": 5,
+      "topics": [
+        "Control-flow (conditionals)",
+        "Control-flow (loops)",
+        "Exception handling",
+        "Algorithms",
+        "Mathematics",
+        "Integers"
+      ]
+    },
     {
       "uuid": "e431fb10-766a-4542-94ad-9c30224a3885",
       "slug": "sum-of-multiples",

data/tracks/typescript/exercises/linked-list/linked-list.test.ts

@@ -1,7 +1,7 @@
 import LinkedList from './linked-list'
 
 describe('LinkedList', () => {
-  test('add/extract elements to the end of the list with push/pop', () => {
+  it('add/extract elements to the end of the list with push/pop', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.push(20)
@@ -9,7 +9,7 @@ describe('LinkedList', () => {
     expect(list.pop()).toBe(10)
   })
 
-  xtest('extract elements from the beginning of the list with shift', () => {
+  xit('extract elements from the beginning of the list with shift', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.push(20)
@@ -17,7 +17,7 @@ describe('LinkedList', () => {
     expect(list.shift()).toBe(20)
   })
 
-  xtest('add/extract elements from the beginning of the list with unshift/shift', () => {
+  xit('add/extract elements from the beginning of the list with unshift/shift', () => {
     const list = new LinkedList<number>()
     list.unshift(10)
     list.unshift(20)
@@ -25,7 +25,7 @@ describe('LinkedList', () => {
     expect(list.shift()).toBe(10)
   })
 
-  xtest('unshift/pop', () => {
+  xit('unshift/pop', () => {
     const list = new LinkedList<number>()
     list.unshift(10)
     list.unshift(20)
@@ -33,7 +33,7 @@ describe('LinkedList', () => {
     expect(list.pop()).toBe(20)
   })
 
-  xtest('example', () => {
+  xit('example', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.push(20)
@@ -47,7 +47,7 @@ describe('LinkedList', () => {
     expect(list.shift()).toBe(30)
   })
 
-  xtest('can count its elements', () => {
+  xit('can count its elements', () => {
     const list = new LinkedList<number>()
     expect(list.count()).toBe(0)
     list.push(10)
@@ -56,7 +56,7 @@ describe('LinkedList', () => {
     expect(list.count()).toBe(2)
   })
 
-  xtest('sets head/tail after popping last element', () => {
+  xit('sets head/tail after popping last element', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.pop()
@@ -65,7 +65,7 @@ describe('LinkedList', () => {
     expect(list.pop()).toBe(20)
   })
 
-  xtest('sets head/tail after shifting last element', () => {
+  xit('sets head/tail after shifting last element', () => {
     const list = new LinkedList<number>()
     list.unshift(10)
     list.shift()
@@ -74,7 +74,7 @@ describe('LinkedList', () => {
     expect(list.shift()).toBe(20)
   })
 
-  xtest('deletes the element with the specified value from the list', () => {
+  xit('deletes the element with the specified value from the list', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.push(20)
@@ -85,14 +85,14 @@ describe('LinkedList', () => {
     expect(list.shift()).toBe(10)
   })
 
-  xtest('deletes the only element', () => {
+  xit('deletes the only element', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.delete(10)
     expect(list.count()).toBe(0)
   })
 
-  xtest('delete does not modify the list if the element is not found', () => {
+  xit('delete does not modify the list if the element is not found', () => {
     const list = new LinkedList<number>()
     list.push(10)
     list.delete(20)

data/tracks/typescript/exercises/nth-prime/README.md

@@ -0,0 +1,36 @@
+# Nth Prime
+
+Given a number n, determine what the nth prime is.
+
+By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that
+the 6th prime is 13.
+
+If your language provides methods in the standard library to deal with prime
+numbers, pretend they don't exist and implement them yourself.
+
+
+## Setup
+
+Go through the setup instructions for TypeScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/typescript
+
+## Requirements
+
+Install assignment dependencies:
+
+```bash
+$ yarn install
+```
+
+## Making the test suite pass
+
+Execute the tests with:
+
+```bash
+$ yarn test
+```
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.