Course contentsShow
← Java
Lesson 1091 of 2,87025. Set ImplementationsFree lesson

Using Immutable Keys in Sets

Learn why immutable objects are preferred as Set elements to avoid broken invariants.

Using Immutable Keys in Sets

What you'll learn: Why immutable objects make the safest and most reliable elements for Set collections.

In the previous lesson, you saw how modifying an object after adding it to a HashSet can break the Set's internal structure. The solution is simple: use immutable objects as Set elements.

Why Immutability Solves the Problem

When an object is immutable (cannot be changed after creation), its hashCode() will never change. This means:

  • The Set can always find the object in the correct bucket
  • The equals() comparison remains consistent
  • The Set's internal invariants stay intact

Think of it like a library catalog system. If book titles could change after being cataloged, you'd never find them on the shelves. But if titles are permanent (immutable), the catalog always works correctly.

Immutable Types You Already Know

Java provides several immutable types that are perfect for Sets:

  • String – cannot be modified after creation
  • Integer, Long, Double – wrapper classes are immutable
  • LocalDate, LocalDateTime – modern date/time classes are immutable

Because these types can't change, they're safe to use in HashSet, TreeSet, or any Set implementation.

The Golden Rule

If you're creating custom objects to use as Set elements, make them immutable:

  • Mark all fields final
  • Don't provide setter methods
  • Don't allow fields to be modified after construction

This prevents the entire class of problems where modifying objects breaks your Set's behavior.

Key Takeaway:
Always prefer immutable objects as Set elements. If an object can't change after creation, its hashCode() stays constant and the Set will always work correctly.