trackler 2.0.6.6 → 2.0.6.7

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 8a21f979fb3f1492834008a98a524077cff2d0b2
-  data.tar.gz: 10ff768afd6613b122020ff2a9054101f3886244
+  metadata.gz: 6cc0a77186d7fa2d5ea7277f76bbd16c0e610a52
+  data.tar.gz: bd56a7bb8a6d1a0d68cf50e13e3a0b8c555f2159
 SHA512:
-  metadata.gz: 4626e4391ae111a17500f5eadd483a10a95a4436c9d2c9e687729821a2d80d3a3adb4de1532acb9d4227f30f880479c406b6ab85fd48e59ddc3e90b80f1bdfab
-  data.tar.gz: 784fc5dc94f2fefe34ce60955ff9182ed2d3599c735097b2ff3d35305c572e8ac834f659912afde3031249197172cfac7e322754cb01acb8a33be08416175e62
+  metadata.gz: b6ceea973ff044d16bb0976de1ce9ba06c91c6deec0abb8a09f2878e1f88e811f86bed65a4eeb36626b4146432220c451b3126b3bf8f05867ef62669ef9cda1e
+  data.tar.gz: 92c97e22e97b13a145ebaa8e4a61aa690907bb017bcfe7c2317199fd1eced5be3a45b1fcb5fc9b9cac1d31b7a60f1d620a36bce790555181fb30ac8a01a99a7c

data/common/exercises/perfect-numbers/description.md

@@ -15,6 +15,6 @@ including the number itself.
 
 - 6 is a perfect number because its divisors are 1, 2, 3 and 6 = 1 + 2 +
   3.
-- 28 is perfect number because 28 = 1 + 2 + 4 + 7 + 14.
-- Prime numbers 7, 13, etc are Deficient by the Nicomachus
+- 28 is a perfect number because 28 = 1 + 2 + 4 + 7 + 14.
+- Prime numbers 7, 13, etc are considered deficient in the Nicomachus
   classification.

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.6.6"
+  VERSION = "2.0.6.7"
 end

data/tracks/c/exercises/allergies/src/allergies.h

