trackler 2.2.1.71 → 2.2.1.72

data/tracks/groovy/exercises/linked-list/README.md

@@ -0,0 +1,49 @@
+# Linked List
+
+Implement a doubly linked list.
+
+Like an array, a linked list is a simple linear data structure. Several
+common data types can be implemented using linked lists, like queues,
+stacks, and associative arrays.
+
+A linked list is a collection of data elements called *nodes*. In a
+*singly linked list* each node holds a value and a link to the next node.
+In a *doubly linked list* each node also holds a link to the previous
+node.
+
+You will write an implementation of a doubly linked list. Implement a
+Node to hold a value and pointers to the next and previous nodes. Then
+implement a List which holds references to the first and last node and
+offers an array-like interface for adding and removing items:
+
+* `push` (*insert value at back*);
+* `pop` (*remove value at back*);
+* `shift` (*remove value at front*).
+* `unshift` (*insert value at front*);
+
+To keep your implementation simple, the tests will not cover error
+conditions. Specifically: `pop` or `shift` will never be called on an
+empty list.
+
+If you want to know more about linked lists, check [Wikipedia](https://en.wikipedia.org/wiki/Linked_list).
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/groovy).
+
+# Running the tests
+
+You can run all the tests for an exercise by entering
+
+```
+$ groovy ./LinkedListSpec.groovy
+```
+
+in your terminal.
+
+## Source
+
+Classic computer science topic
+
+## Submitting Incomplete Solutions
+
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/bin/run-journey-test-from-ci.sh

@@ -17,7 +17,7 @@ for file in $modded_files
   do if [[ $file == exercises* ]] || [[ $file == config.json ]]
     then
     for file2 in $modded_files
