trackler 2.0.8.26 → 2.0.8.27

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: faebef83368ee490d149ffbaefd180c65a4a0d3a
-  data.tar.gz: 507b81bff22dd1cabe62e51fd86ea00fd628203f
+  metadata.gz: b5c894b894e9f0f3d11e47d960d538044a4863cd
+  data.tar.gz: f0150355935cc408bc6fe6cfb8922fb32bd32267
 SHA512:
-  metadata.gz: a37814a2b504762359eafc95f1fb91d7b3ca0015875fa51708fe13c3e1d277a1b781a6d391ae3e1dee4d6d19db457e337a5817a5ba79306fd3c374dacad3c72c
-  data.tar.gz: 02b51347b6e00fd95e17695f9f24fe78e9cde2a28a12d77a511b67c9960299aa2bb1e26f323e9ae22e8be235901f3bb73a4687c6b58c34777f2d169132d56616
+  metadata.gz: 7c70f073bbd990f0d6dbbe5734a19016bc18435f151a009e7c6cd48dda5b2101d5096cc993a749c167a228d97ed29588478d4ace4d0c63ced64976b9234f88b6
+  data.tar.gz: af5c762cba7ea0dc69d25c8e8b05c7108754597a869cf7a5c20ea071a4d6a937c98a5be02d46530a0c8298aba7b7fe59c9ef4a7458e86fa126a949bcb4f6acda

data/common/exercises/simple-cipher/description.md

@@ -19,7 +19,9 @@ being a couple letters off was sufficient so that people couldn't
 recognize the few words that they did know.
 
 Your task is to create a simple shift cipher like the Caesar Cipher.
-This image is a great example of the Caesar Cipher: ![Caesar Cipher][1]
+This image is a great example of the Caesar Cipher:
+
+![Caesar Cipher][1]
 
 For example:
 
@@ -74,5 +76,5 @@ If you want to go farther in this field, the questions begin to be about
 how we can exchange keys in a secure way. Take a look at [Diffie-Hellman
 on Wikipedia][dh] for one of the first implementations of this scheme.
 
-[1]: http://upload.wikimedia.org/wikipedia/en/7/75/Caesar3.png
+[1]: https://upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Caesar_cipher_left_shift_of_3.svg/320px-Caesar_cipher_left_shift_of_3.svg.png
 [dh]: http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.8.26"
+  VERSION = "2.0.8.27"
 end

data/tracks/csharp/appveyor.yml

@@ -1,4 +1,7 @@
 image: Visual Studio 2017
+environment:
+  DOTNET_CLI_TELEMETRY_OPTOUT: true
+  DOTNET_SKIP_FIRST_TIME_EXPERIENCE: true
 test: off
 build_script:
-- ps: ./build.ps1
+- ps: ./build.ps1

data/tracks/ecmascript/README.md

@@ -1,4 +1,4 @@
-# xECMAScript [![Build Status](https://travis-ci.org/exercism/xecmascript.png?branch=master)](https://travis-ci.org/exercism/xecmascript)
+# xECMAScript [![Build Status](https://travis-ci.org/exercism/xecmascript.svg?branch=master)](https://travis-ci.org/exercism/xecmascript)
 
 Exercism exercises in ECMAScript 6
 

data/tracks/haskell/exercises/sieve/src/Sieve.hs

@@ -1,3 +1,4 @@
 module Sieve (primesUpTo) where
 
-primesUpTo = error "You need to implement this function."
+primesUpTo :: Integer -> [Integer]
+primesUpTo n = error "You need to implement this function."

data/tracks/haskell/exercises/simple-cipher/src/Cipher.hs

@@ -1,10 +1,10 @@
 module Cipher (caesarDecode, caesarEncode, caesarEncodeRandom) where
 
 caesarDecode :: String -> String -> String
-caesarDecode = error "You need to implement this function."
+caesarDecode key encodedText = error "You need to implement this function."
 
 caesarEncode :: String -> String -> String
-caesarEncode = error "You need to implement this function."
+caesarEncode key text = error "You need to implement this function."
 
 caesarEncodeRandom :: String -> IO (String, String)
-caesarEncodeRandom = error "You need to implement this function."
+caesarEncodeRandom text = error "You need to implement this function."

data/tracks/haskell/exercises/simple-linked-list/src/LinkedList.hs

@@ -13,25 +13,25 @@ module LinkedList
 data LinkedList a = Dummy
 
 datum :: LinkedList a -> a
-datum = error "You need to implement this function."
+datum linkedList = error "You need to implement this function."
 
 fromList :: [a] -> LinkedList a
-fromList = error "You need to implement this function."
+fromList xs = error "You need to implement this function."
 
 isNil :: LinkedList a -> Bool
-isNil = error "You need to implement this function."
+isNil linkedList = error "You need to implement this function."
 
 new :: a -> LinkedList a -> LinkedList a
-new = error "You need to implement this function."
+new x linkedList = error "You need to implement this function."
 
 next :: LinkedList a -> LinkedList a
-next = error "You need to implement this function."
+next linkedList = error "You need to implement this function."
 
 nil :: LinkedList a
 nil = error "You need to implement this function."
 
 reverseLinkedList :: LinkedList a -> LinkedList a