@@ -1,5 +1,5 @@
-#ifndef _ALLERGIES_H
-#define _ALLERGIES_H
+#ifndef ALLERGIES_H
+#define ALLERGIES_H
 
 typedef enum {
    Allergen_Eggs = 0,

data/tracks/c/exercises/allergies/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _ALLERGIES_H
-#define _ALLERGIES_H
+#ifndef ALLERGIES_H
+#define ALLERGIES_H
 
 #include <stdbool.h>
 

data/tracks/c/exercises/anagram/src/anagram.h

@@ -1,5 +1,5 @@
-#ifndef _ANAGRAM_H
-#define _ANAGRAM_H
+#ifndef ANAGRAM_H
+#define ANAGRAM_H
 
 #define MAX_STR_LEN 20
 

data/tracks/c/exercises/anagram/test/test_anagram.c

@@ -4,11 +4,32 @@
 #include "vendor/unity.h"
 #include "../src/anagram.h"
 
-int stringcmp(const void *a, const void *b)
+// Empty vector for when expected output is nothing
+static struct Vector empty = {
+   NULL,
+   0
+};
+
+static int stringcmp(const void *a, const void *b)
 {
    return strcmp(a, b);
 }
 
+// Asserts that the two input vectors are equal
+static void assert_equal_vector(struct Vector vout, struct Vector expected)
+{
+   // Sort actual and expected outputs for consistency
+   qsort(expected.vec, expected.size, sizeof(char) * MAX_STR_LEN, stringcmp);
+   qsort(vout.vec, vout.size, sizeof(char) * MAX_STR_LEN, stringcmp);
+
+   TEST_ASSERT_EQUAL(expected.size, vout.size);
+   for (int x = 0; x < vout.size; x++) {
+      TEST_ASSERT_EQUAL(strlen(expected.vec[x]), strlen(vout.vec[x]));
+      TEST_ASSERT_EQUAL_MEMORY(expected.vec[x], vout.vec[x],
+                               strlen(expected.vec[x]));
+   }
+}
+
 void test_no_matches(void)
 {
    char inputs[][MAX_STR_LEN] = {
@@ -24,15 +45,12 @@ void test_no_matches(void)
    };
 
    struct Vector vout = anagrams_for("diaper", vin);
-
-   TEST_ASSERT_EQUAL(0, vout.size);
-
+   assert_equal_vector(vout, empty);
    free(vout.vec);
 }
 
 void test_detect_simple_anagram(void)
 {
-   int x;
    char inputs[][MAX_STR_LEN] = {
       "tan",
       "stand",
@@ -42,21 +60,19 @@ void test_detect_simple_anagram(void)
    char outputs[][MAX_STR_LEN] = {
       "tan"
    };
-   int outputs_len = sizeof(outputs) / MAX_STR_LEN;
 
    struct Vector vin = {
       inputs,
       sizeof(inputs) / MAX_STR_LEN
    };
 
-   struct Vector vout = anagrams_for("ant", vin);
-
-   TEST_ASSERT_EQUAL(outputs_len, vout.size);
-   for (x = 0; x < vout.size; x++) {
-      TEST_ASSERT_EQUAL(strlen(outputs[x]), strlen(vout.vec[x]));
-      TEST_ASSERT_EQUAL_MEMORY(outputs[x], vout.vec[x], strlen(outputs[x]));
-   }
+   struct Vector expected = {
+      outputs,
+      sizeof(outputs) / MAX_STR_LEN
+   };
 
+   struct Vector vout = anagrams_for("ant", vin);
+   assert_equal_vector(vout, expected);
    free(vout.vec);
 }
 
@@ -72,9 +88,7 @@ void test_does_not_confuse_different_duplicates(void)
    };
 
    struct Vector vout = anagrams_for("galea", vin);
-
-   TEST_ASSERT_EQUAL(0, vout.size);
-
+   assert_equal_vector(vout, empty);
    free(vout.vec);
 }
 
@@ -91,15 +105,12 @@ void test_eliminate_anagram_subsets(void)
    };
 
    struct Vector vout = anagrams_for("good", vin);
-
-   TEST_ASSERT_EQUAL(0, vout.size);
-
+   assert_equal_vector(vout, empty);
    free(vout.vec);
 }
 
 void test_detect_anagram(void)
 {
-   int x;
    char inputs[][MAX_STR_LEN] = {
       "enlists",
       "google",
@@ -110,27 +121,24 @@ void test_detect_anagram(void)
    char outputs[][MAX_STR_LEN] = {
       "inlets"
    };
-   int outputs_len = sizeof(outputs) / MAX_STR_LEN;
 
    struct Vector vin = {
       inputs,
       sizeof(inputs) / MAX_STR_LEN
    };
 
-   struct Vector vout = anagrams_for("listen", vin);
-
-   TEST_ASSERT_EQUAL(outputs_len, vout.size);
-   for (x = 0; x < vout.size; x++) {
-      TEST_ASSERT_EQUAL(strlen(outputs[x]), strlen(vout.vec[x]));
-      TEST_ASSERT_EQUAL_MEMORY(outputs[x], vout.vec[x], strlen(outputs[x]));
-   }
+   struct Vector expected = {
+      outputs,
+      sizeof(outputs) / MAX_STR_LEN
+   };
 
+   struct Vector vout = anagrams_for("listen", vin);
+   assert_equal_vector(vout, expected);
    free(vout.vec);
 }
 
 void test_multiple_anagrams(void)
 {
-   int x;
    char inputs[][MAX_STR_LEN] = {
       "gallery",
       "ballerina",
@@ -140,28 +148,24 @@ void test_multiple_anagrams(void)
       "leading"
    };
 
-   struct Vector vin = {
-      inputs,
-      sizeof(inputs) / MAX_STR_LEN
-   };
-
    char outputs[][MAX_STR_LEN] = {
       "gallery",
       "regally",
       "largely"
    };
-   int outputs_len = sizeof(outputs) / MAX_STR_LEN;
-   qsort(outputs, outputs_len, sizeof(char) * MAX_STR_LEN, stringcmp);
 
-   struct Vector vout = anagrams_for("allergy", vin);
-   qsort(vout.vec, vout.size, sizeof(char) * MAX_STR_LEN, stringcmp);
+   struct Vector vin = {
+      inputs,
+      sizeof(inputs) / MAX_STR_LEN
+   };
 
-   TEST_ASSERT_EQUAL(outputs_len, vout.size);
-   for (x = 0; x < vout.size; x++) {
-      TEST_ASSERT_EQUAL(strlen(outputs[x]), strlen(vout.vec[x]));
-      TEST_ASSERT_EQUAL_MEMORY(outputs[x], vout.vec[x], strlen(outputs[x]));
-   }
+   struct Vector expected = {
+      outputs,
+      sizeof(outputs) / MAX_STR_LEN
+   };
 
+   struct Vector vout = anagrams_for("allergy", vin);
+   assert_equal_vector(vout, expected);
    free(vout.vec);
 }
 
@@ -173,33 +177,27 @@ void test_case_insensitive_anagrams(void)
       "radishes"
    };
 
