trackler 2.2.1.76 → 2.2.1.77

data/tracks/bash/exercises/acronym/README.md

@@ -0,0 +1,27 @@
+# Acronym
+
+Convert a phrase to its acronym.
+
+Techies love their TLA (Three Letter Acronyms)!
+
+Help generate some jargon by writing a program that converts a long name like Portable Network Graphics to its acronym (PNG).
+
+Run the tests with:
+
+    bats whatever_test.sh
+
+## Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the solution is in the `exercism/bash/<exerciseName>` directory.
+
+For example, if you're submitting `bob.sh` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/bash/bob/bob.sh`.
+
+For more detailed information about running tests, code style and linting, please see the [help page](http://exercism.io/languages/bash).
+
+## Source
+
+Greg Horie [https://github.com/netserf](https://github.com/netserf)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+

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

@@ -0,0 +1,18 @@
+#!/bin/bash
+
+if [ "$#" -ne 1 ]; then
+  echo 'Usage: $0 "<phrase1>"' >&2
+  exit 1
+fi
+
+phrase=`echo $1 | tr '-' ' '`
+set -f -- junk $phrase
+shift
+for word; do
+    initial="$(echo $word | head -c 1 | tr '[:lower:]' '[:upper:]')"
+    acronym+=$initial
+    #echo "[$word] [$initial] [$acronym]"
+done
+echo $acronym
+
+exit 0

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

@@ -0,0 +1,43 @@
+#!/usr/bin/env bats
+
+@test "basic" {
+    # skip
+    run bash acronym.sh "Portable Network Graphics"
+    [ "$status" -eq 0 ]
+    [ "$output" = "PNG" ]
+}
+
+@test "lowercase words" {
+    skip
+    run bash acronym.sh "Ruby on Rails"
+    [ "$status" -eq 0 ]
+    [ "$output" = "ROR" ]
+}
+
+@test "punctuation" {
+    skip
+    run bash acronym.sh "First In, First Out"
+    [ "$status" -eq 0 ]
+    [ "$output" = "FIFO" ]
+}
+
+@test "all caps words" {
+    skip
+    run bash acronym.sh "PHP: Hypertext Preprocessor"
+    [ "$status" -eq 0 ]
+    [ "$output" = "PHP" ]
+}
+
+@test "non-acronym all caps word" {
+    skip
+    run bash acronym.sh "GNU Image Manipulation Program"
+    [ "$status" -eq 0 ]
+    [ "$output" = "GIMP" ]
+}
+
+@test "hyphenated" {
+    skip
+    run bash acronym.sh "Complementary metal-oxide semiconductor"
+    [ "$status" -eq 0 ]
+    [ "$output" = "CMOS" ]
+}

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

@@ -0,0 +1,18 @@
+#!/bin/bash
+
+if [ "$#" -ne 1 ]; then
+  echo 'Usage: $0 "<phrase1>"' >&2
+  exit 1
+fi
+
+phrase=`echo $1 | tr '-' ' '`
+set -f -- junk $phrase
+shift
+for word; do
+    initial="$(echo $word | head -c 1 | tr '[:lower:]' '[:upper:]')"
+    acronym+=$initial
+    #echo "[$word] [$initial] [$acronym]"
+done
+echo $acronym
+
+exit 0

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

@@ -0,0 +1,20 @@
+# 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
+
+[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/bash/exercises/armstrong-numbers/armstrong_numbers_test.sh

@@ -0,0 +1,58 @@
+#!/usr/bin/env bats
+
+@test 'Single digits are armstrong numbers' {
+  #skip
+  run ./armstrong_numbers.sh isarmstrong 5
+
+  [ "$status" -eq 0 ]
+}
+
+@test 'There are no two digit armstrong numbers' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 10
+
+  [ "$status" -eq 1 ]
+}
+
+@test 'A three digit number that is an armstrong number' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 153
+
+  [ "$status" -eq 0 ]
+}
+
+@test 'A three digit number that is not an armstrong number' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 100 
+
+  [ "$status" -eq 1 ]
+}
+
+@test 'A four digit number that is an armstrong number' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 9475 
+
+  [ "$status" -eq 0 ]
+}
+
+@test 'A four digit number that is not an armstrong number' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 9475 
+
+  [ "$status" -eq 1 ]
+}
+
+@test 'A seven digit number that is an armstrong number' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 9926315 
+
+  [ "$status" -eq 0 ]
+}
+
+@test 'A seven digit number that is not an armstrong number' {
+  skip
+  run ./armstrong_numbers.sh isarmstrong 9926314 
+
+  [ "$status" -eq 1 ]
+}
+

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

