trackler 2.2.1.71 → 2.2.1.72

data/tracks/perl6/exercises/acronym/example.yaml

@@ -0,0 +1,19 @@
+exercise: Acronym
+version: 1
+plan: 8
+imports: '&abbreviate'
+tests: |-
+
+  for $c-data<cases>»<cases>».Array.flat {
+    is abbreviate(.<phrase>), |.<expected description>;
+  }
+
+unit: module
+example: |-
+  sub abbreviate ($phrase) is export {
+    [~] $phrase.uc.comb(/\w+/).map: *.substr(0, 1);
+  }
+
+stub: |-
+  sub abbreviate ($phrase) is export {
+  }

data/tracks/perl6/exercises/word-count/Example.pm6

@@ -1,4 +1,4 @@
-unit module WordCount:ver<1>;
+unit module WordCount:ver<2>;
 
 sub count-words (Str:D $str --> Hash:D) is export {
   $str.lc.comb(/ <alnum>+ (\'<alnum>+)? /).Bag.hash

data/tracks/perl6/exercises/word-count/WordCount.pm6

@@ -1,4 +1,4 @@
-unit module WordCount:ver<1>;
+unit module WordCount:ver<2>;
 
 sub count-words ($str) is export {
 }

data/tracks/perl6/exercises/word-count/example.yaml

@@ -1,6 +1,6 @@
 exercise: WordCount
-version: 1
-plan: 12
+version: 2
+plan: 13
 imports: '&count-words'
 tests: |-
   is-deeply (% = .<input>.&count-words), |.<expected description> for @($c-data<cases>);

data/tracks/perl6/exercises/word-count/word-count.t

@@ -5,9 +5,9 @@ use lib my $dir = $?FILE.IO.dirname;
 use JSON::Fast;
 
 my Str:D $exercise := 'WordCount';
-my Version:D $version = v1;
+my Version:D $version = v2;
 my Str $module //= $exercise;
-plan 12;
+plan 13;
 
 use-ok $module or bail-out;
 require ::($module);
@@ -140,6 +140,15 @@ is-deeply (% = .<input>.&count-words), |.<expected description> for @($c-data<ca
         "large": 2,
         "and": 1
       }
+    },
+    {
+      "description": "multiple spaces not detected as a word",
+      "property": "countwords",
+      "input": " multiple   whitespaces",
+      "expected": {
+        "multiple": 1,
+        "whitespaces": 1
+      }
     }
   ]
 }

data/tracks/pony/docs/RESOURCES.md