-reverseLinkedList = error "You need to implement this function."
+reverseLinkedList linkedList = error "You need to implement this function."
 
 toList :: LinkedList a -> [a]
-toList = error "You need to implement this function."
+toList linkedList = error "You need to implement this function."

data/tracks/haskell/exercises/sublist/src/Sublist.hs

@@ -3,4 +3,4 @@ module Sublist (Sublist(..), sublist) where
 data Sublist = Equal | Sublist | Superlist | Unequal deriving (Eq, Show)
 
 sublist :: [a] -> [a] -> Sublist
-sublist = error "You need to implement this function."
+sublist xs ys = error "You need to implement this function."

data/tracks/haskell/exercises/sum-of-multiples/src/SumOfMultiples.hs

@@ -1,3 +1,4 @@
 module SumOfMultiples (sumOfMultiples) where
 
-sumOfMultiples = error "You need to implement this function."
+sumOfMultiples :: [Integer] -> Integer -> Integer
+sumOfMultiples factors limit = error "You need to implement this function."

data/tracks/haskell/exercises/triangle/src/Triangle.hs

@@ -6,4 +6,5 @@ data TriangleType = Equilateral
                   | Illegal
                   deriving (Eq, Show)
 
-triangleType = error "You need to implement this function."
+triangleType :: Num a => a -> a -> a -> TriangleType
+triangleType a b c = error "You need to implement this function."

data/tracks/haskell/exercises/wordy/src/WordProblem.hs

@@ -1,3 +1,4 @@
 module WordProblem (answer) where
 
-answer = error "You need to implement this function."
+answer :: String -> Maybe Integer
+answer problem = error "You need to implement this function."

data/tracks/haskell/exercises/zipper/src/Zipper.hs

@@ -19,28 +19,28 @@ data BinTree a = BT { btValue :: a
 data Zipper a = Dummy deriving (Eq, Show)
 
 fromTree :: BinTree a -> Zipper a
-fromTree = error "You need to implement this function."
+fromTree tree = error "You need to implement this function."
 
 toTree :: Zipper a -> BinTree a
-toTree = error "You need to implement this function."
+toTree zipper = error "You need to implement this function."
 
 value :: Zipper a -> a
-value = error "You need to implement this function."
+value zipper = error "You need to implement this function."
 
 left :: Zipper a -> Maybe (Zipper a)
-left = error "You need to implement this function."
+left zipper = error "You need to implement this function."
 
 right :: Zipper a -> Maybe (Zipper a)
-right = error "You need to implement this function."
+right zipper = error "You need to implement this function."
 
 up :: Zipper a -> Maybe (Zipper a)
-up = error "You need to implement this function."
+up zipper = error "You need to implement this function."
 
 setValue :: a -> Zipper a -> Zipper a
-setValue = error "You need to implement this function."
+setValue x zipper = error "You need to implement this function."
 
 setLeft :: Maybe (BinTree a) -> Zipper a -> Zipper a
-setLeft = error "You need to implement this function."
+setLeft tree zipper = error "You need to implement this function."
 
 setRight :: Maybe (BinTree a) -> Zipper a -> Zipper a
-setRight = error "You need to implement this function."
+setRight tree zipper = error "You need to implement this function."

data/tracks/javascript/config.json

@@ -11,6 +11,7 @@
     "rna-transcription",
     "bob",
     "gigasecond",
+		"perfect-numbers",
     "word-count",
     "isogram",
     "pangram",
@@ -201,6 +202,12 @@
       "difficulty": 1,
       "topics": [
       ]
+    },
+		{
+      "slug": "perfect-numbers",
+      "difficulty": 1,
+      "topics": [
+      ]
     },
     {
       "slug": "word-count",

data/tracks/javascript/exercises/perfect-numbers/example.js

@@ -0,0 +1,67 @@
+'use strict';
+
+var PerfectNumbers = function() {
+
+};
+
+/**
+ * Calculate all the divisors for a given number and return them as an array.
+ * Note: the actual number is not include in the returned array.
+ */
+PerfectNumbers.prototype.getDivisors = function(number) {
+
+  var i;
+  var divs = new Array();
+
+  // Accepts only natura numbers greater than 1.
+  if (number <= 1) {
+    return divs;
+	}
+
+  // 1 always divides everyone!
+  divs.push(1);
+
+  // Calculate the divisors up the the half of the number + 1
+  for (i = 2; i <= number / 2; i++) {
+
+    if (number % i === 0) {
+      divs.push(i);
+		}
+  }
+
+  return divs;
+};
+
+PerfectNumbers.prototype.classify = function(number) {
+
+  var i, sum, result;
+
+  // Check if the input is valid
+  if (number <= 0) {
+    return 'Classification is only possible for natural numbers.';
+  }
+
+  // Factorize the current number.
+  var divsArray = this.getDivisors(number);
+
+  // Sum the factors.
+  sum = 0;
+  for (i = 0; i < divsArray.length; i++) {
+    sum = sum + divsArray[i];
+  }
+
+  // Check if the number is perfect.
+  if (sum === number) {
+    result = 'perfect';
+  }
+  else if (sum > number) {
+    result = 'abundant';
+  }
+  else {
+    result = 'deficient';
+  }
+
+  return result;
+};
+
+module.exports = PerfectNumbers;

data/tracks/javascript/exercises/perfect-numbers/perfect-numbers.spec.js

@@ -0,0 +1,79 @@
+var PerfectNumbers = require('./perfect-numbers');
+
+describe('Exercise - Perfect Numbers', function() {
+
+  var perfectNumbers;
+
+  beforeEach(function () {
+    perfectNumbers = new PerfectNumbers();
+  });
+
+  describe('Perfect Numbers', function() {
+
+    it('Smallest perfect number is classified correctly', function() {
+      expect(perfectNumbers.classify(6)).toEqual('perfect');
+    });
+
+    it('Medium perfect number is classified correctly', function() {
+      expect(perfectNumbers.classify(28)).toEqual('perfect');
+    });
+
+    it('Large perfect number is classified correctly', function() {
+      expect(perfectNumbers.classify(33550336)).toEqual('perfect');
+    });
+
+  });
+
+  describe('Abundant Numbers', function() {
+
+    it('Smallest abundant number is classified correctly', function() {
+      expect(perfectNumbers.classify(12)).toEqual('abundant');
+    });
+
+    it('Medium abundant number is classified correctly', function() {
+      expect(perfectNumbers.classify(30)).toEqual('abundant');
+    });
+
+    it('Large abundant number is classified correctly', function() {
+      expect(perfectNumbers.classify(33550335)).toEqual('abundant');
+    });
+
+  });
+
+  describe('Deficient Numbers', function() {
+
+    it('Smallest prime deficient number is classified correctly', function() {
+      expect(perfectNumbers.classify(2)).toEqual('deficient');
+    });
+
+    it('Smallest non-prime deficient number is classified correctly', function() {
+      expect(perfectNumbers.classify(4)).toEqual('deficient');
+    });
+
+    it('Medium deficient number is classified correctly', function() {
+      expect(perfectNumbers.classify(32)).toEqual('deficient');
+    });
+
+    it('Large deficient number is classified correctly', function() {
+      expect(perfectNumbers.classify(33550337)).toEqual('deficient');
+    });
+
+    it('Edge case (no factors other than itself) is classified correctly', function() {
+      expect(perfectNumbers.classify(1)).toEqual('deficient');
+    });
+
+  });
+
+  describe('Invalid Inputs', function() {
+
+    it('Zero is rejected (not a natural number)', function() {
+      expect(perfectNumbers.classify(0)).toEqual('Classification is only possible for natural numbers.');
+    });
+
+    it('Negative integer is rejected (not a natural number)', function() {
+      expect(perfectNumbers.classify(-1)).toEqual('Classification is only possible for natural numbers.');
+    });
+
+  });
+
+});

data/tracks/objective-c/config.json

@@ -271,6 +271,15 @@
           "Transforming"
       ]
     },