@@ -0,0 +1,19 @@
+#!/bin/bash
+
+isarmstrong() {
+  sum=0
+  item=$1
+  while [ $item -ne 0 ]
+  do
+    rem=`expr $item % 10`
+    cube=`expr $rem \* $rem \* $rem`
+    sum=`expr $sum + $cube`
+    item=`expr $item / 10`
+  done
+  if [ $sum -eq $num ]
+  then
+    return 0
+  else
+    return 1
+  fi
+}

data/tracks/clojure/config.json

@@ -9,6 +9,14 @@
       "unlocked_by": null,
       "uuid": "1378910d-9bec-4217-bd40-07a8967fa3ad"
     },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "two-fer",
+      "topics": null,
+      "unlocked_by": null,
+      "uuid": "91a1f32c-0dac-4c65-8a13-49da90d21520"
+    },
     {
       "core": false,
       "difficulty": 1,

data/tracks/clojure/exercises/two-fer/README.md

@@ -0,0 +1,19 @@
+# Two-fer
+
+`Two-fer` or `2-fer` is short for two for one. One for you and one for me.
+
+```text
+"One for X, one for me."
+```
+
+When X is a name or "you".
+
+If the given name is "Alice", the result should be "One for Alice, one for me."
+If no name is given, the result should be "One for you, one for me."
+
+## Source
+
+This is an exercise to introduce users to basic programming constructs, just after hello World. [http://en.wikipedia.org/wiki/Two-fer](http://en.wikipedia.org/wiki/Two-fer)
+
+## 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/two-fer/project.clj

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

data/tracks/clojure/exercises/two-fer/src/example.clj

@@ -0,0 +1,5 @@
+(ns two-fer)
+
+(defn two-fer 
+  ([] (str "One for you, one for me."))
+  ([name] (str "One for " name ", one for me.")))

data/tracks/clojure/exercises/two-fer/src/two_fer.clj

@@ -0,0 +1,5 @@
+(ns two-fer)
+
+(defn two-fer [] ;; <- arglist goes here
+  ;; your code goes here
+)

data/tracks/clojure/exercises/two-fer/test/two_fer_test.clj

@@ -0,0 +1,12 @@
+(ns two-fer-test
+  (:require [clojure.test :refer [deftest is]]
+            two-fer))
+
+(deftest two-fer-test
+  (is (= "One for you, one for me." (two-fer/two-fer))))
+
+(deftest name-alice-test
+  (is (= "One for Alice, one for me." (two-fer/two-fer "Alice"))))
+
+(deftest name-bob-test
+  (is (= "One for Bob, one for me." (two-fer/two-fer "Bob"))))

data/tracks/common-lisp/docs/INSTALLATION.md

@@ -1,3 +1,29 @@
+*What's needed*
+
+The basic items needed for developing in Common Lisp are:
+
+- A Lisp "Implementation", which will allow you to compile and execute code, as well as supply a REPL.
+- A Text editor with facilities for Lisp code. 
+- (Nice to have) The often-used reference for the Common Lisp language, the "Common Lisp Hyperspec", available online [here](http://www.lispworks.com/documentation/HyperSpec/Front/Contents.htm)
+
+*Fast Start*
+
+Newbies to CL, particularly ones with previous experience with Emacs, can get an easy & quick start by installing Portacle, the Portable Common Lisp Environment. Free and full featured, it works in all common platforms and comes pre-configured "out of the box". This will supply:
+
+- A Lisp implementation: SBCL, including Quicklisp and ASDF.
+- A Text editor: Emacs
+... with lots of add-ons for writing with Lisp code: 
+- SLIME, the "Superior Lisp Interaction Mode for Emacs" turns Emacs into a Common Lisp IDE
+- ParEdit, which makes working with parentheses easy. 
+
+Everything comes already configured out of the box. Install Portacle by downloading from the [front page](https://portacle.github.io/)
+
+Note: Emacs (text editor) can be disorienting at first, if you're not accustomed to it. Fortunately there are many primers on Emacs and SLIME available online. 
+
+*Traditional Start*
+
+If you prefer installing components separately, besides installing your favorite editor for Lisp code, these would be the steps:
+
 Install a lisp implementation such as [SBCL](http://www.sbcl.org/)
 or [CLisp](http://clisp.org/). Both can be installed via Homebrew on
 Mac OS X.

data/tracks/go/exercises/kindergarten-garden/kindergarten_garden_test.go

@@ -181,7 +181,7 @@ RVGCCGCV`
 	tf := func(g *Garden, n int, child string, expPlants []string) {
 		switch plants, ok := g.Plants(child); {
 		case !ok:
-			t.Skip("Garden %d lookup %s returned ok = false, want true.",
+			t.Skipf("Garden %d lookup %s returned ok = false, want true.",
 				n, child)
 		case !reflect.DeepEqual(plants, expPlants):
 			t.Fatalf("Garden %d lookup %s = %q, want %q.",

data/tracks/go/exercises/reverse-string/reverse_string_test.go

@@ -23,3 +23,11 @@ func TestReverseOfReverse(t *testing.T) {
 		t.Fatal(err)
 	}
 }
+
+func BenchmarkReverse(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, test := range testCases {
+			String(test.input)
+		}
+	}
+}

data/tracks/java/config.json

@@ -25,25 +25,24 @@
     },
     {
       "core": false,
-      "difficulty": 6,
-      "slug": "parallel-letter-frequency",
+      "difficulty": 1,
+      "slug": "reverse-string",
       "topics": [
-        "concurrency",
-        "maps",
         "strings"
       ],
-      "unlocked_by": "hamming",
-      "uuid": "38a405e8-619d-400f-b53c-2f06461fdf9d"
+      "unlocked_by": "two-fer",
+      "uuid": "2c8afeed-480e-41f3-ad58-590fa8f88029"
     },
     {
       "core": false,
-      "difficulty": 1,
-      "slug": "reverse-string",
+      "difficulty": 2,
+      "slug": "armstrong-numbers",
       "topics": [
-        "strings"
+        "integers",
+        "mathematics"
       ],
-      "unlocked_by": "two-fer",
-      "uuid": "2c8afeed-480e-41f3-ad58-590fa8f88029"
+      "unlocked_by": null,
+      "uuid": "8e1dd48c-e05e-4a72-bf0f-5aed8dd123f5"
     },
     {
       "core": false,
@@ -201,6 +200,18 @@
       "unlocked_by": "rna-transcription",
       "uuid": "331073b3-bd1a-4868-b767-a64ce9fd9d97"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "proverb",
+      "topics": [
+        "arrays",
+        "loops",
+        "strings"
+      ],
+      "unlocked_by": "two-fer",
+      "uuid": "9906491b-a638-408d-86a4-4ad320a92658"
+    },
     {
       "core": false,
       "difficulty": 4,
@@ -851,6 +862,18 @@
       "unlocked_by": "matrix",
       "uuid": "486d342e-c834-40fc-b691-a4dab3f790da"
     },
+    {
+      "core": false,
+      "difficulty": 6,
+      "slug": "parallel-letter-frequency",
+      "topics": [
+        "concurrency",
+        "maps",
+        "strings"
+      ],
+      "unlocked_by": "bank-account",
+      "uuid": "38a405e8-619d-400f-b53c-2f06461fdf9d"
+    },
     {
       "core": false,
       "difficulty": 7,

data/tracks/java/exercises/armstrong-numbers/.meta/src/reference/java/ArmstrongNumbers.java

@@ -0,0 +1,20 @@
+import static java.lang.Math.pow;
+
+class ArmstrongNumbers {
+
+	boolean isArmstrongNumber(int numberToCheck) {
+		
+		int number = numberToCheck;
+		int calculation = 0;
+		int length = String.valueOf(number).length();
+
+		while (number > 0) {
+    		calculation += pow((number % 10), length);
+    		number = number / 10;
+		}
+
+		return numberToCheck == calculation;
+
+	}
+
+}

data/tracks/java/exercises/armstrong-numbers/.meta/version

@@ -0,0 +1 @@
+1.0.0

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

@@ -0,0 +1,30 @@
+# 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.
+
+# Running the tests
+
+You can run all the tests for an exercise by entering
+
+```sh
+$ gradle test
+```
+
+in your terminal.
+
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Narcissistic_number](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.