trackler 2.2.1.40 → 2.2.1.41

data/tracks/dart/exercises/raindrops/pubspec.lock

@@ -0,0 +1,281 @@
+# Generated by pub
+# See http://pub.dartlang.org/doc/glossary.html#lockfile
+packages:
+  analyzer:
+    description:
+      name: analyzer
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.30.0+4"
+  args:
+    description:
+      name: args
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.0"
+  async:
+    description:
+      name: async
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.13.3"
+  barback:
+    description:
+      name: barback
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.15.2+12"
+  boolean_selector:
+    description:
+      name: boolean_selector
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.2"
+  charcode:
+    description:
+      name: charcode
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.1.1"
+  cli_util:
+    description:
+      name: cli_util
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.1.2+1"
+  collection:
+    description:
+      name: collection
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.14.3"
+  convert:
+    description:
+      name: convert
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "2.0.1"
+  crypto:
+    description:
+      name: crypto
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "2.0.2+1"
+  csslib:
+    description:
+      name: csslib
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.14.1"
+  front_end:
+    description:
+      name: front_end
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.1.0-alpha.4.1"
+  glob:
+    description:
+      name: glob
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.1.5"
+  html:
+    description:
+      name: html
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.13.2"
+  http:
+    description:
+      name: http
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.11.3+15"
+  http_multi_server:
+    description:
+      name: http_multi_server
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "2.0.4"
+  http_parser:
+    description:
+      name: http_parser
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "3.1.1"
+  isolate:
+    description:
+      name: isolate
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.1.0"
+  kernel:
+    description:
+      name: kernel
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.3.0-alpha.1.1"
+  logging:
+    description:
+      name: logging
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.11.3+1"
+  matcher:
+    description:
+      name: matcher
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.12.1+4"
+  meta:
+    description:
+      name: meta
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.1.2"
+  mime:
+    description:
+      name: mime
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.9.3"
+  package_config:
+    description:
+      name: package_config
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.3"
+  package_resolver:
+    description:
+      name: package_resolver
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.2"
+  path:
+    description:
+      name: path
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.4.2"
+  plugin:
+    description:
+      name: plugin
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.2.0+2"
+  pool:
+    description:
+      name: pool
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.3.3"
+  pub_semver:
+    description:
+      name: pub_semver
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.3.2"
+  shelf:
+    description:
+      name: shelf
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.7.0"
+  shelf_packages_handler:
+    description:
+      name: shelf_packages_handler
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.3"
+  shelf_static:
+    description:
+      name: shelf_static
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.2.5"
+  shelf_web_socket:
+    description:
+      name: shelf_web_socket
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.2.2"
+  source_map_stack_trace:
+    description:
+      name: source_map_stack_trace
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.1.4"
+  source_maps:
+    description:
+      name: source_maps
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.10.4"
+  source_span:
+    description:
+      name: source_span
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.4.0"
+  stack_trace:
+    description:
+      name: stack_trace
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.8.2"
+  stream_channel:
+    description:
+      name: stream_channel
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.6.2"
+  string_scanner:
+    description:
+      name: string_scanner
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.2"
+  term_glyph:
+    description:
+      name: term_glyph
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.0"
+  test:
+    description:
+      name: test
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.12.23+1"
+  typed_data:
+    description:
+      name: typed_data
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.1.5"
+  utf:
+    description:
+      name: utf
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.9.0+3"
+  watcher:
+    description:
+      name: watcher
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "0.9.7+4"
+  web_socket_channel:
+    description:
+      name: web_socket_channel
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "1.0.6"
+  yaml:
+    description:
+      name: yaml
+      url: "https://pub.dartlang.org"
+    source: hosted
+    version: "2.1.13"
+sdks:
+  dart: ">=1.23.0 <2.0.0-dev.infinity"

data/tracks/dart/exercises/raindrops/pubspec.yaml

@@ -0,0 +1,3 @@
+name: 'raindrops'
+dev_dependencies:
+  test: '<0.13.0'

data/tracks/dart/exercises/raindrops/test/raindrops_test.dart