+    {
+      "difficulty": 4,
+      "slug": "binary-search",
+      "topics": [
+          "Integers",
+          "Recursion",
+          "Searching"
+      ]
+    },
     {
       "difficulty": 5,
       "slug": "bracket-push",

data/tracks/objective-c/exercises/binary-search/BinarySearchExample.h

@@ -0,0 +1,11 @@
+#import <Foundation/Foundation.h>
+
+@interface BinarySearch : NSObject
+
+@property (nonatomic, strong) NSArray *list;
+
+- (instancetype)initWithArray:(NSArray<NSNumber *> *)array;
+- (NSInteger)searchFor:(int)number;
+- (NSInteger)middle;
+
+@end

data/tracks/objective-c/exercises/binary-search/BinarySearchExample.m

@@ -0,0 +1,56 @@
+#import "BinarySearchExample.h"
+
+@implementation BinarySearch
+
+- (instancetype)initWithArray:(NSArray<NSNumber *> *)array {
+    self = [super init];
+        
+    if (self) {
+        // This binary search algorithm only works if the array is already is ascending order.
+        if ([array isEqualToArray:[array sortedArrayUsingSelector:@selector(compare:)]]) {
+            _list = array;
+        } else {
+            return nil;
+        }
+    }
+    
+    return self;
+}
+
+- (NSInteger)searchFor:(int)number {
+    NSInteger middleIndex = [self middle];
+    int middle = [self.list[middleIndex] intValue];
+    
+    if (middle == number) {
+        return middleIndex;
+    } else if (middle > number) {
+        NSArray *sublist = [self.list subarrayWithRange:NSMakeRange(0, middleIndex)];
+        
+        BinarySearch *binary = [[BinarySearch alloc] initWithArray:sublist];
+        if (!binary) {
+            return NSNotFound;
+        }
+        
+        return [binary searchFor:number];
+    } else {
+        NSUInteger length = self.list.count - middleIndex;
+        NSArray *sublist = [self.list subarrayWithRange:NSMakeRange(middleIndex, length)];
+        if ([sublist isEqualToArray:self.list]) {
+            return NSNotFound;
+        }
+        
+        BinarySearch *binary = [[BinarySearch alloc] initWithArray:sublist];
+        if (!binary) {
+            return NSNotFound;
+        }
+        
+        return [binary searchFor:number] + middleIndex;
+    }
+}
+
+- (NSInteger)middle {
+    return self.list.count / 2;
+}
+
+@end
+

data/tracks/objective-c/exercises/binary-search/BinarySearchTest.m

@@ -0,0 +1,53 @@
+#import <XCTest/XCTest.h>
+
+#if __has_include("BinarySearchExample.h")
+# import "BinarySearchExample.h"
+# else
+# import "BinarySearch.h"
+#endif
+
+@interface BinarySearchTest : XCTestCase
+
+@end
+
+@implementation BinarySearchTest
+
+- (void)testHasListData {
+    NSArray *array = @[@1, @3, @4, @6, @8, @9, @11];
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:array];
+    XCTAssertEqualObjects(binary.list, array);
+}
+
+- (void)testNilForUnsortedList {
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:@[@2, @1, @4, @3, @6]];
+    XCTAssertNil(binary);
+}
+
+- (void)testNotFoundForDataNotInList {
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:@[@1, @3, @6]];
+    XCTAssertEqual([binary searchFor:2], NSNotFound);
+}
+
+- (void)testFindsPositionOfMiddleItem {
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:@[@1, @3, @4, @6, @8, @9, @11]];
+    XCTAssertEqual(3, [binary middle]);
+}
+
+- (void)testFindsPositionOfSearchData {
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:@[@1, @3, @4, @6, @8, @9, @11]];
+    XCTAssertEqual(5, [binary searchFor:9]);
+}
+
+- (void)testFindsPositionInALargerList {
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:@[@1, @3, @5, @8, @13, @21, @34, @55, @89, @144]];
+    XCTAssertEqual(1, [binary searchFor:3]);
+    XCTAssertEqual(7, [binary searchFor:55]);
+}
+
+- (void)testFindsCorrectPositionInAListWithAnEvenNumberOfElements {
+    BinarySearch *binary = [[BinarySearch alloc] initWithArray:@[@1, @3, @5, @8, @13, @21, @34, @55, @89, @144, @233, @377]];
+    XCTAssertEqual(5, [binary searchFor:21]);
+    XCTAssertEqual(6, [binary searchFor:34]);
+}
+
+@end

