trackler 2.2.1.82 → 2.2.1.83

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 77a630fcfa462bfc7fa0f65bb947f2b899102fac
-  data.tar.gz: 0c4d25df70028b4bfcd486fb3841743c031f638e
+  metadata.gz: fd3db94a01e41282f6733f0e8356e7781580009a
+  data.tar.gz: 25464cb3caef3b9481c20cea3a1e3667d8ffee6b
 SHA512:
-  metadata.gz: 84d23785bb597fcd2212917cfb1237ae8065a302e8765877fa87f5837f04d54ed3187ba34553463429f2a5207b00b2b8ddd76db76728580f5042bf2b3b415bc5
-  data.tar.gz: 3d1c4fd648179adeffa83eb0acca07a547a807285d93d99a9acf8d0d238b7c6fb25fe2bcd9601fd7a7cdf2dce75264ceec9949dfc7c2e0ac9ab15b73102e4c51
+  metadata.gz: bb80d176aca640ed2e83cd55815849ff454d6184118095d1af15168bdaedbdb6abeae8dd94e527922e2945e7913f249018ecf38b9d1e3b19de6be8b915cde5c6
+  data.tar.gz: e54cbb2d9efcac874d7aacba8ed97a916adb53c639e3f01f212e08685fbeaa3fbd5bdbb84e3ec666f2b1df70cc1023af18aaaa8efc545dd24ffbc020c74afd20

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.82"
+  VERSION = "2.2.1.83"
 end

data/tracks/bash/.gitattributes

@@ -0,0 +1,10 @@
+# Autodetect text files
+* text=auto
+
+# Force the following filetypes to have unix eols, so Windows does not break them
+*.* text eol=lf
+
+# Force images/fonts to be handled as binaries
+*.jpg binary
+*.jpeg binary
+*.png binary

data/tracks/bash/CONTRIBUTING.md

@@ -10,7 +10,9 @@ In order to run any of the test files (or examples, for that matter), you're goi
 
 ## Porting an Exercise from Another Language
 
-Porting an exercise from another language is easy (ish)!  You can follow this step-by-step guide (specific for this repository) to get it done.
+Porting an exercise from another language is easy (ish)! [Problem specifications](www.github.com/exercism/problem-specifications) for [unimplemented exercises](www.exercism.io/languages/bash/todo) can be used to do this.
+
+The `_template` directory found in `exercism/bash` can be used to port exercises. Once an example submission, full test suite and README.md have been created, you just need to alter `config.json` to include the newly implemented exercise.
 
 ### Initial Setup
 

data/tracks/bash/_template/README.md

