- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for seenLossy (0.27 sec)
-
src/internal/bisect/bisect.go
d.m[h] = true d.mu.Unlock() return seen } // seenLossy is a variant of seen that avoids a lock by using a cache of recently seen hashes. // Each cache entry is N-way set-associative: h can appear in any of the slots. // If h does not appear in any of them, then it is inserted into a random slot, // overwriting whatever was there before. func (d *dedup) seenLossy(h uint64) bool { cache := &d.recent[uint(h)%uint(len(d.recent))]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 17:28:43 UTC 2024 - 22.9K bytes - Viewed (0)