Files
gf/g/container/gmap/gmap_interface_interface_map.go

209 lines
5.1 KiB
Go
Raw Normal View History

2017-12-29 16:03:30 +08:00
// Copyright 2017 gf Author(https://gitee.com/johng/gf). All Rights Reserved.
//
// This Source Code Form is subject to the terms of the MIT License.
// If a copy of the MIT was not distributed with this file,
// You can obtain one at https://gitee.com/johng/gf.
//
2017-12-31 18:19:58 +08:00
2017-11-23 10:21:28 +08:00
package gmap
import (
"gitee.com/johng/gf/g/internal/rwmutex"
2017-11-23 10:21:28 +08:00
)
type InterfaceInterfaceMap struct {
mu *rwmutex.RWMutex
m map[interface{}]interface{}
2017-11-23 10:21:28 +08:00
}
func NewInterfaceInterfaceMap(unsafe...bool) *InterfaceInterfaceMap {
2017-11-23 10:21:28 +08:00
return &InterfaceInterfaceMap{
m : make(map[interface{}]interface{}),
mu : rwmutex.New(unsafe...),
2017-11-23 10:21:28 +08:00
}
}
// 给定回调函数对原始内容进行遍历回调函数返回true表示继续遍历否则停止遍历
2018-04-11 16:06:45 +08:00
func (this *InterfaceInterfaceMap) Iterator(f func (k interface{}, v interface{}) bool) {
this.mu.RLock()
defer this.mu.RUnlock()
for k, v := range this.m {
2018-04-11 16:06:45 +08:00
if !f(k, v) {
break
}
}
}
2017-11-23 10:21:28 +08:00
// 哈希表克隆
func (this *InterfaceInterfaceMap) Clone() map[interface{}]interface{} {
2017-11-23 10:21:28 +08:00
m := make(map[interface{}]interface{})
this.mu.RLock()
2017-11-23 10:21:28 +08:00
for k, v := range this.m {
m[k] = v
}
this.mu.RUnlock()
return m
2017-11-23 10:21:28 +08:00
}
// 设置键值对
func (this *InterfaceInterfaceMap) Set(key interface{}, val interface{}) {
this.mu.Lock()
2017-11-23 10:21:28 +08:00
this.m[key] = val
this.mu.Unlock()
2017-11-23 10:21:28 +08:00
}
// 批量设置键值对
func (this *InterfaceInterfaceMap) BatchSet(m map[interface{}]interface{}) {
this.mu.Lock()
2017-11-23 10:21:28 +08:00
for k, v := range m {
this.m[k] = v
}
this.mu.Unlock()
2017-11-23 10:21:28 +08:00
}
// 获取键值
func (this *InterfaceInterfaceMap) Get(key interface{}) interface{} {
this.mu.RLock()
2017-11-23 10:21:28 +08:00
val, _ := this.m[key]
this.mu.RUnlock()
2017-11-23 10:21:28 +08:00
return val
}
// 设置kv缓存键值对内部会对键名的存在性使用写锁进行二次检索确认如果存在则不再写入返回键名对应的键值。
// 在高并发下有用,防止数据写入的并发逻辑错误。
func (this *InterfaceInterfaceMap) doSetWithLockCheck(key interface{}, value interface{}) interface{} {
this.mu.Lock()
2018-09-20 09:28:45 +08:00
defer this.mu.Unlock()
if v, ok := this.m[key]; ok {
return v
}
if f, ok := value.(func() interface {}); ok {
value = f()
}
this.m[key] = value
return value
}
// 当键名存在时返回其键值,否则写入指定的键值
func (this *InterfaceInterfaceMap) GetOrSet(key interface{}, value interface{}) interface{} {
if v := this.Get(key); v == nil {
return this.doSetWithLockCheck(key, value)
} else {
return v
}
}
// 当键名存在时返回其键值,否则写入指定的键值,键值由指定的函数生成
func (this *InterfaceInterfaceMap) GetOrSetFunc(key interface{}, f func() interface{}) interface{} {
if v := this.Get(key); v == nil {
return this.doSetWithLockCheck(key, f())
} else {
return v
}
}
// 与GetOrSetFunc不同的是f是在写锁机制内执行
func (this *InterfaceInterfaceMap) GetOrSetFuncLock(key interface{}, f func() interface{}) interface{} {
if v := this.Get(key); v == nil {
return this.doSetWithLockCheck(key, f)
} else {
return v
}
}
// 当键名不存在时写入并返回true否则返回false。
func (this *InterfaceInterfaceMap) SetIfNotExist(key interface{}, value interface{}) bool {
if !this.Contains(key) {
this.doSetWithLockCheck(key, value)
return true
}
return false
}
2017-11-23 10:21:28 +08:00
// 批量删除键值对
func (this *InterfaceInterfaceMap) BatchRemove(keys []interface{}) {
this.mu.Lock()
2017-11-23 10:21:28 +08:00
for _, key := range keys {
delete(this.m, key)
}
this.mu.Unlock()
2017-11-23 10:21:28 +08:00
}
// 返回对应的键值,并删除该键值
2018-09-20 09:28:45 +08:00
func (this *InterfaceInterfaceMap) Remove(key interface{}) interface{} {
this.mu.Lock()
2017-11-23 10:21:28 +08:00
val, exists := this.m[key]
if exists {
delete(this.m, key)
}
this.mu.Unlock()
2017-11-23 10:21:28 +08:00
return val
}
// 返回键列表
func (this *InterfaceInterfaceMap) Keys() []interface{} {
this.mu.RLock()
2017-11-23 10:21:28 +08:00
keys := make([]interface{}, 0)
for key, _ := range this.m {
keys = append(keys, key)
}
this.mu.RUnlock()
2017-11-23 10:21:28 +08:00
return keys
}
// 返回值列表(注意是随机排序)
func (this *InterfaceInterfaceMap) Values() []interface{} {
this.mu.RLock()
2017-11-23 10:21:28 +08:00
vals := make([]interface{}, 0)
for _, val := range this.m {
vals = append(vals, val)
}
this.mu.RUnlock()
2017-11-23 10:21:28 +08:00
return vals
}
// 是否存在某个键
func (this *InterfaceInterfaceMap) Contains(key interface{}) bool {
this.mu.RLock()
2017-11-23 10:21:28 +08:00
_, exists := this.m[key]
this.mu.RUnlock()
2017-11-23 10:21:28 +08:00
return exists
}
// 哈希表大小
func (this *InterfaceInterfaceMap) Size() int {
this.mu.RLock()
2018-03-29 13:46:05 +08:00
length := len(this.m)
this.mu.RUnlock()
2018-03-29 13:46:05 +08:00
return length
2017-11-23 10:21:28 +08:00
}
// 哈希表是否为空
func (this *InterfaceInterfaceMap) IsEmpty() bool {
this.mu.RLock()
2018-08-23 21:55:27 +08:00
empty := len(this.m) == 0
this.mu.RUnlock()
2017-11-23 10:21:28 +08:00
return empty
}
// 清空哈希表
func (this *InterfaceInterfaceMap) Clear() {
this.mu.Lock()
2017-11-23 10:21:28 +08:00
this.m = make(map[interface{}]interface{})
this.mu.Unlock()
2017-11-23 10:21:28 +08:00
}
// 并发安全锁操作,使用自定义方法执行加锁修改操作
func (this *InterfaceInterfaceMap) LockFunc(f func(m map[interface{}]interface{})) {
this.mu.Lock(true)
defer this.mu.Unlock(true)
f(this.m)
}
// 并发安全锁操作,使用自定义方法执行加锁读取操作
func (this *InterfaceInterfaceMap) RLockFunc(f func(m map[interface{}]interface{})) {
this.mu.RLock(true)
defer this.mu.RUnlock(true)
f(this.m)
}