32
func (m *mapCounter) getPassWithOverflow(key string, base, inc int64) (int64, bool) {
33
if idx, ok := m.m[key]; ok {
35
>
count := max(base, prev+inc)
36
>
// inline simple case of updateHeap
37
>
m.heap[idx].Count = count
38
>
heap.Fix(m, idx)
39
>
return count, false
40
>
}
41
// not present, fall back to full updateHeap
42
count := max(base, inc)