mirror of
https://github.com/openimsdk/open-im-server.git
synced 2025-04-06 04:15:46 +08:00
* feat: msg local cache * feat: msg local cache * feat: msg local cache * feat: msg local cache * feat: msg local cache * feat: msg local cache * fix: mongo * fix: mongo * fix: mongo * openim.yaml * localcache * localcache * localcache * localcache * localcache * localcache * localcache * localcache * localcache * local cache * local cache * local cache * local cache * fix: GroupApplicationAcceptedNotification * fix: GroupApplicationAcceptedNotification * fix: NotificationUserInfoUpdate * feat: cache add single-flight and timing-wheel. * feat: local cache * feat: local cache * feat: local cache * feat: cache add single-flight and timing-wheel. * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: local cache * feat: msg rpc local cache * feat: msg rpc local cache * feat: msg rpc local cache * feat: msg rpc local cache * feat: msg rpc local cache * feat: msg rpc local cache * refactor: refactor the code of push and optimization. * cicd: robot automated Change * refactor: rename cache. * merge * fix: refactor project dir avoid import cycle. * update tools * merge * feat: conversation FindRecvMsgNotNotifyUserIDs * feat: conversation FindRecvMsgNotNotifyUserIDs * feat: conversation FindRecvMsgNotNotifyUserIDs * merge * merge the latest main --------- Co-authored-by: Gordon <46924906+FGadvancer@users.noreply.github.com> Co-authored-by: withchao <withchao@users.noreply.github.com>
38 lines
769 B
Go
38 lines
769 B
Go
package lru
|
|
|
|
func NewSlotLRU[K comparable, V any](slotNum int, hash func(K) uint64, create func() LRU[K, V]) LRU[K, V] {
|
|
x := &slotLRU[K, V]{
|
|
n: uint64(slotNum),
|
|
slots: make([]LRU[K, V], slotNum),
|
|
hash: hash,
|
|
}
|
|
for i := 0; i < slotNum; i++ {
|
|
x.slots[i] = create()
|
|
}
|
|
return x
|
|
}
|
|
|
|
type slotLRU[K comparable, V any] struct {
|
|
n uint64
|
|
slots []LRU[K, V]
|
|
hash func(k K) uint64
|
|
}
|
|
|
|
func (x *slotLRU[K, V]) getIndex(k K) uint64 {
|
|
return x.hash(k) % x.n
|
|
}
|
|
|
|
func (x *slotLRU[K, V]) Get(key K, fetch func() (V, error)) (V, error) {
|
|
return x.slots[x.getIndex(key)].Get(key, fetch)
|
|
}
|
|
|
|
func (x *slotLRU[K, V]) Del(key K) bool {
|
|
return x.slots[x.getIndex(key)].Del(key)
|
|
}
|
|
|
|
func (x *slotLRU[K, V]) Stop() {
|
|
for _, slot := range x.slots {
|
|
slot.Stop()
|
|
}
|
|
}
|