@@ -0,0 +1,11 @@
+# README 
+
+All exercises should have a README.md file. This file should be generated using the `configlet` tool.
+
+If a `hints.md` file has been added to an exericse, that exercise's `readme` needs to be regenerated. This is because the `hints.md` file will get appended to the `readme` when the `readme` is generated.
+
+To generate the `readme` you need to:
+
+1. Download [`configlet`](https://github.com/exercism/configlet/releases) and put it somewhere on your path (`configlet` is the tool we use to generate `reame` files).
+2. [Clone](https://help.github.com/articles/cloning-a-repository/) the [problem-specifications](https://github.com/exercism/problem-specifications) repository (this repo contains the template we use to generate `readme`s).
+3. Run `configlet generate . --only exercise-slug --spec-path path_to_problem_specifications` from the root of this repository (exercism/bash).

data/tracks/bash/_template/example.sh

@@ -0,0 +1,3 @@
+#!/usr/bin/env bash
+
+# A solution to the exercise, passing all tests, should be here

data/tracks/bash/_template/exercise_slug_test.sh

@@ -0,0 +1,17 @@
+#!/usr/bin/env bats
+
+@test "Test name - first test shouldn't be skipped" {
+  #skip
+  run bash exercise_slug.sh
+
+  [ "$status" -eq 0 ]
+  [ "$output" = "What's expected" ]
+}
+
+@test "Second test onwards should be skipped" {
+  skip
+  run bash exercise_slug.sh
+
+  [ "$status" -eq 0 ]
+  [ "$output" = "What's expected" ]
+}

data/tracks/bash/exercises/acronym/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 if [ "$#" -ne 1 ]; then
   echo 'Usage: $0 "<phrase1>"' >&2

data/tracks/bash/exercises/anagram/example.sh

@@ -1,4 +1,4 @@
-#! /bin/bash
+#!/usr/bin/env bash
 
 if [ "$#" -ne 2 ]; then
   echo "Usage: $0 <string1> <string2>" >&2

data/tracks/bash/exercises/armstrong-numbers/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 isarmstrong() {
   sum=0

data/tracks/bash/exercises/atbash-cipher/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 encode () {
 	clean_string=$(echo "$1" | tr -dc '[:alnum:]\n\r' | tr '[:upper:]' '[:lower:]')

data/tracks/bash/exercises/bob/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 # Exit on error. Append || true if you expect an error.
 set -o errexit

data/tracks/bash/exercises/error-handling/example.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bash
+
 set -eu
 
 if test $# -gt 1

data/tracks/bash/exercises/gigasecond/example.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bash
+
 add='+1000000000 second'
 start="$@$add"
 

data/tracks/bash/exercises/hamming/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 if [ "$#" -ne 2 ]; then
   echo "Usage: $0 <string1> <string2>" >&2

data/tracks/bash/exercises/hello-world/example.sh

@@ -1,3 +1,3 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 echo "Hello, World!"

data/tracks/bash/exercises/leap/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 function usage() {
 	echo "Usage: leap.sh <year>" >&2

data/tracks/bash/exercises/nucleotide-count/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 input="$1";
 

data/tracks/bash/exercises/pangram/example.sh

@@ -1,4 +1,4 @@
-#! /bin/bash
+#!/usr/bin/env bash
 
 input=$1
 #delete non-letters then lowercase, count number of unique letters

data/tracks/bash/exercises/raindrops/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 function usage() {
 	echo "Usage: raindrops <number>" >&2

data/tracks/bash/exercises/reverse-string/example.sh

@@ -1,3 +1,3 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 echo $1|rev

data/tracks/bash/exercises/rna-transcription/example.sh

@@ -1,3 +1,5 @@
+#!/usr/bin/env bash
+
 declare -A trans
 trans[G]='C'
 trans[C]='G'

data/tracks/bash/exercises/roman-numerals/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 values=( 1000 900 500 400 100 90 50 40 10 9 5 4 1 )
 roman=(

data/tracks/bash/exercises/triangle/example.sh

@@ -1,4 +1,5 @@
-#!/bin/bash
+#!/usr/bin/env bash
+
 set -o errexit   # Stop script on command error
 set -o nounset   # Error out if accessing undefined variable name
 set -o pipefail  # Error out if any step in a pipe errors out
@@ -53,4 +54,4 @@ scalene() {
 # If boolean clause is false, it doesn't evaluate the other side of &&
 # If first thing is false, it evaluates the item after ||,
 # but if first two are true, doesn't bother evaluating last part.
-$triangle_type $s1 $s2 $s3 && exit 0 || exit 1
+$triangle_type $s1 $s2 $s3 && exit 0 || exit 1

data/tracks/bash/exercises/two-fer/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 if [ "$#" -eq 0 ]; then
   person="you"

data/tracks/bash/exercises/word-count/example.sh

@@ -1,4 +1,4 @@
-#!/bin/bash
+#!/usr/bin/env bash
 
 input="$1";
 
@@ -18,4 +18,4 @@ fi
 
 echo "$input" | tr '[:upper:]' '[:lower:]' | tr '.,:&@$%^!' ' ' | awk -f "${awk_progfile}";
 
-exit $?;
+exit $?;

data/tracks/clojure/config.json

@@ -9,6 +9,14 @@
       "unlocked_by": null,
       "uuid": "1378910d-9bec-4217-bd40-07a8967fa3ad"
     },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "armstrong-numbers",
+      "topics": null,
+      "unlocked_by": null,
+      "uuid": "a4bdbdfd-1db1-425c-a243-dd032dc7b93a"
+    },
     {
       "core": false,
       "difficulty": 1,

data/tracks/clojure/exercises/armstrong-numbers/README.md

@@ -0,0 +1,19 @@
+## Armstrong numbers
+
+An [Armstrong number](https://en.wikipedia.org/wiki/Narcissistic_number) is a number that is the sum of its own digits each raised to the power of the number of digits.
+
+For example:
+
+- 9 is an Armstrong number, because `9 = 9^1 = 9`
+- 10 is *not* an Armstrong number, because `10 != 1^2 + 0^2 = 2`
+- 153 is an Armstrong number, because: `153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153`
+- 154 is *not* an Armstrong number, because: `154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190`
+
+Write some code to determine whether a number is an Armstrong number.
+
+## Source
+
+See more at [wikipedia](https://en.wikipedia.org/wiki/Narcissistic_number)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/clojure/exercises/armstrong-numbers/project.clj

@@ -0,0 +1,4 @@
+(defproject armstrong-numbers "0.1.0-SNAPSHOT"
+  :description "armstrong-numbers exercise"
+  :url "https://github.com/exercism/clojure/tree/master/exercises/armstrong-numbers"
+  :dependencies [[org.clojure/clojure "1.9.0"]])

data/tracks/clojure/exercises/armstrong-numbers/src/armstrong_numbers.clj

@@ -0,0 +1,3 @@
+(ns armstrong-numbers)
+
+(defn armstrong? [n])

data/tracks/clojure/exercises/armstrong-numbers/src/example.clj

@@ -0,0 +1,6 @@
+(ns armstrong-numbers)
+
+(defn armstrong? [n]
+  (let [digits (map (comp read-string str) (str n))
+        l      (count digits)]
+    (== n (reduce + (map #(Math/pow % l) digits)))))

data/tracks/clojure/exercises/armstrong-numbers/test/armstrong_numbers_test.clj

@@ -0,0 +1,35 @@
+(ns armstrong-numbers-test
+  (:require [clojure.test :refer [deftest is testing]]
+            [armstrong-numbers :refer [armstrong?]]))
+
+(deftest armstrong-number-5
+  (testing "Single digit numbers are Armstrong numbers"
+    (is (armstrong? 5))))
+
+(deftest not-armstrong-number-10
+  (testing "There are no 2 digit Armstrong numbers"
+    (is (not (armstrong? 10)))))
+
+(deftest armstrong-number-153
+  (testing "Three digit number that is an Armstrong number"
+    (is (armstrong? 153))))
+
+(deftest not-armstrong-number-100
+  (testing "Three digit number that is an Armstrong number"
+    (is (not (armstrong? 100)))))
+
+(deftest armstrong-number-9474
+  (testing "Four digit number that is an Armstrong number"
+    (is (armstrong? 9474))))
+
+(deftest not-armstrong-number-9475
+  (testing "Four digit number that is not an Armstrong number"
+    (is (not (armstrong? 9476)))))
+
+(deftest armstrong-number-9926315
+  (testing "Seven digit number that is an Armstrong number"
+    (is (armstrong? 9926315))))
+
+(deftest not-armstrong-number-9926314
+  (testing "Seven digit number that is not an Armstrong number"
+    (is (not (armstrong? 9926314)))))

data/tracks/common-lisp/exercises/sieve/example.lisp

@@ -6,22 +6,21 @@
 (in-package #:sieve)
 
 (defun primes-to (n)
-  "List primes below `n' using sieve of Eratosthenes."
+  "List primes up to `n' using sieve of Eratosthenes."
   (loop
-     initially (when (< n 3) (return nil))
+     initially (when (< n 2) (return nil))
      with sqrtn = (1+ (isqrt n))
-     with sieve = (make-array n
-			      :element-type 'boolean
-			      :initial-element t)
+     with sieve = (make-array (1+ n)
+                              :element-type 'boolean
+                              :initial-element t)
      for maybe from 2 to sqrtn
      when (aref sieve maybe)
-     do
-       (loop
-          for multi from (* maybe maybe) below n by maybe
-          when (aref sieve multi)
-          do (setf (aref sieve multi) nil))
+     do (loop
+           for multi from (* maybe maybe) upto n by maybe
+           when (aref sieve multi)
+           do (setf (aref sieve multi) nil))
      finally (return
                (loop
-                  for index from 2 below n
+                  for index from 2 upto n
                   when (aref sieve index)
                   collect index))))

data/tracks/common-lisp/exercises/sieve/sieve-test.lisp

@@ -6,30 +6,40 @@
 
 (in-package #:sieve-test)
 
-(defparameter *primes-below-1000*
-  '(  2   3   5   7  11  13  17  19  23  29  31  37
-     41  43  47  53  59  61  67  71  73  79  83  89
-     97 101 103 107 109 113 127 131 137 139 149 151
-    157 163 167 173 179 181 191 193 197 199 211 223
-    227 229 233 239 241 251 257 263 269 271 277 281
-    283 293 307 311 313 317 331 337 347 349 353 359
-    367 373 379 383 389 397 401 409 419 421 431 433
-    439 443 449 457 461 463 467 479 487 491 499 503
-    509 521 523 541 547 557 563 569 571 577 587 593
-    599 601 607 613 617 619 631 641 643 647 653 659
-    661 673 677 683 691 701 709 719 727 733 739 743
-    751 757 761 769 773 787 797 809 811 821 823 827
-    829 839 853 857 859 863 877 881 883 887 907 911
-    919 929 937 941 947 953 967 971 977 983 991 997)
-  "List of primes below 1000")
-
-(define-test primes-below-10
+(define-test no-primes-under-two
+  (assert-equal '()
+                (sieve:primes-to 1)))
+
+(define-test find-first-prime
+  (assert-equal '(2)
+                (sieve:primes-to 2)))
+
+(define-test find-primes-up-to-10
   (assert-equal '(2 3 5 7)
                 (sieve:primes-to 10)))
 
+(define-test limit-is-prime
+  (assert-equal '(2 3 5 7 11 13)
+                (sieve:primes-to 13)))
+
 (define-test primes-below-1000
-  (assert-equal *primes-below-1000*
-                (sieve:primes-to 1000)))
+  (let ((primes-below-1000
+         '(  2   3   5   7  11  13  17  19  23  29  31  37
+           41  43  47  53  59  61  67  71  73  79  83  89
+           97 101 103 107 109 113 127 131 137 139 149 151
+           157 163 167 173 179 181 191 193 197 199 211 223
+           227 229 233 239 241 251 257 263 269 271 277 281
+           283 293 307 311 313 317 331 337 347 349 353 359
+           367 373 379 383 389 397 401 409 419 421 431 433
+           439 443 449 457 461 463 467 479 487 491 499 503
+           509 521 523 541 547 557 563 569 571 577 587 593
+           599 601 607 613 617 619 631 641 643 647 653 659
+           661 673 677 683 691 701 709 719 727 733 739 743
+           751 757 761 769 773 787 797 809 811 821 823 827
+           829 839 853 857 859 863 877 881 883 887 907 911
+           919 929 937 941 947 953 967 971 977 983 991 997)))
+    (assert-equal primes-below-1000
+                  (sieve:primes-to 1000))))
 
 #-xlisp-test
 (let ((*print-errors* t)

data/tracks/go/exercises/all-your-base/all_your_base_test.go

@@ -8,12 +8,13 @@ import (
 func TestConvertToBase(t *testing.T) {
 	for _, c := range testCases {
 		output, err := ConvertToBase(c.inputBase, c.inputDigits, c.outputBase)
-		if c.err != "" && (err == nil || c.err != err.Error()) {
-			t.Fatalf(`FAIL: %s
+		if c.err != "" {
+			if err == nil || c.err != err.Error() {
+				t.Fatalf(`FAIL: %s
 	Expected error: %s
 	Got: %v`, c.description, c.err, err)
-		}
-		if !reflect.DeepEqual(c.expected, output) {
+			}
+		} else if !reflect.DeepEqual(c.expected, output) {
 			t.Fatalf(`FAIL: %s
     Input base: %d
     Input digits: %#v

data/tracks/go/exercises/pig-latin/.meta/gen.go

@@ -0,0 +1,58 @@
+package main
+
+import (
+	"log"
+	"text/template"
+
+	"../../../gen"
+)
+
+func main() {
+	t, err := template.New("").Parse(tmpl)
+	if err != nil {
+		log.Fatal(err)
+	}
+	var j js
+	if err := gen.Gen("pig-latin", &j, t); err != nil {
+		log.Fatal(err)
+	}
+}
+
+// The JSON structure we expect to be able to unmarshal into
+type js struct {
+	Exercise string
+	Version  string
+	Cases    []oneLevel
+}
+
+// Test levels
+type oneLevel struct {
+	Description string
+	Cases       []oneCase
+}
+
+// Test cases
+type oneCase struct {
+	Description string
+	Property    string
+	Input       string
+	Expected    string
+}
+
+// Template to generate test cases.
+var tmpl = `package piglatin
+
+{{.Header}}
+
+var testCases = []struct {
+	description	string
+	input		    string
+	expected	  string
+}{ {{range .J.Cases}} {{range .Cases}}
+{
+	description:	{{printf "%q"  .Description}},
+	input:		{{printf "%#v"  .Input}},
+	expected:	{{printf "%#v"  .Expected}},
+},{{end}}{{end}}
+}
+`