A map associates keys with values. Reading a missing key returns the value type's zero value, which can hide the difference between an absent record and a recorded zero. Use the two-result lookup when that distinction matters. Writing into a nil map panics, so allocate the map before you add keys. Iteration order is deliberately unspecified; return a sorted sequence if another part of the program needs a stable order. These tasks keep results as maps or direct lookup results, so they never depend on iteration order. You will count repeated tags, merge corrections and preserve a legitimate zero balance. Every input belongs to a fictional repair desk. Empty inputs are part of the contract, not an exceptional condition.
Each occurrence increases its own tag count.