data/tracks/objective-c/xcodeProject/ObjectiveC.xcodeproj/project.pbxproj

@@ -47,23 +47,15 @@
 		1EFACABA1CCCAF3D006F2E69 /* SpaceAgeTest.m in Sources */ = {isa = PBXBuildFile; fileRef = 1EFACA9F1CCCAF3D006F2E69 /* SpaceAgeTest.m */; };
 		1EFACABB1CCCAF3D006F2E69 /* WordCountExample.m in Sources */ = {isa = PBXBuildFile; fileRef = 1EFACAA11CCCAF3D006F2E69 /* WordCountExample.m */; };
 		1EFACABC1CCCAF3D006F2E69 /* WordCountTest.m in Sources */ = {isa = PBXBuildFile; fileRef = 1EFACAA21CCCAF3D006F2E69 /* WordCountTest.m */; };
-
+		A065F5781E3098080048E337 /* BeerSongExample.m in Sources */ = {isa = PBXBuildFile; fileRef = A065F5761E3098080048E337 /* BeerSongExample.m */; };
+		A065F5791E3098080048E337 /* BeerSongTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A065F5771E3098080048E337 /* BeerSongTest.m */; };
+		A097D40F1E363C2700EAF2C2 /* BracketPushExample.m in Sources */ = {isa = PBXBuildFile; fileRef = A097D40D1E363C2700EAF2C2 /* BracketPushExample.m */; };
+		A097D4101E363C2700EAF2C2 /* BracketPushTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A097D40E1E363C2700EAF2C2 /* BracketPushTest.m */; };
 		A09A4C031E38761A00FEFB7A /* FlattenArrayExample.m in Sources */ = {isa = PBXBuildFile; fileRef = A09A4C021E38761A00FEFB7A /* FlattenArrayExample.m */; };
 		A09A4C051E38763300FEFB7A /* FlattenArrayTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A09A4C041E38763300FEFB7A /* FlattenArrayTest.m */; };
-		E907D0CA1D6B731600106C42 /* GigasecondExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E907D0C91D6B731600106C42 /* GigasecondExample.m */; };
-
-
 		A0BBFCBF1E37719800230071 /* SublistExample.m in Sources */ = {isa = PBXBuildFile; fileRef = A0BBFCBE1E37719800230071 /* SublistExample.m */; };
 		A0BBFCC31E37728100230071 /* SublistTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A0BBFCC21E37728100230071 /* SublistTest.m */; };
