Keyed Collections: Map, Set, and Leak-Free WeakMap/WeakSet

01Map vs Plain Object: The Performance Reality

For years, plain JavaScript objects were used as hash maps. While convenient, plain objects have notable drawbacks: keys can only be strings or symbols (numbers are coerced to strings), objects come with inherited prototype keys (hasOwnProperty checks required), and determining size requires an expensive Object.keys(obj).length scan.

ES2015 introduced Map as a true keyed collection. In a Map, keys can be of ANY type—including objects, functions, and primitives. Maps remember the exact insertion order of keys, provide a clean O(1) .size property, and are heavily optimized by V8 for scenarios involving frequent additions and removals.

While plain JavaScript objects have historically been used as makeshift hash tables, they carry severe limitations: keys must be strings or symbols, they inherit unwanted prototype properties (like toString and constructor), and calculating their size requires calling Object.keys(obj).length in O(N) time.

The Map collection resolves all of these issues: it accepts keys of any type (including DOM nodes, functions, and object references), guarantees predictable insertion-order iteration, and provides an instant O(1) .size property.

02Set: High-Speed Uniqueness and Algebra

A Set is a collection of unique values where duplicate entries are automatically discarded. Checking whether an element exists in a Set (set.has(item)) is an O(1) constant-time hash lookup, compared to array.includes(item) which is an O(N) linear scan.

Modern ECMAScript introduces set algebra methods directly on Set: union(), intersection(), difference(), and isSubsetOf(), making collection comparisons blazingly fast and expressive.

03WeakMap and WeakSet: Eliminating Memory Leaks

In a standard Map, as long as the Map exists, any object used as a key is strongly held in memory. Even if your application drops all other references to that key object, the Map keeps it alive, preventing V8's garbage collector from sweeping it. This is a common source of memory leaks in caching layers.

WeakMap and WeakSet solve this permanently. A WeakMap holds WEAK references to its keys (which MUST be objects). If an object key has no other live references in the program, the engine automatically reclaims the object and silently deletes its entry from the WeakMap. Because keys can disappear at any time due to garbage collection, WeakMaps are not iterable and have no .size property.

04Why This Matters in Production

In production architectures, Maps and Sets drastically outperform arrays when performing frequent lookups, filtering uniqueness, and managing relational caches. In large applications, replacing array.includes() inside loops with a Set.has() lookup frequently reduces algorithm runtimes from O(N^2) (minutes) to O(N) (milliseconds).

Use WeakMap whenever you need to associate private state or metadata with objects whose lifecycle is controlled by an external system (such as DOM nodes, third-party libraries, or transient HTTP connection sockets).