+   char outputs[][MAX_STR_LEN] = {
+      "Carthorse"
+   };
+
    struct Vector vin = {
       inputs,
       sizeof(inputs) / MAX_STR_LEN
    };
 
-   char outputs[][MAX_STR_LEN] = {
-      "Carthorse"
+   struct Vector expected = {
+      outputs,
+      sizeof(outputs) / MAX_STR_LEN
    };
-   int outputs_len = sizeof(outputs) / MAX_STR_LEN;
-   qsort(outputs, outputs_len, sizeof(char) * MAX_STR_LEN, stringcmp);
 
    struct Vector vout = anagrams_for("Orchestra", vin);
-   qsort(vout.vec, vout.size, sizeof(char) * MAX_STR_LEN, stringcmp);
-
-   TEST_ASSERT_EQUAL(outputs_len, vout.size);
-   int x;
-   for (x = 0; x < vout.size; x++) {
-      TEST_ASSERT_EQUAL(strlen(outputs[x]), strlen(vout.vec[x]));
-      TEST_ASSERT_EQUAL_MEMORY(outputs[x], vout.vec[x], strlen(outputs[x]));
-   }
-
+   assert_equal_vector(vout, expected);
    free(vout.vec);
 }
 
 void test_unicode_anagrams(void)
 {
-   int x;
    // These words don't make sense, they're just greek letters cobbled together.
    char inputs[][MAX_STR_LEN] = {
       "ΒΓΑ",
@@ -207,27 +205,22 @@ void test_unicode_anagrams(void)
       "γβα"
    };
 
+   char outputs[][MAX_STR_LEN] = {
+      "ΒΓΑ"
+   };
+
    struct Vector vin = {
       inputs,
       sizeof(inputs) / MAX_STR_LEN
    };
 
-   char outputs[][MAX_STR_LEN] = {
-      "ΒΓΑ",
-      "γβα"
+   struct Vector expected = {
+      outputs,
+      sizeof(outputs) / MAX_STR_LEN
    };
-   int outputs_len = sizeof(outputs) / MAX_STR_LEN;
-   qsort(outputs, outputs_len, sizeof(char) * MAX_STR_LEN, stringcmp);
 
    struct Vector vout = anagrams_for("ΑΒΓ", vin);
-   qsort(vout.vec, vout.size, sizeof(char) * MAX_STR_LEN, stringcmp);
-
-   TEST_ASSERT_EQUAL(outputs_len, vout.size);
-   for (x = 0; x < vout.size; x++) {
-      TEST_ASSERT_EQUAL(strlen(outputs[x]), strlen(vout.vec[x]));
-      TEST_ASSERT_EQUAL_MEMORY(outputs[x], vout.vec[x], strlen(outputs[x]));
-   }
-
+   assert_equal_vector(vout, expected);
    free(vout.vec);
 }
 
@@ -245,9 +238,7 @@ void test_misleading_unicode_anagrams(void)
    };
 
    struct Vector vout = anagrams_for("ΑΒΓ", vin);
