trackler 2.0.3.4 → 2.0.3.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 36080e740c50fc72852fc37ec458b86bfbfc9e44
-  data.tar.gz: a5c5c21f888bc1a2c926b81bfa7cf0c3b529558a
+  metadata.gz: a7246bea41baef8aa38999af188d6a25fb21c359
+  data.tar.gz: c9b3666bcd5f4c51d3251b9fb1f97048425ed156
 SHA512:
-  metadata.gz: 54197c20523de15b52d62db122611be7b844ce329283a3d2bb59840899a7545bed21c0f44e6e2c094765b546d46ee4f95a311941cc23a4761d1f87f50fbce44d
-  data.tar.gz: 1e14225a99cab48c3125db478b9d50440aad4109efbdb88a5fd77cc383c29bfc9cdcb9295d6920ea7772d9e56a1f1f0eec8dc774ff8168c8d0d09a0ddd2821e9
+  metadata.gz: 5e45c5da080f94f7723a6f32aaabf00005108f74e1000a03436904fa1b7b8f283f3b1c66c2923a3d38ce29d41607c4d61df35986c419faafdb33f94135c5e68a
+  data.tar.gz: 5e0c721dd96f6beb5e4e4a7e7dde487d74161ff94bb861f62dfe7928fa3fce7a3b45aef1a824c2bd5452a0bdb16295e51ec8e462f33e663802d83633f88f498c

data/common/exercises/all-your-base/canonical-data.json

@@ -23,126 +23,126 @@
         , "input_base"   : 2
         , "input_digits" : [1]
         , "output_base"  : 10
-        , "output_digits": [1]
+        , "expected"     : [1]
         },
         { "description"  : "binary to single decimal"
         , "input_base"   : 2
         , "input_digits" : [1, 0, 1]
         , "output_base"  : 10
-        , "output_digits": [5]
+        , "expected"     : [5]
         },
         { "description"  : "single decimal to binary"
         , "input_base"   : 10
         , "input_digits" : [5]
         , "output_base"  : 2
-        , "output_digits": [1, 0, 1]
+        , "expected"     : [1, 0, 1]
         },
         { "description"  : "binary to multiple decimal"
         , "input_base"   : 2
         , "input_digits" : [1, 0, 1, 0, 1, 0]
         , "output_base"  : 10
-        , "output_digits": [4, 2]
+        , "expected"     : [4, 2]
         },
         { "description"  : "decimal to binary"
         , "input_base"   : 10
         , "input_digits" : [4, 2]
         , "output_base"  : 2
-        , "output_digits": [1, 0, 1, 0, 1, 0]
+        , "expected"     : [1, 0, 1, 0, 1, 0]
         },
         { "description"  : "trinary to hexadecimal"
         , "input_base"   : 3
         , "input_digits" : [1, 1, 2, 0]
         , "output_base"  : 16
-        , "output_digits": [2, 10]
+        , "expected"     : [2, 10]
         },
         { "description"  : "hexadecimal to trinary"
         , "input_base"   : 16
         , "input_digits" : [2, 10]
         , "output_base"  : 3
-        , "output_digits": [1, 1, 2, 0]
+        , "expected"     : [1, 1, 2, 0]
         },
         { "description"  : "15-bit integer"
         , "input_base"   : 97
         , "input_digits" : [3,46,60]
         , "output_base"  : 73
-        , "output_digits": [6,10,45]
+        , "expected"     : [6,10,45]
         },
         { "description"  : "empty list"
         , "input_base"   : 2
         , "input_digits" : []
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "single zero"
         , "input_base"   : 10
         , "input_digits" : [0]
         , "output_base"  : 2
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "multiple zeros"
         , "input_base"   : 10
         , "input_digits" : [0, 0, 0]
         , "output_base"  : 2
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "leading zeros"
         , "input_base"   : 7
         , "input_digits" : [0, 6, 0]
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "negative digit"
         , "input_base"   : 2
         , "input_digits" : [1, -1, 1, 0, 1, 0]
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "invalid positive digit"
         , "input_base"   : 2
         , "input_digits" : [1, 2, 1, 0, 1, 0]
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "first base is one"
         , "input_base"   : 1
         , "input_digits" : []
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "second base is one"
         , "input_base"   : 2
         , "input_digits" : [1, 0, 1, 0, 1, 0]
         , "output_base"  : 1
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "first base is zero"
         , "input_base"   : 0
         , "input_digits" : []
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "second base is zero"
         , "input_base"   : 10
         , "input_digits" : [7]
         , "output_base"  : 0
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "first base is negative"
         , "input_base"   : -2
         , "input_digits" : [1]
         , "output_base"  : 10
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "second base is negative"
         , "input_base"   : 2
         , "input_digits" : [1]
         , "output_base"  : -7
-        , "output_digits": null
+        , "expected"     : null
         },
         { "description"  : "both bases are negative"
         , "input_base"   : -2
         , "input_digits" : [1]
         , "output_base"  : -7
-        , "output_digits": null
+        , "expected"     : null
         } ]
 }

