Merge branch 'eugenp:master' into master

algorithms-modules/algorithms-miscellaneous-5/pom.xml

@@ -5,6 +5,18 @@
     <modelVersion>4.0.0</modelVersion>
     <artifactId>algorithms-miscellaneous-5</artifactId>
     <version>0.0.1-SNAPSHOT</version>
+    <build>
+        <plugins>
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-compiler-plugin</artifactId>
+                <configuration>
+                    <source>17</source>
+                    <target>17</target>
+                </configuration>
+            </plugin>
+        </plugins>
+    </build>
     <name>algorithms-miscellaneous-5</name>
 
     <parent>

algorithms-modules/algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/conversion/HexStringConverter.java

@@ -1,15 +1,12 @@
 package com.baeldung.algorithms.conversion;
 
-import java.math.BigInteger;
-
-
-
+import com.google.common.io.BaseEncoding;
+import jakarta.xml.bind.DatatypeConverter;
 import org.apache.commons.codec.DecoderException;
 import org.apache.commons.codec.binary.Hex;
 
-import com.google.common.io.BaseEncoding;
-
-import jakarta.xml.bind.DatatypeConverter;
+import java.math.BigInteger;
+import java.util.HexFormat;
 
 public class HexStringConverter {
 
@@ -109,4 +106,14 @@ public class HexStringConverter {
         return BaseEncoding.base16()
             .decode(hexString.toUpperCase());
     }
+
+    public String encodeUsingHexFormat(byte[] bytes) {
+        HexFormat hexFormat = HexFormat.of();
+        return hexFormat.formatHex(bytes);
+    }
+
+    public byte[] decodeUsingHexFormat(String hexString) {
+        HexFormat hexFormat = HexFormat.of();
+        return hexFormat.parseHex(hexString);
+    }
 }

algorithms-modules/algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/conversion/ByteArrayConverterUnitTest.java

@@ -1,15 +1,13 @@
 package com.baeldung.algorithms.conversion;
 
-import static org.hamcrest.MatcherAssert.assertThat;
-import static org.junit.jupiter.api.Assertions.assertArrayEquals;
-import static org.junit.jupiter.api.Assertions.assertThrows;
-
 import org.apache.commons.codec.DecoderException;
 import org.hamcrest.text.IsEqualIgnoringCase;
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
 