-
-   TEST_ASSERT_EQUAL(0, vout.size);
-
+   assert_equal_vector(vout, empty);
    free(vout.vec);
 }
 
@@ -263,9 +254,7 @@ void test_does_not_detect_a_word_as_its_own_anagram(void)
    };
 
    struct Vector vout = anagrams_for("banana", vin);
-
-   TEST_ASSERT_EQUAL(0, vout.size);
-
+   assert_equal_vector(vout, empty);
    free(vout.vec);
 }
 
@@ -281,9 +270,7 @@ void test_does_not_detect_a_differently_cased_word_as_its_own_anagram(void)
    };
 
    struct Vector vout = anagrams_for("banana", vin);
-
-   TEST_ASSERT_EQUAL(0, vout.size);
-
+   assert_equal_vector(vout, empty);
    free(vout.vec);
 }
 

data/tracks/c/exercises/atbash-cipher/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _ATBASH_CIPHER_H
-#define _ATBASH_CIPHER_H
+#ifndef ATBASH_CIPHER_H
+#define ATBASH_CIPHER_H
 
 char *atbash_encode(const char *input);
 char *atbash_decode(const char *input);

data/tracks/c/exercises/beer-song/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _BEER_SONG_H
-#define _BEER_SONG_H
+#ifndef BEER_SONG_H
+#define BEER_SONG_H
 
 void verse(char *buffer, unsigned int verseNumber);
 void sing(char *buffer, unsigned int startingVerseNumber,

data/tracks/c/exercises/binary-search/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _BINARY_SEARCH_H
-#define _BINARY_SEARCH_H
+#ifndef BINARY_SEARCH_H
+#define BINARY_SEARCH_H
 
 #include <stddef.h>
 

data/tracks/c/exercises/bob/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _BOB_H
-#define _BOB_H
+#ifndef BOB_H
+#define BOB_H
 
 #include <stdbool.h>
 char *hey_bob(char *greeting);

data/tracks/c/exercises/clock/src/clock.h

@@ -1,5 +1,5 @@
-#ifndef _CLOCK_H
-#define _CLOCK_H
+#ifndef CLOCK_H
+#define CLOCK_H
 
 #define MAX_STR_LEN (5 + 1)     // "##:##\0"
 

data/tracks/c/exercises/difference-of-squares/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _DIFFERENCE_OF_SQUARES_H
-#define _DIFFERENCE_OF_SQUARES_H
+#ifndef DIFFERENCE_OF_SQUARES_H
+#define DIFFERENCE_OF_SQUARES_H
 
 unsigned int sum_of_squares(unsigned int number);
 unsigned int square_of_sum(unsigned int number);

data/tracks/c/exercises/gigasecond/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _GIGASECOND_H
-#define _GIGASECOND_H
+#ifndef GIGASECOND_H
+#define GIGASECOND_H
 
 #include <time.h>
 

data/tracks/c/exercises/grains/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _GRAINS_H
-#define _GRAINS_H
+#ifndef GRAINS_H
+#define GRAINS_H
 
 #include <stdint.h>
 

data/tracks/c/exercises/hamming/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _HAMMING_H
-#define _HAMMING_H
+#ifndef HAMMING_H
+#define HAMMING_H
 
 size_t compute(const char *lhs, const char *rhs);
 

data/tracks/c/exercises/hello-world/src/hello_world.h

@@ -1,5 +1,5 @@
-#ifndef _HELLO_WORLD_H
-#define _HELLO_WORLD_H
+#ifndef HELLO_WORLD_H
+#define HELLO_WORLD_H
 
 void hello(char *buffer, const char *name);
 

data/tracks/c/exercises/largest-series-product/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _LARGEST_SERIES_PRODUCT_H
-#define _LARGEST_SERIES_PRODUCT_H
+#ifndef LARGEST_SERIES_PRODUCT_H
+#define LARGEST_SERIES_PRODUCT_H
 
 #include <stddef.h>
 #include <stdint.h>

data/tracks/c/exercises/leap/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _LEAP_H
-#define _LEAP_H
+#ifndef LEAP_H
+#define LEAP_H
 
 #include <stdbool.h>
 

data/tracks/c/exercises/meetup/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _MEETUP_H
-#define _MEETUP_H
+#ifndef MEETUP_H
+#define MEETUP_H
 
 int meetupDayOfMonth(unsigned int year, unsigned int month, const char *week,
                      const char *dayOfWeek);

data/tracks/c/exercises/nth-prime/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _NTH_PRIME_H
-#define _NTH_PRIME_H
+#ifndef NTH_PRIME_H
+#define NTH_PRIME_H
 
 #include <stdint.h>
 

data/tracks/c/exercises/pangram/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _PANGRAM_H
-#define _PANGRAM_H
+#ifndef PANGRAM_H
+#define PANGRAM_H
 
 #include <stdbool.h>
 

data/tracks/c/exercises/phone-number/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _PHONE_NUMBER_H
-#define _PHONE_NUMBER_H
+#ifndef PHONE_NUMBER_H
+#define PHONE_NUMBER_H
 
 char *phone_number_clean(const char *input);
 char *phone_number_get_area_code(const char *input);

data/tracks/c/exercises/raindrops/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _RAINDROPS_H
-#define _RAINDROPS_H
+#ifndef RAINDROPS_H
+#define RAINDROPS_H
 
 char *convert(char *buffer, int buffer_length, int drops);
 

data/tracks/c/exercises/rna-transcription/src/example.h

@@ -1,5 +1,5 @@
-#ifndef  _RNA_TRANSCRIPTION_H
-#define _RNA_TRANSCRIPTION_H
+#ifndef RNA_TRANSCRIPTION_H
+#define RNA_TRANSCRIPTION_H
 
 char *to_rna(const char *dna);
 

data/tracks/c/exercises/robot-simulator/src/robot_simulator.h

@@ -1,5 +1,5 @@
-#ifndef _ROBOT_SIMULATOR_H
-#define _ROBOT_SIMULATOR_H
+#ifndef ROBOT_SIMULATOR_H
+#define ROBOT_SIMULATOR_H
 
 typedef enum {
    Heading_North = 0,

data/tracks/c/exercises/roman-numerals/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _ROMAN_NUMERALS_H
-#define _ROMAN_NUMERALS_H
+#ifndef ROMAN_NUMERALS_H
+#define ROMAN_NUMERALS_H
 
 char *to_roman_numeral(unsigned int number);
 

data/tracks/c/exercises/series/src/series.h

@@ -1,5 +1,5 @@
-#ifndef _SERIES_H
-#define _SERIES_H
+#ifndef SERIES_H
+#define SERIES_H
 
 #define MAX_INPUT_TEXT_LENGTH (8)
 #define MAX_SERIES_RESULTS (MAX_INPUT_TEXT_LENGTH)

data/tracks/c/exercises/sieve/src/sieve.h

@@ -1,5 +1,5 @@
-#ifndef _SIEVE_H
-#define _SIEVE_H
+#ifndef SIEVE_H
+#define SIEVE_H
 
 #define MAX_LIMIT_TESTED (1000)
 

data/tracks/c/exercises/sum-of-multiples/src/example.h

@@ -1,5 +1,5 @@
-#ifndef _SUM_OF_MULTIPLES_H
-#define _SUM_OF_MULTIPLES_H
+#ifndef SUM_OF_MULTIPLES_H
+#define SUM_OF_MULTIPLES_H
 
 #include <stddef.h>
 

data/tracks/c/exercises/word-count/src/word_count.h

@@ -1,5 +1,5 @@
-#ifndef _WORD_COUNT_H
-#define _WORD_COUNT_H
+#ifndef WORD_COUNT_H
+#define WORD_COUNT_H
 
 #define MAX_WORDS 20            // at most MAX_WORDS will be found in the test input string
 #define MAX_WORD_LENGTH 50      // no individual word will exceed this length

data/tracks/erlang/config.json

@@ -178,6 +178,11 @@
       "slug": "zipper",
       "topics": [],
       "difficulty": 1
+    },
+    {
+      "slug": "roman-numerals",
+      "topics": [],
+      "difficulty": 1
     }
   ],
   "deprecated": [

data/tracks/erlang/exercises/roman-numerals/example.erl

@@ -0,0 +1,19 @@
+-module(roman_numerals).
+
+-export([numerals/1]).
+
+-define(DIGITS, [{"M", 1000}, {"CM", 900}, {"D", 500}, {"CD", 400},
+                 {"C", 100}, {"XC", 90},  {"L", 50}, {"XL", 40},
+                 {"X", 10}, {"IX", 9}, {"V", 5}, {"IV", 4}, {"I", 1}]).
+
+-spec numerals(non_neg_integer()) -> string().
+numerals(Number) ->
+    to_roman(Number, "", ?DIGITS).
+
+to_roman(0, Roman, _) -> Roman;
+to_roman(N, Roman, Digits) ->
+    {R, D} = hd(Digits),
+    if
+        N >= D -> to_roman(N - D, Roman ++ R, Digits);
+        true   -> to_roman(N, Roman, tl(Digits))
+    end.

data/tracks/erlang/exercises/roman-numerals/roman_numerals.erl

@@ -0,0 +1,6 @@
+-module(roman_numerals).
+
+-export([numerals/1]).
+
+-spec numerals(non_neg_integer()) -> string().
+numerals(Number) ->  "".

data/tracks/erlang/exercises/roman-numerals/roman_numerals_tests.erl

@@ -0,0 +1,46 @@
+-module(roman_numerals_tests).
+
+-include_lib("eunit/include/eunit.hrl").
+
+% To run tests:
+% erlc -make
+% erl -noshell -eval "eunit:test(etl, [verbose])" -s init stop
+
+expect_roman(Number, Expected) ->
+  ?assertEqual(roman_numerals:numerals(Number), Expected).
+
+convert_1_test() -> expect_roman(1, "I").
+
+convert_2_test() -> expect_roman(2, "II").
+
+convert_3_test() -> expect_roman(3, "III").
+
+convert_4_test() -> expect_roman(4, "IV").
+
+convert_5_test() -> expect_roman(5, "V").
+
+convert_6_test() -> expect_roman(6, "VI").
+
+convert_9_test() -> expect_roman(9, "IX").
+
+convert_27_test() -> expect_roman(27, "XXVII").
+
+convert_48_test() -> expect_roman(48, "XLVIII").
+
+convert_59_test() -> expect_roman(59, "LIX").
+
+convert_93_test() -> expect_roman(93, "XCIII").
+
+convert_141_test() -> expect_roman(141, "CXLI").
+
+convert_163_test() -> expect_roman(163, "CLXIII").
+
+convert_402_test() -> expect_roman(402, "CDII").
+
+convert_575_test() -> expect_roman(575, "DLXXV").
+
+convert_911_test() -> expect_roman(911, "CMXI").
+
+convert_1024_test() -> expect_roman(1024, "MXXIV").
+
+convert_3000_test() -> expect_roman(3000, "MMM").

data/tracks/haskell/exercises/allergies/src/Allergies.hs

@@ -1,6 +1,14 @@
 module Allergies (Allergen(..), allergies, isAllergicTo) where
 
-data Allergen = Dummy
+data Allergen = Eggs
+              | Peanuts
+              | Shellfish
+              | Strawberries
+              | Tomatoes
+              | Chocolate
+              | Pollen
+              | Cats
+              deriving (Eq)
 
 allergies :: Int -> [Allergen]
 allergies = undefined