-
Notifications
You must be signed in to change notification settings - Fork 4
/
ordered_map.go
128 lines (111 loc) · 2.06 KB
/
ordered_map.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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
package ast
import "sync"
// OrderedMap -
type OrderedMap struct {
keys []Comparable
values map[Comparable]Comparable
lock sync.Mutex
}
// NewOrderedMap -
func NewOrderedMap() *OrderedMap {
return &OrderedMap{
keys: make([]Comparable, 0),
values: make(map[Comparable]Comparable),
}
}
// Get -
func (m *OrderedMap) Get(key Comparable) (Comparable, bool) {
defer m.lock.Unlock()
m.lock.Lock()
for k, v := range m.values {
ok, err := key.Compare(k)
if err != nil {
return nil, false
}
if ok != 0 {
continue
}
return v, true
}
return nil, false
}
func (m *OrderedMap) set(key, value Comparable) bool {
defer m.lock.Unlock()
m.lock.Lock()
for k := range m.values {
ok, err := key.Compare(k)
if err != nil {
return false
}
if ok != 0 {
continue
}
m.values[k] = value
return true
}
return false
}
// Add -
func (m *OrderedMap) Add(key, value Comparable) error {
if ok := m.set(key, value); ok {
return nil
}
defer m.lock.Unlock()
m.lock.Lock()
m.values[key] = value
idx := -1
for i := range m.keys {
val, err := m.keys[i].Compare(key)
if err != nil {
return err
}
if val == 1 {
idx = i
break
}
}
if idx == -1 {
m.keys = append(m.keys, key)
} else {
m.keys = append(m.keys[:idx+1], m.keys[idx:]...)
m.keys[idx] = key
}
return nil
}
// Remove -
func (m *OrderedMap) Remove(key Comparable) (Comparable, bool) {
val, ok := m.Get(key)
if !ok {
return nil, false
}
defer m.lock.Unlock()
m.lock.Lock()
for i := range m.keys {
res, err := m.keys[i].Compare(key)
if err != nil {
return nil, false
}
if res == 0 {
m.keys = append(m.keys[:i], m.keys[i+1:]...)
delete(m.values, m.keys[i])
return val, true
}
}
return nil, false
}
// Range -
func (m *OrderedMap) Range(handler func(key, value Comparable) (bool, error)) error {
defer m.lock.Unlock()
m.lock.Lock()
for i := range m.keys {
isBreak, err := handler(m.keys[i], m.values[m.keys[i]])
if err != nil || isBreak {
return err
}
}
return nil
}
// Len -
func (m *OrderedMap) Len() int {
return len(m.keys)
}