trackler 2.2.1.46 → 2.2.1.47

data/tracks/objective-c/exercises/grains/GrainsExample.h

@@ -0,0 +1,6 @@
+@interface Grains : NSObject {
+
+}
+-(long long)grainsAtSquareNumber:(int)squareNo;
+-(long long)grainsAtBoard;
+@end

data/tracks/objective-c/exercises/grains/GrainsExample.m

@@ -0,0 +1,19 @@
+#import "GrainsExample.h"
+@implementation Grains : NSObject
+
+-(long long)grainsAtSquareNumber:(int)squareNo {
+	if (squareNo <= 64 && squareNo > 0) {
+		return pow(2, squareNo - 1);
+	}
+	return -1;
+}
+
+-(long long)grainsAtBoard {
+	long long total = 0;
+	for (int i = 1; i <= 64; i++) {
+		total += [self grainsAtSquareNumber:i];
+	}
+	return total;
+}
+
+@end

data/tracks/objective-c/exercises/grains/GrainsTest.m

@@ -0,0 +1,85 @@
+#import <XCTest/XCTest.h>
+
+#if __has_include("GrainsExample.h")
+# import "GrainsExample.h"
+# else
+# import "Grains.h"
+#endif
+
+
+NS_ASSUME_NONNULL_BEGIN
+
+@interface GrainsTest : XCTestCase
+
+@end
+
+@implementation GrainsTest
+
+- (void)testNumberOfGrainsOnSquare1 {
+    long long expected = 1;
+    long long result = [[[Grains alloc]init]grainsAtSquareNumber:1];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare2 {
+    long long expected = 2;
+    long long result = [[[Grains alloc]init]grainsAtSquareNumber:2];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare3 {
+    unsigned long long expected = 4;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:3];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare4 {
+    unsigned long long expected = 8;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:4];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare16 {
+    unsigned long long expected = 32768;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:16];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare32 {
+    unsigned long long expected = 2147483648;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:32];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare64 {
+    unsigned long long expected = 9223372036854775808;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:64];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare65 {
+    unsigned long long expected = -1;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:65];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquareNeg1 {
+    unsigned long long expected = -1;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:-1];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testNumberOfGrainsOnSquare0 {
+    unsigned long long expected = -1;
+    unsigned long long result = [[[Grains alloc]init]grainsAtSquareNumber:0];
+    XCTAssertEqual(expected,result);
+}
+
+- (void)testTotalNumberOfGrains {
+    unsigned long long expected = 18446744073709551615;
+    unsigned long long result = [[[Grains alloc]init]grainsAtBoard];
+    XCTAssertEqual(expected,result);
+}
+
+@end
+NS_ASSUME_NONNULL_END

data/tracks/objective-c/exercises/nth-prime/NthPrimeExample.h

@@ -0,0 +1,6 @@
+@interface NthPrime : NSObject {
+
+}
++(int)primeNum:(int)primeNum;
++(BOOL)isPrime:(int)i;
+@end

data/tracks/objective-c/exercises/nth-prime/NthPrimeExample.m

@@ -0,0 +1,39 @@
+#import "NthPrimeExample.h"
+@implementation NthPrime : NSObject
+
++(int)primeNum:(int)primeNum {
+	if (primeNum == 0) {
+		return 0;
+	}
+	int currentPrime = 0;
+	int i = 0;
+	while (currentPrime <= primeNum) {
+		i += 1;
+		if ([self isPrime:i]){
+			currentPrime += 1;
+		}
+	}
+	return i;
+}
++(BOOL)isPrime:(int)n {
+	if (n == 2 || n == 3) {
+		return YES;
+	}
+	
+	if (n % 2 == 0 || n % 3 == 0) {
+		return NO;
+	}
+
+	int i = 5;
+	int w = 2;
+	while (i * i <= n) {
+		if (n % i == 0) {
+			return NO;
+		}
+		i += w;
+		w = 6 - w;
+	}
+	return YES;
+}
+
+@end

data/tracks/objective-c/exercises/nth-prime/NthPrimeTest.m

@@ -0,0 +1,53 @@
+#import <XCTest/XCTest.h>
+
+#if __has_include("BobExample.h")
+# import "NthPrimeExample.h"
+#else
+# import "NthPrime.h"
+#endif
+
+NS_ASSUME_NONNULL_BEGIN
+
+@interface NthPrimeTest : XCTestCase
+
+@end
+
+@implementation NthPrimeTest
+
+- (void)testFirstPrime {
+	int primeNum = 1;
+	int expected = 2;
+	int result = [NthPrime primeNum:primeNum];
+	XCTAssertEqual(expected, result);
+}
+
+- (void)testSecondPrime {
+	int primeNum = 2;
+	int expected = 3;
+	int result = [NthPrime primeNum:primeNum];
+	XCTAssertEqual(expected, result);
+}
+
+- (void)testSixthPrime {
+	int primeNum = 6;
+	int expected = 13;
+	int result = [NthPrime primeNum:primeNum];
+	XCTAssertEqual(expected, result);
+}
+
+- (void)testBigPrime {
+	int primeNum = 10001;
+	int expected = 104743;
+	int result = [NthPrime primeNum:primeNum];
+	XCTAssertEqual(expected, result);
+}
+
+- (void)testZeroPrime {
+	int primeNum = 0;
+	int expected = 0;
+	int result = [NthPrime primeNum:primeNum];
+	XCTAssertEqual(expected, result);
+}
+
+@end
+NS_ASSUME_NONNULL_END

data/tracks/python/config.json

@@ -288,7 +288,7 @@
       "topics": [
 	"loops",
 	"logic",
-	"conditionals"	      
+	"conditionals"
       ]
     },
     {
@@ -298,8 +298,11 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
-      ]
+        "arrays",
+        "classes",
+        "optional_values",
+        "variables"
+        ]
     },
     {
       "uuid": "aadde1a8-ed7a-4242-bfc0-6dddfd382cf3",
@@ -308,7 +311,12 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "conditionals",
+        "strings",
+        "integers",
+        "lists",
+        "filtering",
+        "sorting"
       ]
     },
     {
@@ -328,7 +336,12 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "conditionals",
+        "loops",
+        "integers",
+        "strings",
+        "logic",
+        "mathematics"
       ]
     },
     {
@@ -338,7 +351,10 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "mathematics",
+        "floating_point_numbers",
+        "integers",
+        "conditionals"
       ]
     },
     {
@@ -368,7 +384,9 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "loops",
+        "maps",
+        "transforming"
       ]
     },
     {
@@ -417,7 +435,10 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+          "loops",
+          "strings",
+          "games",
+          "maps"
       ]
     },
     {
@@ -563,7 +584,14 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "conditionals",
+        "loops",
+        "lists",
+        "integers",
+        "bitwise_operations",
+        "logic",
+        "mathematics",
+        "transforming"
       ]
     },
     {
@@ -585,7 +613,8 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "mathematics",
+        "loops"
       ]
     },
     {
@@ -798,7 +827,9 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "strings",
+        "lists",
+        "loops"
       ]
     },
     {

data/tracks/python/exercises/change/README.md

@@ -0,0 +1,34 @@
+# Change
+
+Correctly determine the fewest number of coins to be given to a customer such
+that the sum of the coins' value would equal the correct amount of change.
+
+## For example
+
+- An input of 15 with [1, 5, 10, 25, 100] should return one nickel (5)
+  and one dime (10) or [0, 1, 1, 0, 0]
+- An input of 40 with [1, 5, 10, 25, 100] should return one nickel (5)
+  and one dime (10) and one quarter (25) or [0, 1, 1, 1, 0]
+
+## Edge cases
+
+- Does your algorithm work for any given set of coins?
+- Can you ask for negative change?
+- Can you ask for a change value smaller than the smallest coin value?
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory.
+
+For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`.
+
+
+For more detailed information about running tests, code style and linting,
+please see the [help page](http://exercism.io/languages/python).
+
+## Source
+
+Software Craftsmanship - Kata-logue [http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata](http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/python/exercises/two-bucket/README.md

@@ -0,0 +1,47 @@
+# Two Bucket
+
+Given two buckets of different size, demonstrate how to measure an exact number of liters by strategically transferring liters of fluid between the buckets.
+
+Since this mathematical problem is fairly subject to interpretation / individual approach, the tests have been written specifically to expect one overarching solution.
+
+To help, the tests provide you with which bucket to fill first. That means, when starting with the larger bucket full, you are NOT allowed at any point to have the smaller bucket full and the larger bucket empty (aka, the opposite starting point); that would defeat the purpose of comparing both approaches! 
+
+Your program will take as input:
+- the size of bucket one, passed as a numeric value
+- the size of bucket two, passed as a numeric value
+- the desired number of liters to reach, passed as a numeric value
+- which bucket to fill first, passed as a String (either 'one' or 'two')
+
+Your program should determine:
+- the total number of "moves" it should take to reach the desired number of liters, including the first fill - expects a numeric value
+- which bucket should end up with the desired number of liters (let's say this is bucket A) - expects a String (either 'one' or 'two')
+- how many liters are left in the other bucket (bucket B) - expects a numeric value
+
+Note: any time a change is made to either or both buckets counts as one (1) move. 
+
+Example: 
+Bucket one can hold up to 7 liters, and bucket two can hold up to 11 liters. Let's say bucket one, at a given step, is holding 7 liters, and bucket two is holding 8 liters (7,8). If you empty bucket one and make no change to bucket two, leaving you with 0 liters and 8 liters respectively (0,8), that counts as one "move". Instead, if you had poured from bucket one into bucket two until bucket two was full, leaving you with 4 liters in bucket one and 11 liters in bucket two (4,11), that would count as only one "move" as well.
+
+To conclude, the only valid moves are:
+- pouring from one bucket to another
+- emptying one bucket and doing nothing to the other
+- filling one bucket and doing nothing to the other
+
+Written with <3 at [Fullstack Academy](http://www.fullstackacademy.com/) by [Lindsay](http://lindsaylevine.com).
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory.
+
+For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`.
+
+
+For more detailed information about running tests, code style and linting,
+please see the [help page](http://exercism.io/languages/python).
+
+## Source
+
+Water Pouring Problem [http://demonstrations.wolfram.com/WaterPouringProblem/](http://demonstrations.wolfram.com/WaterPouringProblem/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/ruby/README.md

@@ -106,7 +106,10 @@ tree -L 1 ~/code/exercism
 
 From within the ruby directory, run the following command:
 
-    bin/generate <slug>
+    bin/generate --update <slug> 
+
+Leaving out the --update option will cause the BookKeeping version number to remain the same.
+This can be useful when testing generators.
 
 #### Changing a Generated Exercise
 

data/tracks/ruby/lib/generator/command_line.rb

@@ -29,11 +29,11 @@ module Generator
     end
 
     def generator_class
-      freeze? ? GenerateTests : UpdateVersionAndGenerateTests
+      update? ? UpdateVersionAndGenerateTests : GenerateTests
     end
 
-    def freeze?
-      @options[:freeze] || @options[:all]
+    def update?
+      @options[:update]
     end
 
     def implementation(slug)