Skip to main content

Java

Ankur in Java

Configuring ResourceBundleViewResolver in Spring MVC

In a Spring MVC application, a ViewResolver is responsible for mapping logical view names that your controllers return to actual .jsp files (or Thymeleaf templates, etc.). When you need to support multiple locales and provide messages or titles that vary per language, a ResourceBundleViewResolver is a convenient choice. This post walks through a minimal, but complete, configuration that you can drop into any Spring MVC project. Problem Statement Suppose you want a home.jsp that displays a greeting, a welcome message, and a page title, all of which should change depending on the user’s locale. You also want to keep the JSPs simple, so you delegate the translation of these messages to a standard Java ResourceBundle (properties file). Solution Overview Define the view resolver so it first looks for a messages_*.properties file. Configure the ViewResolver hierarchy to fall back to the default view resolver if a match isn’t found. Create a simple controller that forwards to a logical view name. Write the JSP that pulls values from the resource bundle.

1 min read
Ankur in Java

Troubleshoot: java.lang.ClassNotFoundException: com.sun.jersey.spi.container.servlet.ServletContainer

Encountering a ClassNotFoundException is a common rite of passage for any Java developer. Specifically, the error java.lang.ClassNotFoundException: com.sun.jersey.spi.container.servlet.ServletContainer can be a head-scratcher when you’re working with web services, particularly when migrating or setting up a new project. This exception typically indicates that your application server (like Tomcat, JBoss, or Jetty) can’t find the necessary Jersey Servlet container class. Let’s break down why this happens and how to fix it. Understanding the Problem The class com.sun.jersey.spi.container.servlet.ServletContainer is a core component of the older **Jersey 1.x** framework. It’s responsible for bootstrapping and handling requests for your RESTful services. If your application attempts to load this class and it’s not present in the classpath, you’ll get the ClassNotFoundException. The most common reasons for this are: Missing Dependency: The required Jersey servlet JAR file is not included in your project’s build path or deployed WAR file. Incorrect Version: You’re using a mix of Jersey 1.x and Jersey 2.x (or later) dependencies, or your configuration points to a Jersey 1.x class while you’re using Jersey 2.x. Build Tool Misconfiguration: Your build tool (Maven, Gradle) isn’t correctly packaging the dependency. Deployment Issue: The JAR file isn’t correctly placed in the application server’s classpath (e.g., in WEB-INF/lib for web applications).

2 min read
Ankur in Java

A Developer’s Deep Dive into Java Memory Management and Garbage Collection

As Java developers, we are blessed with one of the most sophisticated features a programming platform can offer: automatic memory management. We don’t have to manually allocate and deallocate memory like our C++ brethren, which saves us from a whole class of painful bugs. This “magic” is handled by the Java Virtual Machine (JVM) and its Garbage Collector (GC). But here’s the thing: relying on magic without understanding it can lead to trouble. The dreaded OutOfMemoryError, mysterious performance slowdowns, and long application pauses can all be symptoms of memory management woes. To truly master Java, you need to peek behind the curtain. In this post, we’ll demystify how the JVM manages memory and how the Garbage Collector works its magic to keep our applications running smoothly. The JVM’s Memory Blueprint: Where Everything Lives When you start a Java application, the JVM carves out a chunk of memory from the operating system. This memory isn’t just one big, messy pile; it’s a highly organized space, divided into several key areas. While there are a few, we’ll focus on the two most relevant to our day-to-day coding: the Stack and the Heap. Simplified Memory Model https://jenkov.com/tutorials/java-concurrency/java-memory-model.html A simplified view of where our data goes.

2 min read
Ankur in Java

Exploring Java’s LinkedHashSet: Order-Preserving Uniqueness