@@ -0,0 +1,94 @@
+import "package:test/test.dart";
+import "package:raindrops/raindrops.dart";
+
+final raindrops = new Raindrops();
+void main() {
+  group("identity tests", identityTests);
+  group("factor tests", factorTests);
+  group("multiple factor tests", multipleFactorTests);
+  group("edge case tests", edgeCaseTests);
+}
+
+void identityTests() {
+  test("the sound for 1 is 1", () {
+    final String result = raindrops.convert(1);
+    expect(result, equals("1"));
+  }, skip: false);
+  test("the sound for 3 is Pling", () {
+    final String result = raindrops.convert(3);
+    expect(result, equals("Pling"));
+  }, skip: true);
+  test("the sound for 5 is Plang", () {
+    final String result = raindrops.convert(5);
+    expect(result, equals("Plang"));
+  }, skip: true);
+  test("the sound for 7 is Plong", () {
+    final String result = raindrops.convert(7);
+    expect(result, equals("Plong"));
+  }, skip: true);
+}
+
+void factorTests() {
+  test("the sound for 6 is Pling as it has a factor 3", () {
+    final String result = raindrops.convert(6);
+    expect(result, equals("Pling"));
+  }, skip: true);
+  test("2 to the power 3 does not make a raindrop sound as 3 is the exponent not the base", () {
+    final String result = raindrops.convert(8);
+    expect(result, equals("8"));
+  }, skip: true);
+  test("the sound for 9 is Pling as it has a factor 3", () {
+    final String result = raindrops.convert(9);
+    expect(result, equals("Pling"));
+  }, skip: true);
+  test("the sound for 10 is Plang as it has a factor 5", () {
+    final String result = raindrops.convert(10);
+    expect(result, equals("Plang"));
+  }, skip: true);
+  test("the sound for 14 is Plong as it has a factor of 7", () {
+    final String result = raindrops.convert(14);
+    expect(result, equals("Plong"));
+  }, skip: true);
+}
+
+void multipleFactorTests() {
+  test("the sound for 15 is PlingPlang as it has factors 3 and 5", () {
+    final String result = raindrops.convert(15);
+    expect(result, equals("PlingPlang"));
+  }, skip: true);
+  test("the sound for 21 is PlingPlong as it has factors 3 and 7", () {
+    final String result = raindrops.convert(21);
+    expect(result, equals("PlingPlong"));
+  }, skip: true);
+  test("the sound for 35 is PlangPlong as it has factors 5 and 7", () {
+    final String result = raindrops.convert(35);
+    expect(result, equals("PlangPlong"));
+  }, skip: true);
+}
+
+void edgeCaseTests() {
+  test("the sound for 25 is Plang as it has a factor 5", () {
+    final String result = raindrops.convert(25);
+    expect(result, equals("Plang"));
+  }, skip: true);
+  test("the sound for 27 is Pling as it has a factor 3", () {
+    final String result = raindrops.convert(27);
+    expect(result, equals("Pling"));
+  }, skip: true);
+  test("the sound for 49 is Plong as it has a factor 7", () {
+    final String result = raindrops.convert(49);
+    expect(result, equals("Plong"));
+  }, skip: true);
+  test("the sound for 52 is 52", () {
+    final String result = raindrops.convert(52);
+    expect(result, equals("52"));
+  }, skip: true);
+  test("the sound for 105 is PlingPlangPlong as it has factors 3, 5 and 7", () {
+    final String result = raindrops.convert(105);
+    expect(result, equals("PlingPlangPlong"));
+  }, skip: true);
+  test("the sound for 3125 is Plang as it has a factor 5", () {
+    final String result = raindrops.convert(3215);
+    expect(result, equals("Plang"));
+  }, skip: true);
+}

data/tracks/delphi/exercises/pig-latin/uPigLatinExample.pas

@@ -5,7 +5,6 @@ interface
 type
   TPigLatin = class
   private
-    class function WordOnlyHasYForAVowel(aWord: string): boolean;
     class function WordStartsWithVowelLike(aWord: string): boolean;
     class function WordStartsWithPrefixes(aWord: string; aPrefixes: array of string): boolean;
     class function WordStartsWithConsonantAndQu(aWord: string): boolean;
@@ -37,21 +36,14 @@ begin
 end;
 
 class function TPigLatin.TranslateWord(aWord: string): string;
-var splitWordAtY: TArray<string>;
 begin
-  if WordOnlyHasYForAVowel(aWord) then
-  begin
-    splitWordAtY := aWord.Split(['y']);
-    result := 'y' + splitWordAtY[1] + splitWordAtY[0] + 'ay';
-  end
-  else
   if WordStartsWithVowelLike(aWord) then
     result := aWord + 'ay'
   else
   if WordStartsWithPrefixes(aWord, ['thr', 'sch']) then
     result :=  aword.Substring(3) + aWord.Substring(0, 3) + 'ay'
   else
