/
state.go
152 lines (116 loc) · 1.91 KB
/
state.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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
package kind
import "errors"
var (
ErrIndex = errors.New("index out of range")
)
const (
StateIndexMax = 30
)
type State int32
func StatusFromValueSlice(list []int32) State {
if len(list) < 1 {
return 0
}
var st State
for _, value := range list {
st = st | State(value)
}
return st
}
func StateFromSlice(list []uint8) (State, error) {
var st State
if err := st.Add(list...); err != nil {
return 0, err
}
return st, nil
}
func (s *State) Add(indexList ...uint8) error {
if len(indexList) < 1 {
return nil
}
for _, index := range indexList {
if index > StateIndexMax {
return ErrIndex
}
*s = *s | (1 << index)
}
return nil
}
func (s *State) Remove(index uint8) {
if index > StateIndexMax {
return
}
*s = *s & ^(1 << index)
}
func (s *State) RemoveAll() {
*s = 0
}
func (s *State) Has(index uint8) bool {
if index > StateIndexMax {
return false
}
return (*s & (1 << index)) > 0
}
func (s *State) Slice() []uint8 {
if *s == 0 {
return nil
}
var (
st = make([]uint8, 0, StateIndexMax)
i uint8
)
for ; i <= StateIndexMax; i++ {
if s.Has(i) {
st = append(st, i)
}
}
return st
}
func (s *State) ValueSlice() []int32 {
if *s == 0 {
return nil
}
var (
st = make([]int32, 0, StateIndexMax)
i uint8
)
for ; i <= StateIndexMax; i++ {
if s.Has(i) {
st = append(st, 1<<i)
}
}
return st
}
func (s *State) Merge(val State) {
*s = *s | val
}
func (s *State) UnionSet(val State) []uint8 {
if val == 0 || *s == 0 {
return nil
}
var (
st = make([]uint8, 0, StateIndexMax)
i uint8
)
for ; i <= StateIndexMax; i++ {
if s.Has(i) || val.Has(i) {
st = append(st, i)
}
}
return st
}
func (s *State) Intersection(val State) []uint8 {
if val == 0 || *s == 0 {
return nil
}
var (
st = make([]uint8, 0, StateIndexMax)
i uint8
)
for ; i <= StateIndexMax; i++ {
if s.Has(i) && val.Has(i) {
st = append(st, i)
}
}
return st
}