-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcmap.go
64 lines (54 loc) · 1.05 KB
/
cmap.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package cmap
import (
"github.com/TopoSimplify/node"
"sort"
"sync"
)
const CacheKeySize = 6
type CacheMap struct {
sync.RWMutex
dict map[[CacheKeySize]int]struct{}
}
func NewCacheMap(size int) *CacheMap {
return &CacheMap{dict: make(map[[CacheKeySize]int]struct{}, size)}
}
func (m *CacheMap) HasKey(key [CacheKeySize]int) bool {
m.RLock()
var _, ok = m.dict[key]
m.RUnlock()
return ok
}
func (m *CacheMap) Set(key [CacheKeySize]int) {
m.Lock()
m.dict[key] = struct{}{}
m.Unlock()
}
func (m *CacheMap) Delete(key [CacheKeySize]int) {
m.Lock()
delete(m.dict, key)
m.Unlock()
}
func (m *CacheMap) Size() int {
m.RLock()
var v = len(m.dict)
m.RUnlock()
return v
}
func (m *CacheMap) Keys() [][CacheKeySize]int {
m.RLock()
var keys = make([][CacheKeySize]int, m.Size())
for k := range m.dict {
keys = append(keys, k)
}
m.RUnlock()
return keys
}
func CacheKey(a, b *node.Node) [CacheKeySize]int {
var o = [CacheKeySize]int{
a.Range.I, a.Range.J,
b.Range.I, b.Range.J,
a.Instance.Id(), b.Instance.Id(),
}
sort.Ints(o[:])
return o
}