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

HashSet Iterator: Iterating HashMap Keys

How HashSet's iterator is backed by the HashMap's keySet iterator, traversing only keys.

HashSet Iterator: Iterating HashMap Keys

What you'll learn: How HashSet's iterator works by traversing only the keys from its internal HashMap.

The Delegation Pattern Continues

Remember that HashSet is essentially a wrapper around HashMap, using the map's keys as the set elements and storing a dummy PRESENT value. When you iterate over a HashSet, you're actually iterating over the keys of that underlying HashMap.

When you call iterator() on a HashSet, it doesn't create its own custom iteration logic. Instead, it asks the internal HashMap for its keySet(), and then returns that key set's iterator. Since you only care about the keys (the actual set elements), the dummy values are completely ignored during iteration.

Why This Works Perfectly

The HashMap already knows how to traverse its buckets and handle collisions efficiently. By reusing the keySet().iterator(), HashSet gets:

  • No duplicate logic: The iteration code already exists in HashMap
  • Consistent behavior: Iteration order (or lack thereof) matches the underlying hash table
  • Performance: Direct access to the map's internal structure through the key set

Think of it like this: if you have a keychain (the HashMap) where each key has a tag (the key) and a blank notecard attached (the dummy value), iterating over the HashSet means walking through the keychain and only reading the tags, ignoring the notecards entirely.

In Practice

When you use a for-each loop on a HashSet, you're indirectly using this delegated iterator:

HashSet<String> set = new HashSet<>();
// Internally: HashMap<String, PRESENT>

for (String element : set) {
    // Iterating over HashMap's keys only
}

Key Takeaway: HashSet's iterator is backed by HashMap.keySet().iterator(), efficiently traversing only the keys while ignoring the dummy values entirely.