trackler 2.0.3.0 → 2.0.3.1

data/tracks/coffeescript/.travis.yml

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

data/tracks/coldfusion/.travis.yml

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

data/tracks/crystal/Makefile

@@ -1,29 +1,32 @@
-ASSIGNMENT ?= ""
+EXERCISE ?= ""
 IGNOREDIRS := "^(\.git|.crystal|docs|bin|img|script)$$"
 EXERCISESDIR ?= "exercises"
 GENERATORDIR ?= "src/generator"
-ASSIGNMENTS = $(shell find exercises -maxdepth 1 -mindepth 1 -type d | cut -d'/' -f2 | sort | grep -Ev $(IGNOREDIRS))
+EXERCISES = $(shell find exercises -maxdepth 1 -mindepth 1 -type d | cut -d'/' -f2 | sort | grep -Ev $(IGNOREDIRS))
 
-FILEEXT := "cr"
+FILEEXT = "cr"
 SPECDIR = "spec"
-ASSIGNMENTNAME := "$(subst -,_,$(ASSIGNMENT))"
-EXERCISESPECDIR := $(EXERCISESDIR)/$(ASSIGNMENT)/$(SPECDIR)
-SPECFILE := "$(ASSIGNMENTNAME)_spec.$(FILEEXT)"
-TMPSPECFILE := "$(ASSIGNMENTNAME)_spec.$(FILEEXT).tmp"
+EXERCISENAME := "$(subst -,_,$(EXERCISE))"
+EXERCISEDIR := $(EXERCISESDIR)/$(EXERCISE)
+EXERCISESPECDIR := $(EXERCISEDIR)/$(SPECDIR)
+SPECFILE := "$(EXERCISENAME)_spec.$(FILEEXT)"
+SUPERTMPSPECFILE := "$(SPECFILE).super.tmp"
+TMPSPECFILE := "$(SPECFILE).tmp"
 
-test-assignment:
-	@echo "running formatting check for: $(ASSIGNMENT)"
-	@crystal tool format --check $(EXERCISESDIR)/$(ASSIGNMENT)
-	@echo "moving files around"
+test-exercise:
+	@echo "running formatting check for: $(EXERCISE)"
+	@crystal tool format --check $(EXERCISESDIR)/$(EXERCISE)
 	@sed 's/pending/it/g' $(EXERCISESPECDIR)/$(SPECFILE) > $(EXERCISESPECDIR)/$(TMPSPECFILE)
-	@rm $(EXERCISESPECDIR)/$(SPECFILE)
+	@mv $(EXERCISESPECDIR)/$(SPECFILE) $(EXERCISESPECDIR)/$(SUPERTMPSPECFILE)
 	@mv $(EXERCISESPECDIR)/$(TMPSPECFILE) $(EXERCISESPECDIR)/$(SPECFILE)
-	@echo "running tests for: $(ASSIGNMENT)"
-	@cd $(EXERCISESDIR)/$(ASSIGNMENT) && crystal spec
+	@echo "running tests for: $(EXERCISE)"
+	@cd $(EXERCISESDIR)/$(EXERCISE) && crystal spec
+	@rm $(EXERCISESPECDIR)/$(SPECFILE)
+	@mv $(EXERCISESPECDIR)/$(SUPERTMPSPECFILE) $(EXERCISESPECDIR)/$(SPECFILE)
 	@printf "\n"
 
 test:
-	@for assignment in $(ASSIGNMENTS); do ASSIGNMENT=$$assignment $(MAKE) -s test-assignment || exit 1; done
+	@for exercise in $(EXERCISES); do EXERCISE=$$exercise $(MAKE) -s test-exercise || exit 1; done
 	@echo "running generator tests"
 	@cd $(GENERATORDIR) && crystal spec
 

data/tracks/crystal/README.md

@@ -4,18 +4,18 @@ Exercism problems in Crystal.
 
 ## The Tests
 
-### All Assignments
+### All Exercises
 
-Run all assignments with:
+Run all Exercises with:
 ```bash
 $ make test
 ```
 
-### Single Assignment
+### Single Exercises
 
-Run single assignments with:
+Run single Exercises with:
 ```bash
-$ make test-assignment ASSIGNMENT=test-folder-name
+$ make test-exercise EXERCISE=exercise-name
 ```
 
 ## The Test Generator

