trackler 2.2.1.128 → 2.2.1.129

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

@@ -4,43 +4,43 @@ use set::*;
 
 #[test]
 fn sets_with_no_elements_are_empty() {
-    let set: CustomSet<()> = CustomSet::new(vec![]);
+    let set: CustomSet<()> = CustomSet::new(&[]);
     assert!(set.is_empty());
 }
 
 #[test]
 #[ignore]
 fn sets_with_elements_are_not_empty() {
-    let set = CustomSet::new(vec![1]);
+    let set = CustomSet::new(&[1]);
     assert!(!set.is_empty());
 }
 
 #[test]
 #[ignore]
 fn nothing_is_contained_in_an_empty_set() {
-    let set = CustomSet::new(vec![]);
+    let set = CustomSet::new(&[]);
     assert!(!set.contains(&1));
 }
 
 #[test]
 #[ignore]
 fn true_when_the_element_is_in_the_set() {
-    let set = CustomSet::new(vec![1, 2, 3]);
+    let set = CustomSet::new(&[1, 2, 3]);
     assert!(set.contains(&1));
 }
 
 #[test]
 #[ignore]
 fn false_when_the_element_is_not_in_the_set() {
-    let set = CustomSet::new(vec![1, 2, 3]);
+    let set = CustomSet::new(&[1, 2, 3]);
     assert!(!set.contains(&4));
 }
 
 #[test]
 #[ignore]
 fn empty_sets_are_subsets_of_each_other() {
-    let set1: CustomSet<()> = CustomSet::new(vec![]);
-    let set2: CustomSet<()> = CustomSet::new(vec![]);
+    let set1: CustomSet<()> = CustomSet::new(&[]);
+    let set2: CustomSet<()> = CustomSet::new(&[]);
     assert!(set1.is_subset(&set2));
     assert!(set2.is_subset(&set1));
 }