-
-
-		A097D40F1E363C2700EAF2C2 /* BracketPushExample.m in Sources */ = {isa = PBXBuildFile; fileRef = A097D40D1E363C2700EAF2C2 /* BracketPushExample.m */; };
-		A097D4101E363C2700EAF2C2 /* BracketPushTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A097D40E1E363C2700EAF2C2 /* BracketPushTest.m */; };
-
-		A065F5781E3098080048E337 /* BeerSongExample.m in Sources */ = {isa = PBXBuildFile; fileRef = A065F5761E3098080048E337 /* BeerSongExample.m */; };
-		A065F5791E3098080048E337 /* BeerSongTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A065F5771E3098080048E337 /* BeerSongTest.m */; };
-
-        E907D0CA1D6B731600106C42 /* GigasecondExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E907D0C91D6B731600106C42 /* GigasecondExample.m */; };
+		E907D0CA1D6B731600106C42 /* GigasecondExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E907D0C91D6B731600106C42 /* GigasecondExample.m */; };
 		E907D0CC1D6B734800106C42 /* GigasecondTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E907D0CB1D6B734800106C42 /* GigasecondTest.m */; };
 		E907FE921D87547D00B93DA9 /* ScrabbleScoreExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E907FE911D87547D00B93DA9 /* ScrabbleScoreExample.m */; };
 		E907FE941D87554500B93DA9 /* ScrabbleScoreTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E907FE931D87554500B93DA9 /* ScrabbleScoreTest.m */; };
@@ -83,6 +75,8 @@
 		E94ACA151D41763800D56CC2 /* AllYourBaseTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E94ACA141D41763800D56CC2 /* AllYourBaseTest.m */; };
 		E951B6B71D4294E6009EB5B6 /* AllergiesExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E951B6B61D4294E6009EB5B6 /* AllergiesExample.m */; };
 		E951B6B91D429550009EB5B6 /* AllergiesTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E951B6B81D429550009EB5B6 /* AllergiesTest.m */; };
+		E95C52551E81C82A0095D321 /* BinarySearchExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E95C52531E81C82A0095D321 /* BinarySearchExample.m */; };
+		E95C52561E81C82A0095D321 /* BinarySearchTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E95C52541E81C82A0095D321 /* BinarySearchTest.m */; };
 		E96993981DF60E1E009EA223 /* TransposeExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E96993971DF60E1E009EA223 /* TransposeExample.m */; };
 		E969939A1DF60E5F009EA223 /* TransposeTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E96993991DF60E5F009EA223 /* TransposeTest.m */; };
 		E99D1D811D5533BF0006A303 /* SumOfMultiplesExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E99D1D801D5533BF0006A303 /* SumOfMultiplesExample.m */; };