data/common/exercises/wordy/description.md

@@ -1,67 +1,53 @@
-## Step 1
 
-E.g.
+## Iteration 1 — Addition
 
-> What is 5 plus 13?
+Add two numbers together.
 
-The program should handle large numbers and negative numbers.
+> What is 5 plus 13?
 
-Remember, that these are verbal word problems, not treated as you
-normally would treat a written problem.  This means that you calculate
-as you move forward each step.  In other words, you should ignore order
-of operations.  3 + 2 * 3 = 15, not 9.
+Evaluates to 18.
 
-Use the tests to drive your solution by deleting the `skip` in one test
-at a time.
+Handle large numbers and negative numbers.
 
-## Step 2
 
-E.g.
+## Iteration 2 — Subtraction, Multiplication and Division
 
-> What is 5 plus 13?
+Now, perform the other three operations.
 
 > What is 7 minus 5?
 
-> What is 6 multiplied by 4?
+2
 
-> What is 25 divided by 5?
-
-## Step 3
-
-E.g.
-
-> What is 5 plus 13 plus 6?
-
-> What is 7 minus 5 minus 1?
+> What is 6 multiplied by 4?
 
-> What is 9 minus 3 plus 5?
+24
 
-> What is 3 plus 5 minus 8?
+> What is 25 divided by 5?
 
-## Step 4
+5
 
-E.g.
 
-> What is 5 plus 13?
+## Iteration 3 — Multiple Operations
 
-> What is 7 minus 5?
+Handle a set of operations, in sequence.
 
-> What is 6 times 4?
+Since these are verbal word problems, evaluate the expression from
+left-to-right, _ignoring the typical order of operations._
 
-> What is 25 divided by 5?
+> What is 5 plus 13 plus 6?
 
-> What is 78 plus 5 minus 3?
+24
 
-> What is 18 times 3 plus 16?
+> What is 3 plus 2 times 3?
 
-> What is 4 times 3 divided by 6?
+15  (i.e. not 9)
 
-> What is 4 plus 3 times 2?
 
-## Extensions
+## Bonus — Exponentials
 
-Implement questions of the type:
+If you'd like, handle exponentials.
 
 > What is 2 raised to the 5th power?
 
-Remember to write failing tests for this code.
+32
+

data/common/exercises/wordy/metadata.yml

@@ -1,4 +1,4 @@
 ---
-blurb: "Write a program that takes a word problem and returns the answer as an integer."
+blurb: "Parse and evaluate simple math word problems returning the answer as an integer."
 source: "Inspired by one of the generated questions in the Extreme Startup game."
 source_url: "https://github.com/rchatley/extreme_startup"

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.3.4"
+  VERSION = "2.0.3.5"
 end

data/tracks/c/config.json

@@ -196,6 +196,16 @@
         "text formatting",
         "memory management"
      ]
