gf/g/container/gset/int_set.go

126 lines
2.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 gset
import (
"fmt"
"sync"
)
type IntSet struct {
sync.RWMutex
M map[int]struct{}
}
func NewIntSet() *IntSet {
return &IntSet{M: make(map[int]struct{})}
}
// 给定回调函数对原始内容进行遍历
func (this *IntSet) Iterator(f func (v int)) {
this.RLock()
for k, _ := range this.M {
f(k)
}
this.RUnlock()
}
2017-11-23 10:21:28 +08:00
// 设置键
func (this *IntSet) Add(item int) *IntSet {
if this.Contains(item) {
return this
}
this.Lock()
this.M[item] = struct{}{}
this.Unlock()
return this
}
// 批量添加设置键
func (this *IntSet) BatchAdd(items []int) *IntSet {
count := len(items)
if count == 0 {
return this
}
todo := make([]int, 0, count)
this.RLock()
for i := 0; i < count; i++ {
_, exists := this.M[items[i]]
if exists {
continue
}
todo = append(todo, items[i])
}
this.RUnlock()
count = len(todo)
if count == 0 {
return this
}
this.Lock()
for i := 0; i < count; i++ {
this.M[todo[i]] = struct{}{}
}
this.Unlock()
return this
}
// 键是否存在
func (this *IntSet) Contains(item int) bool {
this.RLock()
_, exists := this.M[item]
this.RUnlock()
return exists
}
// 删除键值对
func (this *IntSet) Remove(key int) {
this.Lock()
delete(this.M, key)
this.Unlock()
}
// 大小
func (this *IntSet) Size() int {
this.RLock()
l := len(this.M)
this.RUnlock()
return l
}
// 清空set
func (this *IntSet) Clear() {
this.Lock()
this.M = make(map[int]struct{})
this.Unlock()
}
// 转换为数组
func (this *IntSet) Slice() []int {
this.RLock()
ret := make([]int, len(this.M))
i := 0
for item := range this.M {
ret[i] = item
i++
}
this.RUnlock()
return ret
}
// 转换为字符串
func (this *IntSet) String() string {
s := this.Slice()
return fmt.Sprint(s)
}