trackler 2.2.1.16 → 2.2.1.17

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e5c97fcf2d7f6d2185c61b30676dc864888a9b50
-  data.tar.gz: 0eeef9cbaed6ef79a64e119d2e2a6c04785bb6c1
+  metadata.gz: d633f439c412c8de9275558a71e556144c1064db
+  data.tar.gz: b6706bedaa2ed4c7ff5137e3efbba8566e595312
 SHA512:
-  metadata.gz: 668da44c9adb98cd58873dee0948cb9f7c8a7f891169d56f3b2b6b7dded8a5905645ec7b59941254d1dfc2e221fb92fe19dbf4985977bf6b2bdf2e2d603fc3c1
-  data.tar.gz: 3a7468c948c4e9ea3823b3e9186ebcd7c7b9fa87c3650a828fa535ec0a0018c8a8254c9356150f59cb3da6c14718698a04772df47a8686b667a6d0c9e43d559e
+  metadata.gz: a7ec9f885ae035b45571c86c1124867641e68cd97f2ee20e20ca570874501f9ce416897c2115e15cd9522a0ea29b36e2053e593a3a719d421086af90028965b5
+  data.tar.gz: 8a2a82e332e0cd1c7cfc6b8862f705163c21b28560c2a7548940e472dccfc541cb3c34296f09731ec7ac39cbaf83078522a02187b5351f172756ee6671fb6b99

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.16"
+  VERSION = "2.2.1.17"
 end

data/tracks/delphi/config/maintainers.json

@@ -15,7 +15,7 @@
       "show_on_website": true,
       "alumnus": false,
       "name": "Ryan Potts",
-      "bio": "I have been using Delphi professionally since 1996, Delphi 1.  At my day job I develope software used in the control of various types of test machines used by the auto industry.  Exercism is my first real push into Open Source and I'm happy to have this opportunity to teach and share the virtures of Delphi with others.",
+      "bio": "I have been using Delphi professionally since 1996, Delphi 1.  At my day job I develop software used in the control of various types of test machines used by the auto industry.  Exercism is my first real push into Open Source and I'm happy to have this opportunity to teach and share the virtures of Delphi with others.",
       "link_text": null,
       "link_url": null,
       "avatar_url": null

data/tracks/objective-c/docs/SNIPPET.txt

@@ -0,0 +1,10 @@
+@interface HelloWorld : NSObject
+- (NSString *)hello:(NSString *)name;
+@end
+
+@implementation HelloWorld
+- (NSString *)hello:(NSString *)name {
+  if (!name) { name = @"World"; }
+  return [NSString stringWithFormat:@"Hello, %@!", name];
+}
+@end

data/tracks/python/.gitignore

@@ -6,3 +6,4 @@
 tmp
 bin/configlet
 bin/configlet.exe
+.idea/

data/tracks/python/exercises/accumulate/accumulate.py

@@ -1,2 +1,2 @@
-def accumulate():
+def accumulate(array, function):
     pass

data/tracks/python/exercises/allergies/allergies.py

@@ -1,3 +1,11 @@
 class Allergies(object):
-    def __init__(self):
+
+    def __init__(self, number):
+        pass
+
+    def is_allergic_to(self, string):
+        pass
+
+    @property
+    def lst(self):
         pass

data/tracks/python/exercises/alphametics/alphametics.py

@@ -1,2 +1,2 @@
-def solve():
+def solve(string):
     pass

data/tracks/python/exercises/anagram/anagram.py

@@ -1,2 +1,2 @@
-def detect_anagrams():
+def detect_anagrams(string, array):
     pass

data/tracks/python/exercises/atbash-cipher/atbash_cipher.py

@@ -1,6 +1,6 @@
-def encode():
+def encode(string):
     pass
 
 
-def decode():
+def decode(string):
     pass

data/tracks/python/exercises/beer-song/beer_song.py

@@ -1,6 +1,6 @@
-def verse():
+def verse(number):
     pass
 
 
-def song():
+def song(number1, number2=0):
     pass

data/tracks/python/exercises/binary/binary.py

@@ -1,2 +1,2 @@
-def parse_binary():
+def parse_binary(string):
     pass

data/tracks/python/exercises/binary-search/binary_search.py

@@ -1,2 +1,2 @@
-def binary_search():
+def binary_search(array, number):
     pass

data/tracks/python/exercises/bob/bob.py

@@ -1,2 +1,2 @@
-def hey():
+def hey(string):
     pass

data/tracks/python/exercises/book-store/book_store.py

@@ -1,2 +1,2 @@
-def calculate_total():
+def calculate_total(array, number=None):
     pass

data/tracks/python/exercises/bracket-push/bracket_push.py

@@ -1,2 +1,2 @@
-def check_brackets():
+def check_brackets(string):
     pass

