trackler 2.2.1.40 → 2.2.1.41

data/tracks/javascript/exercises/two-bucket/example.js

@@ -1,89 +1,86 @@
 'use strict';
 
-function TwoBucket(x, y, z, starter) {
-  this.starter = starter;
-  this.x = x;
-  this.y = y;
+function TwoBucket(bucketOne, bucketTwo, goal, startBucket) {
+  this.bucketOne = bucketOne;
+  this.bucketTwo = bucketTwo;
+  this.goal = goal;
+  this.startBucket = startBucket;
 
-  this.reachedGoal = function (measurements) {
-    var reached = false;
-    if (measurements[0] == z || measurements[1] == z) {
-      if (measurements[0] == z) {
-        this.goalBucket = 'one';
-        this.otherBucket = measurements[1];
-      } else {
-        this.goalBucket = 'two';
-        this.otherBucket = measurements[0];
-      }
-      reached = true;
+  this.reachedGoal = function (currentBucketOne, currentBucketTwo) {
+    return (currentBucketOne === goal || currentBucketTwo === goal);
+  };
+
+  this.recordGoal = function (currentBucketOne, currentBucketTwo) {
+    if (currentBucketOne === goal) {
+      this.goalBucket = 'one';
+      this.otherBucket = currentBucketTwo;
+    } else {
+      this.goalBucket = 'two';
+      this.otherBucket = currentBucketOne;
     }
-    return reached;
   };
 
-  this.bigFirst = function (measurements, moveCount, prBool) {
-    var j = measurements[0], k = measurements[1];
-    while (true) {
-      if (this.reachedGoal(measurements)) break;
-      if (k > x && j == 0 && moveCount == 0) {
-        j = x;
-        k = y - j;
-      } else if (j == x) {
-        j = 0;
-      } else if ((k > x && j !== 0) || (k > x && prBool)) {
-        k = k - (x - j);
-        j = x;
-      } else if (k > x || j == 0) {
-        j = k;
-        k = k - j;
-      } else if (k == 0) {
-        k = y;
+  this.bigFirst = function (initialBucketOne, initialBucketTwo) {
+    var currentBucketOne = initialBucketOne;
+    var currentBucketTwo = initialBucketTwo;
+    var moveCount = 0;
+    var pourOrReceive = true;
+    while (!this.reachedGoal(currentBucketOne, currentBucketTwo)) {
+      if (currentBucketTwo > bucketOne && currentBucketOne === 0 && moveCount === 0) {
+        currentBucketOne = bucketOne;
+        currentBucketTwo = bucketTwo - currentBucketOne;
+      } else if (currentBucketOne === bucketOne) {
+        currentBucketOne = 0;
+      } else if ((currentBucketTwo > bucketOne && currentBucketOne !== 0) || (currentBucketTwo > bucketOne && pourOrReceive)) {
+        currentBucketTwo = currentBucketTwo - (bucketOne - currentBucketOne);
+        currentBucketOne = bucketOne;
+      } else if (currentBucketTwo > bucketOne || currentBucketOne === 0) {
+        currentBucketOne = currentBucketTwo;
+        currentBucketTwo = currentBucketTwo - currentBucketOne;
+      } else if (currentBucketTwo === 0) {
+        currentBucketTwo = bucketTwo;
       }
-      measurements = [j, k];
       moveCount++;
-      prBool ? prBool = false : prBool = true;
+      pourOrReceive ? pourOrReceive = false : pourOrReceive = true;
     }
+    this.recordGoal(currentBucketOne, currentBucketTwo);
     return moveCount;
   };
 
-  this.smallFirst = function (measurements, moveCount, prBool) {
-    var j = measurements[0], k = measurements[1];
-    while (true) {
-      if (this.reachedGoal(measurements)) break;
-      if (j == x && moveCount == 0) {
-        j = 0;
-        k = x;
-      } else if (j == 0) {
-        j = x;
-      } else if (j == x && k < y) {
-        var tempK = k;
-        k + j > y ? k = y : k = tempK + j;
-        tempK + j > y ? j = j - (y - tempK) : j = 0;
-      } else if (k == y) {
-        k = 0;
-      } else if (k == 0 && j < x) {
-        k = j;
-        j = 0;
+  this.smallFirst = function (initialBucketOne, initialBucketTwo) {
+    var currentBucketOne = initialBucketOne;
+    var currentBucketTwo = initialBucketTwo;
+    var moveCount = 0;
+    var pourOrReceive = true;
+    while (!this.reachedGoal(currentBucketOne, currentBucketTwo)) {
+      if (currentBucketOne === bucketOne && moveCount === 0) {
+        currentBucketOne = 0;
+        currentBucketTwo = bucketOne;
+      } else if (currentBucketOne === 0) {
+        currentBucketOne = bucketOne;
+      } else if (currentBucketOne === bucketOne && currentBucketTwo < bucketTwo) {
+        var temp = currentBucketTwo;
+        currentBucketTwo + currentBucketOne > bucketTwo ? currentBucketTwo = bucketTwo : currentBucketTwo = temp + currentBucketOne;
+        temp + currentBucketOne > bucketTwo ? currentBucketOne = currentBucketOne - (bucketTwo - temp) : currentBucketOne = 0;
+      } else if (currentBucketTwo === bucketTwo) {
+        currentBucketTwo = 0;
+      } else if (currentBucketTwo === 0 && currentBucketOne < bucketOne) {
+        currentBucketTwo = currentBucketOne;
+        currentBucketOne = 0;
       }
-      measurements = [j, k];
       moveCount++;
-      prBool ? prBool = false : prBool = true;
+      pourOrReceive ? pourOrReceive = false : pourOrReceive = true;
     }
+    this.recordGoal(currentBucketOne, currentBucketTwo);
     return moveCount;
   };
-}
 
-TwoBucket.prototype.moves = function () {
-  var j = 0, k = 0; // j will be running val of bucket one, k = running val of bucket two
-  this.starter == 'one' ? j = this.x : k = this.y;
-  var measurements = [j, k];
-  var moveCount = 0;
-  var prBool = true; // pour / receive boolean - need to pour or receive every other turn
-  if (this.starter == 'one') {
-    moveCount = this.smallFirst(measurements, moveCount, prBool);
-  } else {
-    moveCount = this.bigFirst(measurements, moveCount, prBool);
-  }
-  return moveCount + 1; // accounts for first move made before loop (and moveCount starts at zero before loop)
-};
+  this.moves = function () {
+    if (this.startBucket === 'one') {
+      return this.smallFirst(this.bucketOne, 0) + 1;
+    }
+    return this.bigFirst(0, this.bucketTwo) + 1;
+  };
+}
 
 module.exports = TwoBucket;

data/tracks/javascript/exercises/two-bucket/two-bucket.spec.js

@@ -1,44 +1,44 @@
 var TwoBucket = require('./two-bucket');
 
 describe('TwoBucket', function () {
-  describe('works for input of 3,5,1', function () {
-    var buckOne = 3;
-    var buckTwo = 5;
+  describe('Measure using bucket one of size 3 and bucket two of size 5 - ', function () {
+    var bucketOne = 3;
+    var bucketTwo = 5;
     var goal = 1;
 
-    it('starting with bucket one', function () {
-      var starterBuck = 'one'; // indicates which bucket to fill first
-      var twoBucket = new TwoBucket(buckOne, buckTwo, goal, starterBuck);
+    it('start with bucket one', function () {
+      var twoBucket = new TwoBucket(bucketOne, bucketTwo, goal, 'one');
+
       expect(twoBucket.moves()).toEqual(4); // includes the first fill
       expect(twoBucket.goalBucket).toEqual('one'); // which bucket should end up with the desired # of liters
       expect(twoBucket.otherBucket).toEqual(5); // leftover value in the "other" bucket once the goal has been reached
     });
 
-    xit('starting with bucket two', function () {
-      var starterBuck = 'two';
-      var twoBucket = new TwoBucket(buckOne, buckTwo, goal, starterBuck);
+    xit('start with bucket two', function () {
+      var twoBucket = new TwoBucket(bucketOne, bucketTwo, goal, 'two');
+
       expect(twoBucket.moves()).toEqual(8);
       expect(twoBucket.goalBucket).toEqual('two');
       expect(twoBucket.otherBucket).toEqual(3);
     });
   });
 
-  describe('works for input of 7,11,2', function () {
-    var buckOne = 7;
-    var buckTwo = 11;
+  describe('Measure using bucket one of size 7 and bucket two of size 11 - ', function () {
+    var bucketOne = 7;
+    var bucketTwo = 11;
     var goal = 2;
 
-    xit('starting with bucket one', function () {
-      var starterBuck = 'one';
-      var twoBucket = new TwoBucket(buckOne, buckTwo, goal, starterBuck);
+    xit('start with bucket one', function () {
+      var twoBucket = new TwoBucket(bucketOne, bucketTwo, goal, 'one');
+
       expect(twoBucket.moves()).toEqual(14);
       expect(twoBucket.goalBucket).toEqual('one');
       expect(twoBucket.otherBucket).toEqual(11);
     });
 
-    xit('starting with bucket two', function () {
-      var starterBuck = 'two';
-      var twoBucket = new TwoBucket(buckOne, buckTwo, goal, starterBuck);
+    xit('start with bucket two', function () {
+      var twoBucket = new TwoBucket(bucketOne, bucketTwo, goal, 'two');
+
       expect(twoBucket.moves()).toEqual(18);
       expect(twoBucket.goalBucket).toEqual('two');
       expect(twoBucket.otherBucket).toEqual(7);

data/tracks/julia/config.json

@@ -1,6 +1,7 @@
 {
   "language": "Julia",
   "active": false,
+  "blurb": "Julia is an open-source high-level, dynamic programming language whose sweet spot is technical and scientific computing. It is convenient for day-to-day work and fast enough for high performance computing.",
   "exercises": [
     {
       "uuid": "a668410d-41aa-4710-a68f-54521da6486d",

data/tracks/julia/docs/ABOUT.md

@@ -1,12 +1,7 @@
-Julia is an open-source high-level, high-performance dynamic programming language designed for technical and scientific computing while also being effective for general-purpose tasks. It is convenient to use for daily work but also runs fast enough to be deployed for high-performance applications.
+The creators of Julia want to eat their cake and have it too. As they describe in their blog post ["Why We Created Julia"](http://julialang.org/blog/2012/02/why-we-created-julia) they want the speed of C, the dynamism of Ruby, the familiar mathematical notation of Matlab. They want it to be their favourite things from their favourite languages. String processing like Perl. Glue like the shell. Powerful but not impenetrably complex.
 
-Interesting features include:
-- Large parts of [Julia's base library](https://github.com/julialang/julia) are written in Julia itself. Understanding and contributing to the Julia core does not require knowledge of another language.
-- Easy to use interfaces to call libraries written in other languages, such as [C, Fortran](http://docs.julialang.org/en/stable/manual/calling-c-and-fortran-code/) and [Python](https://github.com/JuliaPy/PyCall.jl), directly.
-- [Multiple dispatch](http://docs.julialang.org/en/stable/manual/methods/#man-methods)
-- A dynamic, nominative and parametric [type system](http://docs.julialang.org/en/stable/manual/types/).
-- Homoiconicity: Julia code can be represented in Julia itself, making it a good language to learn about [metaprogramming](http://docs.julialang.org/en/stable/manual/metaprogramming/).
+Julia has a dynamic, nominative and parametric [type system](http://docs.julialang.org/en/stable/manual/types/). This allows writing dynamic code and specifying types if additional expressiveness is needed for simplification or performance increases. The language features multiple dispatch, meaning it chooses which method is called based on the types of each argument. This lets you write specific methods for certain types while providing generic fallbacks and is particularly useful for mathematical code, where it is not clear why an operation should belong to a specific argument.
 
-The first public release was in 2012. You can find out more about the motivation behind it in the blog post ["Why We Created Julia"](http://julialang.org/blog/2012/02/why-we-created-julia) by the core developers.
+[Metaprogramming](http://docs.julialang.org/en/stable/manual/metaprogramming/) is easy in Julia due to its homoiconicity, i.e. Julia code can be represented in Julia itself. Large parts of [Julia's base library](https://github.com/julialang/julia) are also written in Julia. Understanding and changing it does not require knowledge of another language. If a library you need to use is written in another language, such as [C, Fortran](http://docs.julialang.org/en/stable/manual/calling-c-and-fortran-code/) or [Python](https://github.com/JuliaPy/PyCall.jl), you can use simple interfaces to call them directly from your code.
 
 Despite its young age, Julia is already being used in the real world in a variety of fields, such as but not limited to Finance, Data Science and Scientific Computing. You can find many showcase applications on [juliabloggers.com](http://www.juliabloggers.com/) and a list of publications about the language and its technical computing applications [here](http://julialang.org/publications/).

data/tracks/prolog/README.md

@@ -7,7 +7,7 @@ Exercism Exercises in Prolog
 
 See [INSTALLATION.md](https://github.com/exercism/prolog/blob/master/docs/INSTALLATION.md)
 
-##Contributing
+## Contributing
 
 Thank you so much for contributing! :tada:
 

data/tracks/purescript/.travis.yml

@@ -10,6 +10,7 @@ install:
 script:
   - bin/fetch-configlet
   - bin/configlet lint .
+  - bin/check-bower.sh
   - bin/test.sh
 
 cache:

data/tracks/purescript/README.md

@@ -29,6 +29,15 @@ As a first step we recommend you read the [contributing guide][cont-guide].
 
 [cont-guide]: https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md
 
+Due to Travis builds taking too long and timing out, the current build plan compiles and runs the tests for all exercises in a single run. This requires the following:
+
+- A master bower is given in `etc/bower.json`. Test scripts assure this one is used when they are run
+  * Please only update the master one and then run `bin/update-bower.sh` to sync them up. 
+  * After editing `etc/bower.json`, it is advisable to run `bin/check-bower.sh`. This checks for any discrepancies between various bower scripts.
+- Make sure exercises have a single module in `examples/src`
+
+See [this PR](https://github.com/exercism/purescript/pull/71) for more details and the background.
+
 #### Reporting or fixing bugs
 
 Typical examples for a bug: A typo, a missing test case, an unclear or

data/tracks/purescript/bin/check-bower.sh

@@ -0,0 +1,42 @@
+#!/usr/bin/env bash
+
+# This script will check bower.json of all exercises
+# to confirm there are no discrepancies between them
+# and the master bower.json in etc/bower.json
+
+xpurescript=$(dirname "$BASH_SOURCE")
+xpurescript=$(readlink -f "$xpurescript/..")
+cd "$xpurescript/exercises"
+
+bower_master="$xpurescript/etc/bower.json"
+md5_master=$(md5sum $bower_master | awk '{print $1}')
+
+check_result_all=0
+
+for exercise in *; do
+  bower=$exercise/bower.json
+
+  if [[ -f $bower ]]; then
+    md5=$(sed -r 's/"name": "'$exercise'",/"name": "purescript-exercise",/' $bower | md5sum | awk '{print $1}')
+
+    check_result=0
+    if [[ $md5_master != $md5 ]]; then
+      check_result=1
+      check_result_all=1
+    fi
+
+    if [[ $check_result == 0 ]]; then
+      echo -e "\e[1;32mOK     $bower\e[0;39m"
+    else
+      echo -e "\e[1;31mNOT OK $bower\e[0;39m"
+    fi
+  fi
+done
+
+if [[ $check_result_all != 0 ]]; then
+  echo -e "\e[1;31m"
+  echo -e "Please check Contributing section in README for more information about fixing the above issues."
+  echo -e "\e[0;39m"
+fi
+
+exit $check_result_all

data/tracks/purescript/bin/test-separate.sh

@@ -0,0 +1,46 @@
+#!/usr/bin/env bash
+
+xpurescript=$(dirname "$BASH_SOURCE")
+xpurescript=$(readlink -f "$xpurescript/..")
+cd "$xpurescript/exercises"
+
+# Calling the script with 'clean' as the first argument
+# will cause a fully clean build
+
+clean=no
+if [[ "$1" == clean ]]; then
+  clean=yes
+fi
+
+# Run for all exercises
+
+for exercise in *; do
+  if [[ -f $exercise/bower.json ]]; then
+    cd $exercise
+
+    echo
+    echo -e "\e[1;32m--- [ $exercise ]\e[0;39m"
+    echo
+
+    # Clean local caches if clean build was requested
+    if [[ $clean == yes ]]; then
+      rm -rf bower_components output .pulp-cache
+    fi
+
+    # Move the example solution temporarily
+    if [[ ! -d src.tmp ]]; then
+      mv src src.tmp
+      mv examples/src src
+    fi
+
+    # Install and test
+    bower install
+    pulp test
+
+    # Revert to the previous state
+    mv src examples/src
+    mv src.tmp src
+
+    cd ..
+  fi
+done

data/tracks/python/README.md

@@ -60,9 +60,9 @@ We even :sparkling_heart: them if they contain well written commit messages!
 
 Please write the first line of your commit message in the following style:
 
-```exercise-name: Changes some things``` 
+```exercise-name: Change some things``` 
 
-If there are more details to add, put those into the body of the commit message.
+Please try to follow the [The seven rules of a great Git commit message](https://chris.beams.io/posts/git-commit/#seven-rules) like to capitalize the subject line and use the imperative mood. If there are more details to add, put those into the body of the commit message.
 
 If you're interested, Tim Pope even has an [entire blog post](http://tbaggery.com/2008/04/19/a-note-about-git-commit-messages.html) on good commit messages.
 

data/tracks/python/exercises/all-your-base/all_your_base.py

@@ -0,0 +1,2 @@
+def rebase(from_base, digits, to_base):
+    pass

data/tracks/python/exercises/atbash-cipher/atbash_cipher.py

@@ -1,6 +1,6 @@
-def encode(string):
+def encode(plain_text):
     pass
 
 
-def decode(string):
+def decode(ciphered_text):
     pass

data/tracks/python/exercises/complex-numbers/complex_numbers_test.py

@@ -70,8 +70,8 @@ class ComplexNumbersTest(unittest.TestCase):
     def test_multiply_numbers_with_real_and_imaginary_part(self):
         first_input = ComplexNumber(1, 2)
         second_input = ComplexNumber(-5, 10)
-        self.assertEqual(first_input.mul(second_input).real, -5)
-        self.assertEqual(first_input.mul(second_input).imaginary, 20)
+        self.assertEqual(first_input.mul(second_input).real, -25)
+        self.assertEqual(first_input.mul(second_input).imaginary, 0)
 
     def test_divide_purely_real_numbers(self):
         input_number = ComplexNumber(1.0, 0.0)

data/tracks/python/exercises/complex-numbers/example.py

@@ -12,8 +12,8 @@ class ComplexNumber(object):
         return ComplexNumber(r, i)
 
     def mul(self, other):
-        r = self.real * other.real
-        i = self.imaginary * other.imaginary
+        r = self.real * other.real - self.imaginary * other.imaginary
+        i = self.real * other.imaginary + self.imaginary * other.real
         return ComplexNumber(r, i)
 
     def sub(self, other):

data/tracks/python/exercises/gigasecond/gigasecond.py

@@ -1,2 +1,2 @@
-def add_gigasecond():
+def add_gigasecond(birth_date):
     pass

data/tracks/python/exercises/hamming/hamming.py

@@ -1,2 +1,2 @@
-def distance():
+def distance(strand_a, strand_b):
     pass

data/tracks/python/exercises/hexadecimal/hexadecimal.py

@@ -1,2 +1,2 @@
-def hexa():
+def hexa(hex_string):
     pass

data/tracks/python/exercises/leap/leap.py

@@ -1,2 +1,2 @@
-def is_leap_year():
+def is_leap_year(year):
     pass

data/tracks/python/exercises/meetup/meetup.py

@@ -1,2 +1,2 @@
-def meetup_day():
+def meetup_day(year, month, day_of_the_week, which):
     pass

data/tracks/python/exercises/phone-number/example.py

@@ -27,8 +27,10 @@ class Phone(object):
         )
 
     def _normalize(self, number):
-        valid = len(number) == 10 or \
-            len(number) == 11 and number.startswith('1')
+        if len(number) == 10 or len(number) == 11 and number.startswith('1'):
+            valid = number[-10] in "23456789" and number[-7] in "23456789"
+        else:
+            valid = False
 
         if valid:
             return number[-10:]

data/tracks/python/exercises/phone-number/phone_number_test.py

@@ -3,38 +3,69 @@ import unittest
 from phone_number import Phone
 
 
+# test cases adapted from `x-common//canonical-data.json` @ version: 1.2.0
+
 class PhoneTest(unittest.TestCase):
     def test_cleans_number(self):
-        number = Phone("(123) 456-7890").number
-        self.assertEqual(number, "1234567890")
+        number = Phone("(223) 456-7890").number
+        self.assertEqual(number, "2234567890")
 
     def test_cleans_number_with_dots(self):
-        number = Phone("123.456.7890").number
-        self.assertEqual(number, "1234567890")
+        number = Phone("223.456.7890").number
+        self.assertEqual(number, "2234567890")
+
+    def test_cleans_number_with_multiple_spaces(self):
+        number = Phone("223 456   7890   ").number
+        self.assertEqual(number, "2234567890")
+
+    def test_invalid_when_9_digits(self):
+        number = Phone("123456789").number
+        self.assertEqual(number, "0000000000")
+
+    def test_invalid_when_11_digits_and_first_not_1(self):
+        number = Phone("22234567890").number
+        self.assertEqual(number, "0000000000")
 
     def test_valid_when_11_digits_and_first_is_1(self):
-        number = Phone("11234567890").number
-        self.assertEqual(number, "1234567890")
+        number = Phone("12234567890").number
+        self.assertEqual(number, "2234567890")
+
+    def test_valid_when_11_digits_and_first_is_1_with_punctuation(self):
+        number = Phone("+1 (223) 456-7890").number
+        self.assertEqual(number, "2234567890")
 
-    def test_invalid_when_11_digits(self):
-        number = Phone("21234567890").number
+    def test_invalid_when_more_than_11_digits(self):
+        number = Phone("321234567890").number
         self.assertEqual(number, "0000000000")
 
-    def test_invalid_when_9_digits(self):
-        number = Phone("123456789").number
+    def test_invalid_with_letters(self):
+        number = Phone("123-abc-7890").number
+        self.assertEqual(number, "0000000000")
+
+    def test_invalid_with_punctuation(self):
+        number = Phone("123-@:!-7890").number
+        self.assertEqual(number, "0000000000")
+
+    def test_invalid_area_code(self):
+        number = Phone("(123) 456-7890").number
+        self.assertEqual(number, "0000000000")
+
+    def test_invalid_exchange_code(self):
+        number = Phone("(223) 056-7890").number
         self.assertEqual(number, "0000000000")
 
+    # Track specific tests
     def test_area_code(self):
-        number = Phone("1234567890")
-        self.assertEqual(number.area_code(), "123")
+        number = Phone("2234567890")
+        self.assertEqual(number.area_code(), "223")
 
     def test_pretty_print(self):
-        number = Phone("1234567890")
-        self.assertEqual(number.pretty(), "(123) 456-7890")
+        number = Phone("2234567890")
+        self.assertEqual(number.pretty(), "(223) 456-7890")
 
     def test_pretty_print_with_full_us_phone_number(self):
-        number = Phone("11234567890")
-        self.assertEqual(number.pretty(), "(123) 456-7890")
+        number = Phone("12234567890")
+        self.assertEqual(number.pretty(), "(223) 456-7890")
 
 
 if __name__ == '__main__':

data/tracks/python/exercises/pig-latin/pig_latin.py

@@ -1,2 +1,2 @@
-def translate():
+def translate(text):
     pass

data/tracks/python/exercises/scrabble-score/scrabble_score.py

@@ -1,2 +1,2 @@
-def score():
+def score(word):
     pass

data/tracks/python/exercises/wordy/wordy.py

@@ -1,2 +1,2 @@
-def calculate():
+def calculate(question):
     pass

data/tracks/scala/exercises/meetup/example.scala

@@ -1,17 +1,27 @@
-import java.time.DayOfWeek
-import java.time.LocalDate
+import java.time.{DayOfWeek, LocalDate}
+
+import Schedule.Schedule
 
 case class Meetup(month: Int, year: Int) {
   private val thirteenth = LocalDate.of(year, month, 13)
-  private val first = LocalDate.of(year, month, 1)
-  private val nextMonth = first.plusMonths(1)
+  private val firstDay = LocalDate.of(year, month, 1)
+  private val nextMonth = firstDay.plusMonths(1)
+
+  private val teenth: Scheduler = (dayOfWeek: Int) => thirteenth.next(dayOfWeek)
+  private val first: Scheduler = (dayOfWeek: Int) => firstDay.next(dayOfWeek)
+  private val second: Scheduler = (dayOfWeek: Int) => first.day(dayOfWeek).plusDays(7)
+  private val third: Scheduler = (dayOfWeek: Int) => second.day(dayOfWeek).plusDays(7)
+  private val fourth: Scheduler = (dayOfWeek: Int) => third.day(dayOfWeek).plusDays(7)
+  private val last: Scheduler = (dayOfWeek: Int) => nextMonth.next(dayOfWeek).minusDays(7)
+  private def schedulers: Map[Schedule, Scheduler] = Map(Schedule.Teenth -> teenth,
+    Schedule.First -> first,
+    Schedule.Second -> second,
+    Schedule.Third -> third,
+    Schedule.Fourth -> fourth,
+    Schedule.Last -> last)
 
-  def teenth(day: Int): LocalDate = thirteenth.next(day)
-  def first(day: Int): LocalDate = first.next(day)
-  def second(day: Int): LocalDate = first(day).plusDays(7)
-  def third(day: Int): LocalDate = second(day).plusDays(7)
-  def fourth(day: Int): LocalDate = third(day).plusDays(7)
-  def last(day: Int): LocalDate = nextMonth.next(day).minusDays(7)
+  def day(dayOfWeek: Int, schedule: Schedule): LocalDate =
+    schedulers(schedule).day(dayOfWeek)
 
   implicit class LocalDateOps(self: LocalDate) {
     def next(dayOfWeek: Int): LocalDate = self.plusDays(daysUntil(dayOfWeek))
@@ -20,6 +30,15 @@ case class Meetup(month: Int, year: Int) {
 
     def dayOfWeek: Int = self.getDayOfWeek.getValue
   }
+
+  trait Scheduler {
+    def day(dayOfWeek: Int): LocalDate
+  }
+}
+
+object Schedule extends Enumeration {
+  type Schedule = Value
+  val Teenth, First, Second, Third, Fourth, Last = Value
 }
 
 object Meetup {