trackler 2.0.0.1 → 2.0.0.2

data/tracks/lua/config.json

@@ -4,79 +4,6 @@
   "repository": "https://github.com/exercism/xlua",
   "active": true,
   "test_pattern": ".*spec[.]lua$",
-  "problems": [
-    "hello-world",
-    "accumulate",
-    "hamming",
-    "house",
-    "raindrops",
-    "bob",
-    "difference-of-squares",
-    "anagram",
-    "octal",
-    "binary-search",
-    "bracket-push",
-    "flatten-array",
-    "word-count",
-    "pangram",
-    "matrix",
-    "beer-song",
-    "isogram",
-    "perfect-numbers",
-    "etl",
-    "nucleotide-count",
-    "food-chain",
-    "sum-of-multiples",
-    "rna-transcription",
-    "phone-number",
-    "bank-account",
-    "protein-translation",
-    "grade-school",
-    "nth-prime",
-    "diamond",
-    "run-length-encoding",
-    "sublist",
-    "robot-name",
-    "robot-simulator",
-    "pythagorean-triplet",
-    "leap",
-    "space-age",
-    "pascals-triangle",
-    "sieve",
-    "grains",
-    "kindergarten-garden",
-    "custom-set",
-    "gigasecond",
-    "word-search",
-    "luhn",
-    "triangle",
-    "clock",
-    "series",
-    "linked-list",
-    "ocr-numbers",
-    "pig-latin",
-    "minesweeper",
-    "crypto-square",
-    "list-ops",
-    "atbash-cipher",
-    "scrabble-score",
-    "largest-series-product",
-    "rail-fence-cipher",
-    "roman-numerals",
-    "transpose",
-    "circular-buffer",
-    "binary-search-tree",
-    "bowling",
-    "binary",
-    "alphametics",
-    "prime-factors",
-    "acronym",
-    "all-your-base",
-    "rectangles",
-    "allergies",
-    "pov",
-    "change"
-  ],
   "exercises": [{
     "slug": "hello-world",
     "difficulty": 1,

data/tracks/lua/exercises/bowling/bowling_spec.lua

@@ -17,44 +17,56 @@ describe('bowling', function()
     end
   end
 
-  it('should not allow the score to be taken at the beginning of the game', function()
-    assert.has_error(function() scorer.score() end)
-  end)
-
-  it('should not allow the score to be taken before 10 frames have been played', function()
-    roll_n_times(0, 19)
-    assert.has_error(function() scorer.score() end)
+  it('should score a game with all gutterballs', function()
+    roll_n_times(0, 20)
+    assert.equal(0, scorer.score())
   end)
 
-  it('should not allow more rolls after 10 frames have been played', function()
-    roll_n_times(0, 20)
-    assert.has_error(function() scorer.roll(0) end)
+  it('should allow a game with all open frames', function()
+    roll_n_times({ 6, 3 }, 10)
+    assert.equal(90, scorer.score())
   end)
 
-  it('should not allow a roll with negative pins', function()
-    assert.has_error(function() scorer.roll(-1) end)
+  it('should score a spare followed by zeros as 10', function()
+    scorer.roll(6)
+    scorer.roll(4)
+    roll_n_times(0, 18)
+    assert.equal(10, scorer.score())
   end)
 
-  it('should not allow a roll better than a strike', function()
-    assert.has_error(function() scorer.roll(11) end)
+  it('should count points scored in the roll after a spare twice', function()
+    scorer.roll(6)
+    scorer.roll(4)
+    scorer.roll(3)
+    roll_n_times(0, 17)
+    assert.equal(16, scorer.score())
   end)
 
-  it('should score a game with all gutterballs', function()
-    roll_n_times(0, 20)
-    assert.equal(0, scorer.score())
+  it('should allow a one roll bonus for each consecutive spare', function()
+    scorer.roll(5)
+    scorer.roll(5)
+    scorer.roll(3)
+    scorer.roll(7)
+    scorer.roll(4)
+    roll_n_times(0, 15)
+    assert.equal(31, scorer.score())
   end)
 
-  it('should score a game with all single pin rolls', function()
-    roll_n_times(1, 20)
-    assert.equal(20, scorer.score())
+  it('should score a fill ball for a spare in the last frame', function()
+    roll_n_times(0, 18)
+    scorer.roll(7)
+    scorer.roll(3)
+    scorer.roll(7)
+    assert.equal(17, scorer.score())
   end)
 
-  it('should allow a game with all open frames', function()
-    roll_n_times({ 6, 3 }, 10)
-    assert.equal(90, scorer.score())
+  it('should score a strike as 10 points when the next frame earns no points', function()
+    scorer.roll(10)
+    roll_n_times(0, 18)
+    assert.equal(10, scorer.score())
   end)
 
-  it('should correctly score a strike that is not on the last frame', function()
+  it('should score the next two rolls after a strike as double', function()
     scorer.roll(10)
     scorer.roll(5)
     scorer.roll(3)
@@ -80,17 +92,26 @@ describe('bowling', function()
     assert.equal(18, scorer.score())
   end)
 
-  it('should allow fill balls to be strikes when the final frame is a strike', function()
+  it('should not allow a bonus roll after rolling a spare after a strike on the last frame', function()
     roll_n_times(0, 18)
     scorer.roll(10)
-    scorer.roll(10)
-    scorer.roll(10)
+    scorer.roll(7)
+    scorer.roll(3)
+    assert.equal(20, scorer.score())
+  end)
+
+  it('should not allow bonus rolls for strikes rolled with fill balls from a strike', function()
+    roll_n_times(0, 18)
+    roll_n_times(10, 3)
     assert.equal(30, scorer.score())
   end)
 
-  it('should not allow the game to be scored before fill balls have been played', function()
-    roll_n_times(10, 10)
-    assert.has_error(function() scorer.score() end)
+  it('should not allow bonus rolls for strikes rolled the fill ball from a spare', function()
+    roll_n_times(0, 18)
+    scorer.roll(7)
+    scorer.roll(3)
+    scorer.roll(10)
+    assert.equal(20, scorer.score())
   end)
 
   it('should be able to score a perfect game', function()
@@ -98,32 +119,55 @@ describe('bowling', function()
     assert.equal(300, scorer.score())
   end)
 
-  it('should correctly score a spare that is not on the last frame', function()
-    scorer.roll(5)
-    scorer.roll(5)
-    scorer.roll(3)
-    scorer.roll(4)
-    roll_n_times(0, 16)
-    assert.equal(20, scorer.score())
+  it('should not allow a roll with negative pins', function()
+    assert.has_error(function() scorer.roll(-1) end)
   end)
 
-  it('should correctly score multiple spares in a row', function()
+  it('should not allow a roll better than a strike', function()
+    assert.has_error(function() scorer.roll(11) end)
+  end)
+
+  it('should not allow two rolls in a frame to exceed 10 pins', function()
     scorer.roll(5)
+    assert.has_error(function() scorer.roll(6) end)
+  end)
+
+  it('should not allow fill balls after a strike in the final frame to score more than 10 points', function()
+    roll_n_times(0, 18)
+    scorer.roll(10)
     scorer.roll(5)
-    scorer.roll(3)
-    scorer.roll(7)
-    scorer.roll(4)
-    scorer.roll(1)
-    roll_n_times(0, 14)
-    assert.equal(32, scorer.score())
+    assert.has_error(function() scorer.roll(6) end)
   end)
 
-  it('should allow a fill ball to be rolled if the last frame is a spare', function()
+  it('should not allow the score to be taken at the beginning of the game', function()
+    assert.has_error(function() scorer.score() end)
+  end)
+
+  it('should not allow the score to be taken before 10 frames have been played', function()
+    roll_n_times(0, 19)
+    assert.has_error(function() scorer.score() end)
+  end)
+
+  it('should not allow more rolls after 10 frames have been played', function()
+    roll_n_times(0, 20)
+    assert.has_error(function() scorer.roll(0) end)
+  end)
+
+  it('should not allow the game to be scored before either fill ball for a strike in the final frame', function()
+    roll_n_times(10, 10)
+    assert.has_error(function() scorer.score() end)
+  end)
+
+  it('should not allow the game to be scored before either both fill balls for a strike in the final frame', function()
+    roll_n_times(10, 11)
+    assert.has_error(function() scorer.score() end)
+  end)
+
+  it('should not allow the game to be scored before either the fill ball for a spare in the final frame', function()
     roll_n_times(0, 18)
-    scorer.roll(9)
-    scorer.roll(1)
     scorer.roll(7)
-    assert.equal(17, scorer.score())
+    scorer.roll(3)
+    assert.has_error(function() scorer.score() end)
   end)
 
   it('should allow multiple independent scorers to be created', function()

data/tracks/lua/exercises/bowling/example.lua

@@ -22,6 +22,7 @@ return function()
       table.insert(current, pins)
 
       if #current == 3 and strike() then
+        assert(current[2] == 10 or current[2] + current[3] <= 10, 'illegal roll')
         table.insert(frames, current[1] + current[2] + current[3])
         table.remove(current, 1)
       end
@@ -33,7 +34,9 @@ return function()
       end
 
       if #frames < 10 and #current == 2 and not spare() and not strike() then
-        table.insert(frames, current[1] + current[2])
+        local total = current[1] + current[2]
+        assert(total <= 10, 'illegal roll')
+        table.insert(frames, total)
         table.remove(current, 1)
         table.remove(current, 1)
       end

data/tracks/objective-c/config.json

@@ -3,36 +3,6 @@
   "language": "Objective-C",
   "repository": "https://github.com/exercism/xobjective-c",
   "active": true,
-  "problems": [
-    "hello-world"
-    ,"bob"
-    ,"hamming"
-    ,"word-count"
-    ,"anagram"
-    ,"nucleotide-count"
-    ,"phone-number"
-    ,"grade-school"
-    ,"robot-name"
-    ,"leap"
-    ,"etl"
-    ,"perfect-numbers"
-    ,"space-age"
-    ,"all-your-base"
-    ,"allergies"
-    ,"roman-numerals"
-    ,"sum-of-multiples"
-    ,"gigasecond"
-    ,"meetup"
-    ,"triangle"
-    ,"scrabble-score"
-    ,"difference-of-squares"
-    ,"raindrops"
-    ,"clock"
-    ,"secret-handshake"
-    ,"acronym"
-    ,"run-length-encoding"
-    ,"largest-series-product"
-  ],
   "exercises": [
     {
         "difficulty": 1,
@@ -240,6 +210,15 @@
             "Transforming"
         ]
     },
+    {
+      "difficulty": 4,
+      "slug": "pangram",
+      "topics": [
+          "Strings",
+          "Searching",
+          "Transforming"
+      ]
+    },
     {
         "difficulty": 5,
         "slug": "roman-numerals",

data/tracks/objective-c/exercises/pangram/PangramExample.h

@@ -0,0 +1,7 @@
+#import <Foundation/Foundation.h>
+
+@interface Pangram : NSObject
+
++ (BOOL)isPangram:(NSString *)text;
+
+@end

data/tracks/objective-c/exercises/pangram/PangramExample.m

@@ -0,0 +1,21 @@
+#import "PangramExample.h"
+
+@implementation Pangram
+
++ (BOOL)isPangram:(NSString *)text {
+    NSString *lowercasedText = [[text stringByApplyingTransform:NSStringTransformStripCombiningMarks reverse:NO] lowercaseString];
+    NSString *letters = @"abcdefghijklmnopqrstuvwxyz";
+    
+    for (int i = 0; i < [letters length]; i++) {
+        unichar character = [letters characterAtIndex:i];
+        NSString *letter = [NSString stringWithFormat:@"%c", character];
+        
+        if (![lowercasedText containsString:letter]) {
+            return NO;
+        }
+    }
+    
+    return YES;
+}
+
+@end

data/tracks/objective-c/exercises/pangram/PangramTest.m

@@ -0,0 +1,51 @@
+#import <XCTest/XCTest.h>
+
+#if __has_include("PangramExample.h")
+# import "PangramExample.h"
+# else
+# import "Pangram.h"
+#endif
+
+@interface PangramTest : XCTestCase
+
+@end
+
+@implementation PangramTest
+
+- (void)testSentenceEmpty {
+    XCTAssertFalse([Pangram isPangram:@""]);
+}
+
+- (void)test_pangram_with_only_lower_case {
+    XCTAssertTrue([Pangram isPangram:@"the quick brown fox jumps over the lazy dog"]);
+}
+
+- (void)testMissingCharacterX {
+    XCTAssertFalse([Pangram isPangram:@"a quick movement of the enemy will jeopardize five gunboats"]);
+}
+
+- (void)testAnotherMissingCharacterX {
+    XCTAssertFalse([Pangram isPangram:@"the quick brown fish jumps over the lazy dog"]);
+}
+
+- (void)testPangramWithUnderscores {
+    XCTAssertTrue([Pangram isPangram:@"the_quick_brown_fox_jumps_over_the_lazy_dog"]);
+}
+
+- (void)testPangramWithNumbers {
+    XCTAssertTrue([Pangram isPangram:@"the 1 quick brown fox jumps over the 2 lazy dogs"]);
+}
+
+- (void)testMissingLettersReplacedByNumbers {
+    XCTAssertFalse([Pangram isPangram:@"7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog"]);
+}
+
+- (void)testPangramWithMixedCaseAndPunctuation {
+    XCTAssertTrue([Pangram isPangram:@"Five quacking Zephyrs jolt my wax bed."]);
+}
+
+- (void)testPangramWithNonAsciiCharacters {
+    XCTAssertTrue([Pangram isPangram:@"Victor jagt zwölf Boxkämpfer quer über den großen Sylter Deich."]);
+}
+
+@end

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

@@ -69,6 +69,8 @@
 		E99D1D831D5533D80006A303 /* SumOfMultiplesTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E99D1D821D5533D80006A303 /* SumOfMultiplesTest.m */; };
 		E9A7B2F71DA5AC37009056B6 /* LargestSeriesProductExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E9A7B2F61DA5AC37009056B6 /* LargestSeriesProductExample.m */; };
 		E9A7B2F91DA5AC55009056B6 /* LargestSeriesProductTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E9A7B2F81DA5AC55009056B6 /* LargestSeriesProductTest.m */; };
+		E9B345F81DB93822006EFBE2 /* PangramExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E9B345F71DB93822006EFBE2 /* PangramExample.m */; };
+		E9B345FA1DB93839006EFBE2 /* PangramTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E9B345F91DB93839006EFBE2 /* PangramTest.m */; };
 		E9C1C0231D9D993E0015E86E /* SecretHandshakeExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E9C1C0221D9D993E0015E86E /* SecretHandshakeExample.m */; };
 		E9C1C0251D9D99620015E86E /* SecretHandshakeTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E9C1C0241D9D99620015E86E /* SecretHandshakeTest.m */; };
 		E9C1C0291D9DB16B0015E86E /* AcronymExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E9C1C0281D9DB16B0015E86E /* AcronymExample.m */; };
@@ -154,6 +156,9 @@
 		E9A7B2F51DA5AC37009056B6 /* LargestSeriesProductExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LargestSeriesProductExample.h; path = "../../exercises/largest-series-product/LargestSeriesProductExample.h"; sourceTree = "<group>"; };
 		E9A7B2F61DA5AC37009056B6 /* LargestSeriesProductExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = LargestSeriesProductExample.m; path = "../../exercises/largest-series-product/LargestSeriesProductExample.m"; sourceTree = "<group>"; };
 		E9A7B2F81DA5AC55009056B6 /* LargestSeriesProductTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = LargestSeriesProductTest.m; path = "../../exercises/largest-series-product/LargestSeriesProductTest.m"; sourceTree = "<group>"; };
+		E9B345F61DB93822006EFBE2 /* PangramExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = PangramExample.h; path = ../../exercises/pangram/PangramExample.h; sourceTree = "<group>"; };
+		E9B345F71DB93822006EFBE2 /* PangramExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = PangramExample.m; path = ../../exercises/pangram/PangramExample.m; sourceTree = "<group>"; };
+		E9B345F91DB93839006EFBE2 /* PangramTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = PangramTest.m; path = ../../exercises/pangram/PangramTest.m; sourceTree = "<group>"; };
 		E9C1C0211D9D993E0015E86E /* SecretHandshakeExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = SecretHandshakeExample.h; path = "../../exercises/secret-handshake/SecretHandshakeExample.h"; sourceTree = "<group>"; };
 		E9C1C0221D9D993E0015E86E /* SecretHandshakeExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = SecretHandshakeExample.m; path = "../../exercises/secret-handshake/SecretHandshakeExample.m"; sourceTree = "<group>"; };
 		E9C1C0241D9D99620015E86E /* SecretHandshakeTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = SecretHandshakeTest.m; path = "../../exercises/secret-handshake/SecretHandshakeTest.m"; sourceTree = "<group>"; };
@@ -198,6 +203,7 @@
 				E9E8B6F11D519E120012F12C /* Leap */,
 				E92FCC0A1D78F2AA00061017 /* Meetup */,
 				E9E8B6F21D519E180012F12C /* NucleotideCount */,
+				E9B345F51DB937E5006EFBE2 /* Pangram */,
 				E9E8B6F31D519E200012F12C /* PerfectNumbers */,
 				E9E8B6F41D519E270012F12C /* PhoneNumber */,
 				E9381D491D8F293C003F22A1 /* Raindrops */,
@@ -321,6 +327,16 @@
 			name = LargestSeriesProduct;
 			sourceTree = "<group>";
 		};
+		E9B345F51DB937E5006EFBE2 /* Pangram */ = {
+			isa = PBXGroup;
+			children = (
+				E9B345F61DB93822006EFBE2 /* PangramExample.h */,
+				E9B345F71DB93822006EFBE2 /* PangramExample.m */,
+				E9B345F91DB93839006EFBE2 /* PangramTest.m */,
+			);
+			name = Pangram;
+			sourceTree = "<group>";
+		};
 		E9C1C0201D9D98B80015E86E /* SecretHandshake */ = {
 			isa = PBXGroup;
 			children = (
@@ -621,6 +637,7 @@
 				E9381D541D8F2DE1003F22A1 /* ClockTest.m in Sources */,
 				1EFACAB41CCCAF3D006F2E69 /* PerfectNumbersTest.m in Sources */,
 				E9FDCA191D5407D2004EE8DB /* RomanNumeralsExample.m in Sources */,
+				E9B345F81DB93822006EFBE2 /* PangramExample.m in Sources */,
 				1EFACAAE1CCCAF3D006F2E69 /* HelloWorldTest.m in Sources */,
 				1EFACAB21CCCAF3D006F2E69 /* NucleotideCountTest.m in Sources */,
 				E907D0CC1D6B734800106C42 /* GigasecondTest.m in Sources */,
@@ -648,6 +665,7 @@
 				E947A4DE1D81FE0F00633720 /* TriangleExample.m in Sources */,
 				1EFACAAC1CCCAF3D006F2E69 /* HammingTest.m in Sources */,
 				1EFACAA61CCCAF3D006F2E69 /* BobTest.m in Sources */,
+				E9B345FA1DB93839006EFBE2 /* PangramTest.m in Sources */,
 				E9A7B2F91DA5AC55009056B6 /* LargestSeriesProductTest.m in Sources */,
 				1EFACAAF1CCCAF3D006F2E69 /* LeapExample.m in Sources */,
 				E9C1C0251D9D99620015E86E /* SecretHandshakeTest.m in Sources */,

data/tracks/ocaml/README.md

@@ -4,7 +4,52 @@ Exercism Exercises in OCaml
 
 ## Contributing Guide
 
-Please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
+Contributions to the OCaml track (or any other part of Exercism) are very welcome!
+
+Please see the [contributing guide](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md) for overall guidance. The below
+notes contain a few details specific to Ocaml.
+
+## Prerequisites
+
+The OCaml track assumes installation of OCaml version 4.03.0, and installation of Core, OUnit, and React (for the Hangman exercise).
+Assuming you have opam, these can be installed with
+```bash
+opam install core ounit react
+```
+
+## Running Tests
+
+To run all the tests, type `make` from the top level xocaml directory.
+
+To run tests for an individual exercise, `make test-assignment ASSIGNMENT=luhn`
+
+## Adding an Exercise
+
+The [contributing guide](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md) provides guidance on
+how to add a new exercise, or port an existing exercise from another language track. This is a brief guide, with specifics for the OCaml stream.
+
+Firstly, register the exercise in [config json](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#configjson). The name of the exercise should go in the "slug" entry.
+
+Then, write the exercise tests & proof of concept implementation.
+A folder layout for an exercise called "ocaml-exercise" is below.
+
+```
+└── exercises
+    └── ocaml-exercise
+        ├── .merlin (provided IDE assistance - copy this from any of the other Ocaml exercises)
+        ├── example.ml (a proof of concept implementation)
+        ├── ocaml_exercise.mli (the interface definition for the exercise)
+        ├── HINTS.md (additional hints to anyone trying the exercise - optional)
+        ├── Makefile (standard - copy this from any of the other Ocaml exercises)
+        ├── test.ml (unit tests)
+```
+In this example, the Makefile would look for an implementation in ocaml_exercise.ml - as it matches the .mli file name. When developing it is easier to create and edit ocaml_exercise.ml, but the code should be copied to example.ml prior to submitting a pull request (and ocaml_exercise.ml should not be submitted).  
+
+All pull requests are run through a Travis CI build, which compiles and runs tests.
+
+## Feedback
+
+If you find this documentation is inaccurate or incomplete, or can be improved in any way, please don't hesitate to raise an [issue](https://github.com/exercism/xocaml/issues) or submit a pull request.
 
 ## License
 

data/tracks/ocaml/SETUP.md

@@ -1,9 +1,14 @@
-For running the tests provided, you will need `Opam` and `Core`. Consult [opam](https://opam.ocaml.org) website for instuctions on how to install for your OS. Once `opam` is installed open a terminal window and run the following command to install core:
+
+## Getting Started
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/ocaml).
+
+## Installation
+To work on the exercises, you will need `Opam` and `Core`. Consult [opam](https://opam.ocaml.org) website for instructions on how to install for your OS. Once `opam` is installed open a terminal window and run the following command to install core:
 
 opam install core
 
 ## Running Tests
-
 Because OCaml is a compiled language you need to compile your submission and the test code before you can run the tests. Compile with
 
 ```bash
@@ -21,3 +26,17 @@ Alternatively just type
 ```bash
 make
 ```
+
+## Interactive Shell
+`utop` is a command line program which allows you to run Ocaml code interactively. The easiest way to install it is via opam:
+```bash
+opam install utop
+```
+Consult [utop](https://github.com/diml/utop/blob/master/README.md) for more detail.
+
+## Feedback, Issues, Pull Requests
+The [exercism/xocaml](https://github.com/exercism/xocaml) repository on
+GitHub is the home for all of the Ocaml exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue.  We'll do our best to help you!