[Go小技巧] 实现常用的KV缓存（有序且并发安全）

2019独角兽企业重金招聘Python工程师标准>>>

type KV struct {
	count int
	keys  []string
	hash  map[string]interface{}
	lock  sync.RWMutex
}

// 新建KV缓存(preCapacity为预申请内存容量)
func NewKV(preCapacity uint) *KV {
	return &KV{
		keys: make([]string, 0, int(preCapacity)),
		hash: make(map[string]interface{}, int(preCapacity)),
	}
}

// 添加kv键值对
func (this *KV) Set(k string, v interface{}) {
	this.lock.Lock()
	if _, ok := this.hash[k]; !ok {
		this.keys = append(this.keys, k)
		sort.Strings(this.keys)
		this.count++
	}
	this.hash[k] = v
	this.lock.Unlock()
}

// 获取数据长度
func (this *KV) Count() int {
	this.lock.RLock()
	defer this.lock.RUnlock()
	return this.count
}

// 由key检索value
func (this *KV) Get(k string) (interface{}, bool) {
	this.lock.RLock()
	defer this.lock.RUnlock()
	v, ok := this.hash[k]
	return v, ok
}

// 根据key排序，返回有序的vaule切片
func (this *KV) Values() []interface{} {
	this.lock.RLock()
	defer this.lock.RUnlock()
	vals := make([]interface{}, this.count)
	for i := 0; i < this.count; i++ {
		vals[i] = this.hash[this.keys[i]]
	}
	return vals
}

 

转载于:https://my.oschina.net/henrylee2cn/blog/741315