[noctune]

Immutable hash maps are generally O(lg n) inserts and updates, where the mutable counterpart is O(1). So it's not without cost.

[Quekid5]

The base of the log is usually 32 or similar, so it's practically always bounded by... 6. (That's for a billion keys, for example.)