@@ -48,24 +48,24 @@ fn empty_sets_are_subsets_of_each_other() {
 #[test]
 #[ignore]
 fn empty_set_is_subset_of_non_empty_set() {
-    let set1 = CustomSet::new(vec![]);
-    let set2 = CustomSet::new(vec![1]);
+    let set1 = CustomSet::new(&[]);
+    let set2 = CustomSet::new(&[1]);
     assert!(set1.is_subset(&set2));
 }
 
 #[test]
 #[ignore]
 fn non_empty_set_is_not_subset_of_empty_set() {
-    let set1 = CustomSet::new(vec![1]);
-    let set2 = CustomSet::new(vec![]);
+    let set1 = CustomSet::new(&[1]);
+    let set2 = CustomSet::new(&[]);
     assert!(!set1.is_subset(&set2));
 }
 
 #[test]
 #[ignore]
 fn sets_with_same_elements_are_subsets() {
-    let set1 = CustomSet::new(vec![1, 2, 3]);
-    let set2 = CustomSet::new(vec![1, 2, 3]);
+    let set1 = CustomSet::new(&[1, 2, 3]);
+    let set2 = CustomSet::new(&[1, 2, 3]);
     assert!(set1.is_subset(&set2));
     assert!(set2.is_subset(&set1));
 }
@@ -73,24 +73,24 @@ fn sets_with_same_elements_are_subsets() {
 #[test]
 #[ignore]
 fn set_contained_in_other_set_is_a_subset() {
-    let set1 = CustomSet::new(vec![1, 2, 3]);
-    let set2 = CustomSet::new(vec![4, 1, 2, 3]);
+    let set1 = CustomSet::new(&[1, 2, 3]);
+    let set2 = CustomSet::new(&[4, 1, 2, 3]);
     assert!(set1.is_subset(&set2));
 }
 
 #[test]
 #[ignore]
 fn set_not_contained_in_other_set_is_not_a_subset_one() {
-    let set1 = CustomSet::new(vec![1, 2, 3]);
-    let set2 = CustomSet::new(vec![4, 1, 3]);
+    let set1 = CustomSet::new(&[1, 2, 3]);
+    let set2 = CustomSet::new(&[4, 1, 3]);
     assert!(!set1.is_subset(&set2));
 }
 
 #[test]
 #[ignore]
 fn empty_sets_are_disjoint_with_each_other() {
-    let set1: CustomSet<()> = CustomSet::new(vec![]);
-    let set2: CustomSet<()> = CustomSet::new(vec![]);
+    let set1: CustomSet<()> = CustomSet::new(&[]);
+    let set2: CustomSet<()> = CustomSet::new(&[]);
     assert!(set1.is_disjoint(&set2));
     assert!(set2.is_disjoint(&set1));
 }
@@ -98,24 +98,24 @@ fn empty_sets_are_disjoint_with_each_other() {
 #[test]
 #[ignore]
 fn empty_set_disjoint_with_non_empty_set() {
-    let set1 = CustomSet::new(vec![]);
-    let set2 = CustomSet::new(vec![1]);
+    let set1 = CustomSet::new(&[]);
+    let set2 = CustomSet::new(&[1]);
     assert!(set1.is_disjoint(&set2));
 }
 
 #[test]
 #[ignore]
 fn non_empty_set_disjoint_with_empty_set() {
-    let set1 = CustomSet::new(vec![1]);
-    let set2 = CustomSet::new(vec![]);
+    let set1 = CustomSet::new(&[1]);
+    let set2 = CustomSet::new(&[]);
     assert!(set1.is_disjoint(&set2));
 }
 
 #[test]
 #[ignore]
 fn sets_with_one_element_in_common_are_not_disjoint() {
-    let set1 = CustomSet::new(vec![1, 2]);
-    let set2 = CustomSet::new(vec![2, 3]);
+    let set1 = CustomSet::new(&[1, 2]);
+    let set2 = CustomSet::new(&[2, 3]);
     assert!(!set1.is_disjoint(&set2));
     assert!(!set2.is_disjoint(&set1));
 }
@@ -123,8 +123,8 @@ fn sets_with_one_element_in_common_are_not_disjoint() {
 #[test]
 #[ignore]
 fn sets_with_no_elements_in_common_are_disjoint() {
-    let set1 = CustomSet::new(vec![1, 2]);
-    let set2 = CustomSet::new(vec![3, 4]);
+    let set1 = CustomSet::new(&[1, 2]);
+    let set2 = CustomSet::new(&[3, 4]);
     assert!(set1.is_disjoint(&set2));
     assert!(set2.is_disjoint(&set1));
 }
@@ -132,169 +132,169 @@ fn sets_with_no_elements_in_common_are_disjoint() {
 #[test]
 #[ignore]
 fn empty_sets_are_equal() {
-    let set1: CustomSet<()> = CustomSet::new(vec![]);
-    let set2: CustomSet<()> = CustomSet::new(vec![]);
+    let set1: CustomSet<()> = CustomSet::new(&[]);
+    let set2: CustomSet<()> = CustomSet::new(&[]);
     assert_eq!(set1, set2);
 }
 
 #[test]
 #[ignore]
 fn empty_set_is_not_equal_to_a_non_empty_set() {
-    let set1 = CustomSet::new(vec![]);
-    let set2 = CustomSet::new(vec![1, 2, 3]);
+    let set1 = CustomSet::new(&[]);
+    let set2 = CustomSet::new(&[1, 2, 3]);
     assert_ne!(set1, set2);
 }
 
 #[test]
 #[ignore]
 fn non_empty_set_is_not_equal_to_an_empty_set() {
-    let set1 = CustomSet::new(vec![1, 2, 3]);
-    let set2 = CustomSet::new(vec![]);
+    let set1 = CustomSet::new(&[1, 2, 3]);
+    let set2 = CustomSet::new(&[]);
     assert_ne!(set1, set2);
 }
 
 #[test]
 #[ignore]
 fn sets_with_the_same_elements_are_equal() {
-    let set1 = CustomSet::new(vec![1, 2]);
-    let set2 = CustomSet::new(vec![2, 1]);
+    let set1 = CustomSet::new(&[1, 2]);
+    let set2 = CustomSet::new(&[2, 1]);
     assert_eq!(set1, set2);
 }
 
 #[test]
 #[ignore]
 fn sets_with_different_elements_are_not_equal() {
-    let set1 = CustomSet::new(vec![1, 2, 3]);
-    let set2 = CustomSet::new(vec![2, 1, 4]);
+    let set1 = CustomSet::new(&[1, 2, 3]);
+    let set2 = CustomSet::new(&[2, 1, 4]);
     assert_ne!(set1, set2);
 }
 
 #[test]
 #[ignore]
 fn add_to_empty_set() {
-    let mut set = CustomSet::new(vec![]);
+    let mut set = CustomSet::new(&[]);
     set.add(3);
-    assert_eq!(set, CustomSet::new(vec![3]));
+    assert_eq!(set, CustomSet::new(&[3]));
 }
 
 #[test]
 #[ignore]
 fn add_to_non_empty_set() {
-    let mut set = CustomSet::new(vec![1, 2, 4]);
+    let mut set = CustomSet::new(&[1, 2, 4]);
     set.add(3);
-    assert_eq!(set, CustomSet::new(vec![1, 2, 3, 4]));
+    assert_eq!(set, CustomSet::new(&[1, 2, 3, 4]));
 }
 
 #[test]
 #[ignore]
 fn add_existing_element() {
-    let mut set = CustomSet::new(vec![1, 2, 3]);
+    let mut set = CustomSet::new(&[1, 2, 3]);
     set.add(3);
-    assert_eq!(set, CustomSet::new(vec![1, 2, 3]));
+    assert_eq!(set, CustomSet::new(&[1, 2, 3]));
 }
 
 #[test]
 #[ignore]
 fn intersecting_empty_sets_return_empty_set() {
-    let set1: CustomSet<()> = CustomSet::new(vec![]);
-    let set2: CustomSet<()> = CustomSet::new(vec![]);
-    assert_eq!(set1.intersection(&set2), CustomSet::new(vec![]));
+    let set1: CustomSet<()> = CustomSet::new(&[]);
+    let set2: CustomSet<()> = CustomSet::new(&[]);
+    assert_eq!(set1.intersection(&set2), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn intersecting_empty_set_with_non_empty_returns_empty_set() {
-    let set1 = CustomSet::new(vec![]);
-    let set2 = CustomSet::new(vec![3, 2, 5]);
-    assert_eq!(set1.intersection(&set2), CustomSet::new(vec![]));
+    let set1 = CustomSet::new(&[]);
+    let set2 = CustomSet::new(&[3, 2, 5]);
+    assert_eq!(set1.intersection(&set2), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn intersecting_non_empty_set_with_empty_returns_empty_set() {
-    let set1 = CustomSet::new(vec![1, 2, 3, 4]);
-    let set2 = CustomSet::new(vec![]);
-    assert_eq!(set1.intersection(&set2), CustomSet::new(vec![]));
+    let set1 = CustomSet::new(&[1, 2, 3, 4]);
+    let set2 = CustomSet::new(&[]);
+    assert_eq!(set1.intersection(&set2), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn intersection_of_two_sets_with_no_shared_elements_is_an_empty_set() {
-    let set1 = CustomSet::new(vec![1, 2, 3]);
-    let set2 = CustomSet::new(vec![4, 5, 6]);
-    assert_eq!(set1.intersection(&set2), CustomSet::new(vec![]));
-    assert_eq!(set2.intersection(&set1), CustomSet::new(vec![]));
+    let set1 = CustomSet::new(&[1, 2, 3]);
+    let set2 = CustomSet::new(&[4, 5, 6]);
+    assert_eq!(set1.intersection(&set2), CustomSet::new(&[]));
+    assert_eq!(set2.intersection(&set1), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn intersection_of_two_sets_with_shared_elements_is_a_set_of_the_shared_elements() {
-    let set1 = CustomSet::new(vec![1, 2, 3, 4]);
-    let set2 = CustomSet::new(vec![3, 2, 5]);
-    assert_eq!(set1.intersection(&set2), CustomSet::new(vec![2, 3]));
-    assert_eq!(set2.intersection(&set1), CustomSet::new(vec![2, 3]));
+    let set1 = CustomSet::new(&[1, 2, 3, 4]);
+    let set2 = CustomSet::new(&[3, 2, 5]);
+    assert_eq!(set1.intersection(&set2), CustomSet::new(&[2, 3]));
+    assert_eq!(set2.intersection(&set1), CustomSet::new(&[2, 3]));
 }
 
 #[test]
 #[ignore]
 fn difference_of_two_empty_sets_is_empty_set() {
-    let set1: CustomSet<()> = CustomSet::new(vec![]);
-    let set2: CustomSet<()> = CustomSet::new(vec![]);
-    assert_eq!(set1.difference(&set2), CustomSet::new(vec![]));
+    let set1: CustomSet<()> = CustomSet::new(&[]);
+    let set2: CustomSet<()> = CustomSet::new(&[]);
+    assert_eq!(set1.difference(&set2), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn difference_of_an_empty_and_non_empty_set_is_an_empty_set() {
-    let set1 = CustomSet::new(vec![]);
-    let set2 = CustomSet::new(vec![3, 2, 5]);
-    assert_eq!(set1.difference(&set2), CustomSet::new(vec![]));
+    let set1 = CustomSet::new(&[]);
+    let set2 = CustomSet::new(&[3, 2, 5]);
+    assert_eq!(set1.difference(&set2), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn difference_of_a_non_empty_set_and_empty_set_is_the_non_empty_set() {
-    let set1 = CustomSet::new(vec![1, 2, 3, 4]);
-    let set2 = CustomSet::new(vec![]);
-    assert_eq!(set1.difference(&set2), CustomSet::new(vec![1, 2, 3, 4]));
+    let set1 = CustomSet::new(&[1, 2, 3, 4]);
+    let set2 = CustomSet::new(&[]);
+    assert_eq!(set1.difference(&set2), CustomSet::new(&[1, 2, 3, 4]));
 }
 
 #[test]
 #[ignore]
 fn difference_of_two_non_empty_sets_is_elements_only_in_first_set_one() {
-    let set1 = CustomSet::new(vec![3, 2, 1]);
-    let set2 = CustomSet::new(vec![2, 4]);
-    assert_eq!(set1.difference(&set2), CustomSet::new(vec![1, 3]));
+    let set1 = CustomSet::new(&[3, 2, 1]);
+    let set2 = CustomSet::new(&[2, 4]);
+    assert_eq!(set1.difference(&set2), CustomSet::new(&[1, 3]));
 }
 
 #[test]
 #[ignore]
 fn union_of_two_empty_sets_is_empty_set() {
-    let set1: CustomSet<()> = CustomSet::new(vec![]);
-    let set2: CustomSet<()> = CustomSet::new(vec![]);
-    assert_eq!(set1.union(&set2), CustomSet::new(vec![]));
+    let set1: CustomSet<()> = CustomSet::new(&[]);
+    let set2: CustomSet<()> = CustomSet::new(&[]);
+    assert_eq!(set1.union(&set2), CustomSet::new(&[]));
 }
 
 #[test]
 #[ignore]
 fn union_of_empty_set_and_non_empty_set_is_all_elements() {
-    let set1 = CustomSet::new(vec![]);
-    let set2 = CustomSet::new(vec![2]);
-    assert_eq!(set1.union(&set2), CustomSet::new(vec![2]));
+    let set1 = CustomSet::new(&[]);
+    let set2 = CustomSet::new(&[2]);
+    assert_eq!(set1.union(&set2), CustomSet::new(&[2]));
 }
 
 #[test]
 #[ignore]
 fn union_of_non_empty_set_and_empty_set_is_the_non_empty_set() {
-    let set1 = CustomSet::new(vec![1, 3]);
-    let set2 = CustomSet::new(vec![]);
-    assert_eq!(set1.union(&set2), CustomSet::new(vec![1, 3]));
+    let set1 = CustomSet::new(&[1, 3]);
+    let set2 = CustomSet::new(&[]);
+    assert_eq!(set1.union(&set2), CustomSet::new(&[1, 3]));
 }
 
 #[test]
 #[ignore]
 fn union_of_non_empty_sets_contains_all_unique_elements() {
-    let set1 = CustomSet::new(vec![1, 3]);
-    let set2 = CustomSet::new(vec![2, 3]);
-    assert_eq!(set1.union(&set2), CustomSet::new(vec![3, 2, 1]));
+    let set1 = CustomSet::new(&[1, 3]);
+    let set2 = CustomSet::new(&[2, 3]);
+    assert_eq!(set1.union(&set2), CustomSet::new(&[3, 2, 1]));
 }

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

@@ -44,7 +44,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/difference-of-squares/README.md

@@ -36,7 +36,7 @@ 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!
+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 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).
 

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

@@ -61,7 +61,7 @@ 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!
+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 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).
 

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

@@ -38,7 +38,7 @@ 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!
+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 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).
 

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

@@ -70,7 +70,7 @@ 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!
+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 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).
 

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

@@ -49,7 +49,7 @@ 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!
+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 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).
 

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

@@ -31,7 +31,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/grade-school/README.md

@@ -58,7 +58,7 @@ 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!
+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 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).
 

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

@@ -50,7 +50,7 @@ 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!
+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 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).
 

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

@@ -59,7 +59,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/hello-world/README.md

@@ -38,7 +38,7 @@ 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!
+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 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).
 

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

@@ -31,7 +31,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/isbn-verifier/README.md

@@ -64,7 +64,7 @@ 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!
+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 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).
 

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

@@ -37,7 +37,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/largest-series-product/README.md

@@ -45,7 +45,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/largest-series-product/example.rs

@@ -1,10 +1,16 @@
-pub fn lsp(string_digits: &str, span: usize) -> Result<u64, String> {
+#[derive(Debug, PartialEq)]
+pub enum Error {
+    SpanTooLong,
+    InvalidDigit(char),
+}
+
+pub fn lsp(string_digits: &str, span: usize) -> Result<u64, Error> {
     if span == 0 {
         return Ok(1);
     }
 
-    if string_digits.chars().any(|c| !c.is_digit(10)) {
-        return Err(String::from("All characters must be numbers"));
+    if let Some(invalid) = string_digits.chars().find(|c| !c.is_digit(10)) {
+        return Err(Error::InvalidDigit(invalid));
     }
 
     let products: Vec<u64> = string_digits.chars()
@@ -17,6 +23,6 @@ pub fn lsp(string_digits: &str, span: usize) -> Result<u64, String> {
     if let Some(&x) = products.iter().max() {
         Ok(x)
     } else {
-        Err(String::from("Span longer than string"))
+        Err(Error::SpanTooLong)
     }
 }

data/tracks/rust/exercises/largest-series-product/src/lib.rs

@@ -0,0 +1,9 @@
+#[derive(Debug, PartialEq)]
+pub enum Error {
+    SpanTooLong,
+    InvalidDigit(char),
+}
+
+pub fn lsp(string_digits: &str, span: usize) -> Result<u64, Error> {
+    unimplemented!("largest series product of a span of {} digits in {}", span, string_digits);
+}

data/tracks/rust/exercises/largest-series-product/tests/largest-series-product.rs

@@ -65,7 +65,7 @@ fn returns_zero_if_all_products_are_zero() {
 #[test]
 #[ignore]
 fn a_span_is_longer_than_number_is_an_error() {
-    assert!(lsp("123", 4).is_err());
+    assert_eq!(Err(Error::SpanTooLong), lsp("123", 4));
 }
 
 // There may be some confusion about whether this should be 1 or error.
@@ -95,11 +95,11 @@ fn a_non_empty_string_and_no_span_returns_one() {
 #[test]
 #[ignore]
 fn empty_string_and_non_zero_span_is_an_error() {
-    assert!(lsp("", 1).is_err());
+    assert_eq!(Err(Error::SpanTooLong), lsp("", 1));
 }
 
 #[test]
 #[ignore]
 fn a_string_with_non_digits_is_an_error() {
-    assert!(lsp("1234a5", 2).is_err());
+    assert_eq!(Err(Error::InvalidDigit('a')), lsp("1234a5", 2));
 }

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

@@ -50,7 +50,7 @@ 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!
+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 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).
 

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

@@ -88,7 +88,7 @@ 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!
+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 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).
 

data/tracks/rust/exercises/luhn-from/README.md

@@ -34,7 +34,7 @@ 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!
+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 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).