In the vast and varied world of Java Collections, understanding the nuances of each data structure is crucial for writing efficient and robust code. Today, we're diving into a fascinating member of the Set family: the LinkedHashSet. While the standard HashSet offers blazing-fast O(1) average time complexity for most operations, it doesn't guarantee any order. Enter LinkedHashSet, which beautifully combines the best of both worlds: the uniqueness of a Set with the predictable, insertion-order iteration of a List. Think of it this way: a regular HashSet is like throwing items into a bag – you know they're all there, but when you pull them out, there's no telling which one will come first. A LinkedHashSet, on the other hand, is like placing items onto a conveyor belt – they maintain their original order as they were added, even though duplicates are still strictly rejected. What is LinkedHashSet? The LinkedHashSet class is a member of the Java Collections Framework, specifically implementing the Set interface and extending the HashSet class. It stores unique elements, just like a regular HashSet, but it also maintains a doubly-linked list running through its elements. This linked list defines the iteration order, which is the order in which elements were inserted into the set (insertion-order). Here are its key characteristics: Uniqueness: It does not allow duplicate elements. If you try to add an element that already exists, the operation will effectively do nothing, and the existing element's position will remain unchanged. Insertion Order: It maintains the order in which elements were inserted into the set. When you iterate over a LinkedHashSet, elements will be returned in the same sequence they were added. Null Elements: It can store one null element. Non-Synchronized: Like HashSet, LinkedHashSet is not synchronized. If multiple threads access a LinkedHashSet concurrently and at least one of the threads modifies the set, it must be synchronized externally. This is typically done by wrapping it with Collections.synchronizedSet(). Performance: It provides O(1) average-time performance for basic operations like add(), contains(), and remove(), assuming a good hash function. Due to the overhead of maintaining the linked list, it's generally slightly slower than HashSet but faster than TreeSet.

2 min read
Ankur in Java

A Beginner’s Guide to Java HashSet

