trackler 2.1.0.24 → 2.1.0.25

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

@@ -1,3 +1,3 @@
 [package]
 name = "minesweeper"
-version = "0.0.0"
+version = "1.0.0"

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

@@ -36,6 +36,9 @@ impl Board {
 }
 
 pub fn annotate(pieces: &[&str]) -> Vec<String> {
+    if pieces.len() == 0 {
+        return Vec::new();
+    }
     let pieces_vec = pieces.iter().map(|&r| r.chars().collect()).collect();
     Board {pieces: pieces_vec, num_rows: pieces.len(), num_cols: pieces[0].len()}.annotated()
 }

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

@@ -21,98 +21,93 @@ fn run_test(test_case: &[&str]) {
 }
 
 #[test]
-fn empty_board_has_no_annotations() {
+fn no_rows() {
     run_test(&[
-        "   ",
-        "   ",
-        "   "
     ]);
 }
 
 #[test]
 #[ignore]
-fn board_full_of_mines_has_no_annotations() {
+fn no_columns() {
     run_test(&[
-        "***",
-        "***",
-        "***"
+        "",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_horizontal_row_with_one_mine() {
+fn no_mines() {
     run_test(&[
-        "   1*1 "
+        "   ",
+        "   ",
+        "   ",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_horizontal_row_with_two_mines() {
+fn board_with_only_mines() {
     run_test(&[
-        " 1*2*1 "
+        "***",
+        "***",
+        "***",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_horizontal_row_with_one_mine_at_the_left_end() {
+fn mine_surrounded_by_spaces() {
     run_test(&[
-        "*1  "
+        "111",
+        "1*1",
+        "111",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_horizontal_row_with_one_mine_at_the_right_end() {
+fn space_surrounded_by_mines() {
     run_test(&[
-        "  1*"
+        "***",
+        "*8*",
+        "***",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_vertical_row_with_one_mine() {
+fn horizontal_line() {
     run_test(&[
-        " ",
-        "1",
-        "*",
-        "1",
-        " ",
+        "1*2*1",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_vertical_row_with_two_mines() {
+fn horizontal_line_mines_at_edges() {
     run_test(&[
-        " ",
-        "1",
-        "*",
-        "2",
-        "*",
-        "1",
-        " ",
+        "*1 1*",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_vertical_row_with_one_mine_at_the_top() {
+fn vertical_line() {
     run_test(&[
+        "1",
+        "*",
+        "2",
         "*",
         "1",
-        " ",
-        " ",
     ]);
 }
 
 #[test]
 #[ignore]
-fn one_vertical_row_with_one_mine_at_the_bottom() {
+fn vertical_line_mines_at_edges() {
     run_test(&[
-        " ",
+        "*",
+        "1",
         " ",
         "1",
         "*",
@@ -121,22 +116,25 @@ fn one_vertical_row_with_one_mine_at_the_bottom() {
 
 #[test]
 #[ignore]
-fn one_mine_in_the_middle() {
+fn cross() {
     run_test(&[
-        "***",
-        "*8*",
-        "***"
+        " 2*2 ",
+        "25*52",
+        "*****",
+        "25*52",
+        " 2*2 ",
     ]);
 }
 
 #[test]
 #[ignore]
-fn complex_case() {
+fn large_board() {
     run_test(&[
-        " 2*2 ",
-        "25*52",
-        "*****",
-        "25*52",
-        " 2*2 ",
+        "1*22*1",
+        "12*322",
+        " 123*2",
+        "112*4*",
+        "1*22*2",
+        "111111",
     ]);
-}
+}

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

@@ -1,3 +1,3 @@
 [package]
 name = "raindrops"
-version = "0.0.0"
+version = "1.0.0"

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

@@ -19,6 +19,10 @@ fn test_7() { assert_eq!("Plong", raindrops::raindrops(7)); }
 #[ignore]
 fn test_6() { assert_eq!("Pling", raindrops::raindrops(6)); }
 
+#[test]
+#[ignore]
+fn test_8() { assert_eq!("8", raindrops::raindrops(8)); }
+
 #[test]
 #[ignore]
 fn test_9() { assert_eq!("Pling", raindrops::raindrops(9)); }
@@ -43,6 +47,10 @@ fn test_21() { assert_eq!("PlingPlong", raindrops::raindrops(21)); }
 #[ignore]
 fn test_25() { assert_eq!("Plang", raindrops::raindrops(25)); }
 
+#[test]
+#[ignore]
+fn test_27() { assert_eq!("Pling", raindrops::raindrops(27)); }
+
 #[test]
 #[ignore]
 fn test_35() { assert_eq!("PlangPlong", raindrops::raindrops(35)); }
@@ -59,6 +67,10 @@ fn test_52() { assert_eq!("52", raindrops::raindrops(52)); }
 #[ignore]
 fn test_105() { assert_eq!("PlingPlangPlong", raindrops::raindrops(105)); }
 
+#[test]
+#[ignore]
+fn test_3125() { assert_eq!("Plang", raindrops::raindrops(3125)); }
+
 #[test]
 #[ignore]
 fn test_12121() { assert_eq!("12121", raindrops::raindrops(12121)); }

data/tracks/rust/exercises/rna-transcription/Cargo.toml

@@ -1,3 +1,3 @@
 [package]
 name = "rna-transcription"
-version = "0.0.0"
+version = "1.0.0"

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

@@ -14,13 +14,13 @@ pub struct DeoxyribonucleicAcid {
     nucleotides: String
 }
 
-fn transcribe_dna_rna(c: char) -> char {
+fn transcribe_dna_rna(c: char) -> Option<char> {
     match c {
-        'C' => 'G',
-        'G' => 'C',
-        'A' => 'U',
-        'T' => 'A',
-        _   => c
+        'C' => Some('G'),
+        'G' => Some('C'),
+        'A' => Some('U'),
+        'T' => Some('A'),
+        _   => None
     }
 }
 
@@ -29,8 +29,12 @@ impl DeoxyribonucleicAcid {
         DeoxyribonucleicAcid { nucleotides: nucleotides.to_string() }
     }
 
-    pub fn to_rna(&self) -> RibonucleicAcid {
-        let rna_nucleotides = self.nucleotides.chars().map(transcribe_dna_rna).collect();
-        RibonucleicAcid { nucleotides: rna_nucleotides }
+    pub fn to_rna(&self) -> Result<RibonucleicAcid, ()> {
+        let rna_nucleotides: String = self.nucleotides.chars().filter_map(transcribe_dna_rna).collect();
+        if rna_nucleotides.len() == self.nucleotides.len() {
+            Ok(RibonucleicAcid { nucleotides: rna_nucleotides })
+        } else {
+            Err(())
+        }
     }
 }

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

@@ -9,29 +9,47 @@ fn test_acid_equals_acid() {
 #[test]
 #[ignore]
 fn test_transcribes_cytosine_guanine() {
-    assert_eq!(dna::RibonucleicAcid::new("G"), dna::DeoxyribonucleicAcid::new("C").to_rna());
+    assert_eq!(Ok(dna::RibonucleicAcid::new("G")), dna::DeoxyribonucleicAcid::new("C").to_rna());
 }
 
 #[test]
 #[ignore]
 fn test_transcribes_guanine_cytosine() {
-    assert_eq!(dna::RibonucleicAcid::new("C"), dna::DeoxyribonucleicAcid::new("G").to_rna());
+    assert_eq!(Ok(dna::RibonucleicAcid::new("C")), dna::DeoxyribonucleicAcid::new("G").to_rna());
 }
 
 #[test]
 #[ignore]
 fn test_transcribes_adenine_uracil() {
-    assert_eq!(dna::RibonucleicAcid::new("U"), dna::DeoxyribonucleicAcid::new("A").to_rna());
+    assert_eq!(Ok(dna::RibonucleicAcid::new("U")), dna::DeoxyribonucleicAcid::new("A").to_rna());
 }
 
 #[test]
 #[ignore]
 fn test_transcribes_thymine_to_adenine() {
-    assert_eq!(dna::RibonucleicAcid::new("A"), dna::DeoxyribonucleicAcid::new("T").to_rna());
+    assert_eq!(Ok(dna::RibonucleicAcid::new("A")), dna::DeoxyribonucleicAcid::new("T").to_rna());
 }
 
 #[test]
 #[ignore]
 fn test_transcribes_all_dna_to_rna() {
-    assert_eq!(dna::RibonucleicAcid::new("UGCACCAGAAUU"), dna::DeoxyribonucleicAcid::new("ACGTGGTCTTAA").to_rna())
+    assert_eq!(Ok(dna::RibonucleicAcid::new("UGCACCAGAAUU")), dna::DeoxyribonucleicAcid::new("ACGTGGTCTTAA").to_rna())
+}
+
+#[test]
+#[ignore]
+fn handles_invalid_input() {
+    assert!(dna::DeoxyribonucleicAcid::new("U").to_rna().is_err());
+}
+
+#[test]
+#[ignore]
+fn handles_completely_invalid_input() {
+    assert!(dna::DeoxyribonucleicAcid::new("XXX").to_rna().is_err());
+}
+
+#[test]
+#[ignore]
+fn handles_partially_invalid_input() {
+    assert!(dna::DeoxyribonucleicAcid::new("ACGTXXXCTTAA").to_rna().is_err());
 }

data/tracks/scala/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
+Copyright (c) 2017 Exercism, Inc
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

data/tracks/scala/README.md

@@ -44,11 +44,6 @@ Please submit changes to a single problem per pull request unless you're
 submitting a general change across many of the problems (e.g. formatting).
 
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
 
 ## Scala icon
 The Scala icon used on Exercism is inspired by the official Scala logo, which is copyright École Polytechnique Fédérale de Lausanne.

data/tracks/scheme/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
+Copyright (c) 2017 Exercism, Inc
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

data/tracks/scheme/README.org

@@ -32,12 +32,6 @@ upon.
 
 Please see the [[https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data][contributing guide]]
 
-** License
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Katrina Owen, [[mailto:_@kytrinyx.com][_@kytrinyx.com]]
-
 ** Scheme icon
 
 The Scheme logo was created by [[Matthias.f at en.wikipedia][https://en.wikipedia.org/wiki/User:Matthias.f]] and released under the Creative Commons Attribution-Share Alike 3.0 Unported license.

data/tracks/swift/Dangerfile

@@ -38,7 +38,7 @@ json.each do |object|
    line = object["line"] || 1
    #only warn for files that were edited in this PR.
    if isError
-    fail(msg, file: "/" + shortFile, line: line) if isError
+    warn(msg, file: "/" + shortFile, line: line) if isError
    elsif git.modified_files.include? shortFile
    	warn(msg, file: "/" + shortFile, line: line) unless isError
    else

data/tracks/swift/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
+Copyright (c) 2017 Exercism, Inc
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

data/tracks/swift/README.md

@@ -9,9 +9,3 @@ Please see the [contributing guide](https://github.com/exercism/x-api/blob/maste
 ## Swift Track
 
 We use Travis CI to automatically run all the unit tests on the code that is going to be checked in. In addition we also have [SwiftLint](https://github.com/realm/SwiftLint) set up to make sure that the code is consistent across all exercises. Please run `swiftlint autocorrect --format` on your code before submitting a PR. Check the travis file to see which version of swift we are testing against. Make sure all the tests pass locally using the swift package manager. Keep in mind that we support Linux so the tests need to also pass on linux on Travis. 
-
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2017 Katrina Owen, _@kytrinyx.com

data/tracks/vbnet/.travis.yml

@@ -3,3 +3,4 @@ language: bash
 script:
 - bin/fetch-configlet
 - bin/configlet .
+sudo: false

data/tracks/vimscript/.travis.yml

@@ -1,6 +1,10 @@
 dist: trusty
 sudo: false
 
+notifications:
+  email:
+    on_success: never
+
 addons:
   apt:
     packages:

data/tracks/vimscript/.vintrc.yaml

@@ -0,0 +1,5 @@
+policies:
+  ProhibitCommandWithUnintendedSideEffect:
+    enabled: false
+  ProhibitCommandRelyOnUser:
+    enabled: false

data/tracks/vimscript/TRACK_HINTS.md

@@ -64,10 +64,28 @@ the `:Test` command.
 
 ## Writing tests
 
+#### Generate test files
+
+Use the [generator](lib/generate.vim) to create Vader files from their canonical
+test data:
+
+```vim
+" in Vim
+:source lib/generate.vim
+:Generate word-count
+```
+
+This would fetch the [canonical test data](https://raw.githubusercontent.com/exercism/x-common/master/exercises/word-count/canonical-data.json),
+decode the JSON to Vim data types, iterate over the result, and put the tests in
+a new unnamed buffer.
+
+_This script requires Vim 7.4.1304+ for `json_decode()`. It also relies on the
+netrw plugin (`:h netrw`), but that one is shipped and sourced by default._
+
 #### Type mismatch exceptions
 
 Older Vims don't like changing types for the same variable. If your tests use
-global variables, unlet them in a `Before` block at the top of the Vader file.
+global variables, `unlet!` them in a `Before` block at the top of the Vader file.
 
 When each test uses `let expected = ...`, then put this at the top: