trackler 2.1.0.24 → 2.1.0.25

data/tracks/csharp/README.md

@@ -11,8 +11,3 @@ Please see the [contributing guide](https://github.com/exercism/x-api/blob/maste
 ## Support
 Need assitance?   Check out our Gitter Channel at https://gitter.im/exercism/xcsharp where you can get support and ask questions related to the C# track.
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com

data/tracks/delphi/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2016 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/delphi/README.md

@@ -8,8 +8,3 @@ Exercism exercises in Delphi Pascal.
 
 Please see the [contributing guide](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md).
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com

data/tracks/ecmascript/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/ecmascript/README.md

@@ -36,8 +36,3 @@ Pass the exercise name to make script to run the tests for a specific exercise:
 
 Please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com

data/tracks/elisp/.travis.yml

@@ -1,6 +1,10 @@
 ---
 language: bash
+before_install:
+  - sudo add-apt-repository -y ppa:cassou/emacs # Emacs 24.3
+  - sudo apt-get update
+  - sudo apt-get install -y emacs24-nox
 script:
-- bin/fetch-configlet
-- bin/configlet .
-sudo: false
+  - bin/fetch-configlet
+  - bin/configlet .
+  - bin/test-examples

data/tracks/elisp/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2015 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/elisp/README.org

@@ -1,6 +1,9 @@
 #+TITLE: xelisp
 #+AUTHOR: Jason Lewis
 
+#+ATTR_HTML: :alt Build Status
+[[https://travis-ci.org/exercism/xelisp][https://api.travis-ci.org/exercism/xelisp.svg?branch=master]]
+
 Exercism problems in Emacs Lisp.
 
 ** Contributing to The Emacs Lisp Track
@@ -26,12 +29,6 @@ request. You will need a GitHub account and you will need to fork
 with the process.
 
 
-** License
-
-The MIT License (MIT)
-
-Copyright (c) 2015 Katrina Owen, _@kytrinyx.com
-
 *** GNU Emacs icon
 The GNU Emacs icon was designed by Andrew Zhilin and is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.
 We have modified the GNU Emacs icon to create the Emacs Lisp icon for Exercism.

data/tracks/elisp/bin/test-examples

@@ -0,0 +1,27 @@
+#! /usr/bin/env bash
+
+if [[ ! -d "exercises" ]]; then
+    echo "exercises directory not found!"
+    exit 1
+fi
+
+cd ./exercises
+
+for ex in *; do
+    err_cnt=0
+    impl="${ex}.el"
+    cd $ex
+    mv $impl "${impl}.tmp"
+    cp example.el $impl
+    emacs -batch -l ert -l "${ex}-test.el" -f ert-run-tests-batch-and-exit
+    let "err_cnt += $?"
+    mv "${impl}.tmp" $impl
+    cd -
+done
+
+if [ $err_cnt -ne 0 ]
+then
+    exit 1
+else
+    exit 0
+fi

data/tracks/elisp/config.json

@@ -103,6 +103,16 @@
       "difficulty": 1,
       "slug": "nucleotide-count",
       "topics": []
+    },
+    {
+      "difficulty": 1,
+      "slug": "phone-number",
+      "topics": []
+    },
+    {
+      "slug": "grains",
+      "difficulty": 1,
+      "topics": []
     }
   ]
 }

data/tracks/elisp/docs/LEARNING.org

@@ -4,9 +4,6 @@ Well, you can start the tutoral by pressing =C-h t=, and that's not a bad place
 to start. If you're completely new to Emacs, the [[http://batsov.com/prelude/][Emacs Prelude]] package offers a
 nice set of sensible defaults and packages.
 
-A guide I wrote a while ago for getting started with the editor (including
-Prelude) can be found [[http://decomplecting.org/blog/2014/10/23/welcome-to-the-dark-side-switching-to-emacs/][here]].
-
 The best documentation on Emacs Lisp is... shipped with Emacs itself!
 
 From the [[http://www.emacswiki.org/emacs/EmacsLisp][EmacsWiki Entry]]:

data/tracks/elisp/exercises/grains/example.el

@@ -0,0 +1,18 @@
+;;; grains.el --- Grains exercise (exercism)
+
+;;; Commentary:
+
+;;; Code:
+
+(require 'cl)
+
+(defun square (n)
+  "Find the number of grains on square N."
+  (string-to-number (calc-eval (format "2^(%d - 1)" n))))
+
+(defun total ()
+  "Find the total number of grains on the board."
+  (string-to-number (calc-eval "2^64 - 1")))
+
+(provide 'grains)
+;;; grains.el ends here

data/tracks/elisp/exercises/grains/grains-test.el

@@ -0,0 +1,38 @@
+;;; grains-test.el --- Test for Grains (exercism)
+
+;;; Commentary:
+
+;;; Code:
+
+(load-file "grains.el")
+
+(ert-deftest square-1 ()
+  (should (equal 1 (square 1))))
+
+(ert-deftest square-2 ()
+  (should (equal 2 (square 2))))
+
+(ert-deftest square-3 ()
+  (should (equal 4 (square 3))))
+
+(ert-deftest square-4 ()
+  (should (equal 8 (square 4))))
+
+(ert-deftest square-16 ()
+  (should (equal 32768
+                 (square 16))))
+
+(ert-deftest square-32 ()
+  (should (equal 2147483648
+                 (square 32))))
+
+(ert-deftest square-64 ()
+  (should (equal 9223372036854775808
+                 (square 64))))
+
+(ert-deftest total-grains ()
+  (should (equal 18446744073709551615
+                 (total))))
+
+(provide 'grains-test.el)
+;;; grains-test.el ends here.

data/tracks/elisp/exercises/grains/grains.el

@@ -0,0 +1,10 @@
+;;; grains.el --- Grains exercise (exercism)
+
+;;; Commentary:
+
+;;; Code:
+
+
+
+(provide 'grains)
+;;; grains.el ends here

data/tracks/elisp/exercises/phone-number/example.el

@@ -0,0 +1,34 @@
+;;; phone-number.el --- phone-number Exercise (exercism)
+
+;;; Commentary:
+
+;;; Code:
+
+
+(defun numbers (num)
+  (let ((number (replace-regexp-in-string "[^0-9]+" "" num)))
+    (cond
+     ((= (length number) 10) number)
+     ((and (= (length number) 11)
+           (string-equal (substring number 0 1) "1")) (substring number 1))
+     (t "0000000000"))))
+
+
+(defun area-code (num)
+  (substring (numbers num) 0 3))
+
+
+(defun prefix (num)
+  (substring (numbers num) 3 6))
+
+
+(defun line-number (num)
+  (substring (numbers num) 6))
+
+
+(defun pprint (num)
+  (format "(%s) %s-%s" (area-code num) (prefix num) (line-number num)))
+
+
+(provide 'phone-number)
+;;; phone-number.el ends here

data/tracks/elisp/exercises/phone-number/phone-number-test.el

@@ -0,0 +1,43 @@
+;;; phone-number-test.el --- Tests for phone-number (exercism)
+
+;;; Commentary:
+
+;;; Code:
+
+(load-file "phone-number.el")
+
+
+(ert-deftest cleans-number-test ()
+  (should (equal (numbers "(123) 456-7890") "1234567890")))
+
+
+(ert-deftest cleans-numbers-with-dots-test ()
+  (should (equal (numbers "123.456.7890") "1234567890")))
+
+
+(ert-deftest valid-when-11-digits-and-first-is-1-test ()
+  (should (equal (numbers "11234567890") "1234567890")))
+
+
+(ert-deftest invalid-when-11-digits-test ()
+  (should (equal (numbers "21234567890") "0000000000")))
+
+
+(ert-deftest invalid-when-9-digits-test ()
+  (should (equal (numbers "123456789") "0000000000")))
+
+
+(ert-deftest area-code-test ()
+  (should (equal (area-code "1234567890") "123")))
+
+
+(ert-deftest pprint-test ()
+  (should (equal (pprint "1234567890") "(123) 456-7890")))
+
+
+(ert-deftest pprint-full-us-phone-number-test ()
+  (should (equal (pprint "11234567890") "(123) 456-7890")))
+
+
+(provide 'phone-number)
+;;; phone-number-test.el ends here

data/tracks/elisp/exercises/phone-number/phone-number.el

@@ -0,0 +1,9 @@
+;;; phone-number.el --- phone-number Exercise (exercism)
+
+;;; Commentary:
+
+;;; Code:
+
+
+(provide 'phone-number)
+;;; phone-number.el ends here

data/tracks/elixir/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/elixir/README.md

@@ -76,8 +76,3 @@ All the tests for xElixir exercises can be run from the top level of the repo
 with `$ mix test`. Please run this command before submitting your PR. Watch out
 for and correct any compiler warnings you may have introduced.
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2016 Katrina Owen, _@kytrinyx.com

data/tracks/elm/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2015 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/elm/README.md

@@ -80,11 +80,6 @@ tests =
 
  - If you are submitting a new exercise, be sure to add it to the appropriate place in the `config.json` file. Also, please run `bin/fetch-configlet && bin/configlet` to ensure the exercise is configured correctly.
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2016 Katrina Owen, _@kytrinyx.com
 
 ### Elm icon
 We were unable to find copyright information about the Elm logo, nor information about who designed it. Presumably Evan Czaplicki, creator of the Elm language, also made the logo, and holds copyright. It may also fall within the public domain, since it is a geometric shape. We've adapted the official Elm logo by changing the colors, which we believe falls under "fair use".

data/tracks/erlang/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/erlang/README.md

@@ -83,8 +83,3 @@ should pass without error message.
 Both programs will be run on Travis and a merge is unlikely when
 tests fail.
 
-## License
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Katrina Owen, _@kytrinyx.com

data/tracks/erlang/SETUP.md

@@ -3,6 +3,13 @@
 In order to run the tests, issue the following command from the exercise
 directory:
 
+For running the tests provided, `rebar3` is used as it is the official build and
+dependency management tool for erlang now. Please refer to [the tracks installation
+instructions](http://exercism.io/languages/erlang/installing) on how to do that.
+
+In order to run the tests, you can issue the following command from the exercise
+directory.
+
 ```bash
 $ rebar3 eunit
 ```

data/tracks/erlang/exercises/rotational-cipher/rebar.config

@@ -1,12 +1,12 @@
 %% Erlang compiler options
 {erl_opts, [debug_info]}.
 
-{plugins, [rebar3_proper, rebar_alias]}.
-{deps, [{proper, "1.1.1-beta"}]}.
+% {plugins, [rebar3_proper, rebar_alias]}.
+%{deps, [{proper, "1.1.1-beta"}]}.
 
-{alias, [
-  {test, [eunit, proper]}
-]}.
+%{alias, [
+%  {test, [eunit, proper]}
+%]}.
 
 {dialyzer, [
   {warnings, [underspecs, no_return]},

data/tracks/erlang/exercises/rotational-cipher/test/rotational_cipher_tests.erl

@@ -2,7 +2,6 @@
 
 -define(TESTED_MODULE, (sut(rotational_cipher))).
 -define(TEST_VERSION, 1).
--include_lib("proper/include/proper.hrl").
 -include("exercism.hrl").
 
 %%% To use this testsuite completely do run
@@ -79,20 +78,21 @@ decrypt_punctuation_test() ->
 decrypt_all_letters_test() ->
   ?assertEqual("The quick brown fox jumps over the lazy dog.", ?TESTED_MODULE:decrypt("Gur dhvpx oebja sbk whzcf bire gur ynml qbt.", 13)).
 
-%% Properties tested via `proper`
-
-prop_decrypt_encrypt_is_id() ->
-  ?FORALL({Input, N}, {string(), integer(0,26)},
-    ?TESTED_MODULE:decrypt(?TESTED_MODULE:encrypt(Input, N), N) == Input).
-
-prop_decrypt_is_encrypt_with_another_key() ->
-  ?FORALL({Input, N}, {string(), integer(0,26)},
-    ?TESTED_MODULE:decrypt(Input, 26 - N) == ?TESTED_MODULE:encrypt(Input, N)).
-
-prop_encrypt_13_twice_is_id() ->
-  ?FORALL(Input, string(),
-    ?TESTED_MODULE:encrypt(?TESTED_MODULE:encrypt(Input, 13), 13) == Input).
-
-prop_decrypt_13_twice_is_id() ->
-  ?FORALL(Input, string(),
-    ?TESTED_MODULE:decrypt(?TESTED_MODULE:decrypt(Input, 13), 13) == Input).
+%%% Properties tested via `proper`
+%
+%prop_decrypt_encrypt_is_id() ->
+%  ?FORALL({Input, N}, {string(), integer(0,26)},
+%    ?TESTED_MODULE:decrypt(?TESTED_MODULE:encrypt(Input, N), N) == Input).
+%
+%prop_decrypt_is_encrypt_with_another_key() ->
+%  ?FORALL({Input, N}, {string(), integer(0,26)},
+%    ?TESTED_MODULE:decrypt(Input, 26 - N) == ?TESTED_MODULE:encrypt(Input, N)).
+%
+%prop_encrypt_13_twice_is_id() ->
+%  ?FORALL(Input, string(),
+%    ?TESTED_MODULE:encrypt(?TESTED_MODULE:encrypt(Input, 13), 13) == Input).
+%
+%prop_decrypt_13_twice_is_id() ->
+%  ?FORALL(Input, string(),
+%    ?TESTED_MODULE:decrypt(?TESTED_MODULE:decrypt(Input, 13), 13) == Input).
+%