/
orderedmap.go
91 lines (68 loc) · 1.61 KB
/
orderedmap.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
package common
type item[K comparable, V any] struct {
key K
value V
}
type OrderedMap[K comparable, V any] struct {
items []*item[K, V]
}
func NewOrderedMap[K comparable, V any]() *OrderedMap[K, V] {
return &OrderedMap[K, V]{
items: make([]*item[K, V], 0),
}
}
func (om *OrderedMap[K, V]) Len() int {
return len(om.items)
}
func (om *OrderedMap[K, V]) index(key K) int {
for i := 0; i < len(om.items); i++ {
if om.items[i].key == key {
return i
}
}
return -1
}
func (om *OrderedMap[K, V]) GetByIndex(index int) (K, V) {
return om.items[index].key, om.items[index].value
}
func (om *OrderedMap[K, V]) RemoveByIndex(index int) (K, V) {
item := om.items[index]
om.items = SliceDelete(om.items, index)
return item.key, item.value
}
func (om *OrderedMap[K, V]) Get(key K) (V, bool) {
index := om.index(key)
if index == -1 {
return *(new(V)), false
}
return om.items[index].value, true
}
func (om *OrderedMap[K, V]) Add(key K, value V) *OrderedMap[K, V] {
om.items = append(om.items, &item[K, V]{
key: key,
value: value,
})
return om
}
func (om *OrderedMap[K, V]) Remove(key K) V {
index := om.index(key)
item := om.items[index]
om.items = SliceDelete(om.items, index)
return item.value
}
func (om *OrderedMap[K, V]) Clear() *OrderedMap[K, V] {
om.items = make([]*item[K, V], 0)
return om
}
func (om *OrderedMap[K, V]) Keys() []K {
keys := make([]K, len(om.items))
for i := 0; i < len(om.items); i++ {
keys[i] = om.items[i].key
}
return keys
}
func (om *OrderedMap[K, V]) Range(fn func(K, V)) {
for i := 0; i < len(om.items); i++ {
fn(om.items[i].key, om.items[i].value)
}
}