-
Notifications
You must be signed in to change notification settings - Fork 9
/
pool.go
166 lines (145 loc) · 3.51 KB
/
pool.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
package entitas
import "fmt"
type Pool interface {
CreateEntity(cs ...Component) Entity
Entities() []Entity
Count() int
HasEntity(e Entity) bool
DestroyEntity(e Entity)
DestroyAllEntities()
Group(m Matcher) Group
}
type pool struct {
index int
componentsLength ComponentType
entities map[EntityID]Entity
cache []Entity
groups map[MatcherHash]Group
groupsIndex map[ComponentType][]Group
unused []Entity
}
func NewPool(componentsLength ComponentType, index int) Pool {
return &pool{
index: index,
componentsLength: componentsLength,
entities: make(map[EntityID]Entity),
groups: make(map[MatcherHash]Group),
groupsIndex: make(map[ComponentType][]Group),
unused: make([]Entity, 0),
}
}
func (p *pool) CreateEntity(cs ...Component) Entity {
e := p.getEntity()
e.AddComponent(cs...)
p.entities[e.ID()] = e
p.cache = append(p.cache, e)
for _, g := range p.groups {
g.HandleEntity(e)
}
return e
}
func (p *pool) Entities() []Entity {
if p.cache == nil {
entities := make([]Entity, len(p.entities))
i := 0
for _, e := range p.entities {
entities[i] = e
}
p.cache = entities
}
return p.cache
}
func (p *pool) Count() int {
return len(p.entities)
}
func (p *pool) HasEntity(e Entity) bool {
if entity, ok := p.entities[e.ID()]; ok && entity == e {
return true
}
return false
}
func (p *pool) DestroyEntity(e Entity) {
if entity, ok := p.entities[e.ID()]; ok && entity == e {
e.RemoveAllComponents()
e.RemoveAllCallbacks()
delete(p.entities, e.ID())
p.cache = nil
for _, g := range p.groups {
g.HandleEntity(e)
}
p.unused = append(p.unused, e)
return
}
panic("unknown entity")
}
func (p *pool) DestroyAllEntities() {
for _, e := range p.entities {
e.RemoveAllComponents()
e.RemoveAllCallbacks()
}
p.entities = make(map[EntityID]Entity)
p.cache = nil
}
func (p *pool) Group(m Matcher) Group {
if g, ok := p.groups[m.Hash()]; ok {
return g
}
g := NewGroup(m)
for _, e := range p.entities {
g.HandleEntity(e)
}
p.groups[m.Hash()] = g
for _, component := range m.ComponentTypes() {
p.groupsIndex[component] = append(p.groupsIndex[component], g)
}
return g
}
func (p *pool) String() string {
return fmt.Sprintf("Pool(%v)", p.Entities())
}
func (p *pool) componentAddedCallback(e Entity, c Component) {
p.forMatchingGroups(e, c, func(g Group) {
g.HandleEntity(e)
})
}
func (p *pool) componentReplacedCallback(e Entity, c Component) {
p.forMatchingGroups(e, c, func(g Group) {
g.UpdateEntity(e)
})
}
func (p *pool) componentWillBeRemovedCallback(e Entity, c Component) {
p.forMatchingGroups(e, c, func(g Group) {
delete(e.(*entity).components, c.Type())
if !g.Matches(e) {
e.(*entity).components[c.Type()] = c
g.WillRemoveEntity(e)
}
})
}
func (p *pool) componentRemovedCallback(e Entity, c Component) {
p.forMatchingGroups(e, c, func(g Group) {
g.HandleEntity(e)
})
}
func (p *pool) getEntity() Entity {
var e Entity
if len(p.unused) > 0 {
e = p.unused[0]
p.unused = p.unused[1:]
} else {
e = NewEntity(p.index)
p.index++
}
e.AddCallback(ComponentAdded, p.componentAddedCallback)
e.AddCallback(ComponentReplaced, p.componentReplacedCallback)
e.AddCallback(ComponentWillBeRemoved, p.componentWillBeRemovedCallback)
e.AddCallback(ComponentRemoved, p.componentRemovedCallback)
return e
}
func (p *pool) forMatchingGroups(e Entity, c Component, f func(g Group)) {
if p.HasEntity(e) {
for _, g := range p.groupsIndex[c.Type()] {
f(g)
}
}
}