@@ -2,6 +2,6 @@
 
 - [The Pony Tutorial](https://tutorial.ponylang.org/)
 - [Pony Patterns](https://patterns.ponylang.org/)
-- [Standard Library Documentation](http://www.ponylang.org/ponyc/)
+- [Standard Library Documentation](https://stdlib.ponylang.org/)
 - [Mailing List](https://pony.groups.io/g/pony)
 - [IRC Channel](https://webchat.freenode.net/?channels=%23ponylang)

data/tracks/purescript/docs/INSTALLATION.md

@@ -7,6 +7,4 @@ compiler, the Pulp build tool and the Bower package manager.
 
     npm install --global purescript pulp bower
 
-More information can be found in [the Purescript repository][ps-repo]
-
-[ps-repo]: (https://github.com/purescript/purescript/blob/master/INSTALL.md).
+More information can be found in [the Purescript repository](https://github.com/purescript/purescript/blob/master/INSTALL.md).

data/tracks/python/config.json

@@ -169,7 +169,7 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+	"mathematics"
       ]
     },
     {

data/tracks/r/exercises/word-count/test_word-count.R

@@ -67,4 +67,9 @@ test_that("normalize case", {
                      list("go" = 3, "stop" = 2))
 })
 
+test_that("multiple whitespaces", {
+  expect_equal_pairs(word_count(" multiple   whitespaces "),
+                     list("multiple" = 1, "whitespaces" = 1))
+})
+
 message("All tests passed for exercise: word-count")

data/tracks/ruby/README.md

@@ -33,9 +33,14 @@ A few exercises use a custom test template:
 
 ### BookKeeping::VERSION
 
-For some, even perhaps many, of the exercises, you will find a
-reference to the `BookKeeping` module, but this is only included when
-tests have been generated; see [Generated Test Suites](#generated-test-suites).
+For some, even perhaps many, of the exercises, you will find a reference
+to the `BookKeeping` module, but this is only included when tests have
+been generated; see [Generated Test Suites](#generated-test-suites).
+This `VERSION` number helps make sure exercise solvers and exercise
+reviewers know which revision of the test suite they are talking
+about, and it theoretically helps avoid reviewer feedback like 
+*"Your solution doesn't make the tests pass,"* if they are looking
+at a different version of the tests than the solver used.
 
 ### Canonical Data
 
@@ -104,12 +109,67 @@ tree -L 1 ~/code/exercism
 
 #### Regenerating a Test Suite
 
-From within the ruby directory, run the following command:
+From time to time, the [canonical data](https://github.com/exercism/problem-specifications/tree/master/exercises)
+for an exercise's tests changes, and we need to keep the Ruby version's
+tests synced up.  Regenerating these tests is a quick and easy way to help
+maintain the track and get involved!
 
-    bin/generate --update <slug> 
+If it's your first time cloning/contributing to the repository, you'll
+need to install any dependencies via `bundle`:
 
-Leaving out the --update option will cause the BookKeeping version number to remain the same.
-This can be useful when testing generators.
+```bash
+bundle install
+```
+
+Be sure that you're working on the most up-to-date version of the repo.
+From the root of your copy of the repository:
+
+```bash
+# Add the exercism repo as upstream if you haven't yet:
+git remote add upstream https://github.com/exercism/ruby.git
+
+# Pull down any changes
+git fetch upstream
+
+# Merge any upstream changes with your master branch
+git checkout master
+git merge upstream/master
+```
+
+Depending on your git workflow preferences and the state of your local
+repo, you may want to do some rebasing.
+[See the rebasing documentation for more information.](https://help.github.com/articles/about-git-rebase/)
+
+The generator also depends on the presence of Exercism's `problem-specifications`
+repository (see the file tree in the section above).  Make sure you've got
+an *up-to-date* version of the specifications in a `problem-specifications`
+folder that's in a parallel directory to your local copy of the `ruby` repository.
+
+To check which problems have possibly been updated, run:
+
+```bash
+bin/generate --all
+```
+
+This will autogenerate all of the test cases for which generators exist.
+Use `git diff` (or your preferred method) to find out which test files
+have changed.  Some exercises will update because someone updated the
+description or other exercise metadata.  Others will change because the
+actual test suite has changed.  If you find that an exercise's test suite
+(i.e. the actual tests, not just the line at the test data version number
+at the top of the tests) has changed, be sure to use `generate` to update
+the [BookKeeping::VERSION](#bookkeeping-version) number by running:
+
+```bash
+bin/generate --update <exercise-slug>
+```
+
+Once everything has been regenerated and updated, you're almost ready to
+submit your changes via pull request.  Please be sure to only update one
+exercise per pull request.  Also, please follow the guidelines in the
+[Pull Requests](#pull-requests) section, being sure to follow the pattern
+of `<slug>: Regenerate Tests`, where slug is the slug of the exercise that
+your pull request is regenerating.
 
 #### Changing a Generated Exercise
 
@@ -260,10 +320,13 @@ are constructed using shared metadata, which lives in the [problem-specification
 
 ## Contributing Guide
 
-For an in-depth discussion of how exercism language tracks and exercises work,
-please see the
-[contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
+For an in-depth discussion of how exercism language tracks and exercises work, please see the
+[contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data).
 
+If you're just getting started and looking for a helpful way to get involved,
+take a look at  [regenerating the test suites](#regenerating-a-test-suite),
+[porting an exercise from another language](https://github.com/exercism/docs/blob/master/you-can-help/implement-an-exercise-from-specification.md),
+or [creating an automated test generator](#implementing-a-generator).
 
 ## Ruby icon
 The Ruby icon is the Vienna.rb logo, and is used with permission. Thanks Floor Dress :)

data/tracks/rust/config.json

@@ -164,6 +164,16 @@
         "error handling with Result<T, E>"
       ]
     },
+    {
+      "uuid": "23d82e48-d074-11e7-8fab-cec278b6b50a",
+      "slug": "diffie-hellman",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "mathematics"
+      ]
+    },
     {
       "uuid": "79613fd8-b7da-11e7-abc4-cec278b6b50a",
       "slug": "isogram",
@@ -244,6 +254,18 @@
         "Result"
       ]
     },
+    {
+      "uuid": "10923b0b-c726-44a7-9e02-b775e7b8b237",
+      "slug": "simple-linked-list",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "lists",
+        "type_conversion",
+        "struct"
+      ]
+    },
     {
       "uuid": "ddc0c1da-6b65-4ed1-8bdc-5e71cd05f720",
       "slug": "pascals-triangle",
@@ -589,6 +611,18 @@
         "higher-order functions"
       ]
     },
+    {
+      "uuid": "29583cc6-d56d-4bee-847d-93d74e5a30e7",
+      "slug": "macros",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "macros",
+        "macros-by-example",
+        "hashmap"
+      ]
+    },
     {
       "uuid": "94f040d6-3f41-4950-8fe6-acf0945ac83d",
       "slug": "allergies",

data/tracks/rust/exercises/book-store/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "book_store"
-version = "1.0.1"
+version = "1.1.0"
 authors = ["Peter Goodspeed-Niklaus <peter.r.goodspeedniklaus@gmail.com>"]
 
 [dependencies]

data/tracks/rust/exercises/book-store/tests/book-store.rs

@@ -128,3 +128,10 @@ fn test_three_copies_of_first_book_and_2_each_of_remaining() {
 fn test_three_each_of_first_2_books_and_2_each_of_remaining_books() {
     process_total_case((vec![1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 1, 2], vec![vec![1, 2, 3, 4, 5], vec![1, 2, 3, 4, 5], vec![1, 2]]), 75.2);
 }
+
+#[test]
+#[ignore]
+/// Four groups of four are cheaper than two groups each of five and three
+fn test_four_groups_of_four_are_cheaper_than_two_groups_each_of_five_and_three() {
+    process_total_case((vec![1,1,2,2,3,3,4,5,1,1,2,2,3,3,4,5], vec![vec![1,2,3,4],vec![1,2,3,5],vec![1,2,3,4],vec![1,2,3,5]]), 102.4);
+}

data/tracks/rust/exercises/diffie-hellman/.gitignore

@@ -0,0 +1,9 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+**/*.rs.bk
+
+# Remove Cargo.lock from gitignore if creating an executable, leave it for libraries
+# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
+Cargo.lock
+

data/tracks/rust/exercises/diffie-hellman/Cargo-example.toml

@@ -0,0 +1,6 @@
+[package]
+name = "diffie-hellman"
+version = "0.1.0"
+
+[dependencies]
+rand = "0.3.18"

data/tracks/rust/exercises/diffie-hellman/Cargo.toml

@@ -0,0 +1,5 @@
+[package]
+name = "diffie-hellman"
+version = "0.1.0"
+
+[dependencies]

data/tracks/rust/exercises/diffie-hellman/README.md

@@ -0,0 +1,77 @@
+# Diffie Hellman
+
+Diffie-Hellman key exchange.
+
+Alice and Bob use Diffie-Hellman key exchange to share secrets.  They
+start with prime numbers, pick private keys, generate and share public
+keys, and then generate a shared secret key.
+
+## Step 0
+
+The test program supplies prime numbers p and g.
+
+## Step 1
+
+Alice picks a private key, a, greater than 1 and less than p.  Bob does
+the same to pick a private key b.
+
+## Step 2
+
+Alice calculates a public key A.
+
+    A = g**a mod p
+
+Using the same p and g, Bob similarly calculates a public key B from his
+private key b.
+
+## Step 3
+
+Alice and Bob exchange public keys.  Alice calculates secret key s.
+
+    s = B**a mod p
+
+Bob calculates
+
+    s = A**b mod p
+
+The calculations produce the same result!  Alice and Bob now share
+secret s.
+
+## 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
+
+Wikipedia, 1024 bit key from www.cryptopp.com/wiki. [http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange](http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange)
+
+## 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/diffie-hellman/example.rs

@@ -0,0 +1,15 @@
+extern crate rand;
+
+use rand::distributions::{IndependentSample, Range};
+
+pub fn private_key(p: u64) -> u64 {
+    Range::new(2, p).ind_sample(&mut rand::thread_rng())
+}
+
+pub fn public_key(p: u64, g: u64, a: u64) -> u64 {
+    g.pow(a as u32) % p
+}
+
+pub fn secret(p: u64, b_pub: u64, a: u64) -> u64 {
+    b_pub.pow(a as u32) % p
+}

data/tracks/rust/exercises/diffie-hellman/src/lib.rs

@@ -0,0 +1,11 @@
+pub fn private_key(_p: u64) -> u64 {
+    unimplemented!()
+}
+
+pub fn public_key(_p: u64, _g: u64, _a: u64) -> u64 {
+    unimplemented!()
+}
+
+pub fn secret(_p: u64, _b_pub: u64, _a: u64) -> u64 {
+    unimplemented!()
+}

data/tracks/rust/exercises/diffie-hellman/tests/diffie-hellman.rs

@@ -0,0 +1,60 @@
+extern crate diffie_hellman;
+
+use diffie_hellman::*;
+
+#[test]
+fn test_private_key_in_range_key() {
+    let primes: Vec<u64> = vec![5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 773, 967,
+                                3461, 6131];
+    let private_keys: Vec<u64> = primes.iter().map(|x| private_key(*x)).collect();
+
+    for i in 0..primes.len() {
+        assert!(1 < private_keys[i] && private_keys[i] < primes[i]);
+    }
+}
+
+#[test]
+#[ignore]
+fn test_public_key_correct() {
+    let p: u64 = 23;
+    let g: u64 = 5;
+
+    let private_key: u64 = 6;
+    let expected: u64 = 8;
+
+    assert_eq!(public_key(p, g, private_key), expected);
+}
+
+
+#[test]
+#[ignore]
+fn test_secret_key_correct() {
+    let p: u64 = 11;
+    let g: u64 = 7;
+
+    let private_key_a = 7;
+    let public_key_b = 8;
+    let secret = secret(p, public_key_b, private_key_a);
+    let expected = 2;
+
+    assert_eq!(secret, expected);
+}
+
+#[test]
+#[ignore]
+fn test_changed_secret_key() {
+    let p: u64 = 13;
+    let g: u64 = 11;
+
+    let private_key_a = private_key(p);
+    let private_key_b = private_key(p);
+
+    let public_key_a = public_key(p, g, private_key_a);
+    let public_key_b = public_key(p, g, private_key_b);
+
+    // Key exchange
+    let secret_a = secret(p, public_key_b, private_key_a);
+    let secret_b = secret(p, public_key_a, private_key_b);
+
+    assert_eq!(secret_a, secret_b);
+}