How HashMap get() Method Works Internally in Java

-

The get() method in HashMap is one of the most commonly used operations. Although it looks like a simple key lookup, internally it involves hashing, bucket indexing, and collision handling. In this article, we’ll break down the internal working of HashMap.get() step by step with examples.

1. Hashing the Key

When you call map.get(key), the HashMap computes a hash value using the key’s hashCode(). In Java 8+, this value is further processed with bitwise operations to spread the hash bits and reduce collisions. 

int hash = hash(key.hashCode());

2. Finding the Bucket

The hash value is then converted into an index in the internal array (called table) using: 

int index = (n - 1) & hash;  // n = table.length

This determines the bucket where the entry might be stored.

3. Searching Inside the Bucket

Each bucket can contain:

  • null → no entry stored
  • A single key-value pair
  • A linked list of nodes (if multiple keys hash to the same bucket)
  • A red-black tree (Java 8+, when collisions exceed threshold)

The get() method compares hash values and then checks key equality with equals().

4. Returning the Value

If a matching key is found, the corresponding value is returned. If no entry exists in that bucket, null is returned.

5. Example Program

import java.util.HashMap;

public class HashMapGetExample {
    public static void main(String[] args) {
        HashMap<String, Integer> map = new HashMap<>();
        map.put("apple", 10);
        map.put("banana", 20);

        System.out.println(map.get("apple"));   // 10
        System.out.println(map.get("orange"));  // null
    }
}

6. Simplified Pseudo-code of get()

public V get(Object key) {
    int hash = hash(key.hashCode());
    int index = (n - 1) & hash;
    Node<K,V> e = table[index];
    while (e != null) {
        if (e.hash == hash && (e.key.equals(key))) {
            return e.value;
        }
        e = e.next; // move through linked list / tree
    }
    return null;
}

7. Performance

  • Average Case: O(1)
  • Worst Case: O(log n) if bucket is a tree, or O(n) if it’s a linked list (pre-Java 8)

🔑 Key Takeaways

  • get() relies on both hashCode() and equals().
  • Efficient hash distribution improves lookup performance.
  • Java 8 introduced tree buckets to optimize worst-case scenarios.

Comments

Post a Comment

Popular posts from this blog

Spring Boot on AWS EC2: Upload to S3 Securely Using IAM Role

-
When running a Spring Boot application on AWS EC2 , the most common security mistake is hardcoding AWS access keys inside application.properties . This is unnecessary and risky. AWS already provides a secure mechanism: IAM Roles attached to EC2 . In this blog, you will learn how to upload and download files to Amazon S3 from Spring Boot running on EC2 without any access keys , using: Spring Profiles AWS SDK v2 Instance Metadata Service (IMDS) IAM Roles Why Access Keys Are a Bad Idea on EC2 Typical S3 setups use: Access key Secret key Region Bucket This works only for local development. It should NOT be used on EC2. Problems with access keys: Stored in config or code (high risk) Might leak through Git, logs, or screenshots Require manual rotation Not needed if app runs on EC2 AWS automatically manages temporary credentials using the EC2 Instance Profile (IAM Role) . Architecture: EC2 → IAM Role → S3 Spring Boot app r...
Read more

Java Streams Intermediate Operations Explained with Examples

-
Image
The Java Stream API lets you process collections in a fluent, declarative style. In this post, we’ll walk through the most useful intermediate operations with simple examples. Note: Examples below use Java 8 compatible collect(Collectors.toList()) . If you’re on Java 16+, you can replace it with toList() . 1) filter() — Select elements by a condition Keeps only elements that match the predicate. List<Integer> list = Arrays.asList(1,2,3,4,5,6,7,8,9,10); List<Integer> res = list.stream() .filter(num -> num % 2 != 0) // keep only odd numbers .collect(Collectors.toList()); System.out.println(res); // [1, 3, 5, 7, 9] 2) map() — Transform each element Applies a function to every element and returns a stream of results. List<String> strs = Arrays.asList("rama", "anjaneya", "krishna"); List<String> upper = strs.stream() .map(String::toUpperCase) .collect(Collectors.toList()); System.o...
Read more

ConcurrentHashMap vs Synchronized HashMap in Java

-
Image
Introduction In multi-threaded Java applications, managing shared data safely and efficiently is crucial. Two common approaches are using Synchronized HashMap (via Collections.synchronizedMap(...) ) and ConcurrentHashMap . While both aim to provide thread-safety, their implementations and performance characteristics differ significantly. This post explores these differences in detail. What is a Synchronized HashMap? Created by wrapping a regular HashMap using: Map<K, V> syncMap = Collections.synchronizedMap(new HashMap<>()); Enforces synchronization at the object level , meaning only one thread can access the map at any time (read or write). Supports null keys and values since it relies on HashMap behavior. Iterators are fail-fast , throwing ConcurrentModificationException if the map is modified while iterating. Simpler implementation, suitable when concurrency is low or performance is not cri...
Read more