Class BlobDictionary<K, V>

Returns the number of entries in the dictionary.

The count is derived from the auxiliary keyvals map, which stores all original key references and their associated values. This ensures that the size reflects the actual number of entries, independent of internal overrides in the main root structure.

Default iterator for the dictionary.

Equivalent to calling entries. Enables iteration with for...of:

for (const [key, value] of dict) {
  ...
}
Copy

Removes an entry with the specified key from the dictionary.

Internally, this calls internalSet with undefined to mark the entry as deleted.

Returns an iterator over the [key, value] pairs in the dictionary.

The iterator yields entries in insertion order.

Retrieves the value associated with the given key from the dictionary.

If the key does not exist, this method returns undefined.

Checks whether the dictionary contains an entry for the given key.

⚠️ Note: Avoid using has(...) together with get(...) in a pattern like this:

if (dict.has(key)) {
  const value = dict.get(key);
  ...
}
Copy

This approach performs two lookups for the same key.

Instead, prefer the following pattern, which retrieves the value once:

const value = dict.get(key);
if (value !== undefined) {
  ...
}
Copy

Returns an iterator over the keys in the dictionary.

The iterator yields each key in insertion order.

Adds a new entry to the dictionary or updates the value of an existing key.

If an entry with the given key already exists, its value is replaced with the new one.

Creates a new sorted array of values, ordered by their corresponding keys.

Iterates over all entries in the dictionary and sorts them according to the provided comparator function applied to the keys.

Returns an iterator over the values in the dictionary.

The iterator yields each value in insertion order.

Creates a new BlobDictionary initialized with the given entries.

Creates an empty BlobDictionary.