-  if WordStartsWithPrefixes(aWord, ['ch', 'qu', 'th']) then
+  if WordStartsWithPrefixes(aWord, ['ch', 'qu', 'th', 'rh']) then
     result := aWord.Substring(2) + aWord.Substring(0, 2) + 'ay'
   else
   if WordStartsWithConsonantAndQu(aWord) then
@@ -60,22 +52,6 @@ begin
     result := aWord.Substring(1) + aWord[1] + 'ay';
 end;
 
-class function TPigLatin.WordOnlyHasYForAVowel(aWord: string): boolean;
-var singleLetter: string;
-begin
-  result := false;
-  for singleLetter in aWord do
-  begin
-    result := TRegex.IsMatch(singleLetter,'[aeiou]',[roIgnoreCase]);
-    if result then
-      break;
-  end;
-  if not result then
-    result := aWord.Contains('y')
-  else
-    result := false;
-end;
-
 class function TPigLatin.WordStartsWithConsonantAndQu(aWord: string): boolean;
 begin
   result := aWord.Substring(1).StartsWith('qu');

data/tracks/haskell/config.json

@@ -105,6 +105,15 @@
       "topics": [
       ]
     },
+    {
+      "uuid": "40d4aa74-6e4a-4579-810e-b4430bc172e8",
+      "slug": "diamond",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
+      "topics": [
+      ]
+    },
     {
       "uuid": "197a543c-d9c7-41c3-814c-4b1ece3db568",
       "slug": "grains",

data/tracks/haskell/exercises/acronym/README.md

@@ -8,7 +8,6 @@ Help generate some jargon by writing a program that converts a long name
 like Portable Network Graphics to its acronym (PNG).
 
 
-
 ## Getting Started
 
 For installation and learning resources, refer to the

data/tracks/haskell/exercises/all-your-base/README.md

@@ -6,6 +6,7 @@ Implement general base conversion. Given a number in base **a**,
 represented as a sequence of digits, convert it to base **b**.
 
 ## Note
+
 - Try to implement the conversion yourself.
   Do not use something else to perform the conversion for you.
 
@@ -28,7 +29,6 @@ The number 1120, *in base 3*, means:
 
 I think you got the idea!
 
-
 *Yes. Those three numbers above are exactly the same. Congratulations!*
 
 

data/tracks/haskell/exercises/allergies/README.md

@@ -29,7 +29,6 @@ allergens that score 256, 512, 1024, etc.).  Your program should
 ignore those components of the score.  For example, if the allergy
 score is 257, your program should only report the eggs (1) allergy.
 
-
 ## Hints
 
 To complete this exercise you need to to create the data type `Allergen`,

data/tracks/haskell/exercises/alphametics/README.md

@@ -7,7 +7,7 @@ letters in words are replaced with numbers.
 
 For example `SEND + MORE = MONEY`:
 
-```
+```text
   S E N D
   M O R E +
 -----------
@@ -16,7 +16,7 @@ M O N E Y
 
 Replacing these with valid numbers gives:
 
-```
+```text
   9 5 6 7
   1 0 8 5 +
 -----------

data/tracks/haskell/exercises/atbash-cipher/README.md

@@ -9,7 +9,7 @@ letter, the second with the second-last, and so on.
 
 An Atbash cipher for the Latin alphabet would be as follows:
 
-```plain
+```text
 Plain:  abcdefghijklmnopqrstuvwxyz
 Cipher: zyxwvutsrqponmlkjihgfedcba
 ```
@@ -23,6 +23,7 @@ being 5 letters, and punctuation is excluded. This is to make it harder to guess
 things based on word boundaries.
 
 ## Examples
+
 - Encoding `test` gives `gvhg`
 - Decoding `gvhg` gives `test`
 - Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`

data/tracks/haskell/exercises/beer-song/README.md

@@ -4,7 +4,7 @@ Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles
 
 Note that not all verses are identical.
 
-```plain
+```text
 99 bottles of beer on the wall, 99 bottles of beer.
 Take one down and pass it around, 98 bottles of beer on the wall.
 

data/tracks/haskell/exercises/binary/README.md

@@ -7,10 +7,12 @@ string, your program should produce a decimal output. The
 program should handle invalid inputs.
 
 ## Note