Let's dive into a fundamental and incredibly useful part of the Java Collections Framework: the HashSet. If you've ever needed to store a collection of unique items where order doesn't matter, then HashSet is your go-to data structure. Let's explore what it is, how it works, and when to use it. What is a Java HashSet? At its core, a HashSet in Java is an implementation of the Set interface, based on a hash table. This means it inherits the key property of all sets: it cannot contain duplicate elements. When you try to add an element that already exists in the set, the add operation will simply be ignored (it won't throw an error, but the set's state won't change). Think of it like a collection of unique, unordered items. If you put two identical postcards into a box that only allows one copy of each postcard, you'll still only have one postcard in the box. Key Characteristics of HashSet: No Duplicates: As mentioned, HashSet strictly enforces uniqueness. Unordered: There is no guarantee about the iteration order of elements in a HashSet. The order might even change over time due to operations like adding or removing elements. Null Elements: A HashSet can contain one (and only one) null element. Performance: It offers constant time performance (O(1)) for basic operations like add(), remove(), and contains(), assuming the hash function distributes elements properly. In the worst-case scenario (many hash collisions), performance can degrade to O(n). Non-Synchronized: HashSet is not thread-safe. If multiple threads access a hash set concurrently and at least one of the threads modifies the set, it must be synchronized externally.

2 min read
Ankur in Java

Mastering TreeSet in Java: A Guide for Developers

Today, we're diving into an essential part of the Java Collections Framework: the TreeSet class. If you've been working with Java for a while, you've likely encountered HashSet for its blazing fast operations or LinkedHashSet for its predictable iteration order. But what if you need a set that not only stores unique elements but also keeps them in a sorted order? Enter TreeSet – your go-to for naturally ordered or custom-ordered sets. Let's explore its functionalities, advantages, and how to effectively use it in your Java applications. What is a Java TreeSet? In Java, a TreeSet is a concrete implementation of the Set interface, which in turn extends the SortedSet and NavigableSet interfaces. This means it provides all the capabilities of a standard Set (no duplicate elements) along with the power of ordering and navigation. Under the hood, TreeSet is backed by a TreeMap. This is a crucial detail, as TreeMap stores its elements in a Red-Black tree structure. This self-balancing binary search tree ensures that operations like adding, removing, and searching elements have a time complexity of O(log n) – making it very efficient for large datasets. Key Characteristics of TreeSet: Stores Unique Elements: Like all Set implementations, TreeSet does not allow duplicate elements. If you try to add an element that already exists, the operation will be ignored, and the set will remain unchanged. Maintains Sorted Order: This is its defining feature. Elements are stored in ascending order by default, either based on their natural ordering or a custom comparator you provide. No Null Elements: TreeSet does not permit null elements. Attempting to add a null will result in a NullPointerException. This is because null cannot be compared with other elements. Non-Synchronized: TreeSet is not thread-safe. If multiple threads access a TreeSet concurrently and at least one thread modifies it, external synchronization must be performed. You can use Collections.synchronizedSortedSet() for this purpose. Performance: Operations like add(), remove(), and contains() have an average time complexity of O(log n).

2 min read
Ankur in Java

Java Hashtable: A Dive into Synchronized HashMaps

In the world of Java, when you need to store key-value pairs, HashMap is often your first thought. But what if you need thread-safety—what if multiple threads need to access and modify your map concurrently without corrupting its data? Enter Hashtable. While Hashtable might seem like an older, perhaps less frequently used, sibling to HashMap, it offers a distinct advantage: built-in synchronization. Let's explore Hashtable in detail, understanding its characteristics, how to use it, and when it's the right choice. What is Hashtable? java.util.Hashtable is a concrete implementation of the Map interface in Java. It stores data in key-value pairs and uses a hashing mechanism to efficiently store and retrieve objects. Key characteristics include: Synchronization: All public methods of Hashtable are synchronized. This means that only one thread can access a Hashtable instance at a time, ensuring data consistency in a multi-threaded environment. Nulls Not Allowed: Unlike HashMap, Hashtable does not allow null keys or null values. Attempting to insert a null key or value will result in a NullPointerException. Legacy Class: Hashtable is part of Java's legacy collections framework, dating back to Java 1.0. While functional, newer (and often more performant) synchronized map implementations like ConcurrentHashMap are generally preferred for new development. Initial Capacity and Load Factor: Hashtable uses an initial capacity (default 11) and a load factor (default 0.75). When the number of entries exceeds (capacity * load factor), the Hashtable automatically rehashes and increases its capacity.

2 min read
Ankur in Java

The Java LinkedList Class: A Comprehensive Guide

The LinkedList class in Java's Collections Framework is a powerful and flexible implementation of both the List and Deque interfaces. Unlike ArrayList, which is a dynamic array, LinkedList is a doubly-linked list structure. This fundamental difference dictates its performance characteristics and ideal use cases. What is a Doubly-Linked List? A LinkedList stores its elements in individual nodes. Each node contains three parts: The data (the element itself). A pointer to the next node in the sequence. A pointer to the previous node in the sequence. Because it is a doubly-linked list, traversal can happen in both forward and backward directions. Internal Structure Visualization HEAD TAIL ↓ ↓ [null|Data1|→] ↔ [←|Data2|→] ↔ [←|Data3|null]

1 min read
Ankur in Java

The Developer’s Guide to Email Validation in Java: From Basics to Bulletproof

You've built a registration form. Users are signing up. Everything looks great until you check your database and find john@@example..com, test@, and my personal favorite: notanemail. Sound familiar? Email validation isn't just a nice-to-have—it's your first line of defense against bad data, frustrated users, and those 3 AM "why aren't emails working?" emergencies. Let's explore how to validate email addresses in Java using regex patterns that actually work in production. Why Regex for Email Validation? Before we jump into patterns, let's address the elephant in the room: yes, you could validate emails by splitting strings and checking conditions manually. But regex gives you: Conciseness: One pattern instead of dozens of if-else statements Maintainability: Update one regex instead of refactoring spaghetti code Performance: Compiled patterns are surprisingly fast Industry standard: Every developer understands regex (or should!) That said, perfect email validation is impossible. Even RFC-5322 compliant validators can't tell you if [email protected] is real or if the mailbox exists. We're checking format, not deliverability.

1 min read
Ankur in Java

Building Native Installers for Java Applications with JPackage

Creating distributable installers for Java desktop applications has traditionally been a complex process requiring third-party tools and extensive configuration. JPackage, introduced in Java 14 and stabilized in later versions, eliminates this complexity by providing a built-in command-line tool that generates platform-native installers directly from Java applications. Understanding JPackage JPackage is a powerful packaging tool that bundles Java applications with a custom Java Runtime Environment (JRE), producing platform-specific installers such as EXE and MSI for Windows, DMG and PKG for macOS, and DEB and RPM for Linux distributions. This approach ensures end users can install and run applications without requiring a separate Java installation on their systems. The tool integrates with jlink under the hood to create optimized runtime images, resulting in smaller distribution packages that include only the necessary Java modules. JPackage also supports desktop integration features including application shortcuts, Start Menu entries, file associations, and custom icons.

1 min read