trackler 2.2.1.47 → 2.2.1.48

data/tracks/java/exercises/binary-search/.meta/hints.md

@@ -0,0 +1,25 @@
+This exercise introduces [generics](https://docs.oracle.com/javase/tutorial/java/generics/index.html).
+To make the tests pass you need to construct your class such that it accepts any type of input, e.g. `Integer` or `String`.
+
+Generics are useful because they allow you to write more general and reusable code.
+The Java [List](https://docs.oracle.com/javase/8/docs/api/java/util/List.html) and [Map](https://docs.oracle.com/javase/8/docs/api/java/util/Map.html) implementations are both examples of classes that use generics.
+By using them you can construct a `List` containing `Integers` or a list containing `Strings` or any other type.
+
+There are a few constraints on the types used in generics.
+One of them is that once you've constructed a `List` containing `Integers`, you can't put `Strings` into it.
+You have to specify which type you want to put into the class when you construct it, and that instance can then only be used with that type.
+
+For example you could construct a list of `Integers`:
+
+`List<Integer> someList = new LinkedList<>();`
+
+Now `someList` can only contain `Integers`. You could also do:
+
+`List<String> someOtherList = new LinkedList<>()`
+
+Now `someOtherList` can only contain `Strings`.
+
+Another constraint is that any type used with generics cannot be a [primitive type](https://docs.oracle.com/javase/tutorial/java/nutsandbolts/datatypes.html), such as `int` or `long`.
+However, every primitive type has a corresponding reference type, so instead of `int` you can use [`Integer`](https://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html) and instead of `long` you can use [`Long`](https://docs.oracle.com/javase/8/docs/api/java/lang/Long.html).
+
+It can help to look at an [example use case of generics](https://docs.oracle.com/javase/tutorial/java/generics/types.html) to get you started.

data/tracks/java/exercises/binary-search/.meta/src/reference/java/BinarySearch.java

@@ -1,24 +1,20 @@
 
 import java.util.List;
 
-public class BinarySearch<T extends Comparable<T>> {
+class BinarySearch<T extends Comparable<T>> {
 
     private List<T> array;
     private int arraySize;
 
-    public BinarySearch(List<T> array) {
+    BinarySearch(List<T> array) {
         this.array = array;
         this.arraySize = array.size();
     }
 
-    public int indexOf(T value) {
+    int indexOf(T value) {
         return search(value);
     }
 
-    public List<T> getArray() {
-        return array;
-    }
-
     private int search(T value) {
         int left = 0;
         int right = this.arraySize - 1;

data/tracks/java/exercises/binary-search/README.md

@@ -34,19 +34,49 @@ A binary search halves the number of items to check with each iteration,
 so locating an item (or determining its absence) takes logarithmic time.
 A binary search is a dichotomic divide and conquer search algorithm.
 
+# Java Tips
 
-To run the tests:
+This exercise introduces [generics](https://docs.oracle.com/javase/tutorial/java/generics/index.html).
+To make the tests pass you need to construct your class such that it accepts any type of input, e.g. `Integer` or `String`.
+
+Generics are useful because they allow you to write more general and reusable code.
+The Java [List](https://docs.oracle.com/javase/8/docs/api/java/util/List.html) and [Map](https://docs.oracle.com/javase/8/docs/api/java/util/Map.html) implementations are both examples of classes that use generics.
+By using them you can construct a `List` containing `Integers` or a list containing `Strings` or any other type.
+
+There are a few constraints on the types used in generics.
+One of them is that once you've constructed a `List` containing `Integers`, you can't put `Strings` into it.
+You have to specify which type you want to put into the class when you construct it, and that instance can then only be used with that type.
+
+For example you could construct a list of `Integers`:
+
+`List<Integer> someList = new LinkedList<>();`
+
+Now `someList` can only contain `Integers`. You could also do:
+
+`List<String> someOtherList = new LinkedList<>()`
+
+Now `someOtherList` can only contain `Strings`.
+
+Another constraint is that any type used with generics cannot be a [primitive type](https://docs.oracle.com/javase/tutorial/java/nutsandbolts/datatypes.html), such as `int` or `long`.
+However, every primitive type has a corresponding reference type, so instead of `int` you can use [`Integer`](https://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html) and instead of `long` you can use [`Long`](https://docs.oracle.com/javase/8/docs/api/java/lang/Long.html).
+
+It can help to look at an [example use case of generics](https://docs.oracle.com/javase/tutorial/java/generics/types.html) to get you started.
+
+
+# Running the tests
+
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Wikipedia [http://en.wikipedia.org/wiki/Binary_search_algorithm](http://en.wikipedia.org/wiki/Binary_search_algorithm)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/binary-search/src/test/java/BinarySearchTest.java

@@ -13,23 +13,23 @@ public class BinarySearchTest {
 
     @Test
     public void findsAValueInAnArrayWithOneElement() {
-        List<Integer> listOfUnitLength = Collections.singletonList(6);
+        List<Character> listOfUnitLength = Collections.singletonList('6');
 
-        BinarySearch<Integer> search = new BinarySearch<>(listOfUnitLength);
+        BinarySearch<Character> search = new BinarySearch<>(listOfUnitLength);
 
-        assertEquals(0, search.indexOf(6));
+        assertEquals(0, search.indexOf('6'));
     }
 
     @Ignore("Remove to run test")
     @Test
     public void findsAValueInTheMiddleOfAnArray() {
-        List<Integer> sortedList = Collections.unmodifiableList(
-                Arrays.asList(1, 3, 4, 6, 8, 9, 11)
+        List<String> sortedList = Collections.unmodifiableList(
+                Arrays.asList("1", "3", "4", "6", "8", "9", "11")
         );
 
-        BinarySearch<Integer> search = new BinarySearch<>(sortedList);
+        BinarySearch<String> search = new BinarySearch<>(sortedList);
 
-        assertEquals(3, search.indexOf(6));
+        assertEquals(3, search.indexOf("6"));
     }
 
     @Ignore("Remove to run test")
@@ -83,13 +83,13 @@ public class BinarySearchTest {
     @Ignore("Remove to run test")
     @Test
     public void identifiesThatAValueIsNotIncludedInTheArray() {
-        List<Integer> sortedList = Collections.unmodifiableList(
-                Arrays.asList(1, 3, 4, 6, 8, 9, 11)
+        List<String> sortedList = Collections.unmodifiableList(
+                Arrays.asList("1", "3", "4", "6", "8", "9", "11")
         );
 
-        BinarySearch<Integer> search = new BinarySearch<>(sortedList);
+        BinarySearch<String> search = new BinarySearch<>(sortedList);
 
-        assertEquals(-1, search.indexOf(7));
+        assertEquals(-1, search.indexOf("7"));
     }
 
     @Ignore("Remove to run test")

data/tracks/java/exercises/binary/README.md

@@ -30,19 +30,20 @@ Binary is similar, but uses powers of 2 rather than powers of 10.
 
 So: `101 => 1*2^2 + 0*2^1 + 1*2^0 => 1*4 + 0*2 + 1*1 => 4 + 1 => 5 base 10`.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 All of Computer Science [http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-](http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/bob/README.md

@@ -11,19 +11,20 @@ anything.
 
 He answers 'Whatever.' to anything else.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=06](http://pine.fm/LearnToProgram/?Chapter=06)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/book-store/README.md

@@ -67,19 +67,20 @@ For a total of $51.20
 
 And $51.20 is the price with the biggest discount.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Inspired by the harry potter kata from Cyber-Dojo. [http://cyber-dojo.org](http://cyber-dojo.org)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/bowling/README.md

@@ -60,19 +60,20 @@ support two operations:
 * `score() : int` is called only at the very end of the game.  It
   returns the total score for that game.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 The Bowling Game Kata at but UncleBob [http://butunclebob.com/ArticleS.UncleBob.TheBowlingGameKata](http://butunclebob.com/ArticleS.UncleBob.TheBowlingGameKata)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/bracket-push/README.md

@@ -3,19 +3,20 @@
 Given a string containing brackets `[]`, braces `{}` and parentheses `()`,
 verify that all the pairs are matched and nested correctly.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Ginna Baker
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/change/README.md

@@ -16,19 +16,20 @@ that the sum of the coins' value would equal the correct amount of change.
 - Can you ask for negative change?
 - Can you ask for a change value smaller than the smallest coin value?
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Software Craftsmanship - Coin Change Kata [https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata](https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/circular-buffer/README.md

@@ -50,19 +50,20 @@ the buffer is once again full.
 
     [D][7][8][9][A][B][C]
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Wikipedia [http://en.wikipedia.org/wiki/Circular_buffer](http://en.wikipedia.org/wiki/Circular_buffer)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/clock/README.md

@@ -6,24 +6,27 @@ You should be able to add and subtract minutes to it.
 
 Two clocks that represent the same time should be equal to each other.
 
+# Java Tips
+
 In order to satisfy the requirement that two clocks are considered equal just when they are set to the same time, you will need to override the [`equals`](https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#equals(java.lang.Object)) and [`hashcode`](https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#hashCode) methods in your `Clock` class.
  
 For more information on how to override these methods, see [this JavaWorld article](https://web.archive.org/web/20170528222153/http://www.javaworld.com/article/2072762/java-app-dev/object-equality.html).
 
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Pairing session with Erin Drummond [https://twitter.com/ebdrummond](https://twitter.com/ebdrummond)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/exercises/collatz-conjecture/README.md

@@ -26,19 +26,20 @@ Starting with n = 12, the steps would be as follows:
 
 Resulting in 9 steps. So for input n = 12, the return value would be 9.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 An unsolved problem in mathematics named after mathematician Lothar Collatz [https://en.wikipedia.org/wiki/3x_%2B_1_problem](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -31,19 +31,20 @@ Implement the following operations:
 
 Assume the programming language you are using does not have an implementation of complex numbers.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## Source
 
 Wikipedia [https://en.wikipedia.org/wiki/Complex_number](https://en.wikipedia.org/wiki/Complex_number)
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -69,19 +69,20 @@ aohghn
 sseoau
 ```
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 ## 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/java/exercises/custom-set/README.md

@@ -7,16 +7,17 @@ type, like a set. In this exercise you will define your own set. How it
 works internally doesn't matter, as long as it behaves like a set of
 unique elements.
 
+# Running the tests
 
-To run the tests:
+You can run all the tests for an exercise by entering
 
 ```sh
 $ gradle test
 ```
 
-For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
-
+in your terminal.
 
 
 ## Submitting Incomplete Solutions
+
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.