/
maplist.go
130 lines (115 loc) · 2.5 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
// Copyright 2017 Annchain Information Technology Services Co.,Ltd.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
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
}