-
Notifications
You must be signed in to change notification settings - Fork 0
/
itermap.go
68 lines (59 loc) · 1.11 KB
/
itermap.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
package itermap
// IndexOf : find index of sub in slice
// return index , true
// otherwise return 0, false
func IndexOf(slice []interface{}, sub interface{}) (int, bool) {
// Find s in a, r
n := len(slice) - 1
if n == -1 {
return 0, false
}
for i, v := range slice {
switch {
case v == sub:
return i, true
case slice[n-i] == sub:
return n - i, true
}
}
return 0, false
}
type IterMap struct {
key []interface{}
value []interface{}
index int
err error
}
func (s *IterMap) Set(k, v interface{}) {
i, ok := IndexOf(s.key, k)
if ok {
s.value[i] = v
} else {
s.key = append(s.key, k)
s.value = append(s.value, v)
}
}
func (s *IterMap) Get(k interface{}) (interface{}, bool) {
i, ok := IndexOf(s.key, k)
if ok {
return s.value[i], true
} else {
return nil, false
}
}
func (s *IterMap) StartIter() {
s.index = -1
}
func (s *IterMap) Next() bool {
s.index++
return s.index < len(s.key)
}
func (s *IterMap) Value() (interface{}, interface{}) {
if s.index < len(s.key) {
return s.key[s.index], s.value[s.index]
}
return "", nil
}
func (s *IterMap) Err() error {
return s.err
}