-
Notifications
You must be signed in to change notification settings - Fork 9
/
matcher.go
172 lines (142 loc) · 3.37 KB
/
matcher.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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
package entitas
import (
"fmt"
"sort"
"strings"
)
const (
componentHashFactor uint16 = 647
allHashFactor = 653
anyHashFactor = 659
noneHashFactor = 661
)
type Matcher interface {
Matches(entity Entity) bool
Hash() MatcherHash
ComponentTypes() []ComponentType
Equals(m Matcher) bool
String() string
}
type MatcherHash uint
// --- BaseMatcher ------------------------------------------------------------
type BaseMatcher struct {
matchers map[MatcherHash]Matcher
hash MatcherHash
}
func newBaseMatcher(ms ...Matcher) BaseMatcher {
b := BaseMatcher{matchers: make(map[MatcherHash]Matcher)}
for _, m := range ms {
b.matchers[m.Hash()] = m
}
return b
}
func (b *BaseMatcher) Hash() MatcherHash {
return b.hash
}
func (b *BaseMatcher) ComponentTypes() []ComponentType {
mtype := make(map[ComponentType]struct{})
for _, m := range b.matchers {
for _, t := range m.ComponentTypes() {
mtype[t] = struct{}{}
}
}
types := make([]ComponentType, 0)
for t := range mtype {
types = append(types, t)
}
return types
}
// --- AllOf ------------------------------------------------------------------
type AllMatcher struct{ BaseMatcher }
func AllOf(ms ...Matcher) Matcher {
b := newBaseMatcher(ms...)
b.hash = Hash(allHashFactor, ms...)
return &AllMatcher{b}
}
func (a *AllMatcher) Matches(e Entity) bool {
for _, m := range a.matchers {
if !m.Matches(e) {
return false
}
}
return true
}
func (a *AllMatcher) Equals(m Matcher) bool {
switch m.(type) {
case *AllMatcher:
for h, m := range m.(*AllMatcher).matchers {
if am, ok := a.matchers[h]; ok {
if !m.Equals(am) {
return false
}
} else {
return false
}
}
return true
default:
return false
}
}
func (a *AllMatcher) String() string {
return fmt.Sprintf("AllOf(%v)", print(a.matchers))
}
// --- AnyOf ------------------------------------------------------------------
type AnyMatcher struct{ BaseMatcher }
func AnyOf(ms ...Matcher) Matcher {
b := newBaseMatcher(ms...)
b.hash = Hash(anyHashFactor, ms...)
return &AnyMatcher{b}
}
func (a *AnyMatcher) Matches(e Entity) bool {
for _, m := range a.matchers {
if m.Matches(e) {
return true
}
}
return false
}
func (a *AnyMatcher) Equals(m Matcher) bool {
return false // TODO: Implement
}
func (a *AnyMatcher) String() string {
return fmt.Sprintf("AnyOf(%v)", print(a.matchers))
}
// --- NoneOf -----------------------------------------------------------------
type NoneMatcher struct{ BaseMatcher }
func NoneOf(ms ...Matcher) Matcher {
b := newBaseMatcher(ms...)
b.hash = Hash(noneHashFactor, ms...)
return &NoneMatcher{b}
}
func (n *NoneMatcher) Matches(e Entity) bool {
for _, m := range n.matchers {
if m.Matches(e) {
return false
}
}
return true
}
func (n *NoneMatcher) Equals(m Matcher) bool {
return false // TODO: Implement
}
func (n *NoneMatcher) String() string {
return fmt.Sprintf("NoneOf(%v)", print(n.matchers))
}
// --- Utilities --------------------------------------------------------------
func Hash(factor uint, ms ...Matcher) MatcherHash {
var hash uint
for _, m := range ms {
hash ^= uint(m.Hash())
}
hash ^= uint(len(ms)) * factor
return MatcherHash(hash)
}
func print(matchers map[MatcherHash]Matcher) string {
ms := make([]string, 0)
for _, m := range matchers {
ms = append(ms, m.String())
}
sort.Strings(ms)
return strings.Join(ms, ", ")
}