trackler 2.2.1.103 → 2.2.1.104

data/tracks/php/exercises/variable-length-quantity/README.md

@@ -5,18 +5,17 @@ Implement variable length quantity encoding and decoding.
 The goal of this exercise is to implement [VLQ](https://en.wikipedia.org/wiki/Variable-length_quantity) encoding/decoding.
 
 In short, the goal of this encoding is to encode integer values in a way that would save bytes.
-Only the first 7 bits of each byte is significant (right-justified; sort of like an ASCII byte). 
-So, if you have a 32-bit value, you have to unpack it into a series of 7-bit bytes. 
-Of course, you will have a variable number of bytes depending upon your integer. 
+Only the first 7 bits of each byte is significant (right-justified; sort of like an ASCII byte).
+So, if you have a 32-bit value, you have to unpack it into a series of 7-bit bytes.
+Of course, you will have a variable number of bytes depending upon your integer.
 To indicate which is the last byte of the series, you leave bit #7 clear.
-In all of the preceding bytes, you set bit #7. 
+In all of the preceding bytes, you set bit #7.
 
-So, if an integer is between `0-127`, it can be represented as one byte. 
+So, if an integer is between `0-127`, it can be represented as one byte.
 Although VLQ can deal with numbers of arbitrary sizes, for this exercise we will restrict ourselves to only numbers that fit in a 32-bit unsigned integer.
 Here are examples of integers as 32-bit values, and the variable length quantities that they translate to:
 
-
-```
+```text
  NUMBER        VARIABLE QUANTITY
 00000000              00
 00000040              40
@@ -32,16 +31,22 @@ Here are examples of integers as 32-bit values, and the variable length quantiti
 0FFFFFFF          FF FF FF 7F
 ```
 
-## Making the Test Suite Pass
 
-1. Get [PHPUnit].
+## Running the tests
+
+1. Go to the root of your PHP exercise directory, which is `<EXERCISM_WORKSPACE>/php`.
+   To find the Exercism workspace run
+
+        % exercism debug | grep Workspace
+
+1. Get [PHPUnit] if you don't have it already.
 
         % wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
         % chmod +x phpunit.phar
 
-2. Execute the tests for an assignment.
+2. Execute the tests:
 
-        % phpunit.phar wordy/wordy_test.php
+        % ./phpunit.phar variable-length-quantity/variable-length-quantity_test.php
 
 [PHPUnit]: http://phpunit.de
 

data/tracks/php/exercises/word-count/README.md

@@ -4,7 +4,7 @@ Given a phrase, count the occurrences of each word in that phrase.
 
 For example for the input `"olly olly in come free"`
 
-```plain
+```text
 olly: 2
 in: 1
 come: 1
@@ -12,16 +12,21 @@ free: 1
 ```
 
 
-## Making the Test Suite Pass
+## Running the tests
 
-1. Get [PHPUnit].
+1. Go to the root of your PHP exercise directory, which is `<EXERCISM_WORKSPACE>/php`.
+   To find the Exercism workspace run
+
+        % exercism debug | grep Workspace
+
+1. Get [PHPUnit] if you don't have it already.
 
         % wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
         % chmod +x phpunit.phar
 
-2. Execute the tests for an assignment.
+2. Execute the tests:
 
-        % phpunit.phar wordy/wordy_test.php
+        % ./phpunit.phar word-count/word-count_test.php
 
 [PHPUnit]: http://phpunit.de
 

data/tracks/php/exercises/wordy/README.md

@@ -2,7 +2,6 @@
 
 Parse and evaluate simple math word problems returning the answer as an integer.
 
-
 ## Iteration 1 — Addition
 
 Add two numbers together.
@@ -13,7 +12,6 @@ Evaluates to 18.
 
 Handle large numbers and negative numbers.
 
-
 ## Iteration 2 — Subtraction, Multiplication and Division
 
 Now, perform the other three operations.
@@ -30,7 +28,6 @@ Now, perform the other three operations.
 
 5
 
-
 ## Iteration 3 — Multiple Operations
 
 Handle a set of operations, in sequence.
@@ -46,7 +43,6 @@ left-to-right, _ignoring the typical order of operations._
 
 15  (i.e. not 9)
 
-
 ## Bonus — Exponentials
 
 If you'd like, handle exponentials.
@@ -56,16 +52,21 @@ If you'd like, handle exponentials.
 32
 
 
-## Making the Test Suite Pass
+## Running the tests
+
+1. Go to the root of your PHP exercise directory, which is `<EXERCISM_WORKSPACE>/php`.
+   To find the Exercism workspace run
+
+        % exercism debug | grep Workspace
 
-1. Get [PHPUnit].
+1. Get [PHPUnit] if you don't have it already.
 
         % wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
         % chmod +x phpunit.phar
 
-2. Execute the tests for an assignment.
+2. Execute the tests:
 
-        % phpunit.phar wordy/wordy_test.php
+        % ./phpunit.phar wordy/wordy_test.php
 
 [PHPUnit]: http://phpunit.de
 

data/tracks/rust/config/exercise_readme.go.tmpl

@@ -4,10 +4,38 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
-{{- with .Spec.Credits -}}
+## 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
+{{ with .Spec.Credits }}
 ## Source
 
 {{ . }}

data/tracks/rust/exercises/all-your-base/README.md

@@ -63,6 +63,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/alphametics/README.md

@@ -63,6 +63,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/custom-set/README.md

@@ -39,6 +39,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/dominoes/README.md

@@ -46,6 +46,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/forth/README.md

@@ -57,6 +57,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/isbn-verifier/README.md

@@ -1,4 +1,4 @@
-# Isbn Verifier
+# ISBN Verifier
 
 The [ISBN-10 verification process](https://en.wikipedia.org/wiki/International_Standard_Book_Number) is used to validate book identification
 numbers. These normally contain dashes and look like: `3-598-21508-8`

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

@@ -58,6 +58,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/nucleotide-codons/README.md

@@ -50,6 +50,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/parallel-letter-frequency/README.md

@@ -73,6 +73,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/protein-translation/README.md

@@ -20,11 +20,11 @@ All subsequent codons after are ignored, like this:
 
 RNA: `"AUGUUUUCUUAAAUG"` =>
 
-Codons: `"AUG", "UUU", "UCU", "UAG", "AUG"` =>
+Codons: `"AUG", "UUU", "UCU", "UAA", "AUG"` =>
 
 Protein: `"Methionine", "Phenylalanine", "Serine"`
 
-Note the stop codon terminates the translation and the final methionine is not translated into the protein sequence.
+Note the stop codon `"UAA"` terminates the translation and the final methionine is not translated into the protein sequence.
 
 Below are the codons and resulting Amino Acids needed for the exercise.
 

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

@@ -47,6 +47,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/rectangles/README.md

@@ -95,6 +95,5 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 [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
 
-
 ## 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/reverse-string/README.md

@@ -1,4 +1,4 @@
-# reverse-string
+# Reverse String
 
 Reverse a string
 

data/tracks/rust/exercises/rna-transcription/.meta/hints.md

@@ -0,0 +1,9 @@
+## Notes on Rust implementation
+
+By using private fields in structs with public `new` functions returning
+`Option` or `Result` (as here with `DNA::new` & `RNA::new`), we can guarantee
+that the internal representation of `DNA` is correct. Because every valid DNA
+string has a valid RNA string, we don't need to return a `Result`/`Option` from
+`to_rna`.
+
+This explains the type signatures you will see in the tests.

data/tracks/rust/exercises/rna-transcription/README.md

@@ -18,6 +18,17 @@ each nucleotide with its complement:
 * `T` -> `A`
 * `A` -> `U`
 
+## Notes on Rust implementation
+
+By using private fields in structs with public `new` functions returning
+`Option` or `Result` (as here with `DNA::new` & `RNA::new`), we can guarantee
+that the internal representation of `DNA` is correct. Because every valid DNA
+string has a valid RNA string, we don't need to return a `Result`/`Option` from
+`to_rna`.
+
+This explains the type signatures you will see in the tests.
+
+
 ## Rust Installation
 
 Refer to the [exercism help page][help-page] for Rust installation and learning
@@ -52,7 +63,7 @@ If you want to know more about Exercism, take a look at the [contribution guide]
 
 ## Source
 
-Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
+Hyperphysics [http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html](http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html)
 
 ## 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/rna-transcription/example.rs

@@ -1,40 +1,79 @@
-#[derive(PartialEq, Eq, Debug)]
-pub struct RNA {
-    nucleotides: String
-}
 
-impl RNA {
-    pub fn new(nucleotides: &str) -> RNA {
-        RNA { nucleotides: nucleotides.to_string() }
-    }
-}
 
-#[derive(PartialEq, Eq, Debug)]
-pub struct DNA {
-    nucleotides: String
+/// The possible nucleotides in DNA and RNA
+#[derive(Debug, Eq, PartialEq, Clone, Copy)]
+pub enum Nucleotide {
+    Adenine,
+    Cytosine,
+    Guanine,
+    Thymine,
+    Uracil
 }
 
-fn transcribe_dna_rna(c: char) -> Option<char> {
-    match c {
-        'C' => Some('G'),
-        'G' => Some('C'),
-        'A' => Some('U'),
-        'T' => Some('A'),
-        _   => None
+impl Nucleotide {
+    /// Parses a nucleotode from its character value, if valid.
+    fn from_char(ch: char) -> Option<Nucleotide> {
+        Some(match ch {
+            'A' => Nucleotide::Adenine,
+            'C' => Nucleotide::Cytosine,
+            'G' => Nucleotide::Guanine,
+            'T' => Nucleotide::Thymine,
+            'U' => Nucleotide::Uracil,
+            _ => { return None; }
+        })
     }
 }
 
+/// A vector of nucleotides
+///
+/// Guaranteed that Uracil is not present thanks to `new`.
+#[derive(Debug, Eq, PartialEq, Clone)]
+pub struct DNA(Vec<Nucleotide>);
+
 impl DNA {
-    pub fn new(nucleotides: &str) -> DNA {
-        DNA { nucleotides: nucleotides.to_string() }
+    /// Parse a DNA string, checking it is valid.
+    ///
+    /// The error value is the first invalid character index (char index, not utf8).
+    pub fn new(input: &str) -> Result<DNA, usize> {
+        let mut out = Vec::new();
+        for (idx, ch) in input.chars().enumerate() {
+            match Nucleotide::from_char(ch) {
+                Some(Nucleotide::Uracil) | None => { return Err(idx); },
+                Some(n) => { out.push(n);  },
+            }
+        }
+        Ok(DNA(out))
     }
 
-    pub fn to_rna(&self) -> Result<RNA, ()> {
-        let rna_nucleotides: String = self.nucleotides.chars().filter_map(transcribe_dna_rna).collect();
-        if rna_nucleotides.len() == self.nucleotides.len() {
-            Ok(RNA { nucleotides: rna_nucleotides })
-        } else {
-            Err(())
+    pub fn to_rna(mut self) -> RNA {
+        for nuc in self.0.iter_mut() {
+            *nuc = match *nuc {
+                Nucleotide::Adenine => Nucleotide::Uracil,
+                Nucleotide::Cytosine => Nucleotide::Guanine,
+                Nucleotide::Guanine => Nucleotide::Cytosine,
+                Nucleotide::Thymine => Nucleotide::Adenine,
+                Nucleotide::Uracil => unreachable!()
+            }
+        }
+        RNA(self.0)
+    }
+}
+
+#[derive(Debug, Eq, PartialEq, Clone)]
+pub struct RNA(Vec<Nucleotide>);
+
+impl RNA {
+    /// Parse a RNA string, checking it is valid.
+    ///
+    /// The error value is the first invalid character index (char index, not utf8).
+    pub fn new(input: &str) -> Result<RNA, usize> {
+        let mut out = Vec::new();
+        for (idx, ch) in input.chars().enumerate() {
+            match Nucleotide::from_char(ch) {
+                Some(Nucleotide::Thymine) | None => { return Err(idx); },
+                Some(n) => { out.push(n);  },
+            }
         }
+        Ok(RNA(out))
     }
 }

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

@@ -1,55 +1,88 @@
 extern crate rna_transcription as dna;
 
 #[test]
-fn test_acid_equals_acid() {
-    assert_eq!(dna::RNA::new("CGA"), dna::RNA::new("CGA"));
-    assert_ne!(dna::RNA::new("CGA"), dna::RNA::new("AGC"));
+fn test_valid_dna_input() {
+    assert!(dna::DNA::new("GCTA").is_ok());
 }
 
 #[test]
 #[ignore]
-fn test_transcribes_cytosine_guanine() {
-    assert_eq!(Ok(dna::RNA::new("G")), dna::DNA::new("C").to_rna());
+fn test_valid_rna_input() {
+    assert!(dna::RNA::new("CGAU").is_ok());
 }
 
 #[test]
 #[ignore]
-fn test_transcribes_guanine_cytosine() {
-    assert_eq!(Ok(dna::RNA::new("C")), dna::DNA::new("G").to_rna());
+fn test_invalid_dna_input() {
+    // Invalid character
+    assert!(dna::DNA::new("X").is_err());
+    // Valid nucleotide, but invalid in context
+    assert!(dna::DNA::new("U").is_err());
+    // Longer string with contained errors
+    assert!(dna::DNA::new("ACGTUXXCTTAA").is_err());
 }
 
 #[test]
 #[ignore]
-fn test_transcribes_adenine_uracil() {
-    assert_eq!(Ok(dna::RNA::new("U")), dna::DNA::new("A").to_rna());
+fn test_invalid_rna_input() {
+    // Invalid character
+    assert!(dna::RNA::new("X").is_err());
+    // Valid nucleotide, but invalid in context
+    assert!(dna::RNA::new("T").is_err());
+    // Longer string with contained errors
+    assert!(dna::RNA::new("ACGUTTXCUUAA").is_err());
 }
 
 #[test]
 #[ignore]
-fn test_transcribes_thymine_to_adenine() {
-    assert_eq!(Ok(dna::RNA::new("A")), dna::DNA::new("T").to_rna());
+fn test_acid_equals_acid() {
+    assert_eq!(dna::DNA::new("CGA").unwrap(), dna::DNA::new("CGA").unwrap());
+    assert_ne!(dna::DNA::new("CGA").unwrap(), dna::DNA::new("AGC").unwrap());
+    assert_eq!(dna::RNA::new("CGA").unwrap(), dna::RNA::new("CGA").unwrap());
+    assert_ne!(dna::RNA::new("CGA").unwrap(), dna::RNA::new("AGC").unwrap());
 }
 
 #[test]
 #[ignore]
-fn test_transcribes_all_dna_to_rna() {
-    assert_eq!(Ok(dna::RNA::new("UGCACCAGAAUU")), dna::DNA::new("ACGTGGTCTTAA").to_rna())
+fn test_transcribes_cytosine_guanine() {
+    assert_eq!(
+        dna::RNA::new("G").unwrap(),
+        dna::DNA::new("C").unwrap().to_rna()
+    );
 }
 
 #[test]
 #[ignore]
-fn handles_invalid_input() {
-    assert!(dna::DNA::new("U").to_rna().is_err());
+fn test_transcribes_guanine_cytosine() {
+    assert_eq!(
+        dna::RNA::new("C").unwrap(),
+        dna::DNA::new("G").unwrap().to_rna()
+    );
+}
+
+#[test]
+#[ignore]
+fn test_transcribes_adenine_uracil() {
+    assert_eq!(
+        dna::RNA::new("U").unwrap(),
+        dna::DNA::new("A").unwrap().to_rna()
+    );
 }
 
 #[test]
 #[ignore]
-fn handles_completely_invalid_input() {
-    assert!(dna::DNA::new("XXX").to_rna().is_err());
+fn test_transcribes_thymine_to_adenine() {
+    assert_eq!(
+        dna::RNA::new("A").unwrap(),
+        dna::DNA::new("T").unwrap().to_rna()
+    );
 }
 
 #[test]
 #[ignore]
-fn handles_partially_invalid_input() {
-    assert!(dna::DNA::new("ACGTXXXCTTAA").to_rna().is_err());
+fn test_transcribes_all_dna_to_rna() {
+    assert_eq!(
+        dna::RNA::new("UGCACCAGAAUU").unwrap(),
+        dna::DNA::new("ACGTGGTCTTAA").unwrap().to_rna()
+    )
 }