data/tracks/python/requirements-travis.txt

@@ -1,3 +1,3 @@
 flake8==3.4.1
 pep8>=1.7,<1.7.99
-pyflakes>=1.5,<1.5.99
+pyflakes==1.6.0

data/tracks/rust/config.json

@@ -21,7 +21,7 @@
       "difficulty": 1,
       "topics": [
         "crates",
-        "math"
+        "mathematics"
       ]
     },
     {
@@ -31,7 +31,7 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-        "math",
+        "mathematics",
         "booleans",
         "conditionals"
       ]
@@ -119,7 +119,7 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-        "math",
+        "mathematics",
         "panic"
       ]
     },
@@ -140,7 +140,7 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-        "math"
+        "mathematics"
       ]
     },
     {
@@ -196,7 +196,7 @@
       "unlocked_by": null,
       "difficulty": 4,
       "topics": [
-        "Math",
+        "Mathematics",
         "Vec",
         "Index (optional)"
       ]
@@ -289,6 +289,20 @@
         "ascii"
       ]
     },
+    {
+      "uuid": "0cc485e9-43ba-4d97-a622-ee4cb8b9f1f7",
+      "slug": "crypto-square",
+      "difficulty": 4,
+      "topics": [
+        "str vs string",
+        "primitive types",
+        "iterators",
+        "chars",
+        "arrays",
+        "ascii",
+        "transforming"
+      ]
+    },
     {
       "uuid": "5dbecc83-2c8d-467d-be05-f28a08f7abcf",
       "slug": "rotational-cipher",
@@ -369,7 +383,7 @@
       "unlocked_by": null,
       "difficulty": 4,
       "topics": [
-        "Math",
+        "Mathematics",
         "Struct"
       ]
     },
@@ -596,7 +610,7 @@
       "topics": [
         "string parsing",
         "combinations",
-        "math",
+        "mathematics",
         "external crates (optional)"
       ]
     },

data/tracks/rust/exercises/crypto-square/.gitignore

@@ -0,0 +1,7 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+
+# Remove Cargo.lock from gitignore if creating an executable, leave it for libraries
+# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
+Cargo.lock

data/tracks/rust/exercises/crypto-square/Cargo-example.toml

@@ -0,0 +1,7 @@
+[package]
+name = "crypto-square"
+version = "0.1.0"
+authors = ["Peter Goodspeed-Niklaus <peter.r.goodspeedniklaus@gmail.com>"]
+
+[dependencies]
+itertools = "0.6.1"

data/tracks/rust/exercises/crypto-square/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "crypto-square"
+version = "0.1.0"
+authors = ["Peter Goodspeed-Niklaus <peter.r.goodspeedniklaus@gmail.com>"]
+
+[dependencies]

data/tracks/rust/exercises/crypto-square/README.md

@@ -0,0 +1,106 @@
+# Crypto Square
+
+Implement the classic method for composing secret messages called a square code.
+
+Given an English text, output the encoded version of that text.
+
+First, the input is normalized: the spaces and punctuation are removed
+from the English text and the message is downcased.
+
+Then, the normalized characters are broken into rows.  These rows can be
+regarded as forming a rectangle when printed with intervening newlines.
+
+For example, the sentence
+
+> If man was meant to stay on the ground, god would have given us roots.
+
+is normalized to:
+
+> ifmanwasmeanttostayonthegroundgodwouldhavegivenusroots
+
+The plaintext should be organized in to a rectangle.  The size of the
+rectangle (`r x c`) should be decided by the length of the message,
+such that `c >= r` and `c - r <= 1`, where `c` is the number of columns
+and `r` is the number of rows.
+
+Our normalized text is 54 characters long, dictating a rectangle with
+`c = 8` and `r = 7`:
+
+```plain
+ifmanwas
+meanttos
+tayonthe
+groundgo
+dwouldha
+vegivenu
+sroots
+```
+
+The coded message is obtained by reading down the columns going left to
+right.
+
+The message above is coded as:
+
+```plain
+imtgdvsfearwermayoogoanouuiontnnlvtwttddesaohghnsseoau
+```
+
+Output the encoded text in chunks.  Phrases that fill perfect squares
+`(r X r)` should be output in `r`-length chunks separated by spaces.
+Imperfect squares will have `n` empty spaces.  Those spaces should be distributed evenly across the last `n` rows.
+
+```plain
+imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau
+```
+
+Notice that were we to stack these, we could visually decode the
+cyphertext back in to the original message:
+
+```plain
+imtgdvs
+fearwer
+mayoogo
+anouuio
+ntnnlvt
+wttddes
+aohghn
+sseoau
+```
+
+## 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
+
+J Dalbey's Programming Practice problems [http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html](http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.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/crypto-square/example.rs

