Contains all the java related examples
Sorting is one of the major required feature for any application during implementation of any business logic. There are different types of sorting in place based on performance, speed, cost of operation. One of simplest and easy algorithm is Bubble Sort Algorithm which is an easy one to understand/implement for any quick implementation. Sorting a …
Java 8 has introduced java.util.Optional class to find a value present or absent. Normally Java developers do “not null” check to identify whether the Object is null or to be used further for business logic. In a Enterprise application, lot of null checks present as each meaning object is checked, which makes the code messy. …
What is Binary? Binary is a number either 0 or 1, is a base 2-numeral. Every value of Integer can be represented in binary format in a easy way. Simply, to convert Integer value to binary value, divide the integer by 2 until it becomes 0., and store the reminder… 0 – 0000 1 – …
Apache Log4j2 is used for printing info, error, debug, trace logging statements in enterprise applications. Inorder to format all the log messages externally before printing in logs, we need to create Filters in Log4j 1.x versions. In Log4j2 , we can use LogEventPatternConverter to filter/convert/format log messages before printing in the log files in server. …
Configure Log4j2 Converter Plugin -Java (Filter log messages) Read More »
Apache Log4j2 is used for printing info, error, debug, trace logging statements in enterprise applications. Apache Log4j2.x is an extension of Log4j1.x which has more significant features comparatively.Since major security vulnerabilities like Log4jShell & hacking possibilities are identified in Log4j1.x, it is always recommended to use Log4j2.x. It is pretty simple to configure Log4j2 in …
Date conversions are very common scenarios in any application., Java Provides SimpleDateFormat class for String to Date, Date to String conversions. The below example shows How String format can be converted to Date Format. How to find difference between 2 Dates. Code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
import java.text.SimpleDateFormat; import java.util.Date; class Example { public static void main(String args[]) { String date = "11/13/2018"; try { SimpleDateFormat sdf = new SimpleDateFormat("MM/dd/yyyy"); Date parseDate = sdf.parse(date); System.out.println(parseDate); long differenceInMillis = new Date().getTime() - parseDate.getTime(); long differenceInDays = ((differenceInMillis/1000)/(60*60*24)); long year = differenceInDays/365; System.out.println("DifferenceInDays:"+differenceInDays); System.out.println("Age:"+year); } catch(Throwable t) { t.printStackTrace(); } } } |
Output
|
1 2 3 |
Tue Nov 13 00:00:00 UTC 2018 DifferenceInDays:1099 Age:3 |
XSLT is Extensible Style Sheet Transformation which is used to transform/convert a XML to another HTML/XML structure with the help of XSL document. In this example, we are going to convert 1.xml to 2.xml structure with the help of XSL document., in Java. Steps: Load the input XML inside the DOM parser as document. Load …
BlockingQueue is a thread-safe queue where we can enqueue on one end of queue, and dequeue on another end of queue., All BlockingQueue implementions on array or linked queues are thread-safe implementations. Below is a simple usage of BlockingQueue.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 |
import java.util.Queue; import java.util.concurrent.BlockingQueue; import java.util.concurrent.LinkedBlockingQueue; public class BlockingQueuesExamples { public static void main(String[] args) throws InterruptedException { BlockingQueue<String> linkedBlockingQueue = new LinkedBlockingQueue<String>(); linkedBlockingQueue.offer("Apple"); linkedBlockingQueue.offer("Orange"); linkedBlockingQueue.offer("Peach"); queueStatus(linkedBlockingQueue); linkedBlockingQueue.offer("Avacado"); queueStatus(linkedBlockingQueue); System.out.println("Dequeued at Head of Queue: " + linkedBlockingQueue.take()); System.out.println("Dequeued at Head of Queue: " + linkedBlockingQueue.take()); queueStatus(linkedBlockingQueue); } public static void queueStatus(Queue linkedBlockingQueue) { System.out.println("---------------------------"); System.out.println("Linked Blocking Queue Size:" + linkedBlockingQueue.size()); System.out.println("Items:"); System.out.println(linkedBlockingQueue); System.out.println("---------------------------"); } } |
Output:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
--------------------------- Linked Blocking Queue Size:3 Items: [Apple, Orange, Peach] --------------------------- --------------------------- Linked Blocking Queue Size:4 Items: [Apple, Orange, Peach, Avacado] --------------------------- Dequeued at Head of Queue: Apple Dequeued at Head of Queue: Orange --------------------------- Linked Blocking Queue Size:2 Items: [Peach, Avacado] --------------------------- |
BlockingDeque is an extended implementation of queue where we can enqueue or dequeue on both ends of the queue. All BlockingDeque implementions on array or linked queues are thread-safe implementations. Below is a simple usage of BlockingDeque
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 |
import java.util.Queue; import java.util.concurrent.BlockingDeque; import java.util.concurrent.LinkedBlockingDeque; public class BlockingQueuesExamples { public static void main(String[] args) throws InterruptedException { BlockingDeque<String> linkedBlockingDeque = new LinkedBlockingDeque<String>(); linkedBlockingDeque.offer("Apple"); linkedBlockingDeque.offer("Orange"); linkedBlockingDeque.offer("Peach"); queueStatus(linkedBlockingDeque); linkedBlockingDeque.offerFirst("Banana"); linkedBlockingDeque.offerFirst("Guava"); queueStatus(linkedBlockingDeque); linkedBlockingDeque.offerLast("Pomegranate"); linkedBlockingDeque.offerLast("Grape"); linkedBlockingDeque.offer("Avacado"); // Note: offerLast() and offer() method will do the same operation... queueStatus(linkedBlockingDeque); System.out.println("Dequeued at Head of Queue: " + linkedBlockingDeque.takeFirst()); System.out.println("Dequeued at Tail of Queue: " + linkedBlockingDeque.takeLast()); System.out.println("Dequeued at Head of Queue: " + linkedBlockingDeque.take()); // Note: takeFirst() and take() method will do the same operation... queueStatus(linkedBlockingDeque); } public static void queueStatus(Queue linkedBlockingDeque) { System.out.println("---------------------------"); System.out.println("Linked Blocking Deque Size:" + linkedBlockingDeque.size()); System.out.println("Items:"); System.out.println(linkedBlockingDeque); System.out.println("---------------------------"); } } |
Output:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
--------------------------- Linked Blocking Deque Size:3 Items: [Apple, Orange, Peach] --------------------------- --------------------------- Linked Blocking Deque Size:5 Items: [Guava, Banana, Apple, Orange, Peach] --------------------------- --------------------------- Linked Blocking Deque Size:8 Items: [Guava, Banana, Apple, Orange, Peach, Pomegranate, Grape, Avacado] --------------------------- Dequeued at Head of Queue: Guava Dequeued at Tail of Queue: Avacado Dequeued at Head of Queue: Banana --------------------------- Linked Blocking Deque Size:5 Items: [Apple, Orange, Peach, Pomegranate, Grape] --------------------------- |
Encoding/Decoding is the method of representing an data, to a different format so that data can be transferred through the network or web. Encoder usually converts the data into web representation and after received in the other end, decoder converts back the web representation data to original data. 1. Base64 Encoding/Decoding Base64 is a way …