data/tracks/crystal/config.json

@@ -65,6 +65,12 @@
       "topics": [
       ]
     },
+    {
+      "slug": "difference-of-squares",
+      "difficulty": 1,
+      "topics": [
+      ]
+    },
     {
       "slug": "pangram",
       "difficulty": 1,

data/tracks/crystal/exercises/acronym/src/acronym.cr

@@ -0,0 +1 @@
+# Please implement your solution to acronym in this file

data/tracks/crystal/exercises/anagram/src/anagram.cr

@@ -0,0 +1 @@
+# Please implement your solution to anagram in this file

data/tracks/crystal/exercises/atbash-cipher/src/atbash_cipher.cr

@@ -0,0 +1 @@
+# Please implement your solution to atbash-cipher in this file

data/tracks/crystal/exercises/binary/src/binary.cr

@@ -0,0 +1 @@
+# Please implement your solution to binary in this file

data/tracks/crystal/exercises/bob/src/bob.cr

@@ -0,0 +1 @@
+# Please implement your solution to bob in this file

data/tracks/crystal/exercises/bracket-push/src/bracket_push.cr

@@ -0,0 +1 @@
+# Please implement your solution to bracket-push in this file

data/tracks/crystal/exercises/difference-of-squares/spec/difference_of_squares_spec.cr

@@ -0,0 +1,44 @@
+require "spec"
+require "../src/*"
+
+describe "DifferenceOfSquares" do
+  it "calculates square of sum 5 is 225" do
+    Squares.square_of_sum(5).should eq(225)
+  end
+
+  it "calculates square of sum 10 is 3025" do
+    Squares.square_of_sum(10).should eq(3025)
+  end
+
+  it "calculates square of sum 100 is 25502500" do
+    Squares.square_of_sum(100).should eq(25502500)
+  end
+
+  it "calculates sum of squares 5 is 55" do
+    Squares.sum_of_squares(5).should eq(55)
+  end
+
+  it "calculates sum of squares 10 is 385" do
+    Squares.sum_of_squares(10).should eq(385)
+  end
+
+  it "calculates sum of squares 100 is 338350" do
+    Squares.sum_of_squares(100).should eq(338350)
+  end
+
+  it "calculates difference of squares 0 is 0" do
+    Squares.difference_of_squares(0).should eq(0)
+  end
+
+  it "calculates difference of squares 5 is 170" do
+    Squares.difference_of_squares(5).should eq(170)
+  end
+
+  it "calculates difference of squares 10 is 2640" do
+    Squares.difference_of_squares(10).should eq(2640)
+  end
+
+  it "calculates difference of squares 100 is 25164150" do
+    Squares.difference_of_squares(100).should eq(25164150)
+  end
+end

data/tracks/crystal/exercises/difference-of-squares/src/example.cr

@@ -0,0 +1,15 @@
+module Squares
+  extend self
+
+  def square_of_sum(num)
+    (num * (num + 1) / 2) ** 2
+  end
+
+  def sum_of_squares(num)
+    num * (num + 1) * (2 * num + 1) / 6
+  end
+
+  def difference_of_squares(num)
+    square_of_sum(num) - sum_of_squares(num)
+  end
+end

data/tracks/crystal/exercises/forth/src/forth.cr

@@ -0,0 +1 @@
+# Please implement your solution to forth in this file

data/tracks/crystal/exercises/gigasecond/src/gigasecond.cr

@@ -0,0 +1 @@
+# Please implement your solution to gigasecond in this file

data/tracks/crystal/exercises/hamming/src/hamming.cr

@@ -0,0 +1 @@
+# Please implement your solution to hamming in this file

data/tracks/crystal/exercises/hello-world/src/hello_world.cr

@@ -0,0 +1 @@
+# Please implement your solution to hello-world in this file

data/tracks/crystal/exercises/largest-series-product/src/largest_series_product.cr

@@ -0,0 +1 @@
+# Please implement your solution to largest-series-product in this file

data/tracks/crystal/exercises/leap/src/leap.cr

@@ -0,0 +1 @@
+# Please implement your solution to leap in this file

data/tracks/crystal/exercises/pangram/src/pangram.cr

@@ -0,0 +1 @@
+# Please implement your solution to pangram in this file

data/tracks/crystal/exercises/raindrops/src/raindrops.cr

@@ -0,0 +1 @@
+# Please implement your solution to raindrops in this file

data/tracks/crystal/exercises/react/src/react.cr

@@ -0,0 +1 @@
+# Please implement your solution to react in this file

data/tracks/crystal/exercises/rna-transcription/src/rna_transcription.cr

@@ -0,0 +1 @@
+# Please implement your solution to rna-transcription in this file

data/tracks/crystal/exercises/roman-numerals/src/roman_numerals.cr

@@ -0,0 +1 @@
+# Please implement your solution to roman-numerals in this file

data/tracks/crystal/exercises/sieve/src/sieve.cr

@@ -0,0 +1 @@
+# Please implement your solution to sieve in this file

data/tracks/crystal/src/generator/exercises/difference_of_squares.cr

@@ -0,0 +1,39 @@
+require "./exercise_generator"
+require "./exercise_test_case"
+
+class DifferenceOfSquaresGenerator < ExerciseGenerator
+  def exercise_name
+    "difference-of-squares"
+  end
+
+  def test_cases
+    ["square_of_sum", "sum_of_squares", "difference_of_squares"]
+      .reduce(Array(ExerciseTestCase).new) do |cases, type|
+      cases + JSON.parse(data)[type]["cases"].map do |test_case|
+        DifferenceOfSquaresTestCase.new(test_case, type)
+      end
+    end
+  end
+end
+
+class DifferenceOfSquaresTestCase < ExerciseTestCase
+  private getter number : JSON::Any
+  private getter description : JSON::Any
+  private getter expected : JSON::Any?
+  private getter type : String
+
+  def initialize(test_case, type)
+    @type = type
+    @number = test_case["number"]
+    @description = test_case["description"]
+    @expected = test_case["expected"]?
+  end
+
+  def workload
+    "Squares.#{type}(#{number}).should eq(#{expected})"
+  end
+
+  def test_name
+    "calculates #{description} is #{expected}"
+  end
+end

data/tracks/go/exercises/allergies/allergies_test.go

@@ -32,9 +32,9 @@ func TestAllergies(t *testing.T) {
 		sort.Strings(actual)
 		sort.Strings(test.expected)
 		if fmt.Sprintf("%s", actual) != fmt.Sprintf("%s", test.expected) {
-			t.Fatalf("FAIL: Allergies(%d): expected %s, actual %s", test.input, test.expected, actual)
+			t.Fatalf("FAIL: Allergies(%d): expected %q, actual %q", test.input, test.expected, actual)
 		} else {
-			t.Logf("PASS: Allergic to %v", test.expected)
+			t.Logf("PASS: Allergic to %q", test.expected)
 		}
 	}
 }