@@ -0,0 +1,114 @@
+use std::ascii::AsciiExt;
+
+extern crate itertools;
+use itertools::Itertools;
+
+/// Encrypt the input string using square cryptography
+pub fn encrypt(input: &str) -> String {
+    let prepared = prepare(input);
+    if prepared.len() == 0 {
+        return String::new();
+    }
+
+    let (cols, rows) = dimensions(prepared.len());
+
+    let mut output = String::with_capacity(input.len());
+    for chunk_iterator in SquareIndexer::new(rows, cols).chunks(cols).into_iter() {
+        for ch_idx in chunk_iterator {
+            if ch_idx < prepared.len() {
+                output.push(prepared[ch_idx]);
+            }
+        }
+        output.push(' ');
+    }
+
+    // we know there's one extra space at the end
+    output.pop();
+
+    output
+}
+
+/// Construct a vector of characters from the given input.
+///
+/// Constrain it to the allowed chars: lowercase ascii letters.
+/// We construct a vector here because the length of the input
+/// matters when constructing the output, so we need to know
+/// how many input chars there are. We could treat it as a stream
+/// and just stream twice, but collecting it into a vector works
+/// equally well and might be a bit faster.
+fn prepare(input: &str) -> Vec<char> {
+    let mut output = Vec::with_capacity(input.len());
+
+    output.extend(
+        input
+            .chars()
+            .filter(|&c| c.is_ascii() && !c.is_whitespace())
+            .map(|c| c.to_ascii_lowercase())
+            .filter(|&c| c >= 'a' && c <= 'z'),
+    );
+    output.shrink_to_fit();
+
+    output
+}
+
+/// Get the dimensions of the appropriate bounding rectangle for this encryption
+///
+/// To find `(rows, cols)` such that `cols >= rows && cols - rows <= 1`, we find
+/// the least square greater than or equal to the message length. Its square root
+/// is the cols. If the message length is a perfect square, `rows` is the same.
+/// Otherwise, it is one less.
+fn dimensions(length: usize) -> (usize, usize) {
+    let cols = (length as f64).sqrt().ceil() as usize;
+    let rows = if cols * cols == length {
+        cols
+    } else {
+        cols - 1
+    };
+    (rows, cols)
+}
+
+/// Iterator over the indices of the appropriate chars of the output.
+///
+/// For a (2, 3) (r, c) grid, yields (0, 3, 1, 4, 2, 5).
+/// Does no bounds checking or space insertion: that's handled elsewhere.
+#[derive(Debug)]
+struct SquareIndexer {
+    rows: usize,
+    cols: usize,
+    cur_row: usize,
+    cur_col: usize,
+    max_value: usize,
+}
+
+impl SquareIndexer {
+    fn new(rows: usize, cols: usize) -> SquareIndexer {
+        SquareIndexer {
+            rows: rows,
+            cols: cols,
+            cur_row: 0,
+            cur_col: 0,
+            max_value: rows * cols,
+        }
+    }
+}
+
+impl Iterator for SquareIndexer {
+    type Item = usize;
+    fn next(&mut self) -> Option<usize> {
+        let value = self.cur_row + (self.cur_col * self.rows);
+        let output = if value < self.max_value && self.cur_row < self.rows {
+            Some(value)
+        } else {
+            None
+        };
+
+        // now increment internal state to next value
+        self.cur_col += 1;
+        if self.cur_col >= self.cols {
+            self.cur_col = 0;
+            self.cur_row += 1;
+        }
+
+        output
+    }
+}

data/tracks/rust/exercises/crypto-square/src/lib.rs

@@ -0,0 +1,3 @@
+pub fn encrypt(_: &str) -> String {
+    unimplemented!()
+}

data/tracks/rust/exercises/crypto-square/tests/crypto-square.rs

