Skip to main content

Posts

Showing posts with the label hashCode and equals in Java

Spring Boot JPA Entities, Flyway Migrations & Spring Data Repositories — The Database Layer Done Right (Episode 5)

There is one line in almost every Spring Boot tutorial that runs flawlessly on your laptop and slowly corrupts your database in production: spring : jpa : hibernate : ddl-auto : update # works on your laptop, quietly rewrites prod With ddl-auto: update , Hibernate looks at your entities on every startup and alters the live schema to match them. No migration file. No version. No review. No rollback. Two developers add different fields, deploy in a different order, and now staging and production have quietly diverged — and the day one of those "updates" needs to drop a column, Hibernate will happily take your data with it. In Episode 5 of Building Instagram's Authentication Backend , we do the opposite. The database is not something Hibernate improvises at boot — it is a versioned artifact, checked into git, owned by Flyway . We build the persistence layer in three deliberate steps: the SQL migration , then the JPA entities , then the Spring Data r...

Java HashMap Internals Explained in Simple Terms

Java  HashMap  is one of the most frequently asked topics in Java interviews. Many developers use it daily, but very few understand  how it actually works internally . In this article, we will explain: What HashMap is How HashMap stores data internally Role of  hashCode()  and  equals() What collisions are and how they are handled Improvements made in newer Java versions Time complexity of all major operations How to reduce frequent collisions All explanations are in  simple terms , with  examples . 1. What Is a HashMap? A  HashMap  stores data in  key–value pairs . Example: Map<String, Integer> map = new HashMap<>(); map.put("A", 10); map.put("B", 20); Key characteristics: Keys must be  unique Values can be duplicated Order is  not guaranteed One  null key  is allowed Multiple null values are allowed Why HashMap is popular: HashMap provides very fast access to data. 2. How HashMap Stores Data Interna...

Why HashMap Uses (n - 1) & hash and Why Capacity Is Always Power of 2

If you are learning  Java HashMap internals , one line that often confuses beginners is: index = (n - 1) & hash; Many people ask: Where is the  power of 2  here? Why not use  %  (modulo)? Why does HashMap care so much about powers of 2? In this article, we’ll explain everything in  very simple terms . What Is  n  in  (n - 1) & hash ? In this formula: index = (n - 1) & hash; n  is the  capacity of the HashMap , meaning the  number of buckets . Important rule: HashMap capacity is ALWAYS a power of 2 Examples: 16 → 2⁴ 32 → 2⁵ 64 → 2⁶ 128 → 2⁷ So the  power of 2 is hidden inside  n . Why HashMap Capacity Must Be Power of 2 HashMap calculates bucket index using  bitwise AND ( & ) , not modulo ( % ). This works correctly  only when  n  is a power of 2 . Let’s understand this with an example. Example: Capacity = 16 (Power of 2) Binary values: n = 16 → 10000 n - 1 = 15 → 01111 Now sup...