+
 - Implement the conversion yourself.
   Do not use something else to perform the conversion for you.
 
 ## About Binary (Base-2)
+
 Decimal is a base-10 system.
 
 A number 23 in base 10 notation can be understood

data/tracks/haskell/exercises/bowling/README.md

@@ -2,19 +2,29 @@
 
 Score a bowling game.
 
-Bowling is game where players roll a heavy ball to knock down pins
+Bowling is a game where players roll a heavy ball to knock down pins
 arranged in a triangle. Write code to keep track of the score
 of a game of bowling.
 
 ## Scoring Bowling
 
-The game consists of 10 frames. A frame is composed of one or two ball throws with 10 pins standing at frame initialization. There are three cases for the tabulation of a frame.
+The game consists of 10 frames. A frame is composed of one or two ball
+throws with 10 pins standing at frame initialization. There are three
+cases for the tabulation of a frame.
 
-* An open frame is where a score of less than 10 is recorded for the frame. In this case the score for the frame is the number of pins knocked down.
+* An open frame is where a score of less than 10 is recorded for the
+  frame. In this case the score for the frame is the number of pins
+  knocked down.
 
-* A spare is where all ten pins are knocked down after the second throw. The total value of a spare is 10 plus the number of pins knocked down in their next throw.
+* A spare is where all ten pins are knocked down by the second
+  throw. The total value of a spare is 10 plus the number of pins
+  knocked down in their next throw.
 
-* A strike is where all ten pins are knocked down after the first throw. The total value of a strike is 10 plus the number of pins knocked down in their next two throws. If a strike is immediately followed by a second strike, then we can not total the value of first strike until they throw the ball one more time.
+* A strike is where all ten pins are knocked down by the first
+  throw. The total value of a strike is 10 plus the number of pins
+  knocked down in the next two throws. If a strike is immediately
+  followed by a second strike, then the value of the first strike
+  cannot be determined until the ball is thrown one more time.
 
 Here is a three frame example:
 
@@ -30,7 +40,11 @@ Frame 3 is (9 + 0) = 9
 
 This means the current running total is 48.
 
-The tenth frame in the game is a special case. If someone throws a strike or a spare then they get a fill ball. Fill balls exist to calculate the total of the 10th frame. Scoring a strike or spare on the fill ball does not give the player more fill balls. The total value of the 10th frame is the total number of pins knocked down.
+The tenth frame in the game is a special case. If someone throws a
+strike or a spare then they get a fill ball. Fill balls exist to
+calculate the total of the 10th frame. Scoring a strike or spare on
+the fill ball does not give the player more fill balls. The total
+value of the 10th frame is the total number of pins knocked down.
 
 For a tenth frame of X1/ (strike and a spare), the total value is 20.
 

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

@@ -10,6 +10,7 @@ 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
@@ -26,7 +27,6 @@ Starting with n = 12, the steps would be as follows:
 Resulting in 9 steps. So for input n = 12, the return value would be 9.
 
 
-
 ## Getting Started
 
 For installation and learning resources, refer to the

data/tracks/haskell/exercises/connect/README.md

@@ -18,7 +18,7 @@ computes the winner (or lack thereof). Note that all games need not be "fair".
 The boards look like this (with spaces added for readability, which won't be in
 the representation passed to your code):
 
-```        
+```text
 . O . X .
  . X X O .
   O O O X .

data/tracks/haskell/exercises/crypto-square/README.md

@@ -26,7 +26,7 @@ and `r` is the number of rows.
 Our normalized text is 54 characters long, dictating a rectangle with
 `c = 8` and `r = 7`:
 
-```plain
+```text
 ifmanwas
 meanttos
 tayonthe
@@ -41,7 +41,7 @@ right.
 
 The message above is coded as:
 
-```plain
+```text
 imtgdvsfearwermayoogoanouuiontnnlvtwttddesaohghnsseoau
 ```
 
@@ -49,14 +49,14 @@ Output the encoded text in chunks.  Phrases that fill perfect squares
 `(r X r)` should be output in `r`-length chunks separated by spaces.
 Imperfect squares will have `n` empty spaces.  Those spaces should be distributed evenly across the last `n` rows.
 
-```plain
+```text
 imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau
 ```
 
 Notice that were we to stack these, we could visually decode the
 cyphertext back in to the original message:
 
-```plain
+```text
 imtgdvs
 fearwer
 mayoogo