Merge pull request #4 from eugenp/master

Updating local repository
2020-08-17 21:58:18 +05:30
parent a27969cc70 a098310a5e
commit 969280640c
1385 changed files with 9543 additions and 2696 deletions
@@ -85,5 +85,6 @@ transaction.log
 *-shell.log

 apache-cxf/cxf-aegis/baeldung.xml
+testing-modules/report-*.json

 libraries-2/*.db
@@ -8,4 +8,5 @@
 - [Introduction to Greedy Algorithms with Java](https://www.baeldung.com/java-greedy-algorithms)
 - [The Caesar Cipher in Java](https://www.baeldung.com/java-caesar-cipher)
 - [Implementing a 2048 Solver in Java](https://www.baeldung.com/2048-java-solver)
+- [Finding Top K Elements in an Array](https://www.baeldung.com/java-array-top-elements)
 - More articles: [[<-- prev]](/../algorithms-miscellaneous-5)
@@ -0,0 +1,126 @@
+package com.baeldung.algorithms.kthsmallest;
+
+import java.util.Arrays;
+import java.util.NoSuchElementException;
+
+import static java.lang.Math.max;
+import static java.lang.Math.min;
+
+public class KthSmallest {
+
+    public static int findKthSmallestElement(int k, int[] list1, int[] list2)  throws NoSuchElementException, IllegalArgumentException {
+
+        checkInput(k, list1, list2);
+
+        // we are looking for the minimum value
+        if(k == 1) {
+            return min(list1[0], list2[0]);
+        }
+
+        // we are looking for the maximum value
+        if(list1.length + list2.length == k) {
+            return max(list1[list1.length-1], list2[list2.length-1]);
+        }
+
+        // swap lists if needed to make sure we take at least one element from list1
+        if(k <= list2.length && list2[k-1] < list1[0]) {
+            int[] list1_ = list1;
+            list1 = list2;
+            list2 = list1_;
+        }
+
+        // correct left boundary if k is bigger than the size of list2
+        int left = k < list2.length ? 0 : k - list2.length - 1;
+
+        // the inital right boundary cannot exceed the list1
+        int right = min(k-1, list1.length - 1);
+
+        int nElementsList1, nElementsList2;
+
+        // binary search
+        do {
+            nElementsList1 = ((left + right) / 2) + 1;
+            nElementsList2 = k - nElementsList1;
+
+            if(nElementsList2 > 0) {
+                if (list1[nElementsList1 - 1] > list2[nElementsList2 - 1]) {
+                    right = nElementsList1 - 2;
+                } else {
+                    left = nElementsList1;
+                }
+            }
+        } while(!kthSmallesElementFound(list1, list2, nElementsList1, nElementsList2));
+
+        return nElementsList2 == 0 ? list1[nElementsList1-1] : max(list1[nElementsList1-1], list2[nElementsList2-1]);
+    }
+
+    private static boolean kthSmallesElementFound(int[] list1, int[] list2, int nElementsList1, int nElementsList2) {
+
+        // we do not take any element from the second list
+        if(nElementsList2 < 1) {
+            return true;
+        }
+
+        if(list1[nElementsList1-1] == list2[nElementsList2-1]) {
+            return true;
+        }
+
+        if(nElementsList1 == list1.length) {
+            return list1[nElementsList1-1] <= list2[nElementsList2];
+        }
+
+        if(nElementsList2 == list2.length) {
+            return list2[nElementsList2-1] <= list1[nElementsList1];
+        }
+
+        return list1[nElementsList1-1] <= list2[nElementsList2] && list2[nElementsList2-1] <= list1[nElementsList1];
+    }
+
+
+    private static void checkInput(int k, int[] list1, int[] list2) throws NoSuchElementException, IllegalArgumentException {
+
+        if(list1 == null || list2 == null || k < 1) {
+            throw new IllegalArgumentException();
+        }
+
+        if(list1.length == 0 || list2.length == 0) {
+            throw new IllegalArgumentException();
+        }
+
+        if(k > list1.length + list2.length) {
+            throw new NoSuchElementException();
+        }
+    }
+
+    public static int getKthElementSorted(int[] list1, int[] list2, int k) {
+
+        int length1 = list1.length, length2 = list2.length;
+        int[] combinedArray = new int[length1 + length2];
+        System.arraycopy(list1, 0, combinedArray, 0, list1.length);
+        System.arraycopy(list2, 0, combinedArray, list1.length, list2.length);
+        Arrays.sort(combinedArray);
+
+        return combinedArray[k-1];
+    }
+
+    public static int getKthElementMerge(int[] list1, int[] list2, int k) {
+
+        int i1 = 0, i2 = 0;
+
+        while(i1 < list1.length && i2 < list2.length && (i1 + i2) < k) {
+            if(list1[i1] < list2[i2]) {
+                i1++;
+            } else {
+                i2++;
+            }
+        }
+
+        if((i1 + i2) < k) {
+            return i1 < list1.length ? list1[k - i2 - 1] : list2[k - i1 - 1];
+        } else if(i1 > 0 && i2 > 0) {
+            return Math.max(list1[i1-1], list2[i2-1]);
+        } else {
+            return i1 == 0 ? list2[i2-1] : list1[i1-1];
+        }
+    }
+}
@@ -0,0 +1,288 @@
+package com.baeldung.algorithms.kthsmallest;
+
+import org.junit.jupiter.api.Nested;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.function.Executable;
+
+import java.util.*;
+
+import static com.baeldung.algorithms.kthsmallest.KthSmallest.*;
+import static org.junit.jupiter.api.Assertions.*;
+
+public class KthSmallestUnitTest {
+
+    @Nested
+    class Exceptions {
+
+        @Test
+        public void when_at_least_one_list_is_null_then_an_exception_is_thrown() {
+
+            Executable executable1 = () -> findKthSmallestElement(1, null, null);
+            Executable executable2 = () -> findKthSmallestElement(1, new int[]{2}, null);
+            Executable executable3 = () -> findKthSmallestElement(1, null, new int[]{2});
+
+            assertThrows(IllegalArgumentException.class, executable1);
+            assertThrows(IllegalArgumentException.class, executable2);
+            assertThrows(IllegalArgumentException.class, executable3);
+        }
+
+        @Test
+        public void when_at_least_one_list_is_empty_then_an_exception_is_thrown() {
+
+            Executable executable1 = () -> findKthSmallestElement(1, new int[]{}, new int[]{2});
+            Executable executable2 = () -> findKthSmallestElement(1, new int[]{2}, new int[]{});
+            Executable executable3 = () -> findKthSmallestElement(1, new int[]{}, new int[]{});
+
+            assertThrows(IllegalArgumentException.class, executable1);
+            assertThrows(IllegalArgumentException.class, executable2);
+            assertThrows(IllegalArgumentException.class, executable3);
+        }
+
+        @Test
+        public void when_k_is_smaller_than_0_then_an_exception_is_thrown() {
+            Executable executable1 = () -> findKthSmallestElement(-1, new int[]{2}, new int[]{2});
+            assertThrows(IllegalArgumentException.class, executable1);
+        }
+
+        @Test
+        public void when_k_is_smaller_than_1_then_an_exception_is_thrown() {
+            Executable executable1 = () -> findKthSmallestElement(0, new int[]{2}, new int[]{2});
+            assertThrows(IllegalArgumentException.class, executable1);
+        }
+
+        @Test
+        public void when_k_bigger_then_the_two_lists_then_an_exception_is_thrown() {
+            Executable executable1 = () -> findKthSmallestElement(6, new int[]{1, 5, 6}, new int[]{2, 5});
+            assertThrows(NoSuchElementException.class, executable1);
+        }
+
+    }
+
+    @Nested
+    class K_is_smaller_than_the_size_of_list1_and_the_size_of_list2 {
+
+        @Test
+        public void when_k_is_1_then_the_smallest_element_is_returned_from_list1() {
+            int result = findKthSmallestElement(1, new int[]{2, 7}, new int[]{3, 5});
+            assertEquals(2, result);
+        }
+
+        @Test
+        public void when_k_is_1_then_the_smallest_element_is_returned_list2() {
+            int result = findKthSmallestElement(1, new int[]{3, 5}, new int[]{2, 7});
+            assertEquals(2, result);
+        }
+
+        @Test
+        public void when_kth_element_is_smallest_element_and_occurs_in_both_lists() {
+            int[] list1 = new int[]{1, 2, 3};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(1, list1, list2);
+            assertEquals(1, result);
+        }
+
+        @Test
+        public void when_kth_element_is_smallest_element_and_occurs_in_both_lists2() {
+            int[] list1 = new int[]{1, 2, 3};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(2, list1, list2);
+            assertEquals(1, result);
+        }
+
+        @Test
+        public void when_kth_element_is_largest_element_and_occurs_in_both_lists_1() {
+            int[] list1 = new int[]{1, 2, 3};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(5, list1, list2);
+            assertEquals(3, result);
+        }
+
+        @Test
+        public void when_kth_element_is_largest_element_and_occurs_in_both_lists_2() {
+            int[] list1 = new int[]{1, 2, 3};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(6, list1, list2);
+            assertEquals(3, result);
+        }
+
+        @Test
+        public void when_kth_element_and_occurs_in_both_lists() {
+            int[] list1 = new int[]{1, 2, 3};
+            int[] list2 = new int[]{0, 2, 3};
+            int result = findKthSmallestElement(3, list1, list2);
+            assertEquals(2, result);
+        }
+
+        @Test
+        public void and_kth_element_is_in_first_list() {
+            int[] list1 = new int[]{1,2,3,4};
+            int[] list2 = new int[]{1,3,4,5};
+            int result = findKthSmallestElement(3,  list1, list2);
+            assertEquals(2, result);
+        }
+
+        @Test
+        public void and_kth_is_in_second_list() {
+            int[] list1 = new int[]{1,3,4,4};
+            int[] list2 = new int[]{1,2,4,5};
+            int result = findKthSmallestElement(3,  list1, list2);
+            assertEquals(2, result);
+        }
+
+        @Test
+        public void and_elements_in_first_list_are_all_smaller_than_second_list() {
+            int[] list1 = new int[]{1,3,7,9};
+            int[] list2 = new int[]{11,12,14,15};
+            int result = findKthSmallestElement(3,  list1, list2);
+            assertEquals(7, result);
+        }
+
+        @Test
+        public void and_elements_in_first_list_are_all_smaller_than_second_list2() {
+            int[] list1 = new int[]{1,3,7,9};
+            int[] list2 = new int[]{11,12,14,15};
+            int result = findKthSmallestElement(4,  list1, list2);
+            assertEquals(9, result);
+        }
+
+        @Test
+        public void and_only_elements_from_second_list_are_part_of_result() {
+            int[] list1 = new int[]{11,12,14,15};
+            int[] list2 = new int[]{1,3,7,9};
+            int result = findKthSmallestElement(3,  list1, list2);
+            assertEquals(7, result);
+        }
+
+        @Test
+        public void and_only_elements_from_second_list_are_part_of_result2() {
+            int[] list1 = new int[]{11,12,14,15};
+            int[] list2 = new int[]{1,3,7,9};
+            int result = findKthSmallestElement(4,  list1, list2);
+            assertEquals(9, result);
+        }
+    }
+
+    @Nested
+    class K_is_bigger_than_the_size_of_at_least_one_of_the_lists {
+
+        @Test
+        public void k_is_smaller_than_list1_and_bigger_than_list2() {
+            int[] list1 = new int[]{1, 2, 3, 4, 7, 9};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(5, list1, list2);
+            assertEquals(3, result);
+        }
+
+        @Test
+        public void k_is_bigger_than_list1_and_smaller_than_list2() {
+            int[] list1 = new int[]{1, 2, 3};
+            int[] list2 = new int[]{1, 2, 3, 4, 7, 9};
+            int result = findKthSmallestElement(5, list1, list2);
+            assertEquals(3, result);
+        }
+
+        @Test
+        public void when_k_is_bigger_than_the_size_of_both_lists_and_elements_in_second_list_are_all_smaller_than_first_list() {
+            int[] list1 = new int[]{9, 11, 13, 55};
+            int[] list2 = new int[]{1, 2, 3, 7};
+            int result = findKthSmallestElement(6, list1, list2);
+            assertEquals(11, result);
+        }
+
+        @Test
+        public void when_k_is_bigger_than_the_size_of_both_lists_and_elements_in_second_list_are_all_bigger_than_first_list() {
+            int[] list1 = new int[]{1, 2, 3, 7};
+            int[] list2 = new int[]{9, 11, 13, 55};
+            int result = findKthSmallestElement(6, list1, list2);
+            assertEquals(11, result);
+        }
+
+        @Test
+        public void when_k_is_bigger_than_the_size_of_both_lists() {
+            int[] list1 = new int[]{3, 7, 9, 11, 55};
+            int[] list2 = new int[]{1, 2, 3, 7, 13};
+            int result = findKthSmallestElement(7, list1, list2);
+            assertEquals(9, result);
+        }
+
+        @Test
+        public void when_k_is_bigger_than_the_size_of_both_lists_and_list1_has_more_elements_than_list2() {
+            int[] list1 = new int[]{3, 7, 9, 11, 55, 77, 100, 200};
+            int[] list2 = new int[]{1, 2, 3, 7, 13};
+            int result = findKthSmallestElement(11, list1, list2);
+            assertEquals(77, result);
+        }
+
+        @Test
+        public void max_test() {
+            int[] list1 = new int[]{100, 200};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(4, list1, list2);
+            assertEquals(100, result);
+        }
+
+        @Test
+        public void max_test2() {
+            int[] list1 = new int[]{100, 200};
+            int[] list2 = new int[]{1, 2, 3};
+            int result = findKthSmallestElement(5, list1, list2);
+            assertEquals(200, result);
+        }
+
+        @Test
+        public void when_k_is_smaller_than_the_size_of_both_lists_and_kth_element_in_list2() {
+            int[] list1 = new int[]{1, 2, 5};
+            int[] list2 = new int[]{1, 3, 4, 7};
+            int result = findKthSmallestElement(4, list1, list2);
+            assertEquals(3, result);
+        }
+
+        @Test
+        public void when_k_is_smaller_than_the_size_of_both_lists_and_kth_element_is_smallest_in_list2() {
+            int[] list1 = new int[]{1, 2, 5};
+            int[] list2 = new int[]{3, 4, 7};
+            int result = findKthSmallestElement(3, list1, list2);
+            assertEquals(3, result);
+        }
+
+        @Test
+        public void when_k_is_smaller_than_the_size_of_both_lists_and_kth_element_is_smallest_in_list23() {
+            int[] list1 = new int[]{3, 11, 27, 53, 90};
+            int[] list2 = new int[]{4, 20, 21, 100};
+            int result = findKthSmallestElement(5, list1, list2);
+            assertEquals(21, result);
+        }
+    }
+
+//    @Test
+//    public void randomTests() {
+//        IntStream.range(1, 100000).forEach(i -> random());
+//    }
+
+    private void random() {
+
+        Random random = new Random();
+        int length1 = (Math.abs(random.nextInt())) % 1000 + 1;
+        int length2 = (Math.abs(random.nextInt())) % 1000 + 1;
+
+        int[] list1 = sortedRandomIntArrayOfLength(length1);
+        int[] list2 = sortedRandomIntArrayOfLength(length2);
+
+        int k = (Math.abs(random.nextInt()) % (length1 + length2)) + 1 ;
+
+        int result = findKthSmallestElement(k,  list1, list2);
+
+        int result2 = getKthElementSorted(list1, list2, k);
+
+        int result3 = getKthElementMerge(list1, list2, k);
+
+        assertEquals(result2, result);
+        assertEquals(result2, result3);
+    }
+
+    private int[] sortedRandomIntArrayOfLength(int length) {
+        int[] intArray = new Random().ints(length).toArray();
+        Arrays.sort(intArray);
+        return intArray;
+    }
+}
@@ -7,4 +7,3 @@ This module contains articles about Apache CXF
 - [Apache CXF Support for RESTful Web Services](https://www.baeldung.com/apache-cxf-rest-api)
 - [A Guide to Apache CXF with Spring](https://www.baeldung.com/apache-cxf-with-spring)
 - [Introduction to Apache CXF](https://www.baeldung.com/introduction-to-apache-cxf)
- [Server-Sent Events (SSE) In JAX-RS](https://www.baeldung.com/java-ee-jax-rs-sse)
@@ -0,0 +1,3 @@
+### Relevant Articles:
+
+- [Server-Sent Events (SSE) In JAX-RS](https://www.baeldung.com/java-ee-jax-rs-sse)
@@ -0,0 +1,26 @@
+package com.baeldung.poi.excel.setformula;
+
+import org.apache.poi.xssf.usermodel.XSSFCell;
+import org.apache.poi.xssf.usermodel.XSSFFormulaEvaluator;
+import org.apache.poi.xssf.usermodel.XSSFSheet;
+import org.apache.poi.xssf.usermodel.XSSFWorkbook;
+
+import java.io.File;
+import java.io.FileOutputStream;
+import java.io.IOException;
+
+public class ExcelFormula {
+    public double setFormula(String fileLocation, XSSFWorkbook wb, String formula) throws IOException {
+        XSSFSheet sheet = wb.getSheetAt(0);
+        int lastCellNum = sheet.getRow(0).getLastCellNum();
+        XSSFCell formulaCell = sheet.getRow(0).createCell(lastCellNum);
+        formulaCell.setCellFormula(formula);
+        XSSFFormulaEvaluator formulaEvaluator = wb.getCreationHelper().createFormulaEvaluator();
+        formulaEvaluator.evaluateFormulaCell(formulaCell);
+        FileOutputStream fileOut = new FileOutputStream(new File(fileLocation));
+        wb.write(fileOut);
+        wb.close();
+        fileOut.close();
+        return formulaCell.getNumericCellValue();
+    }
+}
@@ -0,0 +1,51 @@
+package com.baeldung.poi.excel.setformula;
+
+import org.apache.poi.ss.util.CellReference;
+import org.apache.poi.xssf.usermodel.XSSFSheet;
+import org.apache.poi.xssf.usermodel.XSSFWorkbook;
+import org.junit.Assert;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.net.URISyntaxException;
+import java.nio.file.Paths;
+
+class ExcelFormulaUnitTest {
+    private static String FILE_NAME = "com/baeldung/poi/excel/setformula/SetFormulaTest.xlsx";
+    private String fileLocation;
+    private ExcelFormula excelFormula;
+
+    @BeforeEach
+    public void setup() throws URISyntaxException {
+        fileLocation = Paths.get(ClassLoader.getSystemResource(FILE_NAME).toURI()).toString();
+        excelFormula = new ExcelFormula();
+    }
+
+    @Test
+    void givenExcelData_whenSetFormula_thenSuccess() throws IOException {
+        FileInputStream inputStream = new FileInputStream(new File(fileLocation));
+        XSSFWorkbook wb = new XSSFWorkbook(inputStream);
+        XSSFSheet sheet = wb.getSheetAt(0);
+        double resultColumnA = 0;
+        double resultColumnB = 0;
+        for (int row = 0; row <= sheet.getLastRowNum(); row++) {
+            resultColumnA += sheet.getRow(row).getCell(0).getNumericCellValue();
+            resultColumnB += sheet.getRow(row).getCell(1).getNumericCellValue();
+        }
+        String colNameA = CellReference.convertNumToColString(0);
+        String colNameB = CellReference.convertNumToColString(1);
+        String startCellA = colNameA + 1;
+        String stopCellA = colNameA + (sheet.getLastRowNum() + 1);
+        String sumFormulaForColumnA = String.format("SUM(%s:%s)", startCellA, stopCellA);
+        String startCellB = colNameB + 1;
+        String stopCellB = colNameB + (sheet.getLastRowNum() + 1);
+        String sumFormulaForColumnB = String.format("SUM(%s:%s)", startCellB, stopCellB);
+
+        double resultValue = excelFormula.setFormula(fileLocation, wb, sumFormulaForColumnA + "-" + sumFormulaForColumnB);
+
+        Assert.assertEquals(resultColumnA - resultColumnB, resultValue, 0d);
+    }
+}
@@ -6,4 +6,4 @@ This module contains articles about Apache Shiro

 - [Introduction to Apache Shiro](https://www.baeldung.com/apache-shiro)
 - [Permissions-Based Access Control with Apache Shiro](https://www.baeldung.com/apache-shiro-access-control)
-
+- [Spring Security vs Apache Shiro](https://www.baeldung.com/spring-security-vs-apache-shiro)
@@ -31,6 +31,6 @@ public class UseDateTimeFormatterUnitTest {
    public void givenALocalDate_whenFormattingWithStyleAndLocale_thenPass() {
        String result = subject.formatWithStyleAndLocale(localDateTime, FormatStyle.MEDIUM, Locale.UK);

-        assertThat(result).isEqualTo("25 Jan 2015, 06:30:00");
+        assertThat(result).isEqualTo("25-Jan-2015 06:30:00");
    }
 }
@@ -3,6 +3,7 @@ package com.baeldung.datetime;
 import static org.assertj.core.api.Assertions.assertThat;

 import java.time.LocalDateTime;
+import java.time.ZoneId;
 import java.util.Calendar;
 import java.util.Date;
 import java.util.GregorianCalendar;
@@ -24,10 +25,11 @@ public class UseToInstantUnitTest {

    @Test
    public void givenADate_whenConvertingToLocalDate_thenAsExpected() {
-        Date givenDate = new Date(1465817690000L);
+        LocalDateTime currentDateTime = LocalDateTime.now();
+        Date givenDate = Date.from(currentDateTime.atZone(ZoneId.systemDefault()).toInstant());

        LocalDateTime localDateTime = subject.convertDateToLocalDate(givenDate);

-        assertThat(localDateTime).isEqualTo("2016-06-13T13:34:50");
+        assertThat(localDateTime).isEqualTo(currentDateTime);
    }
 }
@@ -54,7 +54,7 @@ public class UseZonedDateTimeUnitTest {
    @Test
    public void givenAStringWithTimeZone_whenParsing_thenEqualsExpected() {
        ZonedDateTime resultFromString = zonedDateTime.getZonedDateTimeUsingParseMethod("2015-05-03T10:15:30+01:00[Europe/Paris]");
-        ZonedDateTime resultFromLocalDateTime = ZonedDateTime.of(2015, 5, 3, 11, 15, 30, 0, ZoneId.of("Europe/Paris"));
+        ZonedDateTime resultFromLocalDateTime = ZonedDateTime.of(2015, 5, 3, 10, 15, 30, 0, ZoneId.of("Europe/Paris"));

        assertThat(resultFromString.getZone()).isEqualTo(ZoneId.of("Europe/Paris"));
        assertThat(resultFromLocalDateTime.getZone()).isEqualTo(ZoneId.of("Europe/Paris"));
@@ -14,3 +14,4 @@ This module contains articles about core Java features that have been introduced
 - [Java 9 Reactive Streams](https://www.baeldung.com/java-9-reactive-streams)
 - [Multi-Release JAR Files with Maven](https://www.baeldung.com/maven-multi-release-jars)
 - [The Difference between RxJava API and the Java 9 Flow API](https://www.baeldung.com/rxjava-vs-java-flow-api)
+- [How to Get a Name of a Method Being Executed?](https://www.baeldung.com/java-name-of-executing-method)
@@ -0,0 +1,39 @@
+package com.baeldung.arraycompare;
+
+import java.util.Objects;
+
+public class Plane {
+
+    private final String name;
+
+    private final String model;
+
+    public Plane(String name, String model) {
+
+        this.name = name;
+        this.model = model;
+    }
+
+    public String getName() {
+        return name;
+    }
+
+    public String getModel() {
+        return model;
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o)
+            return true;
+        if (o == null || getClass() != o.getClass())
+            return false;
+        Plane plane = (Plane) o;
+        return Objects.equals(name, plane.name) && Objects.equals(model, plane.model);
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(name, model);
+    }
+}
@@ -0,0 +1,30 @@
+package com.baeldung.arraycompare;
+
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class DeepEqualsCompareUnitTest {
+
+    @Test
+    public void givenSameContents_whenDeepEquals_thenTrue() {
+        final Plane[][] planes1 = new Plane[][] { new Plane[] { new Plane("Plane 1", "A320") },
+            new Plane[] { new Plane("Plane 2", "B738") } };
+        final Plane[][] planes2 = new Plane[][] { new Plane[] { new Plane("Plane 1", "A320") },
+            new Plane[] { new Plane("Plane 2", "B738") } };
+
+        assertThat(Arrays.deepEquals(planes1, planes2)).isTrue();
+    }
+
+    @Test
+    public void givenSameContentsWithDifferentOrder_whenDeepEquals_thenFalse() {
+        final Plane[][] planes1 = new Plane[][] { new Plane[] { new Plane("Plane 1", "A320") },
+            new Plane[] { new Plane("Plane 2", "B738") } };
+        final Plane[][] planes2 = new Plane[][] { new Plane[] { new Plane("Plane 2", "B738") },
+            new Plane[] { new Plane("Plane 1", "A320") } };
+
+        assertThat(Arrays.deepEquals(planes1, planes2)).isFalse();
+    }
+}
@@ -0,0 +1,26 @@
+package com.baeldung.arraycompare;
+
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class EqualsCompareUnitTest {
+
+    @Test
+    public void givenSameContents_whenEquals_thenTrue() {
+        final String[] planes1 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+        final String[] planes2 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+
+        assertThat(Arrays.equals(planes1, planes2)).isTrue();
+    }
+
+    @Test
+    public void givenSameContentsDifferentOrder_whenEquals_thenFalse() {
+        final String[] planes1 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+        final String[] planes2 = new String[] { "B738", "A320", "A321", "A319", "B77W", "B737", "A333", "A332" };
+
+        assertThat(Arrays.equals(planes1, planes2)).isFalse();
+    }
+}
@@ -0,0 +1,18 @@
+package com.baeldung.arraycompare;
+
+import org.junit.jupiter.api.Test;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class LengthsCompareUnitTest {
+
+    @Test
+    public void givenSameContent_whenSizeCompare_thenTrue() {
+        final String[] planes1 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+        final Integer[] quantities = new Integer[] { 10, 12, 34, 45, 12, 43, 5, 2 };
+
+        assertThat(planes1).hasSize(8);
+        assertThat(quantities).hasSize(8);
+    }
+}
+
@@ -0,0 +1,33 @@
+package com.baeldung.arraycompare;
+
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+import java.util.Comparator;
+
+import static org.assertj.core.api.Assertions.assertThat;
+import static org.junit.Assert.assertTrue;
+
+public class OrderCompareUnitTest {
+    @Test
+    public void givenSameContentDifferentOrder_whenSortedAndDeepEquals_thenTrue() {
+        final Plane[][] planes1 = new Plane[][] {
+            new Plane[] { new Plane("Plane 1", "A320"), new Plane("Plane 2", "B738") } };
+        final Plane[][] planes2 = new Plane[][] {
+            new Plane[] { new Plane("Plane 2", "B738"), new Plane("Plane 1", "A320") } };
+
+        Comparator<Plane> planeComparator = (o1, o2) -> {
+            if (o1.getName()
+                .equals(o2.getName())) {
+                return o2.getModel()
+                    .compareTo(o1.getModel());
+            }
+            return o2.getName()
+                .compareTo(o1.getName());
+        };
+        Arrays.sort(planes1[0], planeComparator);
+        Arrays.sort(planes2[0], planeComparator);
+
+        assertThat(Arrays.deepEquals(planes1, planes2)).isTrue();
+    }
+}
@@ -0,0 +1,30 @@
+package com.baeldung.arraycompare;
+
+import org.junit.jupiter.api.Test;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class ReferenceCompareUnitTest {
+
+    @Test
+    public void givenSameReferences_whenSame_thenTrue() {
+        final String[] planes1 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+        final String[] planes2 = planes1;
+
+        assertThat(planes1).isSameAs(planes2);
+
+        planes2[0] = "747";
+
+        assertThat(planes1).isSameAs(planes2);
+        assertThat(planes2[0]).isEqualTo("747");
+        assertThat(planes1[0]).isEqualTo("747");
+    }
+
+    @Test
+    public void givenSameContentDifferentReferences_whenSame_thenFalse() {
+        final String[] planes1 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+        final String[] planes2 = new String[] { "A320", "B738", "A321", "A319", "B77W", "B737", "A333", "A332" };
+
+        assertThat(planes1).isNotSameAs(planes2);
+    }
+}
@@ -5,7 +5,16 @@ import org.apache.commons.lang3.ArrayUtils;
 import org.junit.Before;
 import org.junit.Test;

-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.LinkedHashMap;
+import java.util.LinkedHashSet;
+import java.util.List;
+import java.util.Map;
 import java.util.Map.Entry;

 import static org.junit.Assert.assertTrue;
@@ -138,7 +147,7 @@ public class JavaSortingUnitTest {
        HashSet<Integer> descSortedIntegersSet = new LinkedHashSet<>(Arrays.asList(255, 200, 123, 89, 88, 66, 7, 5, 1));

        ArrayList<Integer> list = new ArrayList<>(integersSet);
-        list.sort((i1, i2) -> i2 - i1);
+        list.sort(Comparator.reverseOrder());
        integersSet = new LinkedHashSet<>(list);

        assertTrue(Arrays.equals(integersSet.toArray(), descSortedIntegersSet.toArray()));
@@ -3,6 +3,7 @@
 ## Core Java Collections Cookbooks and Examples

 ### Relevant Articles: 
+
 - [Time Comparison of Arrays.sort(Object[]) and Arrays.sort(int[])](https://www.baeldung.com/arrays-sortobject-vs-sortint)
 - [Java ArrayList vs Vector](https://www.baeldung.com/java-arraylist-vs-vector)
 - [Differences Between HashMap and Hashtable](https://www.baeldung.com/hashmap-hashtable-differences)
@@ -10,3 +11,4 @@
 - [Performance of contains() in a HashSet vs ArrayList](https://www.baeldung.com/java-hashset-arraylist-contains-performance)
 - [Fail-Safe Iterator vs Fail-Fast Iterator](https://www.baeldung.com/java-fail-safe-vs-fail-fast-iterator)
 - [Quick Guide to the Java Stack](https://www.baeldung.com/java-stack)
+- [Convert an Array of Primitives to a List](https://www.baeldung.com/java-primitive-array-to-list)
@@ -16,6 +16,11 @@
    </parent>

    <dependencies>
+        <dependency>
+            <groupId>org.openjdk.jol</groupId>
+            <artifactId>jol-core</artifactId>
+            <version>${jol-core.version}</version>
+        </dependency>
        <dependency>
            <groupId>org.openjdk.jmh</groupId>
            <artifactId>jmh-core</artifactId>
@@ -37,6 +42,7 @@
    <properties>
        <openjdk.jmh.version>1.19</openjdk.jmh.version>
        <assertj.version>3.11.1</assertj.version>
+        <jol-core.version>0.10</jol-core.version>
    </properties>

 </project>
@@ -0,0 +1,178 @@
+package com.baeldung.collections.bitset;
+
+import org.junit.Test;
+import org.openjdk.jol.info.ClassLayout;
+import org.openjdk.jol.info.GraphLayout;
+
+import java.util.BitSet;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class BitSetUnitTest {
+
+    @Test
+    public void givenBoolArray_whenMemoryLayout_thenConsumeMoreThanOneBit() {
+        boolean[] bits = new boolean[1024 * 1024];
+
+        System.out.println(ClassLayout.parseInstance(bits).toPrintable());
+    }
+
+    @Test
+    public void givenBitSet_whenMemoryLayout_thenConsumeOneBitPerFlag() {
+        BitSet bitSet = new BitSet(1024 * 1024);
+
+        System.out.println(GraphLayout.parseInstance(bitSet).toPrintable());
+    }
+
+    @Test
+    public void givenBitSet_whenSetting_thenShouldBeTrue() {
+        BitSet bitSet = new BitSet();
+
+        bitSet.set(10);
+        assertThat(bitSet.get(10)).isTrue();
+
+        bitSet.set(20, 30);
+        for (int i = 20; i <= 29; i++) {
+            assertThat(bitSet.get(i)).isTrue();
+        }
+        assertThat(bitSet.get(30)).isFalse();
+
+        bitSet.set(10, false);
+        assertThat(bitSet.get(10)).isFalse();
+
+        bitSet.set(20, 30, false);
+        for (int i = 20; i <= 30; i++) {
+            assertThat(bitSet.get(i)).isFalse();
+        }
+    }
+
+    @Test
+    public void givenBitSet_whenClearing_thenShouldBeFalse() {
+        BitSet bitSet = new BitSet();
+        bitSet.set(42);
+        assertThat(bitSet.get(42)).isTrue();
+
+        bitSet.clear(42);
+        assertThat(bitSet.get(42)).isFalse();
+
+        bitSet.set(10, 20);
+        for (int i = 10; i < 20; i++) {
+            assertThat(bitSet.get(i)).isTrue();
+        }
+
+        bitSet.clear(10, 20);
+        for (int i = 10; i < 20; i++) {
+            assertThat(bitSet.get(i)).isFalse();
+        }
+
+        bitSet.set(10, 20);
+        bitSet.clear();
+        for (int i = 0; i < 100; i++) {
+            assertThat(bitSet.get(i)).isFalse();
+        }
+    }
+
+    @Test
+    public void givenBitSet_whenGettingElements_thenShouldReturnRequestedBits() {
+        BitSet bitSet = new BitSet();
+        bitSet.set(42);
+
+        assertThat(bitSet.get(42)).isTrue();
+        assertThat(bitSet.get(43)).isFalse();
+
+        bitSet.set(10, 20);
+        BitSet newBitSet = bitSet.get(10, 20);
+        for (int i = 0; i < 10; i++) {
+            assertThat(newBitSet.get(i)).isTrue();
+        }
+    }
+
+    @Test
+    public void givenBitSet_whenFlip_thenTogglesTrueToFalseAndViceVersa() {
+        BitSet bitSet = new BitSet();
+        bitSet.set(42);
+        bitSet.flip(42);
+        assertThat(bitSet.get(42)).isFalse();
+
+        bitSet.flip(12);
+        assertThat(bitSet.get(12)).isTrue();
+
+        bitSet.flip(30, 40);
+        for (int i = 30; i < 40; i++) {
+            assertThat(bitSet.get(i)).isTrue();
+        }
+    }
+
+    @Test
+    public void givenBitSet_whenGettingTheSize_thenReturnsTheSize() {
+        BitSet defaultBitSet = new BitSet();
+        assertThat(defaultBitSet.size()).isEqualTo(64);
+
+        BitSet bitSet = new BitSet(1024);
+        assertThat(bitSet.size()).isEqualTo(1024);
+
+        assertThat(bitSet.cardinality()).isEqualTo(0);
+        bitSet.set(10, 30);
+        assertThat(bitSet.cardinality()).isEqualTo(30 - 10);
+
+        assertThat(bitSet.length()).isEqualTo(30);
+        bitSet.set(100);
+        assertThat(bitSet.length()).isEqualTo(101);
+
+        assertThat(bitSet.isEmpty()).isFalse();
+        bitSet.clear();
+        assertThat(bitSet.isEmpty()).isTrue();
+    }
+
+    @Test
+    public void givenBitSet_whenSetOperations_thenShouldReturnAnotherBitSet() {
+        BitSet first = new BitSet();
+        first.set(5, 10);
+
+        BitSet second = new BitSet();
+        second.set(7, 15);
+
+        assertThat(first.intersects(second)).isTrue();
+
+        first.and(second);
+        assertThat(first.get(7)).isTrue();
+        assertThat(first.get(8)).isTrue();
+        assertThat(first.get(9)).isTrue();
+        assertThat(first.get(10)).isFalse();
+
+        first.clear();
+        first.set(5, 10);
+
+        first.xor(second);
+        for (int i = 5; i < 7; i++) {
+            assertThat(first.get(i)).isTrue();
+        }
+        for (int i = 10; i < 15; i++) {
+            assertThat(first.get(i)).isTrue();
+        }
+    }
+
+    @Test
+    public void givenBitSet_whenStream_thenStreamsAllSetBits() {
+        BitSet bitSet = new BitSet();
+        bitSet.set(15, 25);
+
+        bitSet.stream().forEach(System.out::println);
+        assertThat(bitSet.stream().count()).isEqualTo(10);
+    }
+
+    @Test
+    public void givenBitSet_whenNextOrPrev_thenReturnsTheNextOrPrevClearOrSetBit() {
+        BitSet bitSet = new BitSet();
+        bitSet.set(15, 25);
+
+        assertThat(bitSet.nextSetBit(13)).isEqualTo(15);
+        assertThat(bitSet.nextSetBit(25)).isEqualTo(-1);
+
+        assertThat(bitSet.nextClearBit(23)).isEqualTo(25);
+
+        assertThat(bitSet.previousClearBit(24)).isEqualTo(14);
+        assertThat(bitSet.previousSetBit(29)).isEqualTo(24);
+        assertThat(bitSet.previousSetBit(14)).isEqualTo(-1);
+    }
+}
@@ -21,6 +21,12 @@
            <artifactId>commons-collections4</artifactId>
            <version>${commons-collections4.version}</version>
        </dependency>
+        <dependency>
+            <groupId>com.google.guava</groupId>
+            <artifactId>guava</artifactId>
+            <version>${guava.version}</version>
+            <scope>compile</scope>
+        </dependency>
        <dependency>
            <groupId>org.assertj</groupId>
            <artifactId>assertj-core</artifactId>
@@ -0,0 +1,96 @@
+package com.baeldung.list.difference;
+
+import com.google.common.collect.Sets;
+import org.apache.commons.collections4.CollectionUtils;
+import org.junit.Test;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+import java.util.stream.Collectors;
+
+import static org.junit.jupiter.api.Assertions.*;
+import static org.assertj.core.api.Assertions.*;
+
+public class FindDifferencesBetweenListsUnitTest {
+
+    private static final List<String> listOne = Arrays.asList("Jack", "Tom", "Sam", "John", "James", "Jack");
+    private static final List<String> listTwo = Arrays.asList("Jack", "Daniel", "Sam", "Alan", "James", "George");
+
+    @Test
+    public void givenLists_whenUsingPlainJavaImpl_thenDifferencesAreFound() {
+        List<String> differences = new ArrayList<>(listOne);
+        differences.removeAll(listTwo);
+        assertEquals(2, differences.size());
+        assertThat(differences).containsExactly("Tom", "John");
+    }
+
+    @Test
+    public void givenReverseLists_whenUsingPlainJavaImpl_thenDifferencesAreFound() {
+        List<String> differences = new ArrayList<>(listTwo);
+        differences.removeAll(listOne);
+        assertEquals(3, differences.size());
+        assertThat(differences).containsExactly("Daniel", "Alan", "George");
+    }
+
+    @Test
+    public void givenLists_whenUsingJavaStreams_thenDifferencesAreFound() {
+        List<String> differences = listOne.stream()
+                .filter(element -> !listTwo.contains(element))
+                .collect(Collectors.toList());
+        assertEquals(2, differences.size());
+        assertThat(differences).containsExactly("Tom", "John");
+    }
+
+    @Test
+    public void givenReverseLists_whenUsingJavaStreams_thenDifferencesAreFound() {
+        List<String> differences = listTwo.stream()
+                .filter(element -> !listOne.contains(element))
+                .collect(Collectors.toList());
+        assertEquals(3, differences.size());
+        assertThat(differences).containsExactly("Daniel", "Alan", "George");
+    }
+
+    @Test
+    public void givenLists_whenUsingGoogleGuava_thenDifferencesAreFound() {
+        List<String> differences = new ArrayList<>(Sets.difference(Sets.newHashSet(listOne), Sets.newHashSet(listTwo)));
+        assertEquals(2, differences.size());
+        assertThat(differences).containsExactlyInAnyOrder("Tom", "John");
+    }
+
+    @Test
+    public void givenReverseLists_whenUsingGoogleGuava_thenDifferencesAreFound() {
+        List<String> differences = new ArrayList<>(Sets.difference(Sets.newHashSet(listTwo), Sets.newHashSet(listOne)));
+        assertEquals(3, differences.size());
+        assertThat(differences).containsExactlyInAnyOrder("Daniel", "Alan", "George");
+    }
+
+    @Test
+    public void givenLists_whenUsingApacheCommons_thenDifferencesAreFound() {
+        List<String> differences = new ArrayList<>((CollectionUtils.removeAll(listOne, listTwo)));
+        assertEquals(2, differences.size());
+        assertThat(differences).containsExactly("Tom", "John");
+    }
+
+    @Test
+    public void givenReverseLists_whenUsingApacheCommons_thenDifferencesAreFound() {
+        List<String> differences = new ArrayList<>((CollectionUtils.removeAll(listTwo, listOne)));
+        assertEquals(3, differences.size());
+        assertThat(differences).containsExactly("Daniel", "Alan", "George");
+    }
+
+    @Test
+    public void givenLists_whenUsingPlainJavaImpl_thenDifferencesWithDuplicatesAreFound() {
+        List<String> differences = new ArrayList<>(listOne);
+        listTwo.forEach(differences::remove);
+        assertThat(differences).containsExactly("Tom", "John", "Jack");
+    }
+
+    @Test
+    public void givenLists_whenUsingApacheCommons_thenDifferencesWithDuplicatesAreFound() {
+        List<String> differences = new ArrayList<>(CollectionUtils.subtract(listOne, listTwo));
+        assertEquals(3, differences.size());
+        assertThat(differences).containsExactly("Tom", "John", "Jack");
+    }
+
+}
@@ -21,20 +21,15 @@
            <version>${eclipse-collections.version}</version>
        </dependency>
        <dependency>
-            <groupId>net.sf.trove4j</groupId>
-            <artifactId>trove4j</artifactId>
-            <version>${trove4j.version}</version>
+            <groupId>com.carrotsearch</groupId>
+            <artifactId>hppc</artifactId>
+            <version>${hppc.version}</version>
        </dependency>
        <dependency>
            <groupId>it.unimi.dsi</groupId>
            <artifactId>fastutil</artifactId>
            <version>${fastutil.version}</version>
        </dependency>
-        <dependency>
-            <groupId>colt</groupId>
-            <artifactId>colt</artifactId>
-            <version>${colt.version}</version>
-        </dependency>
        <dependency>
            <groupId>org.apache.commons</groupId>
            <artifactId>commons-lang3</artifactId>
@@ -69,9 +64,8 @@
        <commons-collections4.version>4.1</commons-collections4.version>
        <avaitility.version>1.7.0</avaitility.version>
        <eclipse-collections.version>8.2.0</eclipse-collections.version>
-        <trove4j.version>3.0.2</trove4j.version>
+        <hppc.version>0.7.2</hppc.version>
        <fastutil.version>8.1.0</fastutil.version>
-        <colt.version>1.2.0</colt.version>
        <assertj.version>3.11.1</assertj.version>
    </properties>

@@ -1,29 +1,68 @@
 package com.baeldung.map.primitives;

-import cern.colt.map.AbstractIntDoubleMap;
-import cern.colt.map.OpenIntDoubleHashMap;
-import gnu.trove.map.TDoubleIntMap;
-import gnu.trove.map.hash.TDoubleIntHashMap;
+import com.carrotsearch.hppc.IntLongHashMap;
+import com.carrotsearch.hppc.IntLongScatterMap;
+import com.carrotsearch.hppc.IntObjectHashMap;
+import com.carrotsearch.hppc.IntObjectMap;
+import com.carrotsearch.hppc.IntObjectScatterMap;
+
 import it.unimi.dsi.fastutil.ints.Int2BooleanMap;
+import it.unimi.dsi.fastutil.ints.Int2BooleanMaps;
 import it.unimi.dsi.fastutil.ints.Int2BooleanOpenHashMap;
 import it.unimi.dsi.fastutil.ints.Int2BooleanSortedMap;
 import it.unimi.dsi.fastutil.ints.Int2BooleanSortedMaps;
+import it.unimi.dsi.fastutil.objects.ObjectIterator;
+
 import org.eclipse.collections.api.map.primitive.ImmutableIntIntMap;
 import org.eclipse.collections.api.map.primitive.MutableIntIntMap;
 import org.eclipse.collections.api.map.primitive.MutableObjectDoubleMap;
 import org.eclipse.collections.impl.factory.primitive.IntIntMaps;
 import org.eclipse.collections.impl.factory.primitive.ObjectDoubleMaps;

+import static java.lang.String.format;
+
+import java.math.BigDecimal;
+
 public class PrimitiveMaps {

    public static void main(String[] args) {

+        hppcMap();
        eclipseCollectionsMap();
-        troveMap();
-        coltMap();
        fastutilMap();
    }

+    private static void hppcMap() {
+        //Regular maps
+        IntLongHashMap intLongHashMap = new IntLongHashMap();
+        intLongHashMap.put(25,1L);
+        intLongHashMap.put(150,Long.MAX_VALUE);
+        intLongHashMap.put(1,0L);
+        
+        intLongHashMap.get(150);
+
+        IntObjectMap<BigDecimal> intObjectMap = new IntObjectHashMap<BigDecimal>();
+        intObjectMap.put(1, BigDecimal.valueOf(1));
+        intObjectMap.put(2, BigDecimal.valueOf(2500));
+
+        BigDecimal value = intObjectMap.get(2);
+
+        //Scatter maps
+        IntLongScatterMap intLongScatterMap = new IntLongScatterMap();
+        intLongScatterMap.put(1, 1L);
+        intLongScatterMap.put(2, -2L);
+        intLongScatterMap.put(1000,0L);    
+
+        intLongScatterMap.get(1000);
+
+        IntObjectScatterMap<BigDecimal> intObjectScatterMap = new IntObjectScatterMap<BigDecimal>();
+        intObjectScatterMap.put(1, BigDecimal.valueOf(1));
+        intObjectScatterMap.put(2, BigDecimal.valueOf(2500));
+
+        value = intObjectScatterMap.get(2);
+    }
+
+
    private static void fastutilMap() {
        Int2BooleanMap int2BooleanMap = new Int2BooleanOpenHashMap();
        int2BooleanMap.put(1, true);
@@ -32,13 +71,19 @@ public class PrimitiveMaps {

        boolean value = int2BooleanMap.get(1);

-        Int2BooleanSortedMap int2BooleanSorted = Int2BooleanSortedMaps.EMPTY_MAP;
-    }
+        //Lambda style iteration
+        Int2BooleanMaps.fastForEach(int2BooleanMap, entry -> {
+            System.out.println(String.format("Key: %d, Value: %b",entry.getIntKey(),entry.getBooleanValue()));
+        });
+
+        //Iterator based loop
+        ObjectIterator<Int2BooleanMap.Entry> iterator = Int2BooleanMaps.fastIterator(int2BooleanMap);
+        while(iterator.hasNext()) {
+            Int2BooleanMap.Entry entry = iterator.next();
+            System.out.println(String.format("Key: %d, Value: %b",entry.getIntKey(),entry.getBooleanValue()));
+
+        }

-    private static void coltMap() {
-        AbstractIntDoubleMap map = new OpenIntDoubleHashMap();
-        map.put(1, 4.5);
-        double value = map.get(1);
    }

    private static void eclipseCollectionsMap() {
@@ -53,17 +98,5 @@ public class PrimitiveMaps {
        dObject.addToValue("stability", 0.8);
    }

-    private static void troveMap() {
-        double[] doubles = new double[] {1.2, 4.5, 0.3};
-        int[] ints = new int[] {1, 4, 0};

-        TDoubleIntMap doubleIntMap = new TDoubleIntHashMap(doubles, ints);
-
-        doubleIntMap.put(1.2, 22);
-        doubleIntMap.put(4.5, 16);
-
-        doubleIntMap.adjustValue(1.2, 1);
-        doubleIntMap.adjustValue(4.5, 4);
-        doubleIntMap.adjustValue(0.3, 7);
-    }
 }
@@ -15,7 +15,15 @@ import java.util.logging.Logger;

 import static org.junit.Assert.fail;

-public class PrimeNumbersUnitManualTest {
+/**
+ * This test expects the file target/test-classes/META-INF/BenchmarkList to be present.
+ *
+ * Before running the test ensure that the file is present. 
+ * If not, please run mvn install on the module.
+ * 
+ */
+
+public class PrimeNumbersManualTest {

    private static Logger logger = Logger.getAnonymousLogger();

@@ -0,0 +1,25 @@
+package com.baeldung.threadlocal;
+
+import java.util.concurrent.BlockingQueue;
+import java.util.concurrent.RejectedExecutionHandler;
+import java.util.concurrent.ThreadFactory;
+import java.util.concurrent.ThreadPoolExecutor;
+import java.util.concurrent.TimeUnit;
+
+public class ThreadLocalAwareThreadPool extends ThreadPoolExecutor {
+
+    public ThreadLocalAwareThreadPool(int corePoolSize,
+      int maximumPoolSize,
+      long keepAliveTime,
+      TimeUnit unit,
+      BlockingQueue<Runnable> workQueue,
+      ThreadFactory threadFactory,
+      RejectedExecutionHandler handler) {
+        super(corePoolSize, maximumPoolSize, keepAliveTime, unit, workQueue, threadFactory, handler);
+    }
+
+    @Override
+    protected void afterExecute(Runnable r, Throwable t) {
+        // Call remove on each ThreadLocal
+    }
+}
--- a/Show More
+++ b/Show More