-import com.baeldung.algorithms.conversion.HexStringConverter;
+import static org.hamcrest.MatcherAssert.assertThat;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 class ByteArrayConverterUnitTest {
 
@@ -24,7 +22,7 @@ class ByteArrayConverterUnitTest {
     void shouldEncodeByteArrayToHexStringUsingBigIntegerToString() {
         byte[] bytes = getSampleBytes();
         String hexString = getSampleHexString();
-        if(hexString.charAt(0) == '0') {
+        if (hexString.charAt(0) == '0') {
             hexString = hexString.substring(1);
         }
         String output = hexStringConverter.encodeUsingBigIntegerToString(bytes);
@@ -46,7 +44,7 @@ class ByteArrayConverterUnitTest {
         byte[] output = hexStringConverter.decodeUsingBigInteger(hexString);
         assertArrayEquals(bytes, output);
     }
-    
+
     @Test
     void shouldEncodeByteArrayToHexStringUsingCharacterConversion() {
         byte[] bytes = getSampleBytes();
@@ -62,7 +60,7 @@ class ByteArrayConverterUnitTest {
         byte[] output = hexStringConverter.decodeHexString(hexString);
         assertArrayEquals(bytes, output);
     }
-    
+
     @Test
     void shouldDecodeHexToByteWithInvalidHexCharacter() {
         assertThrows(IllegalArgumentException.class, () -> {
@@ -118,12 +116,28 @@ class ByteArrayConverterUnitTest {
         assertArrayEquals(bytes, output);
     }
 
+    @Test
+    void shouldEncodeByteArrayToHexStringUsingHexFormat() throws DecoderException {
+        byte[] bytes = getSampleBytes();
+        String hexString = getSampleHexString();
+        String output = hexStringConverter.encodeUsingHexFormat(bytes);
+        assertThat(output, IsEqualIgnoringCase.equalToIgnoringCase(hexString));
+    }
+
+    @Test
+    void shouldDecodeHexStringToByteArrayUsingHexFormat() throws DecoderException {
+        byte[] bytes = getSampleBytes();
+        String hexString = getSampleHexString();
+        byte[] output = hexStringConverter.decodeUsingHexFormat(hexString);
+        assertArrayEquals(bytes, output);
+    }
+
     private String getSampleHexString() {
         return "0af50c0e2d10";
     }
 
     private byte[] getSampleBytes() {
-        return new byte[] { 10, -11, 12, 14, 45, 16 };
+        return new byte[]{10, -11, 12, 14, 45, 16};
     }
 
 }

algorithms-modules/algorithms-miscellaneous-7/pom.xml

@@ -13,4 +13,22 @@
         <version>1.0.0-SNAPSHOT</version>
     </parent>
 
+    <properties>
+        <jmh.version>1.35</jmh.version>
+    </properties>
+
+    <dependencies>
+        <dependency>
+            <groupId>org.openjdk.jmh</groupId>
+            <artifactId>jmh-core</artifactId>
+            <version>${jmh.version}</version>
+        </dependency>
+
+        <dependency>
+            <groupId>org.openjdk.jmh</groupId>
+            <artifactId>jmh-generator-annprocess</artifactId>
+            <version>${jmh.version}</version>
+        </dependency>
+    </dependencies>
+
 </project>

algorithms-modules/algorithms-miscellaneous-7/src/main/java/com/baeldung/algorithms/perfectnumber/PerfectNumber.java

@@ -0,0 +1,50 @@
+package com.baeldung.algorithms.perfectnumber;
+
+import java.util.stream.IntStream;
+
+class PerfectNumber {
+
+    public static boolean isPerfectBruteForce(int number) {
+        int sum = 0;
+        for (int i = 1; i <= number / 2; i++) {
+            if (number % i == 0) {
+                sum += i;
+            }
+        }
+        return sum == number;
+    }
+
+    public static boolean isPerfectStream(int number) {
+        int sum = IntStream.rangeClosed(2, (int) Math.sqrt(number))
+                .filter(test -> number % test == 0)
+                .reduce(1, (s, test) -> s + test + (number / test));
+        return sum == number;
+    }
+
+    public static boolean isPerfectEuclidEuler(int number) {
+        int p = 2;
+        int perfectNumber = (int) (Math.pow(2, p - 1) * (Math.pow(2, p) - 1));
+        while (perfectNumber <= number) {
+            if (perfectNumber == number) {
+                return true;
+            }
+            p++;
+            perfectNumber = (int) (Math.pow(2, p - 1) * (Math.pow(2, p) - 1));
+        }
+        return false;
+    }
+
+    public static boolean isPerfectEuclidEulerUsingShift(int number) {
+        int p = 2;
+        int perfectNumber = (2 << (p - 1)) * ((2 << p) - 1);
+        while (perfectNumber <= number) {
+            if (perfectNumber == number) {
+                return true;
+            }
+            p++;
+            perfectNumber = (2 << (p - 1)) * ((2 << p) - 1);
+        }
+        return false;
+    }
+
+}

algorithms-modules/algorithms-miscellaneous-7/src/main/java/com/baeldung/algorithms/perfectnumber/PerfectNumberBenchmark.java

@@ -0,0 +1,41 @@
+package com.baeldung.algorithms.perfectnumber;
+
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.State;
+import org.openjdk.jmh.runner.Runner;
+import org.openjdk.jmh.runner.options.Options;
+import org.openjdk.jmh.runner.options.OptionsBuilder;
+
+@State(Scope.Benchmark)
+public class PerfectNumberBenchmark {
+
+    @Benchmark
+    public boolean bruteForceBenchmark() {
+        return PerfectNumber.isPerfectBruteForce(33550336);
+    }
+
+    @Benchmark
+    public boolean streamBenchmark() {
+        return PerfectNumber.isPerfectStream(33550336);
+    }
+
+    @Benchmark
+    public boolean euclidEulerBenchmark() {
+        return PerfectNumber.isPerfectEuclidEuler(33550336);
+    }
+
+    @Benchmark
+    public boolean euclidEulerUsingShiftBenchmark() {
+        return PerfectNumber.isPerfectEuclidEulerUsingShift(33550336);
+    }
+
+    public static void main(String[] args) throws Exception {
+        Options options = new OptionsBuilder()
+                .include(PerfectNumberBenchmark.class.getSimpleName())
+                .forks(1)
+                .build();
+
+        new Runner(options).run();
+    }
+}

algorithms-modules/algorithms-miscellaneous-7/src/test/java/com/baeldung/algorithms/perfectnumber/PerfectNumberUnitTest.java

@@ -0,0 +1,68 @@
+package com.baeldung.algorithms.perfectnumber;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+class PerfectNumberUnitTest {
+    @Test
+    void givenPerfectNumber_whenCheckingIsPerfectBruteForce_thenReturnTrue() {
+        assertTrue(PerfectNumber.isPerfectBruteForce(6));
+    }
+
+    @Test
+    void givenNonPerfectNumber_whenCheckingIsPerfectBruteForce_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectBruteForce(10));
+    }
+
+    @Test
+    void givenNegativeNumber_whenCheckingIsPerfectBruteForce_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectBruteForce(-28));
+    }
+
+    @Test
+    void givenPerfectNumber_whenCheckingIsPerfectStream_thenReturnTrue() {
+        assertTrue(PerfectNumber.isPerfectStream(28));
+    }
+
+    @Test
+    void givenNonPerfectNumber_whenCheckingIsPerfectStream_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectStream(10));
+    }
+
+    @Test
+    void givenNegativeNumber_whenCheckingIsPerfectStream_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectStream(-6));
+    }
+
+    @Test
+    void givenPerfectNumber_whenCheckingIsPerfectEuclidEuler_thenReturnTrue() {
+        assertTrue(PerfectNumber.isPerfectEuclidEuler(28));
+    }
+
+    @Test
+    void givenNonPerfectNumber_whenCheckingIsPerfectEuclidEuler_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectEuclidEuler(10));
+    }
+
+    @Test
+    void givenNegativeNumber_whenCheckingIsPerfectEuclidEuler_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectEuclidEuler(-6));
+    }
+
+    @Test
+    void givenPerfectNumber_whenCheckingIsPerfectEuclidEulerUsingShift_thenReturnTrue() {
+        assertTrue(PerfectNumber.isPerfectEuclidEulerUsingShift(28));
+    }
+
+    @Test
+    void givenNonPerfectNumber_whenCheckingIsPerfectEuclidEulerUsingShift_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectEuclidEulerUsingShift(10));
+    }
+
+    @Test
+    void givenNegativeNumber_whenCheckingIsPerfectEuclidEulerUsingShift_thenReturnFalse() {
+        assertFalse(PerfectNumber.isPerfectEuclidEulerUsingShift(-6));
+    }
+}