data/tracks/go/exercises/anagram/anagram_test.go

@@ -144,9 +144,9 @@ func TestDetectAnagrams(t *testing.T) {
 		if !equal(tt.expected, actual) {
 			msg := `FAIL: %s
 	Subject %s
-	Candidates %v
-	Expected %v
-	Got %v
+	Candidates %q
+	Expected %q
+	Got %q
 				`
 			t.Fatalf(msg, tt.description, tt.subject, tt.candidates, tt.expected, actual)
 		} else {

data/tracks/go/exercises/grade-school/grade_school_test.go

@@ -88,9 +88,9 @@ func TestGetGrade(t *testing.T) {
 		}
 	}
 	t.Errorf(`Get grade, got
-%v
+%q
 expected
-%v`, got, exp)
+%q`, got, exp)
 }
 
 func TestNonExistantGrade(t *testing.T) {
@@ -98,7 +98,7 @@ func TestNonExistantGrade(t *testing.T) {
 	got := s.Grade(1)
 	if len(got) != 0 {
 		t.Errorf(`Get non-existant grade, got
-%v
+%q
 expected
 []`, got)
 	}

data/tracks/go/exercises/secret-handshake/secret_handshake_test.go

@@ -35,7 +35,7 @@ func TestHandshake(t *testing.T) {
 			continue
 		}
 		if !reflect.DeepEqual(h, test.h) {
-			t.Fatalf("Handshake(%d) = %v, want %v.", test.code, h, test.h)
+			t.Fatalf("Handshake(%d) = %q, want %q.", test.code, h, test.h)
 		}
 	}
 }

data/tracks/java/config.json

@@ -50,7 +50,9 @@
     "minesweeper",
     "series",
     "robot-simulator",
-    "bracket-push"
+    "bracket-push",
+    "pythagorean-triplet",
+    "binary-search-tree"
   ],
   "exercises": [
     {
@@ -287,6 +289,16 @@
       "slug": "bracket-push",
       "difficulty": 1,
       "topics": []
+    },
+    {
+      "slug": "pythagorean-triplet",
+      "difficulty": 1,
+      "topics": []
+    },
+    {
+      "slug": "binary-search-tree",
+      "difficulty": 1,
+      "topics": []
     }
   ],
   "deprecated": [

data/tracks/java/exercises/binary-search-tree/build.gradle

@@ -0,0 +1,18 @@
+apply plugin: "java"
+apply plugin: "eclipse"
+apply plugin: "idea"
+
+repositories {
+    mavenCentral()
+}
+
+dependencies {
+    testCompile "junit:junit:4.12"
+}
+
+test {
+    testLogging {
+        exceptionFormat = 'full'
+        events = ["passed", "failed", "skipped"]
+    }
+}

data/tracks/java/exercises/binary-search-tree/src/example/java/BST.java

@@ -0,0 +1,122 @@
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Queue;
+
+public class BST<T extends Comparable<T>> {
+
+    public static class Node<T> {
+
+        private T data;
+        private Node<T> left = null;
+        private Node<T> right = null;
+
+        public Node(T data) {
+            this.data = data;
+        }
+
+        public Node<T> getLeft() {
+            return left;
+        }
+
+        public void setLeft(Node<T> left) {
+            this.left = left;
+        }
+
+        public Node<T> getRight() {
+            return right;
+        }
+
+        public void setRight(Node<T> right) {
+            this.right = right;
+        }
+
+        public T getData() {
+            return data;
+        }
+
+    }
+
+    private Node<T> root;
+
+    private int nodeCount = 0;
+
+    public void insert(T value) {
+        if (root == null) {
+            root = new Node<>(value);
+        } else {
+            this.insert(this.root, value);
+        }
+        this.nodeCount++;
+    }
+
+    public List<T> getAsSortedList() {
+        List<T> result = new ArrayList<>(this.nodeCount);
+        this.putInSortedOrderToList(this.root, result);
+        return Collections.unmodifiableList(result);
+    }
+
+    public List<T> getAsLevelOrderList() {
+        List<T> result = new ArrayList<>(this.nodeCount);
+        this.putInLevelOrderToList(this.root, result);
+        return Collections.unmodifiableList(result);
+    }
+
+    public Node<T> getRoot() {
+        return root;
+    }
+
+    private void insert(Node<T> node, T value) {
+        if (value.compareTo(node.getData()) <= 0) {
+            if (node.getLeft() == null) {
+                node.setLeft(new Node<T>(value));
+            } else {
+                insert(node.getLeft(), value);
+            }
+        } else {
+            if (node.getRight() == null) {
+                node.setRight(new Node<T>(value));
+            } else {
+                insert(node.getRight(), value);
+            }
+        }
+    }
+
+    private void putInSortedOrderToList(Node<T> node, List<T> list) {
+        if (node == null || list == null) {
+            return;
+        }
+        if (node.getLeft() != null) {
+            putInSortedOrderToList(node.getLeft(), list);
+        }
+        list.add(node.getData());
+        if (node.getRight() != null) {
+            putInSortedOrderToList(node.getRight(), list);
+        }
+    }
+
+    private void putInLevelOrderToList(Node<T> node, List<T> list) {
+        if (node == null || list == null) {
+            return;
+        }
+        final Queue<Node<T>> queue = new LinkedList<>();
+        Node<T> myNode;
+        Node<T> left;
+        Node<T> right;
+        queue.add(node);
+        while (!queue.isEmpty()) {
+            myNode = queue.poll();
+            list.add(myNode.getData());
+            left = myNode.getLeft();
+            right = myNode.getRight();
+            if (left != null) {
+                queue.add(left);
+            }
+            if (right != null) {
+                queue.add(right);
+            }
+        }
+    }
+}