@@ -0,0 +1,81 @@
+extern crate crypto_square;
+use crypto_square::encrypt;
+
+fn test(input: &str, output: &str) {
+    assert_eq!(&encrypt(input), output);
+}
+
+#[test]
+fn test_empty_input() {
+    test("", "")
+}
+
+
+#[test]
+fn test_encrypt_also_decrypts_square() {
+    // note that you only get the exact input back if:
+    // 1. no punctuation
+    // 2. even spacing
+    // 3. all lowercase
+    // 4. square input
+    let example = "lime anda coco anut";
+    assert_eq!(example, &encrypt(&encrypt(example)));
+}
+
+#[test]
+fn test_example() {
+    test(
+        "If man was meant to stay on the ground, god would have given us roots.",
+        "imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau",
+    )
+}
+
+#[test]
+fn test_empty_last_line() {
+    test("congratulate", "crl oaa ntt gue")
+}
+
+#[test]
+fn test_spaces_are_reorganized() {
+    test("abet", "ae bt");
+    test("a bet", "ae bt");
+    test("     a  b     e      t             ", "ae bt");
+}
+
+#[test]
+fn test_everything_becomes_lowercase() {
+    test("caSe", "cs ae");
+    test("cAsE", "cs ae");
+    test("CASE", "cs ae");
+}
+
+#[test]
+fn test_ignore_non_ascii_chars() {
+    test(
+        "She got her education, then got rich programming: 👩‍🎓🎓👩‍💻💰",
+        "setnhm hrigpm eeoori gdnton outrgg tchir haeca",
+    );
+}
+
+#[test]
+fn test_long() {
+    test(
+        r#"
+We choose to go to the moon.
+
+We choose to go to the moon in this decade and do the other things,
+not because they are easy, but because they are hard, because that
+goal will serve to organize and measure the best of our energies and
+skills, because that challenge is one that we are willing to accept,
+one we are unwilling to postpone, and one which we intend to win,
+and the others, too.
+
+-- John F. Kennedy, 12 September 1962
+        "#,
+        &(String::from("wohaseagabnttenwan eoennaronedcwpghnf cnmdoseaisshettidk ") +
+              "hwodtyhlztkaaoocte oeoobbaweoilrnphhn ocnteuriaflleeowen shihctdlnolewwseoe " +
+              "eoneabbldusnietitd totoueesmrbglapnhy oshtscceeeeelrotes geiheaaranciienere " +
+              "otsetuuvseasnuensp todrhsseuruognadtt ogeteeetrgsntwntoe tochyttoeieeoidoom " +
+              "htaiahhotettalowjb eodnrearhshhclnioe mtegeytgeaaacienhr"),
+    )
+}

data/tracks/sml/Makefile

@@ -34,8 +34,8 @@ travis:
 
 test-%:
 	$(eval exercise := $(patsubst test-%, %, $@))
-	@echo "# $(exercise)"
 	@echo
+	@ls ./exercises/$(exercise)/README.md > /dev/null
 	@cd ./exercises/$(exercise) && cat test.sml | sed 's/$(exercise).sml/example.sml/' | poly -q
 	@echo
 

data/tracks/sml/config.json

@@ -104,6 +104,36 @@
 
       ]
     },
+    {
+      "uuid": "2bfc685e-0d13-0280-de5e-53bc093e3a8c5ac7c73",
+      "slug": "atbash-cipher",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
+    {
+      "uuid": "b83ce171-06e6-dd80-080e-9dd189bf6df83833e92",
+      "slug": "perfect-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
+    {
+      "uuid": "42adb6ed-09f0-6980-2d4f-75ac90cc2bf1f59fb3a",
+      "slug": "pangram",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "225cfd7d-81a3-4a58-b1aa-1de2e40e7a93",
       "slug": "binary",

data/tracks/sml/exercises/atbash-cipher/README.md

@@ -0,0 +1,64 @@
+# Atbash Cipher
+
+Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.
+
+The Atbash cipher is a simple substitution cipher that relies on
+transposing all the letters in the alphabet such that the resulting
+alphabet is backwards. The first letter is replaced with the last
+letter, the second with the second-last, and so on.
+
+An Atbash cipher for the Latin alphabet would be as follows:
+
+```plain
+Plain:  abcdefghijklmnopqrstuvwxyz
+Cipher: zyxwvutsrqponmlkjihgfedcba
+```
+
+It is a very weak cipher because it only has one possible key, and it is
+a simple monoalphabetic substitution cipher. However, this may not have
+been an issue in the cipher's time.
+
+Ciphertext is written out in groups of fixed length, the traditional group size
+being 5 letters, and punctuation is excluded. This is to make it harder to guess
+things based on word boundaries.
+
+## Examples
+- Encoding `test` gives `gvhg`
+- Decoding `gvhg` gives `test`
+- Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`
+
+## Loading your exercise implementation in PolyML
+
+```
+$ poly --use {exercise}.sml
+```
+
+Or:
+
+```
+$ poly
+> use "{exercise}.sml";
+```
+
+**Note:** You have to replace {exercise}.
+
+## Running the tests
+
+```
+$ poly -q --use test.sml
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/sml](https://github.com/exercism/sml) repository on
+GitHub is the home for all of the Standard ML exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue. We'll do our best to help you!
+
+## Source
+
+Wikipedia [http://en.wikipedia.org/wiki/Atbash](http://en.wikipedia.org/wiki/Atbash)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/sml/exercises/atbash-cipher/atbash-cipher.sml

@@ -0,0 +1,5 @@
+fun decode (phrase: string): string =
+  raise Fail "'decode' is not implemented"
+
+fun encode (phrase: string): string =
+  raise Fail "'encode' is not implemented"