trackler 2.2.1.6 → 2.2.1.7

data/tracks/rust/exercises/custom-set/tests/custom-set.rs

@@ -142,7 +142,7 @@ fn empty_sets_are_equal() {
 fn empty_set_is_not_equal_to_a_non_empty_set() {
     let set1 = CustomSet::new(vec![]);
     let set2 = CustomSet::new(vec![1, 2, 3]);
-    assert!(set1 != set2);
+    assert_ne!(set1, set2);
 }
 
 #[test]
@@ -150,7 +150,7 @@ fn empty_set_is_not_equal_to_a_non_empty_set() {
 fn non_empty_set_is_not_equal_to_an_empty_set() {
     let set1 = CustomSet::new(vec![1, 2, 3]);
     let set2 = CustomSet::new(vec![]);
-    assert!(set1 != set2);
+    assert_ne!(set1, set2);
 }
 
 #[test]
@@ -166,7 +166,7 @@ fn sets_with_the_same_elements_are_equal() {
 fn sets_with_different_elements_are_not_equal() {
     let set1 = CustomSet::new(vec![1, 2, 3]);
     let set2 = CustomSet::new(vec![2, 1, 4]);
-    assert!(set1 != set2);
+    assert_ne!(set1, set2);
 }
 
 #[test]

data/tracks/rust/exercises/dominoes/example.rs

@@ -56,7 +56,7 @@ impl AvailabilityTable {
             panic!("remove for 0 stones: ({:?}, {:?})", x, y)
         }
     }
-    
+
     fn pop_first(&mut self, x: usize) -> Option<usize> {
         for y in 1 .. 7 {
             if self.get(x, y) > 0 {

data/tracks/rust/exercises/grade-school/example.rs

@@ -14,7 +14,7 @@ impl School {
         entry.push(student.to_string());
         entry.sort();
     }
-    
+
     pub fn grades(&self) -> Vec<u32> {
         let mut s = self.grades.keys().cloned().collect::<Vec<u32>>();
         s.sort();

data/tracks/rust/exercises/hamming/example.rs

@@ -2,6 +2,6 @@ pub fn hamming_distance(a : &str, b: &str) -> Result<usize, &'static str> {
     if a.len() != b.len() {
         return Result::Err("inputs of different length");
     }
-    
+
     Result::Ok(a.chars().zip(b.chars()).filter(|&(a, b)| a != b).count())
 }

data/tracks/rust/exercises/nth-prime/Cargo.lock

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

data/tracks/rust/exercises/nth-prime/Cargo.toml

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

data/tracks/rust/exercises/nth-prime/README.md

@@ -0,0 +1,47 @@
+# Nth Prime
+
+Given a number n, determine what the nth prime is.
+
+By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that
+the 6th prime is 13.
+
+If your language provides methods in the standard library to deal with prime
+numbers, pretend they don't exist and implement them yourself.
+
+## 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
+
+A variation on Problem 7 at Project Euler [http://projecteuler.net/problem=7](http://projecteuler.net/problem=7)
+
+## 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/nth-prime/example.rs

@@ -0,0 +1,28 @@
+fn is_prime(n: u32) -> bool {
+    let mut i: u32 = 3;
+    while (i * i) < (n + 1) {
+      if n % i == 0 {
+         return false;
+      }
+      i += 1;
+   }
+   return true;
+}
+
+pub fn nth(n: u32) -> Result<u32, ()> {
+    match n {
+        0 => Err(()),
+        1 => Ok(2),
+        _ => {
+            let mut count: u32 = 1;
+            let mut candidate: u32 = 1;
+            while count < n {
+                candidate += 2;
+                if is_prime(candidate) {
+                    count += 1;
+                }
+            }
+            Ok(candidate)
+        }
+    }
+}

data/tracks/rust/exercises/nth-prime/tests/nth-prime.rs

@@ -0,0 +1,30 @@
+extern crate nth_prime as np;
+
+#[test]
+fn test_first_prime() {
+    assert_eq!(np::nth(1), Ok(2));
+}
+
+#[test]
+#[ignore]
+fn test_second_prime() {
+    assert_eq!(np::nth(2), Ok(3));
+}
+
+#[test]
+#[ignore]
+fn test_sixth_prime() {
+    assert_eq!(np::nth(6), Ok(13));
+}
+
+#[test]
+#[ignore]
+fn test_big_prime() {
+    assert_eq!(np::nth(10001), Ok(104743));
+}
+
+#[test]
+#[ignore]
+fn test_zeroth_prime() {
+    assert!(np::nth(0).is_err());
+}

data/tracks/rust/exercises/parallel-letter-frequency/example.rs

@@ -26,7 +26,7 @@ pub fn frequency(texts: &[&str], num_workers: usize) -> HashMap<char, usize> {
 
     for part in parts {
         let tx = tx.clone();
-        thread::spawn(move || { 
+        thread::spawn(move || {
             tx.send(count(part)).unwrap();
         });
     }

data/tracks/rust/exercises/phone-number/example.rs

@@ -18,7 +18,7 @@ pub fn area_code(s: &str) -> Option<String> {
 }
 
 pub fn pretty_print(s: &str) -> String {
-    number(s).map(|n| 
+    number(s).map(|n|
         format!("({area}) {prefix}-{exchange}",
                 area=&n[..3],
                 prefix=&n[3..6],

data/tracks/rust/exercises/pythagorean-triplet/Cargo.lock

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

data/tracks/rust/exercises/pythagorean-triplet/Cargo.toml

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

data/tracks/rust/exercises/pythagorean-triplet/README.md

@@ -0,0 +1,56 @@
+# Pythagorean Triplet
+
+A Pythagorean triplet is a set of three natural numbers, {a, b, c}, for
+which,
+
+```
+a**2 + b**2 = c**2
+```
+
+For example, 
+
+```
+3**2 + 4**2 = 9 + 16 = 25 = 5**2.
+```
+
+There exists exactly one Pythagorean triplet for which a + b + c = 1000.
+
+Find the product a * b * c.
+
+## 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
+
+Problem 9 at Project Euler [http://projecteuler.net/problem=9](http://projecteuler.net/problem=9)
+
+## 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/pythagorean-triplet/example.rs

@@ -0,0 +1,11 @@
+pub fn find() -> Option<u32> {
+    for a in 1..1000 {
+        for b in (a+1)..(1000-a) {
+            let c = 1000 - (a + b);
+            if a*a + b*b == c*c {
+                return Some(a*b*c);
+            }
+        }
+    }
+    None
+}

data/tracks/rust/exercises/pythagorean-triplet/tests/pythagorean-triplet.rs

@@ -0,0 +1,6 @@
+extern crate pythagorean_triplet;
+
+#[test]
+fn test_answer() {
+    assert_eq!(pythagorean_triplet::find(), Some(31875000));
+}

data/tracks/rust/exercises/rna-transcription/tests/rna-transcription.rs

@@ -3,7 +3,7 @@ extern crate rna_transcription as dna;
 #[test]
 fn test_acid_equals_acid() {
     assert_eq!(dna::RibonucleicAcid::new("CGA"), dna::RibonucleicAcid::new("CGA"));
-    assert!(dna::RibonucleicAcid::new("CGA") != dna::RibonucleicAcid::new("AGC"));
+    assert_ne!(dna::RibonucleicAcid::new("CGA"), dna::RibonucleicAcid::new("AGC"));
 }
 
 #[test]

data/tracks/rust/exercises/robot-name/tests/robot-name.rs

@@ -42,7 +42,7 @@ fn test_name_is_persistent() {
 fn test_different_robots_have_different_names() {
     let r1 = robot::Robot::new();
     let r2 = robot::Robot::new();
-    assert!(r1.name() != r2.name(), "Robot names should be different");
+    assert_ne!(r1.name(), r2.name(), "Robot names should be different");
 }
 
 #[test]
@@ -69,5 +69,5 @@ fn test_new_name_is_different_from_old_name() {
     let n1 = r.name().to_string();
     r.reset_name();
     let n2 = r.name().to_string();
-    assert!(n1 != n2, "Robot name should change when reset");
+    assert_ne!(n1, n2, "Robot name should change when reset");
 }

data/tracks/rust/exercises/say/example.rs

@@ -1,6 +1,6 @@
-const SMALL: &'static [&'static str] = &["zero", "one", "two", "three", "four", "five", 
-                                         "six", "seven", "eight", "nine", "ten", 
-                                         "eleven", "twelve", "thirteen", "fourteen", "fifteen", 
+const SMALL: &'static [&'static str] = &["zero", "one", "two", "three", "four", "five",
+                                         "six", "seven", "eight", "nine", "ten",
+                                         "eleven", "twelve", "thirteen", "fourteen", "fifteen",
                                          "sixteen", "seventeen", "eighteen", "nineteen"];
 
 const TENS: &'static [&'static str] = &["ones", "ten", "twenty", "thirty", "forty",
@@ -28,7 +28,7 @@ pub fn encode(n: u64) -> String {
             out.push(' ');
             out.push_str(&encode(ones));
         }
-        out     
+        out
     } else {
         let mut sets: Vec<u64> = Vec::new();
         let mut val = n;

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

@@ -1,6 +1,6 @@
 extern crate say;
 
-// Note: No tests created using 'and' with numbers.  
+// Note: No tests created using 'and' with numbers.
 // Aparently Most American English does not use the 'and' with numbers,
 // where it is common in British English to use the 'and'.
 
@@ -9,9 +9,9 @@ fn test_zero() {
     assert_eq!(say::encode(0), String::from("zero"));
 }
 
-// 
+//
 // If the below test is uncommented, it should not compile.
-// 
+//
 /*
 #[test]
 fn test_negative() {
@@ -109,7 +109,7 @@ fn test_one_billion() {
 #[test]
 #[ignore]
 fn test_987654321123() {
-    assert_eq!(say::encode(987_654_321_123), 
+    assert_eq!(say::encode(987_654_321_123),
                String::from("nine hundred eighty-seven billion \
                              six hundred fifty-four million \
                              three hundred twenty-one thousand \

data/tracks/rust/exercises/tournament/example.rs

@@ -29,7 +29,7 @@ impl TeamResult {
 pub fn tally(input: &str) -> String {
     let mut results: HashMap<String, TeamResult> = HashMap::new();
     for line in input.to_string().lines() {
-        let parts: Vec<&str> = line.trim_right().split(';').collect(); 
+        let parts: Vec<&str> = line.trim_right().split(';').collect();
         if parts.len() != 3 { continue; }
         let team1 = parts[0];
         let team2 = parts[1];
@@ -60,7 +60,7 @@ fn write_tally(results: &HashMap<String, TeamResult>) -> String {
         (team, games, r, points)
     }).collect();
     // Sort by points descending, then name A-Z.
-    v.sort_by(|a, b| 
+    v.sort_by(|a, b|
               match a.3.cmp(&(b.3)).reverse() {
                   Equal => a.0.cmp(&(b.0)),
                   other => other

data/tracks/scala/config/maintainers.json

@@ -2,12 +2,12 @@
   "maintainers": [
     {
       "github_username": "ErikSchierboom",
-      "show_on_website": false,
+      "show_on_website": true,
       "alumnus": false,
-      "name": null,
+      "name": "Erik Schierboom",
       "bio": null,
-      "link_text": null,
-      "link_url": null,
+      "link_text": "My blog",
+      "link_url": "http://www.erikschierboom.com/",
       "avatar_url": null
     },
     {
@@ -16,13 +16,17 @@
     },
     {
       "github_username": "ricemery",
-      "show_on_website": false,
+      "show_on_website": true,
       "alumnus": false,
-      "name": null,
+      "name": "Ric Emery",
       "bio": null,
       "link_text": null,
       "link_url": null,
       "avatar_url": null
+    },
+    {
+      "github_username": "abo64",
+      "alumnus": true
     }
   ],
   "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"

data/tracks/scala/exercises/bracket-push/example.scala

@@ -1,6 +1,6 @@
 import scala.util.parsing.combinator.RegexParsers
 
-object Brackets extends RegexParsers {
+object BracketPush extends RegexParsers {
   lazy val t = "[^\\[\\]\\(\\)\\{\\}]+".r
 
   private def paren: Parser[String] =
@@ -16,7 +16,7 @@ object Brackets extends RegexParsers {
 
   private def all = rep(paren)
 
-  def areBalanced(s: String) = this.parseAll(all, s) match {
+  def isPaired(s: String) = this.parseAll(all, s) match {
     case NoSuccess(_, _) => false
     case Success(_, _) => true
   }