trackler 2.2.1.129 → 2.2.1.130

data/tracks/rust/exercises/parallel-letter-frequency/README.md

@@ -37,7 +37,7 @@ rustup run nightly cargo bench
 
 Learn more about nightly Rust:
 
-- [Nightly Rust](https://doc.rust-lang.org/book/first-edition/release-channels.html)
+- [Nightly Rust](https://doc.rust-lang.org/book/second-edition/ch01-03-how-rust-is-made-and-nightly-rust.html)
 - [Rustup: Working with nightly](https://github.com/rust-lang-nursery/rustup.rs#working-with-nightly-rust)
 
 

data/tracks/rust/exercises/pascals-triangle/src/lib.rs

@@ -2,7 +2,7 @@ pub struct PascalsTriangle;
 
 impl PascalsTriangle {
     pub fn new(row_count: u32) -> Self {
-        unimplemented!();
+        unimplemented!("create Pascal's triangle with {} rows", row_count);
     }
 
     pub fn rows(&self) -> Vec<Vec<u32>> {

data/tracks/rust/exercises/perfect-numbers/src/lib.rs

@@ -6,5 +6,5 @@ pub enum Classification {
 }
 
 pub fn classify(num: u64) -> Option<Classification> {
-    unimplemented!();
+    unimplemented!("classify {}", num);
 }

data/tracks/rust/exercises/prime-factors/src/lib.rs

@@ -1,3 +1,3 @@
-pub fn factors(n: u32) -> Vec<u32> {
+pub fn factors(n: u64) -> Vec<u64> {
     unimplemented!("This should calculate the prime factors of {}", n)
 }

data/tracks/rust/exercises/proverb/src/lib.rs

@@ -1,3 +1,3 @@
 pub fn build_proverb(list: Vec<&str>) -> String {
-    unimplemented!()
+    unimplemented!("build a proverb from this list of items: {:?}", list)
 }

data/tracks/rust/exercises/raindrops/src/lib.rs

@@ -1,3 +1,3 @@
 pub fn raindrops(n: usize) -> String {
-    unimplemented!()
+    unimplemented!("what sound does Raindrop #{} make?", n)
 }

data/tracks/rust/exercises/react/src/lib.rs

@@ -1,5 +1,3 @@
-#[allow(unused_variables)]
-
 // Because these are passed without & to some functions,
 // it will probably be necessary for these two types to be Copy.
 pub type CellID = ();
@@ -20,7 +18,7 @@ pub enum RemoveCallbackError {
 pub struct Reactor<T> {
     // Just so that the compiler doesn't complain about an unused type parameter.
     // You probably want to delete this field.
-    dummy: T,
+    dummy: ::std::marker::PhantomData<T>,
 }
 
 // You are guaranteed that Reactor will only be tested against types that are Copy + PartialEq.
@@ -30,7 +28,7 @@ impl <T: Copy + PartialEq> Reactor<T> {
     }
 
     // Creates an input cell with the specified initial value, returning its ID.
-    pub fn create_input(&mut self, initial: T) -> CellID {
+    pub fn create_input(&mut self, _initial: T) -> CellID {
         unimplemented!()
     }
 
@@ -47,7 +45,7 @@ impl <T: Copy + PartialEq> Reactor<T> {
     // Notice that there is no way to *remove* a cell.
     // This means that you may assume, without checking, that if the dependencies exist at creation
     // time they will continue to exist as long as the Reactor exists.
-    pub fn create_compute<F: Fn(&[T]) -> T>(&mut self, dependencies: &[CellID], compute_func: F) -> Result<CellID, CellID> {
+    pub fn create_compute<F: Fn(&[T]) -> T>(&mut self, _dependencies: &[CellID], _compute_func: F) -> Result<CellID, CellID> {
         unimplemented!()
     }
 
@@ -59,7 +57,7 @@ impl <T: Copy + PartialEq> Reactor<T> {
     // It turns out this introduces a significant amount of extra complexity to this exercise.
     // We chose not to cover this here, since this exercise is probably enough work as-is.
     pub fn value(&self, id: CellID) -> Option<T> {
-        unimplemented!()
+        unimplemented!("Get the value of the cell whose id is {:?}", id)
     }
 
     // Sets the value of the specified input cell.
@@ -73,7 +71,7 @@ impl <T: Copy + PartialEq> Reactor<T> {
     // a `set_value(&mut self, new_value: T)` method on `Cell`.
     //
     // As before, that turned out to add too much extra complexity.
-    pub fn set_value(&mut self, id: CellID, new_value: T) -> Result<(), SetValueError> {
+    pub fn set_value(&mut self, _id: CellID, _new_value: T) -> Result<(), SetValueError> {
         unimplemented!()
     }
 
@@ -89,7 +87,7 @@ impl <T: Copy + PartialEq> Reactor<T> {
     // * Exactly once if the compute cell's value changed as a result of the set_value call.
     //   The value passed to the callback should be the final value of the compute cell after the
     //   set_value call.
-    pub fn add_callback<F: FnMut(T) -> ()>(&mut self, id: CellID, callback: F) -> Option<CallbackID> {
+    pub fn add_callback<F: FnMut(T) -> ()>(&mut self, _id: CellID, _callback: F) -> Option<CallbackID> {
         unimplemented!()
     }
 
@@ -99,6 +97,10 @@ impl <T: Copy + PartialEq> Reactor<T> {
     //
     // A removed callback should no longer be called.
     pub fn remove_callback(&mut self, cell: CellID, callback: CallbackID) -> Result<(), RemoveCallbackError> {
-        unimplemented!()
+        unimplemented!(
+            "Remove the callback identified by the CallbackID {:?} from the cell {:?}",
+            callback,
+            cell,
+        )
     }
 }

data/tracks/rust/exercises/robot-simulator/src/lib.rs

@@ -12,9 +12,12 @@ pub enum Direction {
 pub struct Robot;
 
 impl Robot {
-    #[allow(unused_variables)]
     pub fn new(x: isize, y: isize, d: Direction) -> Self {
-        unimplemented!()
+        unimplemented!(
+            "Create a robot at (x, y) ({}, {}) facing {:?}",
+            x, y,
+            d,
+        )
     }
 
     pub fn turn_right(self) -> Self {
@@ -29,9 +32,8 @@ impl Robot {
         unimplemented!()
     }
 
-    #[allow(unused_variables)]
     pub fn instructions(self, instructions: &str) -> Self {
-        unimplemented!()
+        unimplemented!("Follow the given sequence of instructions: {}", instructions)
     }
 
     pub fn position(&self) -> (isize, isize) {

data/tracks/rust/exercises/saddle-points/src/lib.rs

@@ -1,3 +1,3 @@
 pub fn find_saddle_points(input: &[Vec<u64>]) -> Vec<(usize, usize)> {
-    unimplemented!()
+    unimplemented!("find the saddle points of the following matrix: {:?}", input)
 }

data/tracks/rust/exercises/simple-linked-list/src/lib.rs

@@ -1,7 +1,7 @@
 pub struct SimpleLinkedList<T> {
     // Delete this field
-    // _dummy is needed to avoid unused parameter error during compilation
-    _dummy: T,
+    // dummy is needed to avoid unused parameter error during compilation
+    dummy: ::std::marker::PhantomData<T>,
 }
 
 impl<T> SimpleLinkedList<T> {
@@ -13,7 +13,7 @@ impl<T> SimpleLinkedList<T> {
         unimplemented!()
     }
 
-    pub fn push(&mut self, element: T) {
+    pub fn push(&mut self, _element: T) {
         unimplemented!()
     }
 
@@ -34,13 +34,13 @@ impl<T: Clone> SimpleLinkedList<T> {
 
 
 impl<'a, T: Clone> From<&'a [T]> for SimpleLinkedList<T> {
-    fn from(item: &[T]) -> Self {
+    fn from(_item: &[T]) -> Self {
         unimplemented!()
     }
 }
 
 impl<T> Into<Vec<T>> for SimpleLinkedList<T> {
-    fn into(mut self) -> Vec<T> {
+    fn into(self) -> Vec<T> {
         unimplemented!()
     }
 }

data/tracks/rust/exercises/space-age/src/lib.rs

@@ -1,18 +1,21 @@
 // The code below is a stub. Just enough to satisfy the compiler.
 // In order to pass the tests you can add-to or change any of this code.
-#![allow(unused_variables)]
 
+#[derive(Debug)]
 pub struct Duration;
 
 impl From<u64> for Duration {
     fn from(s: u64) -> Self {
-        unimplemented!()
+        unimplemented!("s, measured in seconds: {}", s)
     }
 }
 
 pub trait Planet {
     fn years_during(d: &Duration) -> f64 {
-        unimplemented!();
+        unimplemented!(
+            "convert a duration ({:?}) to the number of years on this planet for that duration",
+            d,
+        );
     }
 }
 

data/tracks/rust/exercises/sum-of-multiples/src/lib.rs

@@ -1,3 +1,3 @@
 pub fn sum_of_multiples(limit: u32, factors: &[u32]) -> u32 {
-    unimplemented!()
+    unimplemented!("Sum the multiples of all of {:?} which are less than {}", factors, limit)
 }

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

@@ -22,5 +22,11 @@ pub fn solve(capacity_1: u8,
              goal: u8,
              start_bucket: &Bucket) -> BucketStats
 {
-    unimplemented!();
+    unimplemented!(
+        "Given one bucket of capacity {}, another of capacity {}, starting with {:?}, find pours to reach {}",
+        capacity_1,
+        capacity_2,
+        start_bucket,
+        goal,
+    );
 }

data/tracks/rust/exercises/variable-length-quantity/src/lib.rs

@@ -6,10 +6,10 @@ pub enum Error {
 
 /// Convert a list of numbers to a stream of bytes encoded with variable length encoding.
 pub fn to_bytes(values: &[u32]) -> Vec<u8> {
-    unimplemented!()
+    unimplemented!("Convert the values {:?} to a list of bytes", values)
 }
 
 /// Given a stream of bytes, extract all numbers which are encoded in there.
 pub fn from_bytes(bytes: &[u8]) -> Result<Vec<u32>, Error> {
-    unimplemented!()
+    unimplemented!("Convert the list of bytes {:?} to a list of numbers", bytes)
 }

data/tracks/typescript/exercises/list-ops/list-ops.example.ts

@@ -1,23 +1,22 @@
-class List {
-    values: number[]
+class List<T> {
+    values: T[]
 
-    constructor(arr?: number[]) {
+    constructor(arr?: T[]) {
         this.values = arr || []
     }
 
-    append(otherList: List) {
+    append(otherList: List<T>) {
         for (const el of otherList.values) {
             this.values.push(el)
         }
         return this
     }
 
-    concat(otherList: List) {
+    concat(otherList: List<T>) {
         return this.append(otherList)
     }
 
-    // tslint:disable-next-line: no-any
-    filter(operation: any) {
+    filter(operation: (arg: T) => boolean) {
         const filteredValues = []
         for (const el of this.values) {
             if (operation(el)) {
@@ -34,8 +33,7 @@ class List {
         return length
     }
 
-    // tslint:disable-next-line: no-any
-    map(operation: any) {
+    map(operation: (arg: T) => T) {
         const mappedValues = []
         for (const el of this.values) {
             mappedValues.push(operation(el))
@@ -44,8 +42,7 @@ class List {
         return this
     }
 
-    // tslint:disable-next-line: no-any
-    foldl(operation: any, initialValue: any) {
+    foldl(operation: (arg1: T, arg2: T) => T, initialValue: T) {
         let acc = initialValue
         for (const el of this.values) {
             acc = operation(acc, el)
@@ -53,8 +50,7 @@ class List {
         return acc
     }
 
-    // tslint:disable-next-line: no-any
-    foldr(operation: any, initialValue: any) {
+    foldr(operation: (arg1: T, arg2: T) => T, initialValue: T) {
         let acc = initialValue
         let index = this.length() - 1
         while (index >= 0) {

data/tracks/typescript/exercises/list-ops/list-ops.test.ts

@@ -9,7 +9,7 @@ describe('append entries to a list and return the new list', () => {
 
     xit('empty list to list', () => {
         const list1 = new List([1, 2, 3, 4])
-        const list2 = new List()
+        const list2 = new List<number>()
         expect(list1.append(list2)).toEqual(list1)
     })
 
@@ -39,14 +39,12 @@ describe('concat lists and lists of lists into new list', () => {
 describe('filter list returning only values that satisfy the filter function', () => {
     xit('empty list', () => {
         const list1 = new List([])
-        // tslint:disable-next-line: no-any
-        expect(list1.filter((el: any) => el % 2 === 1).values).toEqual([])
+        expect(list1.filter((el: number) => el % 2 === 1).values).toEqual([])
     })
 
     xit('non empty list', () => {
         const list1 = new List([1, 2, 3, 5])
-        // tslint:disable-next-line: no-any
-        expect(list1.filter((el: any) => el % 2 === 1).values).toEqual([1, 3, 5])
+        expect(list1.filter((el: number) => el % 2 === 1).values).toEqual([1, 3, 5])
     })
 })
 
@@ -65,42 +63,36 @@ describe('returns the length of a list', () => {
 describe('returns a list of elements whose values equal the list value transformed by the mapping function', () => {
     xit('empty list', () => {
         const list1 = new List()
-        // tslint:disable-next-line: no-any
-        expect(list1.map((el: any) => ++el).values).toEqual([])
+        expect(list1.map((el: number) => ++el).values).toEqual([])
     })
 
     xit('non-empty list', () => {
         const list1 = new List([1, 3, 5, 7])
-        // tslint:disable-next-line: no-any
-        expect(list1.map((el: any) => ++el).values).toEqual([2, 4, 6, 8])
+        expect(list1.map((el: number) => ++el).values).toEqual([2, 4, 6, 8])
     })
 })
 
 describe('folds (reduces) the given list from the left with a function', () => {
     xit('empty list', () => {
         const list1 = new List()
-        // tslint:disable-next-line: no-any
-        expect(list1.foldl((acc: any, el: any) => el / acc, 2)).toEqual(2)
+        expect(list1.foldl((acc: number, el: number) => el / acc, 2)).toEqual(2)
     })
 
     xit('division of integers', () => {
         const list1 = new List([1, 2, 3, 4])
-        // tslint:disable-next-line: no-any
-        expect(list1.foldl((acc: any, el: any) => el / acc, 24)).toEqual(64)
+        expect(list1.foldl((acc: number, el: number) => el / acc, 24)).toEqual(64)
     })
 })
 
 describe('folds (reduces) the given list from the right with a function', () => {
     xit('empty list', () => {
         const list1 = new List()
-        // tslint:disable-next-line: no-any
-        expect(list1.foldr((acc: any, el: any) => el / acc, 2)).toEqual(2)
+        expect(list1.foldr((acc: number, el: number) => el / acc, 2)).toEqual(2)
     })
 
     xit('division of integers', () => {
         const list1 = new List([1, 2, 3, 4])
-        // tslint:disable-next-line: no-any
-        expect(list1.foldr((acc: any, el: any) => el / acc, 24)).toEqual(9)
+        expect(list1.foldr((acc: number, el: number) => el / acc, 24)).toEqual(9)
     })
 })
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.129
+  version: 2.2.1.130
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-04-07 00:00:00.000000000 Z
+date: 2018-04-09 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -3428,13 +3428,11 @@ files:
 - tracks/dart/exercises/raindrops/README.md
 - tracks/dart/exercises/raindrops/lib/example.dart
 - tracks/dart/exercises/raindrops/lib/raindrops.dart
-- tracks/dart/exercises/raindrops/pubspec.lock
 - tracks/dart/exercises/raindrops/pubspec.yaml
 - tracks/dart/exercises/raindrops/test/raindrops_test.dart
 - tracks/dart/exercises/rna-transcription/README.md
 - tracks/dart/exercises/rna-transcription/lib/example.dart
 - tracks/dart/exercises/rna-transcription/lib/rna_transcription.dart
-- tracks/dart/exercises/rna-transcription/pubspec.lock
 - tracks/dart/exercises/rna-transcription/pubspec.yaml
 - tracks/dart/exercises/rna-transcription/test/rna_transcription_test.dart
 - tracks/dart/exercises/word-count/README.md
@@ -11489,6 +11487,11 @@ files:
 - tracks/purescript/exercises/pascals-triangle/examples/src/PascalsTriangle.purs
 - tracks/purescript/exercises/pascals-triangle/src/PascalsTriangle.purs
 - tracks/purescript/exercises/pascals-triangle/test/Main.purs
+- tracks/purescript/exercises/phone-number/README.md
+- tracks/purescript/exercises/phone-number/bower.json
+- tracks/purescript/exercises/phone-number/examples/src/PhoneNumber.purs
+- tracks/purescript/exercises/phone-number/src/PhoneNumber.purs
+- tracks/purescript/exercises/phone-number/test/Main.purs
 - tracks/purescript/exercises/raindrops/README.md
 - tracks/purescript/exercises/raindrops/bower.json
 - tracks/purescript/exercises/raindrops/examples/src/Raindrops.purs
@@ -12772,6 +12775,7 @@ files:
 - tracks/rust/README.md
 - tracks/rust/_test/WINDOWS_README.md
 - tracks/rust/_test/check-exercises.sh
+- tracks/rust/_test/check-stubs.sh
 - tracks/rust/_test/count-ignores.sh
 - tracks/rust/_test/ensure-lib-src-rs-exist.sh
 - tracks/rust/_test/ensure-readmes-are-updated.sh