trackler 2.2.1.8 → 2.2.1.9

data/tracks/go/config.json

@@ -700,9 +700,11 @@
       "slug": "nucleotide-count",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": [
-
+        "Strings",
+        "Parsing",
+        "Maps"
       ]
     },
     {
@@ -722,9 +724,13 @@
       "slug": "matrix",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 4,
       "topics": [
-
+        "Matrices",
+        "Type conversion",
+        "Arrays",
+        "Exception handling",
+        "Strings"
       ]
     },
     {
@@ -732,9 +738,12 @@
       "slug": "saddle-points",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
-
+        "Arrays",
+        "Integers",
+        "Matrices",
+        "Searching"
       ]
     },
     {
@@ -742,9 +751,12 @@
       "slug": "meetup",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Dates",
+        "Time",
+        "Transforming",
+        "Type conversion"
       ]
     },
     {
@@ -752,9 +764,12 @@
       "slug": "binary-search",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
-
+        "Algorithms",
+        "Arrays",
+        "Searching",
+        "Sorting"
       ]
     },
     {
@@ -762,9 +777,14 @@
       "slug": "binary-search-tree",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
-
+        "Algorithms",
+        "Recursion",
+        "Searching",
+        "Sorting",
+        "Structs",
+        "Trees"
       ]
     },
     {
@@ -772,9 +792,12 @@
       "slug": "tree-building",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Records",
+        "Refactoring",
+        "Sorting",
+        "Trees"
       ]
     },
     {
@@ -782,9 +805,13 @@
       "slug": "kindergarten-garden",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Parsing",
+        "Records",
+        "Searching",
+        "Strings",
+        "Structs"
       ]
     },
     {
@@ -792,9 +819,13 @@
       "slug": "simple-cipher",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Algorithms",
+        "Interfaces",
+        "Security",
+        "Strings",
+        "Transforming"
       ]
     },
     {
@@ -802,9 +833,11 @@
       "slug": "paasio",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
-
+        "Concurrency",
+        "Interfaces",
+        "Networking"
       ]
     },
     {
@@ -812,9 +845,13 @@
       "slug": "pov",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 7,
       "topics": [
-
+        "Graphs",
+        "Recursion",
+        "Structs",
+        "Transforming",
+        "Trees"
       ]
     },
     {
@@ -822,9 +859,13 @@
       "slug": "minesweeper",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
-
+        "Arrays",
+        "Control-flow (loops)",
+        "Matrices",
+        "Games",
+        "Transforming"
       ]
     },
     {
@@ -832,9 +873,13 @@
       "slug": "robot-simulator",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 6,
       "topics": [
-
+        "Concurrency",
+        "Control-flow (loops)",
+        "Sequences",
+        "Strings",
+        "Structs"
       ]
     },
     {
@@ -842,9 +887,15 @@
       "slug": "tournament",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Integers",
+        "Parsing",
+        "Records",
+        "Sorting",
+        "Strings",
+        "Text formatting",
+        "Transforming"
       ]
     },
     {
@@ -852,9 +903,11 @@
       "slug": "word-search",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 4,
       "topics": [
-
+        "Matrices",
+        "Searching",
+        "Strings"
       ]
     },
     {
@@ -862,9 +915,11 @@
       "slug": "all-your-base",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Integers",
+        "Mathematics",
+        "Transforming"
       ]
     },
     {
@@ -872,9 +927,13 @@
       "slug": "connect",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 9,
       "topics": [
-
+        "Arrays",
+        "Control-flow (loops)",
+        "Games",
+        "Graphs",
+        "Searching"
       ]
     },
     {

data/tracks/julia/README.md

@@ -1,7 +1,7 @@
 # Exercism Julia Track
 
-[![Join the chat at https://gitter.im/exercism/xjulia](https://badges.gitter.im/exercism/xjulia.svg)](https://gitter.im/exercism/xjulia?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
-[![Build Status](https://travis-ci.org/exercism/xjulia.svg?branch=master)](https://travis-ci.org/exercism/xjulia)
+[![Join the chat at https://gitter.im/exercism/julia](https://badges.gitter.im/exercism/julia.svg)](https://gitter.im/exercism/julia?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
+[![Build Status](https://travis-ci.org/exercism/julia.svg?branch=master)](https://travis-ci.org/exercism/julia)
 
 Exercism exercises in Julia.
 
@@ -29,7 +29,7 @@ Exercises for the Julia track go in the `exercises` directory and should follow
 
 Replace `<slug>` with the exercise slug of the exercise you're working on.
 
-See [Issue #2](https://github.com/exercism/xjulia/issues/2) for discussion on the structure and style guidelines.
+See [Issue #2](https://github.com/exercism/julia/issues/2) for discussion on the structure and style guidelines.
 
 ### Adding it to config
 

data/tracks/julia/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "SaschaMann",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/rust/config.json

@@ -312,6 +312,16 @@
         "btree"
       ]
     },
+    {
+      "uuid": "ddc45979-8a92-4313-a4f8-878562d5a483",
+      "slug": "accumulate",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "function pointer"
+      ]
+    },
     {
       "uuid": "26a9102f-26f6-4238-858e-ba20db66f1a9",
       "slug": "acronym",

data/tracks/rust/exercises/accumulate/.meta/hints.md

@@ -0,0 +1,10 @@
+## Hints
+
+We are dealing with two types of situations.  One is a function pointer and
+the other is a closure.
+
+It may help to look at the [Fn trait](https://doc.rust-lang.org/std/ops/trait.Fn.html).
+
+Help with passing a closure into a function may be found in
+the ["closures as input parameters" section](https://rustbyexample.com/fn/closures/input_parameters.html) of
+[Rust by Example](https://rustbyexample.com/).

data/tracks/rust/exercises/accumulate/Cargo.lock

@@ -0,0 +1,4 @@
+[root]
+name = "accumulate"
+version = "0.0.0"
+

data/tracks/rust/exercises/accumulate/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "accumulate"
+version = "0.0.0"
+authors = ["sacherjj <sacherjj@gmail.com>"]
+
+[dependencies]

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

@@ -0,0 +1,79 @@
+# Accumulate
+
+Implement the `accumulate` operation, which, given a collection and an
+operation to perform on each element of the collection, returns a new
+collection containing the result of applying that operation to each element of
+the input collection.
+
+Given the collection of numbers:
+
+- 1, 2, 3, 4, 5
+
+And the operation:
+
+- square a number (`x => x * x`)
+
+Your code should be able to produce the collection of squares:
+
+- 1, 4, 9, 16, 25
+
+Check out the test suite to see the expected function signature.
+
+## Restrictions
+
+Keep your hands off that collect/map/fmap/whatchamacallit functionality
+provided by your standard library!
+Solve this one yourself using other basic tools instead.
+
+Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
+as this is idiomatic Lisp, not a library function.
+
+## Hints
+
+We are dealing with two types of situations.  One is a function pointer and
+the other is a closure.
+
+It may help to look at the [Fn trait](https://doc.rust-lang.org/std/ops/trait.Fn.html).
+
+Help with passing a closure into a function may be found in
+the ["closures as input parameters" section](https://rustbyexample.com/fn/closures/input_parameters.html) of
+[Rust by Example](https://rustbyexample.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 [Crates and Modules](https://doc.rust-lang.org/stable/book/crates-and-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
+[crates-and-modules]: http://doc.rust-lang.org/stable/book/crates-and-modules.html
+
+## Source
+
+Conversation with James Edward Gray II [https://twitter.com/jeg2](https://twitter.com/jeg2)
+
+## 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/accumulate/example.rs

@@ -0,0 +1,15 @@
+pub fn map_function(values: Vec<i32>, f: &Fn(i32) -> i32) -> Vec<i32> {
+    let mut out: Vec<i32> = vec![];
+    for val in values {
+        out.push(f(val))
+    }
+    out
+}
+
+pub fn map_closure<F>(values: Vec<i32>, f: F) -> Vec<i32> where F: Fn(i32) -> i32 {
+    let mut out: Vec<i32> = vec![];
+    for val in values {
+        out.push(f(val))
+    }
+    out
+}

data/tracks/rust/exercises/accumulate/tests/accumulate.rs

@@ -0,0 +1,94 @@
+extern crate accumulate;
+
+use accumulate::{map_function, map_closure};
+
+fn square(x: i32) -> i32 {
+    x*x
+}
+
+fn abs_val(x: i32) -> i32 {
+    if x > 0 {
+        x
+    } else {
+        -x
+    }
+}
+
+#[test]
+fn test_func_square_single() {
+    let input = vec![2];
+    let expected = vec![4];
+    assert_eq!(map_function(input, &square), expected);
+}
+
+#[test]
+#[ignore]
+fn test_func_square_short() {
+    let input = vec![2, 3, 4, 5];
+    let expected = vec![4, 9, 16, 25];
+    assert_eq!(map_function(input, &square), expected);
+}
+
+#[test]
+#[ignore]
+fn test_func_square_long_with_neg() {
+    let input = vec![2, -3, -2, 3, 4, 3, 4, 5, 100, 8, 16, 34];
+    let expected = vec![4, 9, 4, 9, 16, 9, 16, 25, 10000, 64, 256, 1156];
+    assert_eq!(map_function(input, &square), expected);
+}
+
+#[test]
+#[ignore]
+fn test_func_abs_value_with_neg() {
+    let input = vec![-3];
+    let expected = vec![3];
+    assert_eq!(map_function(input, &abs_val), expected);
+}
+
+#[test]
+#[ignore]
+fn test_func_abs_value_long() {
+    let input = vec![-3, 5, -10, 4, 100, -1234, 55443];
+    let expected = vec![3, 5, 10, 4, 100, 1234, 55443];
+    assert_eq!(map_function(input, &abs_val), expected);
+}
+
+#[test]
+#[ignore]
+fn test_closure_square_single() {
+    let input = vec![2];
+    let expected = vec![4];
+    assert_eq!(map_closure(input, |x| x*x), expected);
+}
+
+#[test]
+#[ignore]
+fn test_closure_square_short() {
+    let input = vec![2, 3, 4, 5];
+    let expected = vec![4, 9, 16, 25];
+    assert_eq!(map_closure(input, |x| x*x), expected);
+}
+
+#[test]
+#[ignore]
+fn test_closure_square_long_with_neg() {
+    let input = vec![2, -3, -2, 3, 4, 3, 4, 5, 100, 8, 16, 34];
+    let expected = vec![4, 9, 4, 9, 16, 9, 16, 25, 10000, 64, 256, 1156];
+    assert_eq!(map_closure(input, |x| x*x), expected);
+}
+
+#[test]
+#[ignore]
+fn test_closure_abs_value_with_neg() {
+    let input = vec![-3];
+    let expected = vec![3];
+    assert_eq!(map_closure(input, |x| if x > 0 {x} else {-x}), expected);
+}
+
+#[test]
+#[ignore]
+fn test_closure_abs_value_long() {
+    let input = vec![-3, 5, -10, 4, 100, -1234, 55443];
+    let expected = vec![3, 5, 10, 4, 100, 1234, 55443];
+    assert_eq!(map_closure(input, |x| if x > 0 {x} else {-x}), expected);
+}