algorithms-modules/algorithms-miscellaneous-8/README.md

@@ -1,2 +1,3 @@
 ### Relevant Articles: 
 - [Vigenère Cipher in Java](https://www.baeldung.com/java-vigenere-cipher)
+- [Merge Overlapping Intervals in a Java Collection](https://www.baeldung.com/java-collection-merge-overlapping-intervals)

algorithms-modules/algorithms-miscellaneous-8/src/main/java/com/baeldung/algorithms/mergeintervals/Interval.java

@@ -0,0 +1,37 @@
+package com.baeldung.algorithms.mergeintervals;
+
+import java.util.Objects;
+
+public class Interval {
+    int start;
+    int end;
+
+    Interval(int start, int end) {
+        this.start = start;
+        this.end = end;
+    }
+
+    public void setEnd(int end) {
+        this.end = end;
+    }
+
+    @Override
+    public String toString() {
+        return "Interval{" + "start=" + start + ", end=" + end + '}';
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o)
+            return true;
+        if (o == null || getClass() != o.getClass())
+            return false;
+        Interval interval = (Interval) o;
+        return start == interval.start && end == interval.end;
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(start, end);
+    }
+}

algorithms-modules/algorithms-miscellaneous-8/src/main/java/com/baeldung/algorithms/mergeintervals/MergeOverlappingIntervals.java

@@ -0,0 +1,29 @@
+package com.baeldung.algorithms.mergeintervals;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class MergeOverlappingIntervals {
+
+    public List<Interval> doMerge(List<Interval> intervals) {
+        // Sort the intervals based on start time
+        intervals.sort((one, two) -> one.start - two.start);
+
+        // Create somewhere to put the merged list, start it off with the earliest starting interval
+        ArrayList<Interval> merged = new ArrayList<>();
+        merged.add(intervals.get(0));
+
+        // Loop over each interval and merge if start time is before the end time of the
+        // previous interval
+        intervals.forEach(interval -> {
+            if (merged.get(merged.size() - 1).end > interval.start) {
+                merged.get(merged.size() - 1).setEnd(interval.end);
+            } else {
+                merged.add(interval);
+            }
+        });
+
+        return merged;
+    }
+
+}

algorithms-modules/algorithms-miscellaneous-8/src/main/java/com/baeldung/algorithms/skiplist/Node.java

@@ -0,0 +1,11 @@
+package com.baeldung.algorithms.skiplist;
+
+class Node {
+    int value;
+    Node[] forward; // array to hold references to different levels
+
+    public Node(int value, int level) {
+        this.value = value;
+        this.forward = new Node[level + 1]; // level + 1 because level is 0-based
+    }
+}

algorithms-modules/algorithms-miscellaneous-8/src/main/java/com/baeldung/algorithms/skiplist/SkipList.java

@@ -0,0 +1,92 @@
+package com.baeldung.algorithms.skiplist;
+
+
+import java.util.Random;
+
+public class SkipList {
+    private Node head;
+    private int maxLevel;
+    private int level;
+    private Random random;
+
+    public SkipList() {
+        maxLevel = 16; // maximum number of levels
+        level = 0; // current level of SkipList
+        head = new Node(Integer.MIN_VALUE, maxLevel);
+        random = new Random();
+    }
+
+    public void insert(int value) {
+        Node[] update = new Node[maxLevel + 1];
+        Node current = this.head;
+
+        for (int i = level; i >= 0; i--) {
+            while (current.forward[i] != null && current.forward[i].value < value) {
+                current = current.forward[i];
+            }
+            update[i] = current;
+        }
+
+        current = current.forward[0];
+
+        if (current == null || current.value != value) {
+            int lvl = randomLevel();
+
+            if (lvl > level) {
+                for (int i = level + 1; i <= lvl; i++) {
+                    update[i] = head;
+                }
+                level = lvl;
+            }
+
+            Node newNode = new Node(value, lvl);
+            for (int i = 0; i <= lvl; i++) {
+                newNode.forward[i] = update[i].forward[i];
+                update[i].forward[i] = newNode;
+            }
+        }
+    }
+
+    public boolean search(int value) {
+        Node current = this.head;
+        for (int i = level; i >= 0; i--) {
+            while (current.forward[i] != null && current.forward[i].value < value) {
+                current = current.forward[i];
+            }
+        }
+        current = current.forward[0];
+        return current != null && current.value == value;
+    }
+
+    public void delete(int value) {
+        Node[] update = new Node[maxLevel + 1];
+        Node current = this.head;
+
+        for (int i = level; i >= 0; i--) {
+            while (current.forward[i] != null && current.forward[i].value < value) {
+                current = current.forward[i];
+            }
+            update[i] = current;
+        }
+        current = current.forward[0];
+
+        if (current != null && current.value == value) {
+            for (int i = 0; i <= level; i++) {
+                if (update[i].forward[i] != current) break;
+                update[i].forward[i] = current.forward[i];
+            }
+
+            while (level > 0 && head.forward[level] == null) {
+                level--;
+            }
+        }
+    }
+
+    private int randomLevel() {
+        int lvl = 0;
+        while (lvl < maxLevel && random.nextDouble() < 0.5) {
+            lvl++;
+        }
+        return lvl;
+    }
+}

algorithms-modules/algorithms-miscellaneous-8/src/test/java/com/baeldung/algorithms/mergeintervals/MergeIntervalsUnitTest.java

@@ -0,0 +1,30 @@
+package com.baeldung.algorithms.mergeintervals;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+
+import org.junit.jupiter.api.Test;
+
+class MergeIntervalsUnitTest {
+
+    private ArrayList<Interval> intervals = new ArrayList<>(Arrays.asList(
+      new Interval(2, 5),
+      new Interval(13, 20),
+      new Interval(11, 15),
+      new Interval(1, 3)
+    ));
+    private ArrayList<Interval> intervalsMerged = new ArrayList<>(Arrays.asList(
+      new Interval(1, 5),
+      new Interval(11, 20)
+    ));
+
+    @Test
+    void givenIntervals_whenMerging_thenReturnMergedIntervals() {
+        MergeOverlappingIntervals merger = new MergeOverlappingIntervals();
+        ArrayList<Interval> result = (ArrayList<Interval>) merger.doMerge(intervals);
+        assertArrayEquals(intervalsMerged.toArray(), result.toArray());
+    }
+
+}

algorithms-modules/algorithms-miscellaneous-8/src/test/java/com/baeldung/algorithms/skiplist/SkipListUnitTest.java

@@ -0,0 +1,34 @@
+package com.baeldung.algorithms.skiplist;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+public class SkipListUnitTest {
+
+    @Test
+    public void givenSkipList_WhenInsert_ThenSearchFound() {
+        SkipList skipList = new SkipList();
+
+        skipList.insert(3);
+        assertTrue(skipList.search(3), "Should find 3");
+
+        assertFalse(skipList.search(99), "Should not find 99");
+    }
+
+    @Test
+    public void givenSkipList_WhenDeleteElement_ThenRemoveFromList() {
+        SkipList skipList = new SkipList();
+
+        skipList.insert(3);
+        skipList.insert(7);
+
+        skipList.delete(3);
+        assertFalse(skipList.search(3), "3 should have been deleted");
+
+        skipList.delete(99);
+        assertTrue(skipList.search(7), "7 should still exist");
+    }
+
+}

apache-libraries-2/README.md

@@ -1,5 +1,6 @@
 ## Relevant Articles
 - [Understanding XSLT Processing in Java](https://www.baeldung.com/java-extensible-stylesheet-language-transformations)
 - [Add Camel Route at Runtime in Java](https://www.baeldung.com/java-camel-dynamic-route)
-
+- [Logging in Apache Camel](https://www.baeldung.com/java-apache-camel-logging)
 - More articles: [[<-- prev]](../apache-libraries)
+

apache-libraries-2/data/inbox/welcome.txt

@@ -0,0 +1 @@
+Welcome to Baeldung

apache-libraries-2/data/json/name.json

@@ -0,0 +1,4 @@
+{
+  "name" : "phillip",
+  "age" : 5
+}

apache-libraries-2/data/outbox/welcome.txt

@@ -0,0 +1 @@
+WELCOME TO BAELDUNG

apache-libraries-2/data/output/name.json

@@ -0,0 +1 @@
+{"name":"phillip","age":5,"transformedName":"PHILLIP","transformedAge":15}

apache-libraries-2/pom.xml

@@ -35,11 +35,16 @@
             <artifactId>camel-main</artifactId>
             <version>${camel.version}</version>
         </dependency>
+        <dependency>
+            <groupId>org.apache.camel</groupId>
+            <artifactId>camel-jackson</artifactId>
+            <version>${camel.version}</version>
+        </dependency>
     </dependencies>
 
     <properties>
         <javax.validation.validation-api.version>2.0.1.Final</javax.validation.validation-api.version>
-        <camel.version>4.3.0</camel.version>
+        <camel.version>4.4.1</camel.version>
     </properties>
 
 </project>

apache-libraries-2/src/main/java/com/baeldung/apachecamellogging/CamelLoggingMainApp.java

@@ -0,0 +1,13 @@
+package com.baeldung.apachecamellogging;
+
+import org.apache.camel.main.Main;
+
+public class CamelLoggingMainApp {
+
+    public static void main(String[] args) throws Exception {
+        Main main = new Main();
+        main.configure()
+            .addRoutesBuilder(new FileCopierCamelRoute());
+        main.run(args);
+    }
+}

apache-libraries-2/src/main/java/com/baeldung/apachecamellogging/FileCopierCamelRoute.java

@@ -0,0 +1,25 @@
+package com.baeldung.apachecamellogging;
+
+import org.apache.camel.LoggingLevel;
+import org.apache.camel.builder.RouteBuilder;
+
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+public class FileCopierCamelRoute extends RouteBuilder {
+
+    private static final Logger LOGGER = LoggerFactory.getLogger(FileCopierCamelRoute.class);
+
+    public void configure() {
+        from("file:data/inbox?noop=true").log("We got an incoming file ${file:name} containing: ${body}")
+            .to("log:com.baeldung.apachecamellogging?level=INFO")
+            .process(process -> {
+                LOGGER.info("We are passing the message to a FileProcesor bean to capitalize the message body");
+            })
+            .bean(FileProcessor.class)
+            .to("file:data/outbox")
+            .to("log:com.baeldung.apachecamellogging?showBodyType=false&maxChars=20")
+            .log(LoggingLevel.DEBUG, "Output Process", "The Process ${id}")
+            .log("Successfully transfer file: ${file:name}");
+    }
+}

apache-libraries-2/src/main/java/com/baeldung/apachecamellogging/FileCopierTracerCamelRoute.java

@@ -0,0 +1,22 @@
+package com.baeldung.apachecamellogging;
+
+import org.apache.camel.builder.RouteBuilder;
+import org.apache.camel.model.dataformat.JsonLibrary;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+public class FileCopierTracerCamelRoute extends RouteBuilder {
+
+    Logger logger = LoggerFactory.getLogger(FileCopierTracerCamelRoute.class);
+
+    public void configure() {
+        getContext().setTracing(true);
+        from("file:data/json?noop=true").to("log:input?level=INFO")
+            .unmarshal()
+            .json(JsonLibrary.Jackson)
+            .bean(FileProcessor.class, "transform")
+            .marshal()
+            .json(JsonLibrary.Jackson)
+            .to("file:data/output");
+    }
+}

apache-libraries-2/src/main/java/com/baeldung/apachecamellogging/FileProcessor.java

@@ -0,0 +1,23 @@
+package com.baeldung.apachecamellogging;
+
+import org.apache.camel.Body;
+
+import java.util.Map;
+
+public class FileProcessor {
+
+    public String process(@Body String fileContent) {
+        String processedContent = fileContent.toUpperCase();
+        return processedContent;
+    }
+
+    public Map<String, Object> transform(Map<String, Object> input) {
+        String name = (String) input.get("name");
+        int age = (int) input.get("age");
+
+        input.put("transformedName", name.toUpperCase());
+        input.put("transformedAge", age + 10);
+
+        return input;
+    }
+}

apache-libraries-2/src/test/java/com/baeldung/dynamicrouter/DynamicRouterRouteUnitTest.java

@@ -1,4 +1,4 @@
-package dynamicrouter;
+package com.baeldung.dynamicrouter;
 
 import com.baeldung.dynamicrouter.DynamicRouterRoute;
 import org.apache.camel.RoutesBuilder;

core-java-modules/core-java-18/src/main/java/com/baeldung/inetspi/InetAddressSPI.java

@@ -0,0 +1,44 @@
+package com.baeldung.inetspi;
+
+import java.net.InetAddress;
+import java.net.UnknownHostException;
+import java.util.Arrays;
+import java.util.stream.Stream;
+
+import com.baeldung.inetspi.providers.CustomAddressResolverImpl;
+
+public class InetAddressSPI {
+    public String usingGetByName(String host) throws UnknownHostException {
+        InetAddress inetAddress =  InetAddress.getByName(host);
+        return inetAddress.getHostAddress();
+    }
+
+    public String[] usingGetAllByName(String host) throws UnknownHostException {
+        InetAddress[] inetAddresses =  InetAddress.getAllByName(host);
+        return Arrays.stream(inetAddresses).map(InetAddress::getHostAddress).toArray(String[]::new);
+    }
+
+    public String usingGetByIp(byte[] ip) throws UnknownHostException {
+        InetAddress inetAddress =  InetAddress.getByAddress(ip);
+
+        return inetAddress.getHostName();
+    }
+
+    public String usingGetByIpAndReturnsCannonName(byte[] ip) throws UnknownHostException {
+        InetAddress inetAddress =  InetAddress.getByAddress(ip);
+
+        return inetAddress.getCanonicalHostName();
+    }
+
+    public String getHostUsingCustomImpl(byte[] ip) throws UnknownHostException {
+
+        CustomAddressResolverImpl imp = new CustomAddressResolverImpl();
+        return imp.get(null).lookupByAddress(ip);
+    }
+
+    public Stream<InetAddress> getIpUsingCustomImpl(String host) throws UnknownHostException {
+
+        CustomAddressResolverImpl imp = new CustomAddressResolverImpl();
+        return imp.get(null).lookupByName(host, null);
+    }
+}

core-java-modules/core-java-18/src/main/java/com/baeldung/inetspi/Registry.java

@@ -0,0 +1,56 @@
+package com.baeldung.inetspi;
+
+import java.net.InetAddress;
+import java.net.UnknownHostException;
+import java.util.Arrays;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+import java.util.logging.Logger;
+import java.util.stream.Stream;
+
+public class Registry {
+    private final Map<String, List<byte[]>> registry;
+
+    private static final Logger LOGGER = Logger.getLogger(Registry.class.getName());
+
+    public Registry() {
+        registry = loadMapWithData();
+    }
+
+    public Stream<InetAddress> getAddressesfromHost(String host) throws UnknownHostException {
+        LOGGER.info("Performing Forward Lookup for HOST : " + host);
+        if (!registry.containsKey(host)) {
+            throw new UnknownHostException("Missing Host information in Resolver");
+        }
+        return registry.get(host)
+          .stream()
+          .map(add -> constructInetAddress(host, add))
+          .filter(Objects::nonNull);
+    }
+
+    public String getHostFromAddress(byte[] arr) throws UnknownHostException {
+        LOGGER.info("Performing Reverse Lookup for Address : " + Arrays.toString(arr));
+        for (Map.Entry<String, List<byte[]>> entry : registry.entrySet()) {
+            if (entry.getValue()
+              .stream()
+              .anyMatch(ba -> Arrays.equals(ba, arr))) {
+                return entry.getKey();
+            }
+        }
+        throw new UnknownHostException("Address Not Found");
+    }
+
+    private Map<String, List<byte[]>> loadMapWithData() {
+        return Map.of("baeldung-local.org", List.of(new byte[] { 1, 2, 3, 4 }));
+    }
+
+    private static InetAddress constructInetAddress(String host, byte[] address) {
+        try {
+            return InetAddress.getByAddress(host, address);
+        } catch (UnknownHostException unknownHostException) {
+            return null;
+        }
+    }
+
+}

core-java-modules/core-java-18/src/main/java/com/baeldung/inetspi/providers/CustomAddressResolverImpl.java

@@ -0,0 +1,42 @@
+package com.baeldung.inetspi.providers;
+
+import java.net.InetAddress;
+import java.net.UnknownHostException;
+import java.net.spi.InetAddressResolver;
+import java.net.spi.InetAddressResolverProvider;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.logging.Logger;
+import java.util.stream.Stream;
+
+import com.baeldung.inetspi.Registry;
+
+public class CustomAddressResolverImpl extends InetAddressResolverProvider {
+
+    private static Logger LOGGER = Logger.getLogger(CustomAddressResolverImpl.class.getName());
+
+    private static Registry registry = new Registry();
+
+    @Override
+    public InetAddressResolver get(Configuration configuration) {
+        LOGGER.info("Using Custom Address Resolver :: " + this.name());
+        LOGGER.info("Registry initialised");
+        return new InetAddressResolver() {
+            @Override
+            public Stream<InetAddress> lookupByName(String host, LookupPolicy lookupPolicy) throws UnknownHostException {
+                return registry.getAddressesfromHost(host);
+            }
+
+            @Override
+            public String lookupByAddress(byte[] addr) throws UnknownHostException {
+                return registry.getHostFromAddress(addr);
+            }
+        };
+    }
+
+    @Override
+    public String name() {
+        return "CustomInternetAddressResolverImpl";
+    }
+}

core-java-modules/core-java-18/src/test/java/com/baeldung/inetspi/InetAddressSPIUnitTest.java

@@ -0,0 +1,31 @@
+package com.baeldung.inetspi;
+
+import java.net.InetAddress;
+import java.net.UnknownHostException;
+import java.util.stream.Stream;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+public class InetAddressSPIUnitTest {
+    @Test
+    public void givenInetAddress_whenUsingInetAddress_thenPerformResolution() throws UnknownHostException {
+        InetAddressSPI spi = new InetAddressSPI();
+        Assert.assertNotNull(spi.usingGetByName("www.google.com"));
+        Assert.assertTrue(spi.usingGetAllByName("www.google.com").length > 1);
+        Assert.assertNotNull(spi.usingGetByIp(InetAddress.getByName("www.google.com")
+          .getAddress()));
+        Assert.assertNotNull(spi.usingGetByIpAndReturnsCannonName(InetAddress.getByName("www.google.com")
+          .getAddress()));
+    }
+
+    @Test
+    public void givenCustomInetAddressImplementation_whenUsingInetAddress_thenPerformResolution() throws UnknownHostException {
+        InetAddressSPI spi = new InetAddressSPI();
+        Assert.assertEquals("baeldung-local.org", spi.getHostUsingCustomImpl(new byte[] { 1, 2, 3, 4 }));
+        Stream<InetAddress> response = spi.getIpUsingCustomImpl("baeldung-local.org");
+        Assert.assertArrayEquals(new byte[] { 1, 2, 3, 4 }, response.findFirst()
+          .get()
+          .getAddress());
+    }
+}