trackler 2.2.1.174 → 2.2.1.175

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: becd82b348e1141be2f222f88cdd825dc8cd9ae0
-  data.tar.gz: 46a27ed81af03d55eb64230f5f67514014d89d3f
+  metadata.gz: f8ba749e7d72c728ef66d3ae7e4172a0a24063de
+  data.tar.gz: a23cb78cfda6299e50baacaf47590e14b46c0d56
 SHA512:
-  metadata.gz: 76069557c80d5a3fa8528b51b6c17466501c9a0029a8561ac37171020a02943ffaf59175e24b2c34a09e0e7ef5417195440887449d2b195e53a8ab2b6af52cfa
-  data.tar.gz: da5f3990e6cac62eb741efc01e7be42cfb3e5130423c7ba5dad5821a471e66dfff3b9c8a755b903cfdf7a45b2f74ddd00ee620f283e13a337df928d038afece9
+  metadata.gz: 224ce7c0af67cb3ff9896e1b578918e6e0a46f0588e6dc9ea0cab3fbbf661162ee4e6394233096d2a1597e949688573324c6dd05cf2bd7fa0b0678d73245377a
+  data.tar.gz: e640bf79b918cd47f365955731fb8f197f524e0b9309f54b57d2a806bece389707e8a94dd80317f2379bfd667fb94202c6e12e270de91394268b43bdfe40494e

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.174"
+  VERSION = "2.2.1.175"
 end

data/tracks/ecmascript/config.json

@@ -8,6 +8,7 @@
       "slug": "hello-world",
       "uuid": "9ce0f408-6d7b-4466-a390-75aeaf9492f2",
       "core": true,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [

data/tracks/javascript/README.md

@@ -1,3 +1,12 @@
+# DEPRECATION NOTICE
+
+This track will be deprecated as part of the migration of Exercism to V2.  Going forward, the EcmaScript track will replace the JavaScript track as "the new JavaScript" track.  
+- User's old submissions will be migrated
+- PRs unrelated to the deprecation will be closed as `wontfix`
+- Issues unrelated to deprecation will be closed as `wontfix`
+
+Thank you to all the many invested and hardworking contributors who have helped to make this track a success!!
+
 # JavaScript [![Build Status](https://travis-ci.org/exercism/javascript.svg?branch=master)](https://travis-ci.org/exercism/javascript)[![Join the chat at https://gitter.im/exercism/xecmascript](https://badges.gitter.im/exercism/xecmascript.svg)](https://gitter.im/exercism/xecmascript?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
 
 Exercism exercises in JavaScript

data/tracks/reasonml/.travis.yml

@@ -1,5 +1,22 @@
-language: bash
+language: node_js
+
+node_js:
+  - 'node'
+
+before_install:
+  - npm i -g npm@latest
+
+install:
+  - npm ci
+
+cache:
+  directories:
+    - node_modules
 
 script:
   - bin/fetch-configlet
-  - bin/configlet lint --track TRACK_ID .
+  - bin/configlet lint --track-id reasonml .
+  - make copy-all-exercises
+  - npm run build
+  - npm run test:ci
+  - make clean

data/tracks/reasonml/Makefile

@@ -0,0 +1,35 @@
+EXERCISE ?= ""
+IGNOREDIRS := "^(\.git|docs|bin|node_modules|.idea)$$"
+EXERCISES = $(shell find ./exercises -maxdepth 1 -mindepth 1 -type d | cut -d'/' -f3 | sort | grep -Ev $(IGNOREDIRS))
+
+default: testgenerator test
+
+# output directories
+OUTDIR ?= "tmp"
+
+# language specific config (tweakable per language)
+FILEEXT := "re"
+EXAMPLE := "Example.$(FILEEXT)"
+SRCFILE := "$(shell echo $(EXERCISE) | sed -r 's/(^|-)([a-z])/\U\2/g')"
+TSTFILE := "$(SRCFILE)_test.$(FILEEXT)"
+# Any additional arguments, such as -p for pretty output and others
+ARGS ?= ""
+
+# copy example and test file for single exercise to OUTDIR
+# Rename Example.re to ExerciseName.re in the process
+copy-exercise:
+	@cp exercises/$(EXERCISE)/__tests__/$(TSTFILE) $(OUTDIR)/__tests__/
+	@cp exercises/$(EXERCISE)/src/$(EXAMPLE) $(OUTDIR)/src/$(SRCFILE).$(FILEEXT)
+
+# copy all source files to OUTDIR - easier to compile from there
+copy-all-exercises:
+	@echo "Copying files..."
+	@mkdir -p $(OUTDIR)/src
+	@mkdir -p $(OUTDIR)/__tests__
+	@for exercise in $(EXERCISES); do EXERCISE=$$exercise $(MAKE) -s copy-exercise || exit 1; done
+
+# Remove the OUTDIR
+clean:
+	@rm -rf $(OUTDIR)
+
+.PHONY: clean

data/tracks/reasonml/README.md

@@ -34,7 +34,8 @@ describe("Leap", () => {
   test("year divisible by 4, not divisible by 100: leap year", () =>
     expect(Leap.is_leap_year(1996)) |> toBe(true)
   );
-})```
+})
+```
 
 ## Opening an Issue
 

data/tracks/reasonml/bsconfig.json

@@ -0,0 +1,25 @@
+{
+  "name": "exercism-reason",
+  "version": "0.1.0",
+  "sources": [
+    {
+      "dir" : "tmp/src",
+      "subdirs" : true
+    },
+    {
+      "dir": "tmp/__tests__",
+      "type": "dev"
+    }
+  ],
+  "package-specs": {
+    "module": "commonjs",
+    "in-source": true
+  },
+  "suffix": ".bs.js",
+  "bs-dev-dependencies": ["@glennsl/bs-jest"],
+  "warnings": {
+    "error" : "+101"
+  },
+  "namespace": true,
+  "refmt": 3
+}

data/tracks/reasonml/config/maintainers.json

@@ -1,4 +1,15 @@
 {
   "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md",
-  "maintainers": []
+  "maintainers": [
+    {
+      "github_username": "stevejb71",
+      "alumnus": false,
+      "show_on_website": false,
+      "name": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null,
+      "bio": null
+    }    
+  ]
 }

data/tracks/reasonml/config.json

@@ -102,6 +102,28 @@
         "list_map_function"
       ]
     },