@@ -145,27 +139,18 @@
 		1EFACAA01CCCAF3D006F2E69 /* WordCountExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = WordCountExample.h; path = "../../exercises/word-count/WordCountExample.h"; sourceTree = "<group>"; };
 		1EFACAA11CCCAF3D006F2E69 /* WordCountExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = WordCountExample.m; path = "../../exercises/word-count/WordCountExample.m"; sourceTree = "<group>"; };
 		1EFACAA21CCCAF3D006F2E69 /* WordCountTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = WordCountTest.m; path = "../../exercises/word-count/WordCountTest.m"; sourceTree = "<group>"; };
-
+		A065F5751E3098080048E337 /* BeerSongExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BeerSongExample.h; path = "../../exercises/beer-song/BeerSongExample.h"; sourceTree = "<group>"; };
+		A065F5761E3098080048E337 /* BeerSongExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BeerSongExample.m; path = "../../exercises/beer-song/BeerSongExample.m"; sourceTree = "<group>"; };
+		A065F5771E3098080048E337 /* BeerSongTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BeerSongTest.m; path = "../../exercises/beer-song/BeerSongTest.m"; sourceTree = "<group>"; };
+		A097D40C1E363C1A00EAF2C2 /* BracketPushExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BracketPushExample.h; path = "../../exercises/bracket-push/BracketPushExample.h"; sourceTree = "<group>"; };
+		A097D40D1E363C2700EAF2C2 /* BracketPushExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BracketPushExample.m; path = "../../exercises/bracket-push/BracketPushExample.m"; sourceTree = "<group>"; };
+		A097D40E1E363C2700EAF2C2 /* BracketPushTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BracketPushTest.m; path = "../../exercises/bracket-push/BracketPushTest.m"; sourceTree = "<group>"; };
 		A09A4C011E38761A00FEFB7A /* FlattenArrayExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = FlattenArrayExample.h; path = "../../exercises/flatten-array/FlattenArrayExample.h"; sourceTree = "<group>"; };
 		A09A4C021E38761A00FEFB7A /* FlattenArrayExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = FlattenArrayExample.m; path = "../../exercises/flatten-array/FlattenArrayExample.m"; sourceTree = "<group>"; };
 		A09A4C041E38763300FEFB7A /* FlattenArrayTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = FlattenArrayTest.m; path = "../../exercises/flatten-array/FlattenArrayTest.m"; sourceTree = "<group>"; };
-
-
-        A0BBFCBD1E37719800230071 /* SublistExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = SublistExample.h; path = ../../exercises/sublist/SublistExample.h; sourceTree = "<group>"; };
+		A0BBFCBD1E37719800230071 /* SublistExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = SublistExample.h; path = ../../exercises/sublist/SublistExample.h; sourceTree = "<group>"; };
 		A0BBFCBE1E37719800230071 /* SublistExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = SublistExample.m; path = ../../exercises/sublist/SublistExample.m; sourceTree = "<group>"; };
 		A0BBFCC21E37728100230071 /* SublistTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = SublistTest.m; path = ../../exercises/sublist/SublistTest.m; sourceTree = "<group>"; };
-
-
-		A097D40C1E363C1A00EAF2C2 /* BracketPushExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BracketPushExample.h; path = "../../exercises/bracket-push/BracketPushExample.h"; sourceTree = "<group>"; };
-		A097D40D1E363C2700EAF2C2 /* BracketPushExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BracketPushExample.m; path = "../../exercises/bracket-push/BracketPushExample.m"; sourceTree = "<group>"; };
-		A097D40E1E363C2700EAF2C2 /* BracketPushTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BracketPushTest.m; path = "../../exercises/bracket-push/BracketPushTest.m"; sourceTree = "<group>"; };
-
-		A065F5751E3098080048E337 /* BeerSongExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BeerSongExample.h; path = "../../exercises/beer-song/BeerSongExample.h"; sourceTree = "<group>"; };
-		A065F5761E3098080048E337 /* BeerSongExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BeerSongExample.m; path = "../../exercises/beer-song/BeerSongExample.m"; sourceTree = "<group>"; };
-		A065F5771E3098080048E337 /* BeerSongTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BeerSongTest.m; path = "../../exercises/beer-song/BeerSongTest.m"; sourceTree = "<group>"; };
-
-
-
 		E907D0C81D6B731600106C42 /* GigasecondExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = GigasecondExample.h; path = ../../exercises/gigasecond/GigasecondExample.h; sourceTree = "<group>"; };
 		E907D0C91D6B731600106C42 /* GigasecondExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = GigasecondExample.m; path = ../../exercises/gigasecond/GigasecondExample.m; sourceTree = "<group>"; };
 		E907D0CB1D6B734800106C42 /* GigasecondTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = GigasecondTest.m; path = ../../exercises/gigasecond/GigasecondTest.m; sourceTree = "<group>"; };
@@ -196,6 +181,9 @@
 		E951B6B51D4294E6009EB5B6 /* AllergiesExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = AllergiesExample.h; path = ../../exercises/allergies/AllergiesExample.h; sourceTree = "<group>"; };
 		E951B6B61D4294E6009EB5B6 /* AllergiesExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = AllergiesExample.m; path = ../../exercises/allergies/AllergiesExample.m; sourceTree = "<group>"; };
 		E951B6B81D429550009EB5B6 /* AllergiesTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = AllergiesTest.m; path = ../../exercises/allergies/AllergiesTest.m; sourceTree = "<group>"; };
+		E95C52521E81C82A0095D321 /* BinarySearchExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BinarySearchExample.h; path = "../../exercises/binary-search/BinarySearchExample.h"; sourceTree = "<group>"; };
+		E95C52531E81C82A0095D321 /* BinarySearchExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BinarySearchExample.m; path = "../../exercises/binary-search/BinarySearchExample.m"; sourceTree = "<group>"; };
+		E95C52541E81C82A0095D321 /* BinarySearchTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BinarySearchTest.m; path = "../../exercises/binary-search/BinarySearchTest.m"; sourceTree = "<group>"; };
 		E96993961DF60E1E009EA223 /* TransposeExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = TransposeExample.h; path = ../../exercises/transpose/TransposeExample.h; sourceTree = "<group>"; };
 		E96993971DF60E1E009EA223 /* TransposeExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = TransposeExample.m; path = ../../exercises/transpose/TransposeExample.m; sourceTree = "<group>"; };
 		E96993991DF60E5F009EA223 /* TransposeTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = TransposeTest.m; path = ../../exercises/transpose/TransposeTest.m; sourceTree = "<group>"; };
@@ -245,6 +233,7 @@
 				E9E8B6EB1D519DE70012F12C /* Anagram */,
 				E9386EEB1E0B68F90009A414 /* AtbashCipher */,
 				A0CE03811E2F994200669F42 /* BeerSong */,
+				E95C52481E806BA20095D321 /* BinarySearch */,
 				E9E8B6EC1D519DEF0012F12C /* Bob */,
 				A09A906D1E28C1380087CCB7 /* BracketPush */,
 				E9381D4F1D8F2DA4003F22A1 /* Clock */,
@@ -296,7 +285,6 @@
 			name = Products;
 			sourceTree = "<group>";
 		};
