mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2025-10-30 20:22:25 -05:00
62 lines
1.1 KiB
Go
62 lines
1.1 KiB
Go
package structr
|
|
|
|
type hashmap struct {
|
|
m map[string]*list
|
|
n int
|
|
}
|
|
|
|
func (m *hashmap) Init(cap int) {
|
|
m.m = make(map[string]*list, cap)
|
|
m.n = cap
|
|
}
|
|
|
|
func (m *hashmap) Get(key string) *list {
|
|
return m.m[key]
|
|
}
|
|
|
|
func (m *hashmap) Put(key string, list *list) {
|
|
m.m[key] = list
|
|
if n := len(m.m); n > m.n {
|
|
m.n = n
|
|
}
|
|
}
|
|
|
|
func (m *hashmap) Delete(key string) {
|
|
delete(m.m, key)
|
|
}
|
|
|
|
func (m *hashmap) Compact() {
|
|
// Noop when hashmap size
|
|
// is too small to matter.
|
|
if m.n < 2048 {
|
|
return
|
|
}
|
|
|
|
// Difference between maximum map
|
|
// size and the current map size.
|
|
diff := m.n - len(m.m)
|
|
|
|
// Maximum load factor before
|
|
// runtime allocates new hmap:
|
|
// maxLoad = 13 / 16
|
|
//
|
|
// So we apply the inverse/2, once
|
|
// $maxLoad/2 % of hmap is empty we
|
|
// compact the map to drop buckets.
|
|
//
|
|
// TODO: this is still a relatively
|
|
// good approximation, but it has
|
|
// changed a little with swiss maps.
|
|
if 2*16*diff > m.n*13 {
|
|
|
|
// Create new map only big as required.
|
|
m2 := make(map[string]*list, len(m.m))
|
|
for k, v := range m.m {
|
|
m2[k] = v
|
|
}
|
|
|
|
// Set new.
|
|
m.m = m2
|
|
m.n = len(m2)
|
|
}
|
|
}
|