+    {
+      "slug": "binary-search",
+      "uuid": "eb635d37-a70b-47b2-883b-8ec9ca6098ef",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
+      "topics": [
+        "arrays",
+        "recursion"
+      ]
+    },
+    {
+      "slug": "run-length-encoding",
+      "uuid": "1c8245de-3ae2-4b59-83a9-d34c540f67f0",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "strings",
+        "converting_strings_to_ints"
+      ]
+    },
     {
       "slug": "change",
       "uuid": "3526ae52-5962-43d6-ae83-dd6a9ca6e25b",

data/tracks/reasonml/exercises/anagram/README.md

@@ -0,0 +1,18 @@
+# Anagram
+
+Given a word and a list of possible anagrams, select the correct sublist.
+
+Given `"listen"` and a list of candidates like `"enlists" "google"
+"inlets" "banana"` the program should return a list containing
+`"inlets"`.
+
+# Build
+```
+npm run build
+```
+
+# Build + Watch
+
+```
+npm run start
+```

data/tracks/reasonml/exercises/binary-search/README.md

@@ -0,0 +1,50 @@
+# Binary Search
+
+Implement a binary search algorithm.
+
+Searching a sorted collection is a common task. A dictionary is a sorted
+list of word definitions. Given a word, one can find its definition. A
+telephone book is a sorted list of people's names, addresses, and
+telephone numbers. Knowing someone's name allows one to quickly find
+their telephone number and address.
+
+If the list to be searched contains more than a few items (a dozen, say)
+a binary search will require far fewer comparisons than a linear search,
+but it imposes the requirement that the list be sorted.
+
+In computer science, a binary search or half-interval search algorithm
+finds the position of a specified input value (the search "key") within
+an array sorted by key value.
+
+In each step, the algorithm compares the search key value with the key
+value of the middle element of the array.
+
+If the keys match, then a matching element has been found and its index,
+or position, is returned.
+
+Otherwise, if the search key is less than the middle element's key, then
+the algorithm repeats its action on the sub-array to the left of the
+middle element or, if the search key is greater, on the sub-array to the
+right.
+
+If the remaining array to be searched is empty, then the key cannot be
+found in the array and a special "not found" indication is returned.
+
+A binary search halves the number of items to check with each iteration,
+so locating an item (or determining its absence) takes logarithmic time.
+A binary search is a dichotomic divide and conquer search algorithm.
+
+# Build
+```
+npm run build
+```
+
+# Build + Watch
+
+```
+npm run start
+```
+
+
+# Editor
+If you use `vscode`, Press `Windows + Shift + B` it will build automatically

data/tracks/reasonml/exercises/binary-search/__tests__/BinarySearch_test.re

@@ -0,0 +1,39 @@
+open Jest;
+open Expect;
+open BinarySearch;
+
+describe("Binary search", () => {
+  test("finds a value in an array with one element", () =>
+    expect(find([|6|], 6)) |> toEqual(Some(0))
+  );
+  test("finds a value in the middle of an array", () => 
+    expect(find([|1, 3, 4, 6, 8, 9, 11|], 6)) |> toEqual(Some(3))
+  );
+  test("finds a value at the beginning of an array", () => 
+    expect(find([|1, 3, 4, 6, 8, 9, 11|], 1)) |> toEqual(Some(0))
+  );
+  test("finds a value at the end of an array", () => 
+    expect(find([|1, 3, 4, 6, 8, 9, 11|], 11)) |> toEqual(Some(6))
+  );
+  test("finds a value in an array of odd length", () => 
+    expect(find([|1, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 634|], 144)) |> toEqual(Some(9))
+  );
+  test("finds a value in an array of even length", () => 
+    expect(find([|1, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377|], 21)) |> toEqual(Some(5))
+  );
+  test("identifies that a value is not included in the array", () => 
+    expect(find([|1, 3, 4, 6, 8, 9, 11|], 7)) |> toEqual(None)
+  );
+  test("a value smaller than the array's smallest value is not included", () => 
+    expect(find([|1, 3, 4, 6, 8, 9, 11|], 0)) |> toEqual(None)
+  );
+  test("a value larger than the array's largest value is not included", () => 
+    expect(find([|1, 3, 4, 6, 8, 9, 11|], 13)) |> toEqual(None)
+  );
+  test("nothing is included in an empty array", () => 
+    expect(find([||], 1)) |> toEqual(None)
+  );
+});
+
+
+

data/tracks/reasonml/exercises/binary-search/bsconfig.json

@@ -0,0 +1,30 @@
+// This is the configuration file used by BuckleScript's build system bsb. Its documentation lives here: http://bucklescript.github.io/bucklescript/docson/#build-schema.json
+// BuckleScript comes with its own parser for bsconfig.json, which is normal JSON, with the extra support of comments and trailing commas.
+{
+  "name": "binary-search",
+  "version": "0.1.0",
+  "sources": [
+    {
+      "dir" : "src",
+      "subdirs" : true
+    },
+    {
+      "dir": "__tests__",
+      "type": "dev"
+    }
+  ],
+  "package-specs": {
+    "module": "commonjs",
+    "in-source": true
+  },
+  "suffix": ".bs.js",
+  "bs-dependencies": [
+      // add your dependencies here. You'd usually install them normally through `npm install my-dependency`. If my-dependency has a bsconfig.json too, then everything will work seamlessly.
+  ],
+  "bs-dev-dependencies": ["@glennsl/bs-jest"],
+  "warnings": {
+    "error" : "+101"
+  },
+  "namespace": true,
+  "refmt": 3
+}

data/tracks/reasonml/exercises/binary-search/package.json

@@ -0,0 +1,20 @@
+{
+  "name": "binary-search",
+  "version": "0.1.0",
+  "scripts": {
+    "build": "bsb -make-world",
+    "start": "bsb -make-world -w",
+    "clean": "bsb -clean-world",
+    "test": "jest --watchAll",
+    "test:ci": "jest --ci --bail --no-cache"
+  },
+  "keywords": [
+    "BuckleScript"
+  ],
+  "author": "",
+  "license": "MIT",
+  "devDependencies": {
+    "@glennsl/bs-jest": "^0.4.2",
+    "bs-platform": "^3.1.5"
+  }
+}

data/tracks/reasonml/exercises/binary-search/src/Example.re

@@ -0,0 +1,17 @@
+let find = (array, value) => {
+  let rec go = (lo, hi) =>
+    if (lo > hi) {
+      None;
+    } else {
+      let mid = lo + (hi - lo) / 2;
+      let mid_val = array[mid];
+      if (mid_val < value) {
+        go(mid + 1, hi);
+      } else if (mid_val > value) {
+        go(lo, mid - 1);
+      } else {
+        Some(mid);
+      };
+    };
+  go(0, Array.length(array) - 1);
+};

data/tracks/reasonml/exercises/bob/README.md

@@ -24,6 +24,5 @@ npm run build
 npm run start
 ```
 
-
 # Editor
 If you use `vscode`, Press `Windows + Shift + B` it will build automatically

data/tracks/reasonml/exercises/leap/README.md

@@ -1,5 +1,31 @@
 # Leap in ReasonML
 
+Given a year, report if it is a leap year.
+
+The tricky thing here is that a leap year in the Gregorian calendar occurs:
+
+```text
+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
+
 # Build + Watch
 
 ```

data/tracks/reasonml/exercises/rna-transcription/README.md

@@ -0,0 +1,31 @@
+# RNA Transcription
+
+Given a DNA strand, return its RNA complement (per RNA transcription).
+
+Both DNA and RNA strands are a sequence of nucleotides.
+
+The four nucleotides found in DNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and thymine (**T**).
+
+The four nucleotides found in RNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and uracil (**U**).
+
+Given a DNA strand, its transcribed RNA strand is formed by replacing
+each nucleotide with its complement:
+
+* `G` -> `C`
+* `C` -> `G`
+* `T` -> `A`
+* `A` -> `U`
+
+# Build + Watch
+
+```
+npm start
+```
+
+# Test + Watch
+
+```
+npm test
+```

data/tracks/reasonml/exercises/run-length-encoding/README.md

@@ -0,0 +1,39 @@
+# Run Length Encoding
+
+Implement run-length encoding and decoding.
+
+Run-length encoding (RLE) is a simple form of data compression, where runs
+(consecutive data elements) are replaced by just one data value and count.
+
+For example we can represent the original 53 characters with only 13.
+
+```text
+"WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB"  ->  "12WB12W3B24WB"
+```
+
+RLE allows the original data to be perfectly reconstructed from
+the compressed data, which makes it a lossless data compression.
+
+```text
+"AABCCCDEEEE"  ->  "2AB3CD4E"  ->  "AABCCCDEEEE"
+```
+
+For simplicity, you can assume that the unencoded string will only contain
+the letters A through Z (either lower or upper case) and whitespace. This way
+data to be encoded will never contain any numbers and numbers inside data to
+be decoded always represent the count for the following character.
+
+# Build
+```
+npm run build
+```
+
+# Build + Watch
+
+```
+npm run start
+```
+
+
+# Editor
+If you use `vscode`, Press `Windows + Shift + B` it will build automatically

data/tracks/reasonml/exercises/run-length-encoding/__tests__/RunLengthEncoding_test.re

@@ -0,0 +1,51 @@
+open Jest;
+open Expect;
+open RunLengthEncoding;
+
+describe("encode function", () => {
+  test("empty string", () =>
+    expect(encode("")) |> toBe("")
+  );
+  test("single characters only are encoded without count", () =>
+    expect(encode("XYZ")) |> toBe("XYZ")
+  );
+  test("string with no single characters", () =>
+    expect(encode("AABBBCCCC")) |> toBe("2A3B4C")
+  );
+  test("single characters mixed with repeated characters", () =>
+    expect(encode("WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB")) |> toBe("12WB12W3B24WB")
+  );
+  test("multiple whitespace mixed in string", () =>
+    expect(encode("  hsqq qww  ")) |> toBe("2 hs2q q2w2 ")
+  );
+  test("lowercase characters", () =>
+    expect(encode("aabbbcccc")) |> toBe("2a3b4c")
+  );
+});
+
+describe("decode function", () => {
+  test("empty string", () =>
+    expect(decode("")) |> toBe("")
+  );
+  test("single characters only", () =>
+    expect(decode("XYZ")) |> toBe("XYZ")
+  );
+  test("string with no single characters", () =>
+    expect(decode("2A3B4C")) |> toBe("AABBBCCCC")
+  );
+  test("single characters with repeated characters", () =>
+    expect(decode("12WB12W3B24WB")) |> toBe("WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB")
+  );
+  test("multiple whitespace mixed in string", () =>
+    expect(decode("2 hs2q q2w2 ")) |> toBe("  hsqq qww  ")
+  );
+  test("lower case string", () =>
+    expect(decode("2a3b4c")) |> toBe("aabbbcccc")
+  );
+});
+
+describe("Encode/decode are inverse operations", () => {
+  test("encode(followed by decode gives original string", () =>
+    expect(encode("zzz ZZ  zZ") |> decode) |> toBe("zzz ZZ  zZ")
+  );
+});

data/tracks/reasonml/exercises/run-length-encoding/bsconfig.json

@@ -0,0 +1,30 @@
+// This is the configuration file used by BuckleScript's build system bsb. Its documentation lives here: http://bucklescript.github.io/bucklescript/docson/#build-schema.json
+// BuckleScript comes with its own parser for bsconfig.json, which is normal JSON, with the extra support of comments and trailing commas.
+{
+  "name": "run-length-encoding",
+  "version": "0.1.0",
+  "sources": [
+    {
+      "dir" : "src",
+      "subdirs" : true
+    },
+    {
+      "dir": "__tests__",
+      "type": "dev"
+    }
+  ],
+  "package-specs": {
+    "module": "commonjs",
+    "in-source": true
+  },
+  "suffix": ".bs.js",
+  "bs-dependencies": [
+      // add your dependencies here. You'd usually install them normally through `npm install my-dependency`. If my-dependency has a bsconfig.json too, then everything will work seamlessly.
+  ],
+  "bs-dev-dependencies": ["@glennsl/bs-jest"],
+  "warnings": {
+    "error" : "+101"
+  },
+  "namespace": true,
+  "refmt": 3
+}

data/tracks/reasonml/exercises/run-length-encoding/package.json

@@ -0,0 +1,20 @@
+{
+  "name": "run-length-encoding",
+  "version": "0.1.0",
+  "scripts": {
+    "build": "bsb -make-world",
+    "start": "bsb -make-world -w",
+    "clean": "bsb -clean-world",
+    "test": "jest --watchAll",
+    "test:ci": "jest --ci --bail --no-cache"
+  },
+  "keywords": [
+    "BuckleScript"
+  ],
+  "author": "",
+  "license": "MIT",
+  "devDependencies": {
+    "@glennsl/bs-jest": "^0.4.2",
+    "bs-platform": "^3.1.5"
+  }
+}

data/tracks/reasonml/exercises/run-length-encoding/src/Example.re

@@ -0,0 +1,60 @@
+let isDigit = (ch: char) => {
+  let ord = Char.code(ch);
+  ord >= 48 && ord <= 57;
+};
+
+let rec toInt = (s: string, ptr: int, acc: int) => {
+  if(ptr == String.length(s)) {
+    (ptr, acc)
+  } else {
+    if(!isDigit(s.[ptr])) {
+      (ptr, acc)
+    } else {
+      toInt(s, ptr + 1, 10 * acc + Char.code(s.[ptr]) - 48)
+    }
+  }
+};
+
+let rec unfoldString = (startPtr: int, acc: string, consume, s: string): string => {
+  if(s == "" || startPtr == String.length(s)) {
+    acc;
+  } else {
+    let (nextPtr, nextChunk) = consume(s, startPtr);
+    unfoldString(nextPtr, acc ++ nextChunk, consume, s);
+  }
+};
+
+let rec skipWhileUnchanged = (s: string, startPtr: int, ptr: int): int => {
+  if(ptr < String.length(s) && s.[ptr] == s.[startPtr]) {
+    skipWhileUnchanged(s, startPtr, ptr + 1)
+  } else {
+    ptr  
+  }
+};
+
+let chunk = (plainText: string, startPtr: int) => {
+  let nextPtr = skipWhileUnchanged(plainText, startPtr, startPtr + 1);
+  let chunkLength = nextPtr - startPtr;
+  let chunkChar = plainText.[startPtr];
+  let chunked = if(chunkLength == 1) {
+    String.make(1, chunkChar)
+  } else {
+    string_of_int(chunkLength) ++ String.make(1, chunkChar)
+  };
+  (nextPtr, chunked);
+};
+
+let expand = (rleText: string, startPtr: int) => {
+  let firstChar = rleText.[startPtr];
+  let (nextPtr, size) = if(isDigit(firstChar)) {
+    toInt(rleText, startPtr, 0)
+  } else {
+    (startPtr, 1)
+  };
+  let expansionChar = rleText.[nextPtr];
+  (nextPtr + 1, String.make(size, expansionChar))
+};
+
+let encode = unfoldString(0, "", chunk);
+
+let decode = unfoldString(0, "", expand);

data/tracks/reasonml/exercises/space-age/README.md

@@ -0,0 +1,30 @@
+# Space Age
+
+Given an age in seconds, calculate how old someone would be on:
+
+   - Earth: orbital period 365.25 Earth days, or 31557600 seconds
+   - Mercury: orbital period 0.2408467 Earth years
+   - Venus: orbital period 0.61519726 Earth years
+   - Mars: orbital period 1.8808158 Earth years
+   - Jupiter: orbital period 11.862615 Earth years
+   - Saturn: orbital period 29.447498 Earth years
+   - Uranus: orbital period 84.016846 Earth years
+   - Neptune: orbital period 164.79132 Earth years
+
+So if you were told someone were 1,000,000,000 seconds old, you should
+be able to say that they're 31.69 Earth-years old.
+
+If you're wondering why Pluto didn't make the cut, go watch [this
+youtube video](http://www.youtube.com/watch?v=Z_2gbGXzFbs).
+
+# Build + Watch
+
+```
+npm start
+```
+
+# Test + Watch
+
+```
+npm test
+```