-
 		A09A4C001E3875C200FEFB7A /* FlattenArray */ = {
 			isa = PBXGroup;
 			children = (
@@ -307,8 +295,16 @@
 			name = FlattenArray;
 			sourceTree = "<group>";
 		};
-
-
+		A09A906D1E28C1380087CCB7 /* BracketPush */ = {
+			isa = PBXGroup;
+			children = (
+				A097D40C1E363C1A00EAF2C2 /* BracketPushExample.h */,
+				A097D40D1E363C2700EAF2C2 /* BracketPushExample.m */,
+				A097D40E1E363C2700EAF2C2 /* BracketPushTest.m */,
+			);
+			name = BracketPush;
+			sourceTree = "<group>";
+		};
 		A0BBFCBC1E37703D00230071 /* Sublist */ = {
 			isa = PBXGroup;
 			children = (
@@ -319,19 +315,6 @@
 			name = Sublist;
 			sourceTree = "<group>";
 		};
-
-
-		A09A906D1E28C1380087CCB7 /* BracketPush */ = {
-			isa = PBXGroup;
-			children = (
-				A097D40C1E363C1A00EAF2C2 /* BracketPushExample.h */,
-				A097D40D1E363C2700EAF2C2 /* BracketPushExample.m */,
-				A097D40E1E363C2700EAF2C2 /* BracketPushTest.m */,
-			);
-			name = BracketPush;
-            sourceTree = "<group>";
-        };
-
 		A0CE03811E2F994200669F42 /* BeerSong */ = {
 			isa = PBXGroup;
 			children = (
@@ -340,11 +323,8 @@
 				A065F5771E3098080048E337 /* BeerSongTest.m */,
 			);
 			name = BeerSong;
-            sourceTree = "<group>";
+			sourceTree = "<group>";
 		};
-
-
-
 		E907D0C71D6B72B600106C42 /* Gigasecond */ = {
 			isa = PBXGroup;
 			children = (
@@ -425,6 +405,16 @@
 			name = Triangle;
 			sourceTree = "<group>";
 		};
+		E95C52481E806BA20095D321 /* BinarySearch */ = {
+			isa = PBXGroup;
+			children = (
+				E95C52521E81C82A0095D321 /* BinarySearchExample.h */,
+				E95C52531E81C82A0095D321 /* BinarySearchExample.m */,
+				E95C52541E81C82A0095D321 /* BinarySearchTest.m */,
+			);
+			name = BinarySearch;
+			sourceTree = "<group>";
+		};
 		E96993951DF60DF1009EA223 /* Transpose */ = {
 			isa = PBXGroup;
 			children = (
@@ -759,11 +749,9 @@
 				E9C1C0291D9DB16B0015E86E /* AcronymExample.m in Sources */,
 				1EFACAA41CCCAF3D006F2E69 /* AnagramTest.m in Sources */,
 				E907FE921D87547D00B93DA9 /* ScrabbleScoreExample.m in Sources */,
-
 				A09A4C051E38763300FEFB7A /* FlattenArrayTest.m in Sources */,
-
 				A097D4101E363C2700EAF2C2 /* BracketPushTest.m in Sources */,
-
+				E95C52551E81C82A0095D321 /* BinarySearchExample.m in Sources */,
 				1EFACABC1CCCAF3D006F2E69 /* WordCountTest.m in Sources */,
 				1EFACAB11CCCAF3D006F2E69 /* NucleotideCountExample.m in Sources */,
 				E9381D481D8EE00C003F22A1 /* DifferenceOfSquaresTest.m in Sources */,
@@ -779,11 +767,8 @@
 				E9381D521D8F2DCC003F22A1 /* ClockExample.m in Sources */,
 				E99D1D811D5533BF0006A303 /* SumOfMultiplesExample.m in Sources */,
 				E9F390071DFCA337005C5F46 /* IsogramExample.m in Sources */,
-
 				A09A4C031E38761A00FEFB7A /* FlattenArrayExample.m in Sources */,
-
 				A0BBFCC31E37728100230071 /* SublistTest.m in Sources */,
-
 				E9C1C02F1D9EC1130015E86E /* RunLengthEncodingExample.m in Sources */,
 				E92FCC0F1D78F3B600061017 /* MeetupTest.m in Sources */,
 				E9381D4E1D8F2982003F22A1 /* RaindropsTest.m in Sources */,
@@ -828,6 +813,7 @@
 				E9C1C0251D9D99620015E86E /* SecretHandshakeTest.m in Sources */,
 				E969939A1DF60E5F009EA223 /* TransposeTest.m in Sources */,
 				E99D1D831D5533D80006A303 /* SumOfMultiplesTest.m in Sources */,
+				E95C52561E81C82A0095D321 /* BinarySearchTest.m in Sources */,
 				1EFACAAA1CCCAF3D006F2E69 /* GradeSchoolTest.m in Sources */,
 			);
 			runOnlyForDeploymentPostprocessing = 0;

data/tracks/python/exercises/difference-of-squares/difference_of_squares_test.py

@@ -3,25 +3,38 @@ import unittest
 from difference_of_squares import difference, square_of_sum, sum_of_squares
 
 
-class DifferenceOfSquaresTest(unittest.TestCase):
+# test cases adapted from `x-common//canonical-data.json` @ version: 1.0.0
 
+class DifferenceOfSquaresTest(unittest.TestCase):
     def test_square_of_sum_5(self):
-        self.assertEqual(225, square_of_sum(5))
+        self.assertEqual(square_of_sum(5), 225)
 
-    def test_sum_of_squares_5(self):
-        self.assertEqual(55, sum_of_squares(5))
-
-    def test_difference_5(self):
-        self.assertEqual(170, difference(5))
+    def test_square_of_sum_10(self):
+        self.assertEqual(square_of_sum(10), 3025)
 
     def test_square_of_sum_100(self):
-        self.assertEqual(25502500, square_of_sum(100))
+        self.assertEqual(square_of_sum(100), 25502500)
+
+    def test_sum_of_squares_5(self):
+        self.assertEqual(sum_of_squares(5), 55)
+
+    def test_sum_of_squares_10(self):
+        self.assertEqual(sum_of_squares(10), 385)
 
     def test_sum_of_squares_100(self):
-        self.assertEqual(338350, sum_of_squares(100))
+        self.assertEqual(sum_of_squares(100), 338350)
+
+    def test_difference_of_squares_0(self):
+        self.assertEqual(difference(0), 0)
+
+    def test_difference_of_squares_5(self):
+        self.assertEqual(difference(5), 170)
+
+    def test_difference_of_squares_10(self):
+        self.assertEqual(difference(10), 2640)
 
-    def test_difference_100(self):
-        self.assertEqual(25164150, difference(100))
+    def test_difference_of_squares_100(self):
+        self.assertEqual(difference(100), 25164150)
 
 
 if __name__ == '__main__':

data/tracks/python/exercises/rna-transcription/rna_transcription_test.py

@@ -3,8 +3,9 @@ import unittest
 from rna_transcription import to_rna
 
 
-class DNATests(unittest.TestCase):
+# test cases adapted from `x-common//canonical-data.json` @ version: 1.0.0
 
+class DNATests(unittest.TestCase):
     def test_transcribes_guanine_to_cytosine(self):
         self.assertEqual('C', to_rna('G'))
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.0.8.26
+  version: 2.0.8.27
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-03-21 00:00:00.000000000 Z
+date: 2017-03-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -4223,11 +4223,9 @@ files:
 - tracks/java/exercises/binary-search-tree/build.gradle
 - tracks/java/exercises/binary-search-tree/src/example/java/BST.java
 - tracks/java/exercises/binary-search-tree/src/main/java/.keep
-- tracks/java/exercises/binary-search-tree/src/test/java/.keep
 - tracks/java/exercises/binary-search-tree/src/test/java/BSTTest.java
 - tracks/java/exercises/binary-search/build.gradle
 - tracks/java/exercises/binary-search/src/example/java/BinarySearch.java
-- tracks/java/exercises/binary-search/src/main/java/.keep
 - tracks/java/exercises/binary-search/src/main/java/BinarySearch.java
 - tracks/java/exercises/binary-search/src/test/java/.keep
 - tracks/java/exercises/binary-search/src/test/java/BinarySearchTest.java
@@ -4609,6 +4607,8 @@ files:
 - tracks/javascript/exercises/pangram/pangram.spec.js
 - tracks/javascript/exercises/pascals-triangle/example.js
 - tracks/javascript/exercises/pascals-triangle/pascals-triangle.spec.js
+- tracks/javascript/exercises/perfect-numbers/example.js
+- tracks/javascript/exercises/perfect-numbers/perfect-numbers.spec.js
 - tracks/javascript/exercises/phone-number/example.js
 - tracks/javascript/exercises/phone-number/phone-number.spec.js
 - tracks/javascript/exercises/pig-latin/example.js
@@ -5593,6 +5593,9 @@ files:
 - tracks/objective-c/exercises/beer-song/BeerSongExample.h
 - tracks/objective-c/exercises/beer-song/BeerSongExample.m
 - tracks/objective-c/exercises/beer-song/BeerSongTest.m
+- tracks/objective-c/exercises/binary-search/BinarySearchExample.h
+- tracks/objective-c/exercises/binary-search/BinarySearchExample.m
+- tracks/objective-c/exercises/binary-search/BinarySearchTest.m
 - tracks/objective-c/exercises/bob/BobExample.h
 - tracks/objective-c/exercises/bob/BobExample.m
 - tracks/objective-c/exercises/bob/BobTest.m
@@ -5786,7 +5789,6 @@ files:
 - tracks/ocaml/exercises/hangman/hangman.mli
 - tracks/ocaml/exercises/hangman/test.ml
 - tracks/ocaml/exercises/hello-world/.merlin
-- tracks/ocaml/exercises/hello-world/HINTS.md
 - tracks/ocaml/exercises/hello-world/Makefile
 - tracks/ocaml/exercises/hello-world/example.ml
 - tracks/ocaml/exercises/hello-world/hello_world.ml

data/tracks/ocaml/exercises/hello-world/HINTS.md

@@ -1,31 +0,0 @@
-## Use of `option`
-The type signature of the `greet` function reads `string option -> string`. It
-could be that this is your first time to encounter an Option type.
-
-An option type is an explicit way to signal that a value could be missing for a
-legitimate reason.
-
-In OCaml Options types are implemented as
-a [variant type](https://realworldocaml.org/v1/en/html/variants.html) something
-like
-
-```ocaml
-type 'a option =
-    | None
-    | Some of 'a
-```
-
-In the case of `string option` you provide an argument using one of the
-following snippets
-
-1. `None` to signal that no subject is passed.
-2. `Some("Alice")` to provide an actual subject.
-
-Just like other variants types you can match on an option. The example below
-demonstrates how this can be done. Here `x` is an `string option`.
-
-```ocaml
-match x with 
-    | None           -> "no argument passed"
-    | Some(argument) -> "argument passed"
-```