-
Notifications
You must be signed in to change notification settings - Fork 124
/
maplist.go
133 lines (118 loc) · 2.59 KB
/
maplist.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
129
130
131
132
133
/*
* This file is part of The AnnChain.
*
* The AnnChain is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* The AnnChain is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with The www.annchain.io. If not, see <http://www.gnu.org/licenses/>.
*/
package mlist
type Element struct {
key string
value interface{}
next *Element
prev *Element
}
func (e *Element) clear() {
e.next = nil
e.prev = nil
}
type MapList struct {
head *Element
tail *Element
keyMp map[string]*Element
}
func NewMapList() *MapList {
var m MapList
m.Init()
return &m
}
func (l *MapList) Init() {
l.keyMp = make(map[string]*Element)
}
func (l *MapList) Len() int {
return len(l.keyMp)
}
// Set if the key can't find in the list
// then insert the value into the end of the list,
// or modify the value of the key
func (l *MapList) Set(key string, value interface{}) {
if v, ok := l.keyMp[key]; ok {
v.value = value
return
}
e := &Element{
key: key,
}
e.value = value
if l.tail != nil {
l.tail.next = e
}
e.prev = l.tail
l.tail = e
if l.head == nil {
l.head = e
}
l.keyMp[key] = e
}
// Get get the key in the list
func (l *MapList) Get(key string) (interface{}, bool) {
if v, ok := l.keyMp[key]; ok {
return v.value, ok
}
return nil, false
}
// Del delete the key in the list
func (l *MapList) Del(key string) {
if v, ok := l.keyMp[key]; ok {
if l.head == v {
l.head = v.next
}
if l.tail == v {
l.tail = v.prev
}
if v.prev != nil {
v.prev.next = v.next
}
if v.next != nil {
v.next.prev = v.prev
}
v.clear()
delete(l.keyMp, key)
}
}
// Has check whether the key is in the list
func (l *MapList) Has(key string) bool {
_, ok := l.keyMp[key]
return ok
}
// Exec go through the list
func (l *MapList) Exec(exec func(string, interface{})) {
var p *Element
for p = l.head; p != nil; p = p.next {
exec(p.key, p.value)
}
}
// Exec go through the list
func (l *MapList) ExecBreak(exec func(string, interface{}) bool) bool {
var p *Element
for p = l.head; p != nil; p = p.next {
if !exec(p.key, p.value) {
return false
}
}
return true
}
func (l *MapList) Reset() {
l.Init()
l.head = nil
l.tail = nil
}