trackler 2.2.1.59 → 2.2.1.60

data/tracks/rust/exercises/triangle/README.md

@@ -2,23 +2,26 @@
 
 Determine if a triangle is equilateral, isosceles, or scalene.
 
-An _equilateral_ triangle has all three sides the same length.<br/>
+An _equilateral_ triangle has all three sides the same length.
+
 An _isosceles_ triangle has at least two sides the same length. (It is sometimes
 specified as having exactly two sides the same length, but for the purposes of
-this exercise we'll say at least two.)<br/>
+this exercise we'll say at least two.)
+
 A _scalene_ triangle has all sides of different lengths.
 
 ## Note
 
-For a shape to be a triangle at all, all sides have to be of length > 0, and 
-the sum of the lengths of any two sides must be greater than or equal to the 
+For a shape to be a triangle at all, all sides have to be of length > 0, and
+the sum of the lengths of any two sides must be greater than or equal to the
 length of the third side. See [Triangle Inequality](https://en.wikipedia.org/wiki/Triangle_inequality).
 
 ## Dig Deeper
 
-The case where the sum of the lengths of two sides _equals_ that of the 
-third is known as a _degenerate_ triangle - it has zero area and looks like 
+The case where the sum of the lengths of two sides _equals_ that of the
+third is known as a _degenerate_ triangle - it has zero area and looks like
 a single line. Feel free to add your own code/tests to check for degenerate triangles.
+
 # Triangle in Rust
 
 - [Result](https://doc.rust-lang.org/std/result/index.html)

data/tracks/rust/exercises/two-bucket/Cargo.lock

@@ -0,0 +1,4 @@
+[root]
+name = "two-bucket"
+version = "1.0.0"
+

data/tracks/rust/exercises/two-bucket/Cargo.toml

@@ -0,0 +1,3 @@
+[package]
+name = "two-bucket"
+version = "1.0.0"

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

@@ -0,0 +1,69 @@
+# 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 Bucket (either Bucket::One or Bucket::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 Bucket (either Bucket::One or Bucket::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).
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored.  After you get the first test to
+pass, remove the ignore flag (`#[ignore]`) from the next test and get the tests
+to pass again.  The test file is located in the `tests` directory.   You can
+also remove the ignore flag from all the tests to get them to run all at once
+if you wish.
+
+Make sure to read the [Modules](https://doc.rust-lang.org/book/second-edition/ch07-00-modules.html) chapter if you
+haven't already, it will help you with organizing your files.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the [rust track team](https://github.com/orgs/exercism/teams/rust) are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: http://exercism.io/languages/rust
+[modules]: https://doc.rust-lang.org/book/second-edition/ch07-00-modules.html
+[cargo]: https://doc.rust-lang.org/book/second-edition/ch14-00-more-about-cargo.html
+
+## 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/rust/exercises/two-bucket/example.rs

@@ -0,0 +1,129 @@
+use std::collections::{HashSet, VecDeque};
+
+// We can turn this problem into a simple graph searching problem. Each move represents an
+// edge in our graph; the buckets' fill states form the graph's vertices. For example, say bucket
+// one holds up to 7 liters, and bucket two holds up to 11 liters, and at the current step, bucket
+// one has 7 liters and bucket two has 8 liters: (7, 8). By emptying the first bucket, we form an
+// edge (7, 8) -> (0, 8). Similarly, by pouring the first bucket into the second, we form an edge
+// (7, 8) -> (4, 11).
+//
+// Since we want to minimize the number of moves, we search the graph breadth-first, starting with
+// the configuration provided as the problem input. Note that, to avoid cheating, we mark both
+// possible starting configurations as visited; otherwise, our search might just empty the initial
+// bucket and fill the other one.
+
+#[derive(PartialEq, Eq, Debug)]
+pub enum Bucket {
+    One,
+    Two
+}
+
+/// A struct to hold your results in.
+#[derive(PartialEq, Eq, Debug)]
+pub struct BucketStats {
+    /// The total number of "moves" it should take to reach the desired number of liters, including
+    /// the first fill.
+    pub moves: u8,
+    /// Which bucket should end up with the desired number of liters? (Either "one" or "two")
+    pub goal_bucket: Bucket,
+    /// How many liters are left in the other bucket?
+    pub other_bucket: u8,
+}
+
+/// Solve the bucket problem
+pub fn solve(capacity_1: u8,
+             capacity_2: u8,
+             goal: u8,
+             start_bucket: &Bucket) -> BucketStats
+{
+    let state = match *start_bucket {
+        Bucket::One => (capacity_1, 0),
+        Bucket::Two => (0, capacity_2),
+    };
+
+    let mut next_search = VecDeque::new();
+    let mut visited = HashSet::new();
+    let mut moves = 1;
+
+    next_search.push_front(state);
+
+    // "Visit" both starting states. This will ensure that we don't cheat, i.e.
+    // empty our starting bucket completely and fill the other bucket.
+    visited.insert((capacity_1, 0));
+    visited.insert((0, capacity_2));
+
+    loop {
+        let mut current_search = next_search;
+        next_search = VecDeque::new();
+
+        for state in current_search.drain(0..) {
+            let (bucket_1, bucket_2) = state;
+
+            if bucket_1 == goal {
+                return BucketStats {
+                    moves: moves,
+                    goal_bucket: Bucket::One,
+                    other_bucket: bucket_2,
+                };
+            } else if bucket_2 == goal {
+                return BucketStats {
+                    moves: moves,
+                    goal_bucket: Bucket::Two,
+                    other_bucket: bucket_1,
+                };
+            }
+
+            // Empty the first bucket
+            let empty_1 = (0, bucket_2);
+            if !visited.contains(&empty_1) {
+                next_search.push_front(empty_1);
+                visited.insert(empty_1);
+            }
+
+            // Empty the second bucket
+            let empty_2 = (bucket_1, 0);
+            if !visited.contains(&empty_2) {
+                next_search.push_front(empty_2);
+                visited.insert(empty_2);
+            }
+
+            // Fill the first bucket
+            let fill_1 = (capacity_1, bucket_2);
+            if !visited.contains(&fill_1) {
+                next_search.push_front(fill_1);
+                visited.insert(fill_1);
+            }
+
+            // Fill the second bucket
+            let fill_2 = (bucket_1, capacity_2);
+            if !visited.contains(&fill_2) {
+                next_search.push_front(fill_2);
+                visited.insert(fill_2);
+            }
+
+            // Pour the first bucket into the second bucket
+            let pour_1_into_2 = if bucket_1 + bucket_2 <= capacity_1 {
+                (bucket_1 + bucket_2, 0)
+            } else {
+                (capacity_1, bucket_1 + bucket_2 - capacity_1)
+            };
+            if !visited.contains(&pour_1_into_2) {
+                next_search.push_front(pour_1_into_2);
+                visited.insert(pour_1_into_2);
+            }
+
+            // Pour the second bucket into the first bucket
+            let pour_2_into_1 = if bucket_1 + bucket_2 <= capacity_2 {
+                (0, bucket_1 + bucket_2)
+            } else {
+                (bucket_1 + bucket_2 - capacity_2, capacity_2)
+            };
+            if !visited.contains(&pour_2_into_1) {
+                next_search.push_front(pour_2_into_1);
+                visited.insert(pour_2_into_1);
+            }
+        }
+
+        moves += 1;
+    }
+}

data/tracks/rust/exercises/two-bucket/src/lib.rs

@@ -0,0 +1,26 @@
+#[derive(PartialEq, Eq, Debug)]
+pub enum Bucket {
+    One,
+    Two
+}
+
+/// A struct to hold your results in.
+#[derive(PartialEq, Eq, Debug)]
+pub struct BucketStats {
+    /// The total number of "moves" it should take to reach the desired number of liters, including
+    /// the first fill.
+    pub moves: u8,
+    /// Which bucket should end up with the desired number of liters? (Either "one" or "two")
+    pub goal_bucket: Bucket,
+    /// How many liters are left in the other bucket?
+    pub other_bucket: u8,
+}
+
+/// Solve the bucket problem
+pub fn solve(capacity_1: u8,
+             capacity_2: u8,
+             goal: u8,
+             start_bucket: &Bucket) -> BucketStats
+{
+    unimplemented!();
+}

data/tracks/rust/exercises/two-bucket/tests/two-bucket.rs

@@ -0,0 +1,68 @@
+extern crate two_bucket;
+
+use two_bucket::{solve, BucketStats, Bucket};
+
+#[test]
+fn test_case_1() {
+    assert_eq!(solve(3, 5, 1, &Bucket::One),
+               BucketStats {
+                   moves: 4,
+                   goal_bucket: Bucket::One,
+                   other_bucket: 5,
+               });
+}
+
+#[test]
+#[ignore]
+fn test_case_2() {
+    assert_eq!(solve(3, 5, 1, &Bucket::Two),
+               BucketStats {
+                   moves: 8,
+                   goal_bucket: Bucket::Two,
+                   other_bucket: 3,
+               });
+}
+
+#[test]
+#[ignore]
+fn test_case_3() {
+    assert_eq!(solve(7, 11, 2, &Bucket::One),
+               BucketStats {
+                   moves: 14,
+                   goal_bucket: Bucket::One,
+                   other_bucket: 11,
+               });
+}
+
+#[test]
+#[ignore]
+fn test_case_4() {
+    assert_eq!(solve(7, 11, 2, &Bucket::Two),
+               BucketStats {
+                   moves: 18,
+                   goal_bucket: Bucket::Two,
+                   other_bucket: 7,
+               });
+}
+
+#[test]
+#[ignore]
+fn test_case_5() {
+    assert_eq!(solve(1, 3, 3, &Bucket::Two),
+               BucketStats {
+                   moves: 1,
+                   goal_bucket: Bucket::Two,
+                   other_bucket: 0,
+               });
+}
+
+#[test]
+#[ignore]
+fn test_case_6() {
+    assert_eq!(solve(2, 3, 3, &Bucket::One),
+               BucketStats {
+                   moves: 2,
+                   goal_bucket: Bucket::Two,
+                   other_bucket: 2,
+               });
+}

data/tracks/rust/exercises/variable-length-quantity/README.md

@@ -5,18 +5,17 @@ Implement variable length quantity encoding and decoding.
 The goal of this exercise is to implement [VLQ](https://en.wikipedia.org/wiki/Variable-length_quantity) encoding/decoding.
 
 In short, the goal of this encoding is to encode integer values in a way that would save bytes.
-Only the first 7 bits of each byte is significant (right-justified; sort of like an ASCII byte). 
-So, if you have a 32-bit value, you have to unpack it into a series of 7-bit bytes. 
-Of course, you will have a variable number of bytes depending upon your integer. 
+Only the first 7 bits of each byte is significant (right-justified; sort of like an ASCII byte).
+So, if you have a 32-bit value, you have to unpack it into a series of 7-bit bytes.
+Of course, you will have a variable number of bytes depending upon your integer.
 To indicate which is the last byte of the series, you leave bit #7 clear.
-In all of the preceding bytes, you set bit #7. 
+In all of the preceding bytes, you set bit #7.
 
-So, if an integer is between `0-127`, it can be represented as one byte. 
+So, if an integer is between `0-127`, it can be represented as one byte.
 Although VLQ can deal with numbers of arbitrary sizes, for this exercise we will restrict ourselves to only numbers that fit in a 32-bit unsigned integer.
 Here are examples of integers as 32-bit values, and the variable length quantities that they translate to:
 
-
-```
+```text
  NUMBER        VARIABLE QUANTITY
 00000000              00
 00000040              40

data/tracks/rust/exercises/word-count/README.md

@@ -4,14 +4,13 @@ Given a phrase, count the occurrences of each word in that phrase.
 
 For example for the input `"olly olly in come free"`
 
-```plain
+```text
 olly: 2
 in: 1
 come: 1
 free: 1
 ```
 
-
 ## Rust Installation
 
 Refer to the [exercism help page][help-page] for Rust installation and learning

data/tracks/rust/exercises/wordy/README.md

@@ -2,7 +2,6 @@
 
 Parse and evaluate simple math word problems returning the answer as an integer.
 
-
 ## Iteration 1 — Addition
 
 Add two numbers together.
@@ -13,7 +12,6 @@ Evaluates to 18.
 
 Handle large numbers and negative numbers.
 
-
 ## Iteration 2 — Subtraction, Multiplication and Division
 
 Now, perform the other three operations.
@@ -30,7 +28,6 @@ Now, perform the other three operations.
 
 5
 
-
 ## Iteration 3 — Multiple Operations
 
 Handle a set of operations, in sequence.
@@ -46,7 +43,6 @@ left-to-right, _ignoring the typical order of operations._
 
 15  (i.e. not 9)
 
-
 ## Bonus — Exponentials
 
 If you'd like, handle exponentials.
@@ -55,7 +51,6 @@ If you'd like, handle exponentials.
 
 32
 
-
 ## Rust Installation
 
 Refer to the [exercism help page][help-page] for Rust installation and learning

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.59
+  version: 2.2.1.60
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-11-02 00:00:00.000000000 Z
+date: 2017-11-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -544,6 +544,7 @@ files:
 - problem-specifications/exercises/trinary/canonical-data.json
 - problem-specifications/exercises/trinary/description.md
 - problem-specifications/exercises/trinary/metadata.yml
+- problem-specifications/exercises/twelve-days/canonical-data.json
 - problem-specifications/exercises/twelve-days/description.md
 - problem-specifications/exercises/twelve-days/metadata.yml
 - problem-specifications/exercises/two-bucket/canonical-data.json
@@ -5547,13 +5548,17 @@ files:
 - tracks/fsharp/generators/Templates/_TestMethod.liquid
 - tracks/fsharp/generators/Templates/_TestMethodBody.liquid
 - tracks/fsharp/img/icon.png
+- tracks/gnu-apl/.dockerignore
 - tracks/gnu-apl/.git
 - tracks/gnu-apl/.gitignore
 - tracks/gnu-apl/.travis.yml
 - tracks/gnu-apl/.travis/.gnu-apl/preferences
+- tracks/gnu-apl/Dockerfiles/release.dockerfile
+- tracks/gnu-apl/Dockerfiles/svn.dockerfile
 - tracks/gnu-apl/LICENSE
 - tracks/gnu-apl/README.md
 - tracks/gnu-apl/bin/fetch-configlet
+- tracks/gnu-apl/bin/install-apl
 - tracks/gnu-apl/bin/run-all-tests
 - tracks/gnu-apl/config.json
 - tracks/gnu-apl/config/exercise-readme-insert.md
@@ -5589,7 +5594,6 @@ files:
 - tracks/gnu-apl/img/.keep
 - tracks/gnu-apl/test.apl
 - tracks/go/.git
-- tracks/go/.github/PULL_REQUEST_TEMPLATE.md
 - tracks/go/.gitignore
 - tracks/go/.travis.yml
 - tracks/go/LICENSE
@@ -6390,6 +6394,13 @@ files:
 - tracks/haskell/exercises/house/src/House.hs
 - tracks/haskell/exercises/house/stack.yaml
 - tracks/haskell/exercises/house/test/Tests.hs
+- tracks/haskell/exercises/isbn-verifier/README.md
+- tracks/haskell/exercises/isbn-verifier/examples/success-standard/package.yaml
+- tracks/haskell/exercises/isbn-verifier/examples/success-standard/src/IsbnVerifier.hs
+- tracks/haskell/exercises/isbn-verifier/package.yaml
+- tracks/haskell/exercises/isbn-verifier/src/IsbnVerifier.hs
+- tracks/haskell/exercises/isbn-verifier/stack.yaml
+- tracks/haskell/exercises/isbn-verifier/test/Tests.hs
 - tracks/haskell/exercises/isogram/README.md
 - tracks/haskell/exercises/isogram/examples/success-standard/package.yaml
 - tracks/haskell/exercises/isogram/examples/success-standard/src/Isogram.hs
@@ -7423,6 +7434,7 @@ files:
 - tracks/java/scripts/insert-ignores.sh
 - tracks/java/scripts/prune-extra-keep-files.sh
 - tracks/javascript/.editorconfig
+- tracks/javascript/.eslintignore
 - tracks/javascript/.eslintrc.json
 - tracks/javascript/.git
 - tracks/javascript/.github/stale.yml
@@ -9352,6 +9364,11 @@ files:
 - tracks/ocaml/exercises/react/example.ml
 - tracks/ocaml/exercises/react/react.mli
 - tracks/ocaml/exercises/react/test.ml
+- tracks/ocaml/exercises/rectangles/.merlin
+- tracks/ocaml/exercises/rectangles/Makefile
+- tracks/ocaml/exercises/rectangles/example.ml
+- tracks/ocaml/exercises/rectangles/rectangles.mli
+- tracks/ocaml/exercises/rectangles/test.ml
 - tracks/ocaml/exercises/rna-transcription/.merlin
 - tracks/ocaml/exercises/rna-transcription/Makefile
 - tracks/ocaml/exercises/rna-transcription/README.md
@@ -9454,6 +9471,7 @@ files:
 - tracks/ocaml/tools/test-generator/templates/ocaml/phone-number/test.ml
 - tracks/ocaml/tools/test-generator/templates/ocaml/prime-factors/test.ml
 - tracks/ocaml/tools/test-generator/templates/ocaml/raindrops/test.ml
+- tracks/ocaml/tools/test-generator/templates/ocaml/rectangles/test.ml
 - tracks/ocaml/tools/test-generator/templates/ocaml/roman-numerals/test.ml
 - tracks/ocaml/tools/test-generator/templates/ocaml/run-length-encoding/test.ml
 - tracks/ocaml/tools/test-generator/templates/ocaml/say/test.ml
@@ -11122,7 +11140,6 @@ files:
 - tracks/racket/img/icon.png
 - tracks/ruby/.git
 - tracks/ruby/.github/ISSUE_TEMPLATE.md
-- tracks/ruby/.github/PULL_REQUEST_TEMPLATE.md
 - tracks/ruby/.github/stale.yml
 - tracks/ruby/.gitignore
 - tracks/ruby/.rubocop.yml
@@ -11813,6 +11830,12 @@ files:
 - tracks/rust/exercises/hexadecimal/example.rs
 - tracks/rust/exercises/hexadecimal/src/lib.rs
 - tracks/rust/exercises/hexadecimal/tests/hexadecimal.rs
+- tracks/rust/exercises/isbn-verifier/Cargo.lock
+- tracks/rust/exercises/isbn-verifier/Cargo.toml
+- tracks/rust/exercises/isbn-verifier/README.md
+- tracks/rust/exercises/isbn-verifier/example.rs
+- tracks/rust/exercises/isbn-verifier/src/lib.rs
+- tracks/rust/exercises/isbn-verifier/tests/isbn-verifier.rs
 - tracks/rust/exercises/isogram/.gitignore
 - tracks/rust/exercises/isogram/Cargo.toml
 - tracks/rust/exercises/isogram/README.md
@@ -12097,6 +12120,12 @@ files:
 - tracks/rust/exercises/triangle/float_example.rs
 - tracks/rust/exercises/triangle/src/lib.rs
 - tracks/rust/exercises/triangle/tests/triangle.rs
+- tracks/rust/exercises/two-bucket/Cargo.lock
+- tracks/rust/exercises/two-bucket/Cargo.toml
+- tracks/rust/exercises/two-bucket/README.md
+- tracks/rust/exercises/two-bucket/example.rs
+- tracks/rust/exercises/two-bucket/src/lib.rs
+- tracks/rust/exercises/two-bucket/tests/two-bucket.rs
 - tracks/rust/exercises/variable-length-quantity/.gitignore
 - tracks/rust/exercises/variable-length-quantity/Cargo.lock
 - tracks/rust/exercises/variable-length-quantity/Cargo.toml