Merge pull request #7 from eugenp/master

fork update 8-Nov-2019_1

.gitignore

@@ -84,4 +84,10 @@ software-security/sql-injection-samples/derby.log
 spring-soap/src/main/java/com/baeldung/springsoap/gen/
 /report-*.json
 transaction.log
-*-shell.log
+*-shell.log
+
+apache-cxf/cxf-aegis/baeldung.xml
+apache-fop/src/test/resources/input.xml
+apache-fop/src/test/resources/output_herold.pdf
+apache-fop/src/test/resources/output_html2fo.pdf
+apache-fop/src/test/resources/output_jtidy.pdf

algorithms-miscellaneous-3/README.md

@@ -16,4 +16,6 @@ This module contains articles about algorithms. Some classes of algorithms, e.g.
 - [Efficient Word Frequency Calculator in Java](https://www.baeldung.com/java-word-frequency)
 - [Interpolation Search in Java](https://www.baeldung.com/java-interpolation-search)
 - [The K-Means Clustering Algorithm in Java](https://www.baeldung.com/java-k-means-clustering-algorithm)
+- [Creating a Custom Annotation in Java](https://www.baeldung.com/java-custom-annotation)
+- [Breadth-First Search Algorithm in Java](https://www.baeldung.com/java-breadth-first-search)
 - More articles: [[<-- prev]](/algorithms-miscellaneous-2) [[next -->]](/algorithms-miscellaneous-4)

algorithms-miscellaneous-4/README.md

@@ -1,7 +1,6 @@
 ## Algorithms - Miscellaneous
 
-This module contains articles about algorithms. Some classes of algorithms, e.g., [sorting](/../algorithms-sorting) and
-[genetic algorithms](/../algorithms-genetic), have their own dedicated modules. 
+This module contains articles about algorithms. Some classes of algorithms, e.g., [sorting](https://github.com/eugenp/tutorials/blob/algorithms-sorting) and [genetic algorithms](https://github.com/eugenp/tutorials/blob/algorithms-genetic), have their own dedicated modules.
 
 ### Relevant articles:
 
@@ -12,4 +11,4 @@ This module contains articles about algorithms. Some classes of algorithms, e.g.
 - [Find Substrings That Are Palindromes in Java](https://www.baeldung.com/java-palindrome-substrings)
 - [Find the Longest Substring without Repeating Characters](https://www.baeldung.com/java-longest-substring-without-repeated-characters)
 - [Permutations of an Array in Java](https://www.baeldung.com/java-array-permutations)
-- More articles: [[<-- prev]](/../algorithms-miscellaneous-3) [[next -->]](/../algorithms-miscellaneous-5)
+- More articles: [[<-- prev]](/algorithms-miscellaneous-3) [[next -->]](/algorithms-miscellaneous-5)

algorithms-miscellaneous-4/src/main/java/com/baeldung/algorithms/smallestinteger/SmallestMissingPositiveInteger.java

@@ -0,0 +1,37 @@
+package com.baeldung.algorithms.smallestinteger;
+
+import java.util.Arrays;
+
+public class SmallestMissingPositiveInteger {
+    public static int searchInSortedArray(int[] input) {
+        for (int i = 0; i < input.length; i++) {
+            if (i != input[i]) {
+                return i;
+            }
+        }
+
+        return input.length;
+    }
+
+    public static int searchInUnsortedArraySortingFirst(int[] input) {
+        Arrays.sort(input);
+        return searchInSortedArray(input);
+    }
+
+    public static int searchInUnsortedArrayBooleanArray(int[] input) {
+        boolean[] flags = new boolean[input.length];
+        for (int number : input) {
+            if (number < flags.length) {
+                flags[number] = true;
+            }
+        }
+
+        for (int i = 0; i < flags.length; i++) {
+            if (!flags[i]) {
+                return i;
+            }
+        }
+
+        return flags.length;
+    }
+}

algorithms-miscellaneous-4/src/test/java/com/baeldung/algorithms/smallestinteger/SmallestMissingPositiveIntegerUnitTest.java

@@ -0,0 +1,88 @@
+package com.baeldung.algorithms.smallestinteger;
+
+import org.junit.jupiter.api.Test;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+class SmallestMissingPositiveIntegerUnitTest {
+    @Test
+    void givenArrayWithThreeMissing_whenSearchInSortedArray_thenThree() {
+        int[] input = new int[] {0, 1, 2, 4, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInSortedArray(input);
+
+        assertThat(result).isEqualTo(3);
+    }
+
+    @Test
+    void givenArrayWithOneAndThreeMissing_whenSearchInSortedArray_thenOne() {
+        int[] input = new int[] {0, 2, 4, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInSortedArray(input);
+
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void givenArrayWithoutMissingInteger_whenSearchInSortedArray_thenArrayLength() {
+        int[] input = new int[] {0, 1, 2, 3, 4, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInSortedArray(input);
+
+        assertThat(result).isEqualTo(input.length);
+    }
+
+    @Test
+    void givenArrayWithThreeMissing_whenSearchInUnsortedArraySortingFirst_thenThree() {
+        int[] input = new int[] {1, 4, 0, 5, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArraySortingFirst(input);
+
+        assertThat(result).isEqualTo(3);
+    }
+
+    @Test
+    void givenArrayWithOneAndThreeMissing_whenSearchInUnsortedArraySortingFirst_thenOne() {
+        int[] input = new int[] {4, 2, 0, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArraySortingFirst(input);
+
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void givenArrayWithoutMissingInteger_whenSearchInUnsortedArraySortingFirst_thenArrayLength() {
+        int[] input = new int[] {4, 5, 1, 3, 0, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArraySortingFirst(input);
+
+        assertThat(result).isEqualTo(input.length);
+    }
+
+    @Test
+    void givenArrayWithThreeMissing_whenSearchInUnsortedArrayBooleanArray_thenThree() {
+        int[] input = new int[] {1, 4, 0, 5, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArrayBooleanArray(input);
+
+        assertThat(result).isEqualTo(3);
+    }
+
+    @Test
+    void givenArrayWithOneAndThreeMissing_whenSearchInUnsortedArrayBooleanArray_thenOne() {
+        int[] input = new int[] {4, 2, 0, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArrayBooleanArray(input);
+
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void givenArrayWithoutMissingInteger_whenSearchInUnsortedArrayBooleanArray_thenArrayLength() {
+        int[] input = new int[] {4, 5, 1, 3, 0, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArrayBooleanArray(input);
+
+        assertThat(result).isEqualTo(input.length);
+    }
+}

algorithms-miscellaneous-5/README.md

@@ -8,4 +8,5 @@ This module contains articles about algorithms. Some classes of algorithms, e.g.
 - [Converting Between Byte Arrays and Hexadecimal Strings in Java](https://www.baeldung.com/java-byte-arrays-hex-strings)
 - [Reversing a Binary Tree in Java](https://www.baeldung.com/java-reversing-a-binary-tree)
 - [Find If Two Numbers Are Relatively Prime in Java](https://www.baeldung.com/java-two-relatively-prime-numbers)
+- [Knapsack Problem Implementation in Java](https://www.baeldung.com/java-knapsack)
 - More articles: [[<-- prev]](/../algorithms-miscellaneous-4)

algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/balancedbinarytree/BalancedBinaryTree.java

@@ -0,0 +1,33 @@
+package com.baeldung.algorithms.balancedbinarytree;
+
+public class BalancedBinaryTree {
+
+    public static boolean isBalanced(Tree tree) {
+        return isBalancedRecursive(tree, -1).isBalanced;
+    }
+
+    private static Result isBalancedRecursive(Tree tree, int depth) {
+        if (tree == null) {
+            return new Result(true, -1);
+        }
+
+        Result leftSubtreeResult = isBalancedRecursive(tree.left(), depth + 1);
+        Result rightSubtreeResult = isBalancedRecursive(tree.right(), depth + 1);
+
+        boolean isBalanced = Math.abs(leftSubtreeResult.height - rightSubtreeResult.height) <= 1;
+        boolean subtreesAreBalanced = leftSubtreeResult.isBalanced && rightSubtreeResult.isBalanced;
+        int height = Math.max(leftSubtreeResult.height, rightSubtreeResult.height) + 1;
+
+        return new Result(isBalanced && subtreesAreBalanced, height);
+    }
+
+    private static final class Result {
+        private final boolean isBalanced;
+        private final int height;
+
+        private Result(boolean isBalanced, int height) {
+            this.isBalanced = isBalanced;
+            this.height = height;
+        }
+    }
+}

algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/balancedbinarytree/Tree.java

@@ -0,0 +1,34 @@
+package com.baeldung.algorithms.balancedbinarytree;
+
+public class Tree {
+    private final int value;
+    private final Tree left;
+    private final Tree right;
+
+    public Tree(int value, Tree left, Tree right) {
+        this.value = value;
+        this.left = left;
+        this.right = right;
+    }
+
+    public int value() {
+        return value;
+    }
+
+    public Tree left() {
+        return left;
+    }
+
+    public Tree right() {
+        return right;
+    }
+
+    @Override
+    public String toString() {
+        return String.format("[%s, %s, %s]",
+            value,
+            left == null ? "null" : left.toString(),
+            right == null ? "null" : right.toString()
+        );
+    }
+}

algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/binarygap/BinaryGap.java

@@ -0,0 +1,17 @@
+package com.baeldung.algorithms.binarygap;
+
+public class BinaryGap {
+    static int calculateBinaryGap(int n) {
+        return calculateBinaryGap(n >>> Integer.numberOfTrailingZeros(n), 0, 0);
+    }
+
+    static int calculateBinaryGap(int n, int current, int maximum) {
+        if (n == 0) {
+            return maximum;
+        } else if ((n & 1) == 0) {
+            return calculateBinaryGap(n >>> 1, current + 1, maximum);
+        } else {
+            return calculateBinaryGap(n >>> 1, 0, Math.max(maximum, current));
+        }
+    }
+}

algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/balancedbinarytree/BalancedBinaryTreeUnitTest.java

@@ -0,0 +1,26 @@
+package com.baeldung.algorithms.balancedbinarytree;
+
+import org.junit.Test;
+import static org.junit.Assert.assertTrue;
+import static org.junit.Assert.assertFalse;
+
+public class BalancedBinaryTreeUnitTest extends BinaryTreeDataProvider {
+
+    @Test
+    public void givenBalancedTrees_whenCallingIsBalanced_ShouldReturnTrue() {
+        for (Tree tree : balancedTrees()) {
+            assertTrue(toString(tree) + " should be balanced", BalancedBinaryTree.isBalanced(tree));
+        }
+    }
+
+    @Test
+    public void givenUnbalancedTrees_whenCallingIsBalanced_ShouldReturnFalse() {
+        for (Tree tree : unbalancedTrees()) {
+            assertFalse(toString(tree) + " should not be balanced", BalancedBinaryTree.isBalanced(tree));
+        }
+    }
+
+    private String toString(Tree tree) {
+        return tree != null ? tree.toString() : "null";
+    }
+}

algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/balancedbinarytree/BinaryTreeDataProvider.java

@@ -0,0 +1,69 @@
+package com.baeldung.algorithms.balancedbinarytree;
+
+import java.util.Arrays;
+import java.util.Collection;
+
+class BinaryTreeDataProvider {
+
+    static Collection<Tree> balancedTrees() {
+        return Arrays.asList(
+            null,
+            leaf(1),
+            tree(1, leaf(2), leaf(3)),
+            tree(
+                1,
+                leaf(2),
+                tree(3, leaf(4), null)
+            ),
+            tree(
+                1,
+                tree(
+                    2,
+                    tree(3, leaf(4), null),
+                    leaf(5)
+                ),
+                tree(
+                    6,
+                    leaf(7),
+                    tree(8, null, leaf(9))
+                )
+            )
+        );
+    }
+
+    static Collection<Tree> unbalancedTrees() {
+        return Arrays.asList(
+            tree(
+                1,
+                tree(2, leaf(3), null),
+                null
+            ),
+            tree(
+                1,
+                tree(
+                    2,
+                    tree(3, leaf(4), leaf(5)),
+                    null
+                ),
+                tree(6, leaf(7), null)
+            ),
+            tree(
+                1,
+                tree(2, leaf(3), null),
+                tree(
+                    4,
+                    tree(5, leaf(6), leaf(7)),
+                    null
+                )
+            )
+        );
+    }
+
+    private static Tree leaf(int value) {
+        return new Tree(value, null, null);
+    }
+
+    private static Tree tree(int value, Tree left, Tree right) {
+        return new Tree(value, left, right);
+    }
+}

algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/binarygap/BinaryGapUnitTest.java

@@ -0,0 +1,34 @@
+package com.baeldung.algorithms.binarygap;
+
+import static com.baeldung.algorithms.binarygap.BinaryGap.calculateBinaryGap;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import org.junit.jupiter.api.Test;
+
+public class BinaryGapUnitTest {
+
+    @Test public void givenNoOccurrenceOfBoundedZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(63);
+        assertEquals(0, result);
+    }
+
+    @Test public void givenTrailingZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(40);
+        assertEquals(1, result);
+    }
+
+    @Test public void givenSingleOccurrenceOfBoundedZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(9);
+        assertEquals(2, result);
+    }
+
+    @Test public void givenMultipleOccurrenceOfBoundedZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(145);
+        assertEquals(3, result);
+    }
+
+}

algorithms-sorting/README.md

@@ -17,3 +17,4 @@ This module contains articles about sorting algorithms.
 - [Sorting Strings by Contained Numbers in Java](https://www.baeldung.com/java-sort-strings-contained-numbers)
 - [Radix Sort in Java](https://www.baeldung.com/java-radix-sort)
 - [Sorting a String Alphabetically in Java](https://www.baeldung.com/java-sort-string-alphabetically)
+- [Bucket Sort in Java](https://www.baeldung.com/java-bucket-sort)

code-generation/pom.xml

@@ -12,10 +12,16 @@
     </parent>
 
     <dependencies>
+        <dependency>
+            <groupId>com.google.auto.value</groupId>
+            <artifactId>auto-value-annotations</artifactId>
+            <version>${auto-value.version}</version>
+        </dependency>
         <dependency>
             <groupId>com.google.auto.value</groupId>
             <artifactId>auto-value</artifactId>
             <version>${auto-value.version}</version>
+            <scope>provided</scope>
         </dependency>
         <dependency>
             <groupId>com.google.auto.factory</groupId>
@@ -43,9 +49,9 @@
     </dependencies>
 
     <properties>
-        <auto-value.version>1.3</auto-value.version>
-        <auto-factory.version>1.0-beta5</auto-factory.version>
-        <auto-service.version>1.0-rc5</auto-service.version>
+        <auto-value.version>1.6.6</auto-value.version>
+        <auto-factory.version>1.0-beta6</auto-factory.version>
+        <auto-service.version>1.0-rc6</auto-service.version>
         <guice.version>4.2.0</guice.version>
     </properties>
 

code-generation/src/main/java/com/baeldung/autovalue/Person.java

@@ -0,0 +1,38 @@
+package com.baeldung.autovalue;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+import com.google.auto.value.AutoValue;
+
+@AutoValue
+public abstract class Person {
+
+    public abstract String name();
+
+    public abstract List<String> favoriteMovies();
+
+    public static Builder builder() {
+        return new AutoValue_Person.Builder();
+    }
+
+    @AutoValue.Builder
+    public static abstract class Builder {
+
+        public abstract Builder name(String value);
+
+        public abstract Builder favoriteMovies(List<String> value);
+
+        abstract List<String> favoriteMovies();
+
+        abstract Person autoBuild();
+
+        public Person build() {
+            List<String> favoriteMovies = favoriteMovies();
+            List<String> copy = Collections.unmodifiableList(new ArrayList<>(favoriteMovies));
+            favoriteMovies(copy);
+            return autoBuild();
+        }
+    }
+}

code-generation/src/test/java/com/baeldung/autovalue/PersonUnitTest.java

@@ -0,0 +1,37 @@
+package com.baeldung.autovalue;
+
+import static org.junit.Assert.assertEquals;
+import static org.junit.Assert.assertFalse;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.junit.Test;
+
+/**
+ * Unit Test which verifies that the {@link Person} value object creates defensive copies of its favoriteMovies list.
+ */
+public class PersonUnitTest {
+
+    @Test
+    public void givenNewPerson_whenModifyOriginalList_thenValueObjectIsNotAlsoModified() {
+        // GIVEN new Person
+        List<String> originalFavoriteMoviesList = new ArrayList<String>();
+        originalFavoriteMoviesList.add("Training Day");
+        originalFavoriteMoviesList.add("Fast and the Furious");
+        Person person = Person.builder()
+            .name("Dan")
+            .favoriteMovies(originalFavoriteMoviesList)
+            .build();
+
+        // WHEN modify original list
+        originalFavoriteMoviesList.add("Friday");
+
+        // THEN Person remains unaffected
+        assertFalse(person.favoriteMovies()
+            .contains("Friday"));
+        assertEquals(2, person.favoriteMovies()
+            .size());
+    }
+
+}

core-groovy-2/README.md

@@ -12,4 +12,5 @@ This module contains articles about core Groovy concepts
 - [Concatenate Strings with Groovy](https://www.baeldung.com/groovy-concatenate-strings)
 - [Metaprogramming in Groovy](https://www.baeldung.com/groovy-metaprogramming)
 - [A Quick Guide to Working with Web Services in Groovy](https://www.baeldung.com/groovy-web-services)
+- [Categories in Groovy](https://www.baeldung.com/groovy-categories)
 - [[<-- Prev]](/core-groovy)

core-groovy-collections/README.md

@@ -5,4 +5,6 @@ This module contains articles about Groovy core collections
 ## Relevant articles:
 
 - [Maps in Groovy](https://www.baeldung.com/groovy-maps)
-
+- [Finding Elements in Collections in Groovy](https://www.baeldung.com/groovy-collections-find-elements)
+- [Lists in Groovy](https://www.baeldung.com/groovy-lists)
+- [A Quick Guide to Iterating a Map in Groovy](https://www.baeldung.com/groovy-map-iterating)

core-groovy-collections/src/test/groovy/com/baeldung/find/ListFindUnitTest.groovy

@@ -1,11 +1,11 @@
-package com.baeldung.lists
+package com.baeldung.find
 
-import com.baeldung.Person
+import com.baeldung.find.Person
 import org.junit.Test
 
 import static org.junit.Assert.*
 
-class ListUnitTest {
+class ListFindUnitTest {
 
     private final personList = [
       new Person("Regina", "Fitzpatrick", 25),

core-groovy-collections/src/test/groovy/com/baeldung/find/MapFindUnitTest.groovy

@@ -1,11 +1,11 @@
-package com.baeldung.map
+package com.baeldung.find
 
-import com.baeldung.Person
+import com.baeldung.find.Person
 import org.junit.Test
 
 import static org.junit.Assert.*
 
-class MapUnitTest {
+class MapFindUnitTest {
 
     private final personMap = [
       Regina : new Person("Regina", "Fitzpatrick", 25),
@@ -13,84 +13,6 @@ class MapUnitTest {
       Lucian : new Person("Lucian", "Walter", 30)
     ]
 
-    @Test
-    void whenUsingEach_thenMapIsIterated() {
-        def map = [
-            'FF0000' : 'Red',
-            '00FF00' : 'Lime',
-            '0000FF' : 'Blue',
-            'FFFF00' : 'Yellow'
-        ]
-
-        map.each { println "Hex Code: $it.key = Color Name: $it.value" }
-    }
-
-    @Test
-    void whenUsingEachWithEntry_thenMapIsIterated() {
-        def map = [
-            'E6E6FA' : 'Lavender',
-            'D8BFD8' : 'Thistle',
-            'DDA0DD' : 'Plum',
-        ]
-
-        map.each { entry -> println "Hex Code: $entry.key = Color Name: $entry.value" }
-    }
-
-    @Test
-    void whenUsingEachWithKeyAndValue_thenMapIsIterated() {
-        def map = [
-            '000000' : 'Black',
-            'FFFFFF' : 'White',
-            '808080' : 'Gray'
-        ]
-
-        map.each { key, val ->
-            println "Hex Code: $key = Color Name $val"
-        }
-    }
-
-    @Test
-    void whenUsingEachWithIndexAndEntry_thenMapIsIterated() {
-        def map = [
-            '800080' : 'Purple',
-            '4B0082' : 'Indigo',
-            '6A5ACD' : 'Slate Blue'
-        ]
-
-        map.eachWithIndex { entry, index ->
-            def indent = ((index == 0 || index % 2 == 0) ? "   " : "")
-            println "$indent Hex Code: $entry.key = Color Name: $entry.value"
-        }
-    }
-
-    @Test
-    void whenUsingEachWithIndexAndKeyAndValue_thenMapIsIterated() {
-        def map = [
-            'FFA07A' : 'Light Salmon',
-            'FF7F50' : 'Coral',
-            'FF6347' : 'Tomato',
-            'FF4500' : 'Orange Red'
-        ]
-
-        map.eachWithIndex { key, val, index ->
-            def indent = ((index == 0 || index % 2 == 0) ? "   " : "")
-            println "$indent Hex Code: $key = Color Name: $val"
-        }
-    }
-
-    @Test
-    void whenUsingForLoop_thenMapIsIterated() {
-        def map = [
-            '2E8B57' : 'Seagreen',
-            '228B22' : 'Forest Green',
-            '008000' : 'Green'
-        ]
-
-        for (entry in map) {
-            println "Hex Code: $entry.key = Color Name: $entry.value"
-        }
-    }
-
     @Test
     void whenMapContainsKeyElement_thenCheckReturnsTrue() {
         def map = [a: 'd', b: 'e', c: 'f']

core-groovy-collections/src/test/groovy/com/baeldung/find/Person.groovy

@@ -1,4 +1,4 @@
-package com.baeldung
+package com.baeldung.find
 
 class Person {
     private String firstname

core-groovy-collections/src/test/groovy/com/baeldung/find/SetFindUnitTest.groovy

@@ -1,10 +1,10 @@
-package com.baeldung.set
+package com.baeldung.find
 
 import org.junit.Test
 
 import static org.junit.Assert.assertTrue
 
-class SetUnitTest {
+class SetFindUnitTest {
 
     @Test
     void whenSetContainsElement_thenCheckReturnsTrue() {

core-groovy-collections/src/test/groovy/com/baeldung/iteratemap/IterateMapUnitTest.groovy

@@ -0,0 +1,87 @@
+package com.baeldung.iteratemap
+
+import com.baeldung.find.Person
+import org.junit.Test
+
+import static org.junit.Assert.*
+
+class IterateMapUnitTest {
+
+    @Test
+    void whenUsingEach_thenMapIsIterated() {
+        def map = [
+                'FF0000' : 'Red',
+                '00FF00' : 'Lime',
+                '0000FF' : 'Blue',
+                'FFFF00' : 'Yellow'
+        ]
+
+        map.each { println "Hex Code: $it.key = Color Name: $it.value" }
+    }
+
+    @Test
+    void whenUsingEachWithEntry_thenMapIsIterated() {
+        def map = [
+                'E6E6FA' : 'Lavender',
+                'D8BFD8' : 'Thistle',
+                'DDA0DD' : 'Plum',
+        ]
+
+        map.each { entry -> println "Hex Code: $entry.key = Color Name: $entry.value" }
+    }
+
+    @Test
+    void whenUsingEachWithKeyAndValue_thenMapIsIterated() {
+        def map = [
+                '000000' : 'Black',
+                'FFFFFF' : 'White',
+                '808080' : 'Gray'
+        ]
+
+        map.each { key, val ->
+            println "Hex Code: $key = Color Name $val"
+        }
+    }
+
+    @Test
+    void whenUsingEachWithIndexAndEntry_thenMapIsIterated() {
+        def map = [
+                '800080' : 'Purple',
+                '4B0082' : 'Indigo',
+                '6A5ACD' : 'Slate Blue'
+        ]
+
+        map.eachWithIndex { entry, index ->
+            def indent = ((index == 0 || index % 2 == 0) ? "   " : "")
+            println "$indent Hex Code: $entry.key = Color Name: $entry.value"
+        }
+    }
+
+    @Test
+    void whenUsingEachWithIndexAndKeyAndValue_thenMapIsIterated() {
+        def map = [
+                'FFA07A' : 'Light Salmon',
+                'FF7F50' : 'Coral',
+                'FF6347' : 'Tomato',
+                'FF4500' : 'Orange Red'
+        ]
+
+        map.eachWithIndex { key, val, index ->
+            def indent = ((index == 0 || index % 2 == 0) ? "   " : "")
+            println "$indent Hex Code: $key = Color Name: $val"
+        }
+    }
+
+    @Test
+    void whenUsingForLoop_thenMapIsIterated() {
+        def map = [
+                '2E8B57' : 'Seagreen',
+                '228B22' : 'Forest Green',
+                '008000' : 'Green'
+        ]
+
+        for (entry in map) {
+            println "Hex Code: $entry.key = Color Name: $entry.value"
+        }
+    }
+}

core-groovy-collections/src/test/groovy/com/baeldung/lists/ListUnitTest.groovy

@@ -1,9 +1,9 @@
-package com.baeldung.groovy.lists
+package com.baeldung.lists
 
 import static groovy.test.GroovyAssert.*
 import org.junit.Test
 
-class ListTest{
+class ListUnitTest {
 
     @Test
     void testCreateList() {

core-groovy-collections/src/test/groovy/com/baeldung/maps/MapTest.groovy

@@ -1,4 +1,4 @@
-package com.baeldung.map;
+package com.baeldung.maps;
 
 import static groovy.test.GroovyAssert.*
 import org.junit.Test