+  }, {
+     "difficulty": 4,
+     "slug": "meetup",
+     "topics": [
+        "control-flow (if-statements)",
+        "strings",
+        "structs",
+        "time functions",
+        "preprocessor (x-macros in test)"
+     ]
   }, {
      "difficulty": 2,
      "slug": "robot-simulator",

data/tracks/c/exercises/meetup/makefile

@@ -0,0 +1,15 @@
+CFLAGS  = -std=c99
+CFLAGS += -Wall
+CFLAGS += -Wextra
+CFLAGS += -pedantic
+CFLAGS += -Werror
+
+test: tests.out
+	@./tests.out
+
+clean:
+	rm -f *.o *.out
+
+tests.out: test/test_meetup.c src/meetup.c src/meetup.h src/example.c
+	@echo Compiling $@
+	@cc $(CFLAGS) src/meetup.c test/vendor/unity.c test/test_meetup.c -o tests.out

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

@@ -0,0 +1,139 @@
+#include <string.h>
+#include <stdbool.h>
+#include <time.h>
+#include "meetup.h"
+
+#define BAD_DATE_REQUESTED (0)
+
+typedef struct {
+   const char *text;
+   int number;
+} TextToIntLookup_t;
+
+static bool isLeapyear(int year)
+{
+   return ((((year % 4) == 0) && ((year % 100) != 0)) || ((year % 400) == 0));
+}
+
+static int daysInMonth(int year, int month)
+{
+   int numberOfDays = 31;
+
+   switch (month) {
+   case 4:
+   case 6:
+   case 9:
+   case 11:
+      numberOfDays = 30;
+      break;
+   case 2:
+      if (isLeapyear(year)) {
+         numberOfDays = 29;
+      } else {
+         numberOfDays = 28;
+      }
+      break;
+   }
+   return numberOfDays;
+}
+
+static int getNumberGivenText(const char *text, TextToIntLookup_t * lookup,
+                              size_t numberEntries)
+{
+   int matchNumber = -1;
+
+   for (size_t index = 0; index < numberEntries; index++) {
+      if (0 == strcmp(text, lookup[index].text)) {
+         matchNumber = lookup[index].number;
+         break;
+      }
+   }
+   return matchNumber;
+}
+
+static int getDayOfWeekFromDate(unsigned int year, unsigned int month,
+                                unsigned int day)
+{
+   struct tm firstDayOfTestMonth;
+   time_t midnightFirstDayofTestMonth;
+
+   firstDayOfTestMonth.tm_year = year - 1900;
+   firstDayOfTestMonth.tm_mon = month - 1;
+   firstDayOfTestMonth.tm_mday = day;
+   firstDayOfTestMonth.tm_hour = 0;
+   firstDayOfTestMonth.tm_min = 0;
+   firstDayOfTestMonth.tm_sec = 0;
+   firstDayOfTestMonth.tm_isdst = 0;
+   midnightFirstDayofTestMonth = mktime(&firstDayOfTestMonth);
+
+   return (localtime(&midnightFirstDayofTestMonth)->tm_wday);
+}
+
+static int getWeekOfMonth(const char *week)
+{
+   TextToIntLookup_t whichWeekOfMonthLookup[] = {
+      {"first", 1},
+      {"second", 2},
+      {"third", 3},
+      {"fourth", 4},
+      {"fifth", 5},
+      {"last", 6},
+      {"teenth", 7}
+   };
+
+   return getNumberGivenText(week, &whichWeekOfMonthLookup[0],
+                             sizeof(whichWeekOfMonthLookup) /
+                             sizeof(TextToIntLookup_t));
+}
+
+static int getRequestedDayOfWeek(const char *dayOfWeek)
+{
+   TextToIntLookup_t dayLookup[] = {
+      {"Sunday", 0},
+      {"Monday", 1},
+      {"Tuesday", 2},
+      {"Wednesday", 3},
+      {"Thursday", 4},
+      {"Friday", 5},
+      {"Saturday", 6}
+   };
+
+   return getNumberGivenText(dayOfWeek, &dayLookup[0],
+                             sizeof(dayLookup) / sizeof(TextToIntLookup_t));
+}
+
+int meetupDayOfMonth(unsigned int year, unsigned int month, const char *week,
+                     const char *dayOfWeek)
+{
+   int dayOfMonth = BAD_DATE_REQUESTED;
+   int baselineDayOfWeek;
+   int daysInTestMonth = daysInMonth(year, month);
+   int dayOffset;
+   int referenceDay = 1;        // used to calculate a baseline day of week given a target date.
+
+   int whichWeekOfMonth = getWeekOfMonth(week);
+   int targetDayInWeek = getRequestedDayOfWeek(dayOfWeek);
+
+   // check for valid lookup...
+   if ((whichWeekOfMonth >= 0) && (targetDayInWeek >= 0)) {
+      // first - fifth Xday of month
+      if (whichWeekOfMonth <= 5) {
+         dayOffset = 1 + ((whichWeekOfMonth - 1) * 7);
+      } else {
+         // code for last Xday of month
+         if (6 == whichWeekOfMonth) {
+            referenceDay = daysInTestMonth - 6; // use the last unique day near end of month as reference
+         } else {
+            referenceDay = 13;  // use first teenth day as reference
+         }
+         dayOffset = referenceDay;
+      }
+      baselineDayOfWeek = getDayOfWeekFromDate(year, month, referenceDay);
+      dayOfMonth = dayOffset + ((targetDayInWeek + 7 - baselineDayOfWeek) % 7);
+   }
+
+   if (dayOfMonth > daysInTestMonth) {
+      dayOfMonth = BAD_DATE_REQUESTED;
+   }
+   return dayOfMonth;
+}

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

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