-      do if [[ $file2 == exercises* ]]
+      do if [[ $file2 == exercises* ]] && [[ $file2 != exercises/settings.gradle ]]
         then modded_exercise=${file2#exercises/}
         modded_exercise=${modded_exercise%%/*}
         if [[ $last_modded_exercise != $modded_exercise ]]

data/tracks/java/config.json

@@ -23,6 +23,16 @@
       "unlocked_by": null,
       "uuid": "74515d45-565b-4be2-96c4-77e58efa9257"
     },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "reverse-string",
+      "topics": [
+        "strings"
+      ],
+      "unlocked_by": "two-fer",
+      "uuid": "2c8afeed-480e-41f3-ad58-590fa8f88029"
+    },
     {
       "core": false,
       "difficulty": 2,

data/tracks/java/config/maintainers.json

@@ -53,6 +53,13 @@
       "github_username": "FridaTveit",
       "name": "Frida Johanne Tveit",
       "show_on_website": true
+    },
+    {
+      "alumnus": false,
+      "bio": "I am a software developer and consultant working for Black Pepper Software, a software company based in Leamington Spa, England. I'm a recent Computer Science graduate from the University of Warwick, and love all things to do with computers!",
+      "github_username": "sjwarner-bp",
+      "name": "Sam Warner",
+      "show_on_website": true
     }
   ]
-}
+}

data/tracks/java/docs/MAINTAINING.md

@@ -23,9 +23,9 @@ As a maintainer, you have write access to several repositories.  "write access"
 
 ## Maintainer Guides
 
-- **[exercism.io/docs/maintaining-a-track.md](https://github.com/exercism/exercism.io/blob/master/docs/maintaining-a-track.md)**
-- [exercism.io/docs/getting-involved-in-a-track.md](https://github.com/exercism/exercism.io/blob/master/docs/getting-involved-in-a-track.md)
-- [exercism.io/docs/reviewing-a-pull-request.md](https://github.com/exercism/exercism.io/blob/master/docs/reviewing-a-pull-request.md)
+- **[docs/maintaining-a-track/README.md](https://github.com/exercism/docs/blob/master/maintaining-a-track/README.md)**
+- [docs/contributing-to-language-tracks/README.md](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md)
+- [docs/you-can-help/review-pull-requests.md](https://github.com/exercism/docs/blob/master/you-can-help/review-pull-requests.md)
 
 ## Miscellaneous
 

data/tracks/java/exercises/accumulate/.meta/src/reference/java/Accumulate.java

@@ -2,9 +2,9 @@ import java.util.ArrayList;
 import java.util.List;
 import java.util.function.Function;
 
-public class Accumulate {
+class Accumulate {
 
-	public static <T> List<T> accumulate(List<T> collection, Function<T, T> function) {
+	static <T> List<T> accumulate(List<T> collection, Function<T, T> function) {
 		List<T> newCollection = new ArrayList<>();
 
 		for (T item : collection) {

data/tracks/java/exercises/binary/.meta/src/reference/java/Binary.java

@@ -1,14 +1,14 @@
-public class Binary {
+class Binary {
 
     private String binary;
     private int decimal;
 
-    public Binary(String binary) {
+    Binary(String binary) {
         this.binary = binary;
         this.decimal = getDecimalFromBinary(binary);
     }
 
-    public int getDecimal() {
+    int getDecimal() {
         return decimal;
     }
 

data/tracks/java/exercises/circular-buffer/.meta/src/reference/java/BufferIOException.java

@@ -1,4 +1,4 @@
-public class BufferIOException extends Exception {
+class BufferIOException extends Exception {
 
     BufferIOException(String message) {
         super(message);

data/tracks/java/exercises/circular-buffer/.meta/src/reference/java/CircularBuffer.java

@@ -1,17 +1,17 @@
 import java.util.LinkedList;
 import java.util.Queue;
 
-public class CircularBuffer<T> {
+class CircularBuffer<T> {
 
     private Queue<T> buffer;
     private int capacity;
 
-    public CircularBuffer(int size) {
+    CircularBuffer(int size) {
         this.buffer = new LinkedList<>();
         this.capacity = size;
     }
 
-    public T read() throws BufferIOException {
+    T read() throws BufferIOException {
         if (this.buffer.size() == 0) {
             throw new BufferIOException("Tried to read from empty buffer");
         }
@@ -19,14 +19,14 @@ public class CircularBuffer<T> {
         return this.buffer.remove();
     }
 
-    public void write(T data) throws BufferIOException {
+    void write(T data) throws BufferIOException {
         if (this.buffer.size() == this.capacity) {
             throw new BufferIOException("Tried to write to full buffer");
         }
 
         this.buffer.add(data);
     }
-    public void overwrite(T data) {
+    void overwrite(T data) {
         if (this.buffer.size() == this.capacity) {
             this.buffer.remove();
         }
@@ -34,7 +34,7 @@ public class CircularBuffer<T> {
         this.buffer.add(data);
     }
 
-    public void clear() {
+    void clear() {
         this.buffer.clear();
     }
 }

data/tracks/java/exercises/circular-buffer/src/main/java/BufferIOException.java

@@ -1,4 +1,4 @@
-public class BufferIOException extends Exception {
+class BufferIOException extends Exception {
 
     BufferIOException(String message) {
         super(message);

data/tracks/java/exercises/clock/.meta/src/reference/java/Clock.java

@@ -1,17 +1,17 @@
-public class Clock {
+class Clock {
     private static final int MINUTES_IN_AN_HOUR = 60;
     private static final int HOURS_IN_A_DAY = 24;
 
     private int hours;
     private int minutes;
 
-    public Clock(int hours, int minutes) {
+    Clock(int hours, int minutes) {
         this.hours = hours;
         this.minutes = minutes;
         sanitiseTime();
     }
 
-    public void add(int minutes) {
+    void add(int minutes) {
         this.minutes += minutes;
         sanitiseTime();
     }

data/tracks/java/exercises/crypto-square/.meta/src/reference/java/Crypto.java

@@ -1,21 +1,21 @@
 import java.util.ArrayList;
 import java.util.List;
 
-public class Crypto {
+class Crypto {
 
     private String normalizedPlaintext;
     private int squareSize;
 
-    public Crypto(String text) {
+    Crypto(String text) {
         this.normalizedPlaintext = normalizeText(text);
         this.squareSize = calculateSquareSize(normalizedPlaintext);
     }
 
-    public String getNormalizedPlaintext() {
+    String getNormalizedPlaintext() {
         return normalizedPlaintext;
     }
 
-    public int getSquareSize() {
+    int getSquareSize() {
         return squareSize;
     }
 
@@ -30,7 +30,7 @@ public class Crypto {
         return (int) Math.ceil(Math.sqrt(text.length()));
     }
 
-    public List<String> getPlaintextSegments() {
+    List<String> getPlaintextSegments() {
         return getSegmentText(normalizedPlaintext, squareSize);
     }
 
@@ -50,11 +50,11 @@ public class Crypto {
         return segments;
     }
 
-    public String getCipherText() {
+    String getCipherText() {
         return getNormalizedCipherText().replaceAll("\\s", "");
     }
 
-    public String getNormalizedCipherText() {
+    String getNormalizedCipherText() {
         StringBuilder cipherText = new StringBuilder(normalizedPlaintext.length());
 
         for (int index = 0; index < squareSize; index++) {

data/tracks/java/exercises/etl/.meta/src/reference/java/Etl.java

@@ -2,8 +2,8 @@ import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 
-public class Etl {
-    public Map<String, Integer> transform(Map<Integer, List<String>> old) {
+class Etl {
+    Map<String, Integer> transform(Map<Integer, List<String>> old) {
         final Map<String, Integer> result = new HashMap<String, Integer>();
         for (Map.Entry<Integer, List<String>> e : old.entrySet()) {
             for (String s : e.getValue()) {

data/tracks/java/exercises/etl/src/main/java/Etl.java

@@ -1,8 +1,8 @@
 import java.util.List;
 import java.util.Map;
 
-public class Etl {
-    public Map<String, Integer> transform(Map<Integer, List<String>> old) {
+class Etl {
+    Map<String, Integer> transform(Map<Integer, List<String>> old) {
         throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
     }
 }

data/tracks/java/exercises/kindergarten-garden/.meta/src/reference/java/KindergartenGarden.java

@@ -3,7 +3,7 @@ import java.util.List;
 import java.util.ArrayList;
 
 
-public class KindergartenGarden {
+class KindergartenGarden {
     private String[] students;
     private String garden;
     private static final int PLANTS_PER_STUDENT_PER_ROW = 2;
@@ -15,18 +15,18 @@ public class KindergartenGarden {
             "Ileana", "Joseph", "Kincaid", "Larry"
     };
 
-    public KindergartenGarden(String garden, String[] students) {
+    KindergartenGarden(String garden, String[] students) {
         this.garden = garden;
         Arrays.sort(students);
         this.students = students;
         newRowLocation = garden.indexOf('\n') + 1;
     }
 
-    public KindergartenGarden(String garden) {
+    KindergartenGarden(String garden) {
         this(garden, DEFAULT_STUDENTS);
     }
 
-    public List<Plant> getPlantsOfStudent(String student) {
+    List<Plant> getPlantsOfStudent(String student) {
         List<Plant> plants = new ArrayList<Plant>();
         int studentPlantsIndex = Arrays.binarySearch(students, student) * PLANTS_PER_STUDENT_PER_ROW;
 

data/tracks/java/exercises/kindergarten-garden/.meta/src/reference/java/Plant.java

@@ -1,10 +1,10 @@
-public enum Plant {
+enum Plant {
     VIOLETS,
     RADISHES,
     CLOVER,
     GRASS;
 
-    public static Plant getPlant(char plantCode) {
+    static Plant getPlant(char plantCode) {
         switch (plantCode) {
             case 'G':
                 return GRASS;

data/tracks/java/exercises/kindergarten-garden/src/main/java/Plant.java

@@ -1,10 +1,10 @@
-public enum Plant {
+enum Plant {
     VIOLETS,
     RADISHES,
     CLOVER,
     GRASS;
 
-    public static Plant getPlant(char plantCode) {
+    static Plant getPlant(char plantCode) {
         switch (plantCode) {
             case 'G':
                 return GRASS;

data/tracks/java/exercises/nth-prime/.meta/src/reference/java/PrimeCalculator.java

@@ -1,7 +1,7 @@
 import java.util.stream.IntStream;
 
-public final class PrimeCalculator {
-    public int nth(int nth) {
+final class PrimeCalculator {
+    int nth(int nth) {
         if (nth < 1) {
             throw new IllegalArgumentException();
         }

data/tracks/java/exercises/reverse-string/.meta/src/reference/java/ReverseString.java

@@ -0,0 +1,7 @@
+class ReverseString {
+  
+    String reverse(String inputString) {
+        return new StringBuffer(inputString).reverse().toString();
+    }
+  
+}

data/tracks/java/exercises/reverse-string/.meta/version

@@ -0,0 +1 @@
+1.0.1

data/tracks/java/exercises/reverse-string/README.md

@@ -0,0 +1,25 @@
+# reverse-string
+
+Reverse a string
+
+For example:
+input: "cool"
+output: "looc"
+
+# Running the tests
+
+You can run all the tests for an exercise by entering
+
+```sh
+$ gradle test
+```
+
+in your terminal.
+
+## Source
+
+Introductory challenge to reverse an input string [https://medium.freecodecamp.org/how-to-reverse-a-string-in-javascript-in-3-different-ways-75e4763c68cb](https://medium.freecodecamp.org/how-to-reverse-a-string-in-javascript-in-3-different-ways-75e4763c68cb)
+
+## 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/reverse-string/build.gradle

@@ -0,0 +1,17 @@
+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/reverse-string/src/main/java/ReverseString.java

@@ -0,0 +1,7 @@
+class ReverseString {
+  
+    String reverse() {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+  
+}

data/tracks/java/exercises/reverse-string/src/test/java/ReverseStringTest.java

@@ -0,0 +1,37 @@
+import org.junit.Ignore;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class ReverseStringTest {
+
+    @Test
+    public void testAnEmptyString() {
+        assertEquals("", new ReverseString().reverse(""));
+    }
+
+    @Ignore("Remove to run test")
+    @Test
+    public void testAWord() {
+        assertEquals("tobor", new ReverseString().reverse("robot"));
+    }
+
+    @Ignore("Remove to run test")
+    @Test
+    public void testACapitalizedWord() {
+        assertEquals("nemaR", new ReverseString().reverse("Ramen"));
+    }
+
+    @Ignore("Remove to run test")
+    @Test
+    public void testASentenceWithPunctuation() {
+        assertEquals("!yrgnuh m'I", new ReverseString().reverse("I'm hungry!"));
+    }
+
+    @Ignore("Remove to run test")
+    @Test
+    public void testAPalindrome() {
+        assertEquals("racecar", new ReverseString().reverse("racecar"));
+    }
+
+}